We propose a new QR-like algorithm, symmetric squared QR (SSQR) method, that can be readily parallelized using commonly available parallel computational primitives such as matrix-matrix multiplication and QR decomposition. The algorithm converges quadratically and the quadratic convergence is achiev
โฆ LIBER โฆ
Hermitian quadratic eigenvalue problems of restricted rank
โ Scribed by Carlos Conca; Heinrich Puschmann
- Publisher
- Elsevier Science
- Year
- 1993
- Tongue
- English
- Weight
- 372 KB
- Volume
- 6
- Category
- Article
- ISSN
- 0893-9659
No coin nor oath required. For personal study only.
โฆ Synopsis
We consider a quadratic eigenvalue problem such that the second order term is a Hermitian matrix of rank r, the linear term is the identity matrix, and the constant term is an arbitrary Hermitian matrix A E cnn. Of the n + T solutions that this problem admits, we show at least n -r to be real and located in specific intervals defined by the eigenvalues of A, whence at most 2r are nonreal occuring in possibly repeated conjugate pairs.
๐ SIMILAR VOLUMES
A quadratically convergent QR-like metho
โ
Hongyuan Zha; Zhenyue Zhang; Wenlong Ying
๐
Article
๐
2006
๐
Elsevier Science
๐
English
โ 288 KB
Eigenvalues of Hermitian matrices with p
โ
Anders Skovsted Buch
๐
Article
๐
2006
๐
Elsevier Science
๐
English
โ 152 KB
On solvability of inverse eigenvalue pro
โ
Luoluo Li
๐
Article
๐
1997
๐
Elsevier Science
๐
English
โ 526 KB
Linearization of the quadratic eigenvalu
โ
D. Afolabi
๐
Article
๐
1987
๐
Elsevier Science
๐
English
โ 200 KB
On symmetrization and roots of quadratic
โ
J Eisenfeld
๐
Article
๐
1972
๐
Elsevier Science
๐
English
โ 647 KB
Implicit computational solution of gener
โ
Louis Komzsik
๐
Article
๐
2001
๐
Elsevier Science
๐
English
โ 274 KB