[图书][B] Core-chasing algorithms for the eigenvalue problem
Core-Chasing Algorithms for the Eigenvalue Problem : Back Matter Page 1 Bibliography [1] GS
Ammar, WB Gragg, and L. Reichel. On the eigenproblem for orthogonal matrices. In Proceedings …
Ammar, WB Gragg, and L. Reichel. On the eigenproblem for orthogonal matrices. In Proceedings …
Connecting optimization with spectral analysis of tri-diagonal matrices
JB Lasserre - Mathematical Programming, 2021 - Springer
We show that the global minimum (resp. maximum) of a continuous function on a compact
set can be approximated from above (resp. from below) by computing the smallest (rest …
set can be approximated from above (resp. from below) by computing the smallest (rest …
When is a matrix unitary or Hermitian plus low rank?
Hermitian and unitary matrices are two representatives of the class of normal matrices
whose full eigenvalue decomposition can be stably computed in quadratic computing …
whose full eigenvalue decomposition can be stably computed in quadratic computing …
[PDF][PDF] Connecting optimization with spectral analysis of tri-diagonal (univariate) moment matrices
JB Lasserre - 2019 - hal.laas.fr
We show that the global minimum (resp. maximum) of a continuous function on a compact
set can be approximated from above (resp. from below) by computing the smallest (rest …
set can be approximated from above (resp. from below) by computing the smallest (rest …