Zobrazeno 1 - 10
of 17
pro vyhledávání: '"Brian D. Sutton"'
Publikováno v:
SIAM Journal on Matrix Analysis and Applications. 39(3)
We introduce a backward stable algorithm for computing the CS decomposition of a partitioned $2n \times n$ matrix with orthonormal columns, or a rank-deficient partial isometry. The algorithm computes two $n \times n$ polar decompositions (which can
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::4814dadf19bc8fe12417c045e446b7fb
http://ora.ox.ac.uk/objects/uuid:
http://ora.ox.ac.uk/objects/uuid:
Publikováno v:
Numerical Algorithms. 66:479-493
When an orthogonal matrix is partitioned into a two-by-two block structure, its four blocks can be simultaneously bidiagonalized. This observation underlies numerically stable algorithms for the CS decomposition and the existence of CMV matrices for
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::42b0d5c563c50ea7246f40a2a282cd40
https://doi.org/10.1007/s11075-013-9744-5
https://doi.org/10.1007/s11075-013-9744-5
Autor:
Brian D. Sutton
Publikováno v:
SIAM Journal on Matrix Analysis and Applications. 34:417-444
We develop a divide-and-conquer algorithm for the bidiagonal CS decomposition (CSD). This complements an earlier algorithm based on simultaneous QR iteration. The new algorithm is designed to provide the efficiency gains of familiar divide-and-conque
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::0103e5eb26cc411e3adf1498187da3a3
https://doi.org/10.1137/120870785
https://doi.org/10.1137/120870785
Autor:
Brian D. Sutton
Publikováno v:
SIAM Journal on Matrix Analysis and Applications. 33:1-21
Since its discovery in 1977, the CS decomposition (CSD) has resisted computation, even though it is a sibling of the well-understood eigenvalue and singular value decompositions. Several algorithms have been developed for the reduced 2-by-1 form of t
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::c737c8f5ad19a8c758c009928bdb16ca
https://doi.org/10.1137/100813002
https://doi.org/10.1137/100813002
Autor:
Brian D. Sutton, Charles R. Johnson, Margaret Lay, Lon H. Mitchell, Philip Hackney, Matthew Booth, Sivaram K. Narayan, Amanda Pascoe, Benjamin Harris, Terry D. Lenker
Publikováno v:
Linear and Multilinear Algebra. 59:483-506
The minimum semidefinite rank (msr) of a graph is defined to be the minimum rank among all positive semidefinite matrices whose zero/nonzero pattern corresponds to that graph. We recall some known facts and present new results, including results conc
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::24e3c25ad0b0d6d98819296da5c13dc0
https://doi.org/10.1080/03081080903542791
https://doi.org/10.1080/03081080903542791
Publikováno v:
Linear and Multilinear Algebra. 57:409-420
We are generally concerned with the possible lists of multiplicities for the eigenvalues of a real symmetric matrix with a given graph. Many restrictions are known, but it is often problematic to construct a matrix with desired multiplicities, even i
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::6791c4c3fa2aa6ccceb0ed52013f3688
https://doi.org/10.1080/03081080701852756
https://doi.org/10.1080/03081080701852756
Autor:
Brian D. Sutton
Publikováno v:
Numerical Algorithms. 50:33-65
An algorithm is developed to compute the complete CS decomposition (CSD) of a partitioned unitary matrix. Although the existence of the CSD has been recognized since 1977, prior algorithms compute only a reduced version (the 2-by-1 CSD) that is equiv
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::a99d447ab89ffb7b58bca85be492649a
https://doi.org/10.1007/s11075-008-9215-6
https://doi.org/10.1007/s11075-008-9215-6
Autor:
Philip Hackney, Charles R. Johnson, Matthew Booth, Brian D. Sutton, Sivaram K. Narayan, Kelly Steinmetz, Wendy Wang, Lon H. Mitchell, Amanda Pascoe, Margaret Lay, Benjamin Harris
Publikováno v:
SIAM Journal on Matrix Analysis and Applications. 30:731-740
Let $\mathcal{P}(G)$ be the set of all positive semidefinite matrices whose graph is $G$, and $\operatorname{msr}(G)$ be the minimum rank of all matrices in $\mathcal{P}(G)$. Upper and lower bounds for $\operatorname{msr}(G)$ are given and used to de
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::12ceb29a635addcc77d7377867a440a2
https://doi.org/10.1137/050629793
https://doi.org/10.1137/050629793
Autor:
Alan Edelman, Brian D. Sutton
Publikováno v:
Journal of Statistical Physics. 127:1121-1165
We propose that classical random matrix models are properly viewed as finite difference schemes for stochastic differential operators. Three particular stochastic operators commonly arise, each associated with a familiar class of local eigenvalue beh
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::93fe4cde44df38c7887893eda0844ed4
https://doi.org/10.1007/s10955-006-9226-4
https://doi.org/10.1007/s10955-006-9226-4