東華大學圖書館 |

語系: 繁體中文

說明(常見問題)

回圖書館首頁

手機版館藏查詢

登入

回首頁

切換: 標籤 | MARC模式 | ISBD

Constructive Solutions to A. Horn's ...

Gift, Sarah Kathryn,

FindBook

Google Book

Amazon

博客來

Constructive Solutions to A. Horn's Problem, Determinantal Representations, and Real Fejer-Riesz Factorization /

紀錄類型:	書目-電子資源 : Monograph/item
正題名/作者:	Constructive Solutions to A. Horn's Problem, Determinantal Representations, and Real Fejer-Riesz Factorization // Sarah Kathryn Gift.
作者:	Gift, Sarah Kathryn,
面頁冊數:	1 electronic resource (174 pages)
附註:	Source: Dissertations Abstracts International, Volume: 86-12, Section: B.
Contained By:	Dissertations Abstracts International86-12B.
標題:	Mathematics. -
電子資源:	https://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=32117058
ISBN:	9798286425594

Constructive Solutions to A. Horn's Problem, Determinantal Representations, and Real Fejer-Riesz Factorization /
Gift, Sarah Kathryn,

Constructive Solutions to A. Horn's Problem, Determinantal Representations, and Real Fejer-Riesz Factorization /Sarah Kathryn Gift. - 1 electronic resource (174 pages)

Source: Dissertations Abstracts International, Volume: 86-12, Section: B.

In this thesis, we give constructive approaches to a variety of related linear algebra problems. These problems, which include Alfred Horn's problem, real Fejér-Riesz factorization, and determinantal representations of multivariate polynomials, have previously established existence results, but those proofs do not provide a way to construct a solution.Alfred Horn's problem is, given three sets of n real eigenvalues, when do there exist n x n real symmetric matrices A and B so that A has the first set of eigenvalues, B has the second set of eigenvalues, and A + B has the last set of eigenvalues? We now know when A and B exist, but the question remains how do we find A and B? In this thesis, we give ways to find a real Horn solution pair (A, B) in two specific cases. In particular, we first give a construction for A and B when n=3 that uses semidefinite programming. Second, we give a construction for A and B when B is a rank 2 matrix. This construction stems from performing two orthogonal rank 1 updates of A.Our construction of a real Horn solution pair using semidefinite programming when n = 3 involves factorizing a positive semidefinite matrix polynomial as a matrix polynomial times its transpose. This is a real version of the Fejer-Riesz factorization, which is known to be possible when the determinant of the positive semidefinite matrix polynomial is the square of a nonzero polynomial. We provide a new, constructive proof of this fact, rooted in finding a skew-symmetric solution to a modified algebraic Riccati equation.Our construction of a real Horn solution pair when B is rank 2 highlights a relationship between the Horn problem and the following similar problem: given a set of n real eigenvalues, a set of m real eigenvalues, and a set of n+m real eigenvalues satisfying certain conditions, find an (n+m)x(n+m) real symmetric matrix such that the top left principal submatrix has the first set of eigenvalues, the bottom right principal submatrix has the second set of eigenvalues, and the full matrix has the last set of eigenvalues. This relationship between an additive problem and a block problem leads us to study the interplay between additive and block Hermitian determinantal representations for multivariate polynomials. For each kind of Hermitian determinantal representation, we show necessary and sufficient conditions for a multivariate polynomial to have that representation. Furthermore, we show how to construct such a representation.

English

ISBN: 9798286425594Subjects--Topical Terms:

515831
Mathematics.
Subjects--Index Terms:

Alfred horn problem

Constructive Solutions to A. Horn's Problem, Determinantal Representations, and Real Fejer-Riesz Factorization /
LDR:04076nmm a22004453i 4500 001 2433559
005 20250825062354.5
006 m o d
007 cr|nu||||||||
008 261011s2025 miu||||||m |||||||eng d
020 $a 9798286425594
035 $a (MiAaPQD)AAI32117058
035 $a AAI32117058
040 $a MiAaPQD $b eng $c MiAaPQD $e rda
100 1 $a Gift, Sarah Kathryn, $e author. $0 (orcid)0000-0001-6633-700X $3 3823223
245 1 0 $a Constructive Solutions to A. Horn's Problem, Determinantal Representations, and Real Fejer-Riesz Factorization / $c Sarah Kathryn Gift.
264 1 $a Ann Arbor : $b ProQuest Dissertations & Theses, $c 2025
300 $a 1 electronic resource (174 pages)
336 $a text $b txt $2 rdacontent
337 $a computer $b c $2 rdamedia
338 $a online resource $b cr $2 rdacarrier
500 $a Source: Dissertations Abstracts International, Volume: 86-12, Section: B.
500 $a Advisors: Woerdeman, Hugo J. Committee members: Yu, Pok-Yin; Blasiak, Jonah; Schmutz, Eric; Grinshpan, Anatolii; Ran, Andre.
502 $b Ph.D. $c Drexel University $d 2025.
520 $a In this thesis, we give constructive approaches to a variety of related linear algebra problems. These problems, which include Alfred Horn's problem, real Fejér-Riesz factorization, and determinantal representations of multivariate polynomials, have previously established existence results, but those proofs do not provide a way to construct a solution.Alfred Horn's problem is, given three sets of n real eigenvalues, when do there exist n x n real symmetric matrices A and B so that A has the first set of eigenvalues, B has the second set of eigenvalues, and A + B has the last set of eigenvalues? We now know when A and B exist, but the question remains how do we find A and B? In this thesis, we give ways to find a real Horn solution pair (A, B) in two specific cases. In particular, we first give a construction for A and B when n=3 that uses semidefinite programming. Second, we give a construction for A and B when B is a rank 2 matrix. This construction stems from performing two orthogonal rank 1 updates of A.Our construction of a real Horn solution pair using semidefinite programming when n = 3 involves factorizing a positive semidefinite matrix polynomial as a matrix polynomial times its transpose. This is a real version of the Fejer-Riesz factorization, which is known to be possible when the determinant of the positive semidefinite matrix polynomial is the square of a nonzero polynomial. We provide a new, constructive proof of this fact, rooted in finding a skew-symmetric solution to a modified algebraic Riccati equation.Our construction of a real Horn solution pair when B is rank 2 highlights a relationship between the Horn problem and the following similar problem: given a set of n real eigenvalues, a set of m real eigenvalues, and a set of n+m real eigenvalues satisfying certain conditions, find an (n+m)x(n+m) real symmetric matrix such that the top left principal submatrix has the first set of eigenvalues, the bottom right principal submatrix has the second set of eigenvalues, and the full matrix has the last set of eigenvalues. This relationship between an additive problem and a block problem leads us to study the interplay between additive and block Hermitian determinantal representations for multivariate polynomials. For each kind of Hermitian determinantal representation, we show necessary and sufficient conditions for a multivariate polynomial to have that representation. Furthermore, we show how to construct such a representation.
546 $a English
590 $a School code: 0065
650 4 $a Mathematics. $3 515831
650 4 $a Theoretical mathematics. $3 3173530
650 4 $a Applied mathematics. $3 2122814
653 $a Alfred horn problem
653 $a Algebraic Riccati equation
653 $a Determinantal representation
653 $a Eigenvalue
653 $a Positive semidefinite matrix polynomial
653 $a Real zero polynomial
690 $a 0405
690 $a 0642
690 $a 0364
710 2 $a Drexel University. $b Mathematics (College of Arts and Sciences). $e degree granting institution. $3 3823224
720 1 $a Woerdeman, Hugo J. $e degree supervisor.
773 0 $t Dissertations Abstracts International $g 86-12B.
790 $a 0065
791 $a Ph.D.
792 $a 2025
856 4 0 $u https://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=32117058