The eigenvalue decomposition of normal matrices by the skew-symmetric part
Fuente:
arXiv
Guardado en:
| Autores principales: | , |
|---|---|
| Formato: | Preprint |
| Publicado: |
2024
|
| Materias: | |
| Acceso en línea: | |
| Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
| _version_ | 1866914430364680192 |
|---|---|
| author | Mataigne, Simon Gallivan, Kyle A. |
| author_facet | Mataigne, Simon Gallivan, Kyle A. |
| contents | We propose a new method for computing the eigenvalue decomposition of a dense real normal matrix $A$ through the decomposition of its skew-symmetric part. The method relies on algorithms that are known to be efficiently implemented, such as the bidiagonal singular value decomposition and the symmetric eigenvalue decomposition. The advantages of this method stand for normal matrices with few real eigenvalues, such as random orthogonal matrices. We provide a stability and a complexity analysis of the method. The numerical performance is compared with existing algorithms. In most cases, the method has the same operation count as the Hessenberg factorization of a dense matrix. Finally, we provide experiments for the application of computing a Riemannian barycenter on the special orthogonal group. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2410_12421 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | The eigenvalue decomposition of normal matrices by the skew-symmetric part Mataigne, Simon Gallivan, Kyle A. Numerical Analysis 65F15, 15B10, 15B57, 62R30 We propose a new method for computing the eigenvalue decomposition of a dense real normal matrix $A$ through the decomposition of its skew-symmetric part. The method relies on algorithms that are known to be efficiently implemented, such as the bidiagonal singular value decomposition and the symmetric eigenvalue decomposition. The advantages of this method stand for normal matrices with few real eigenvalues, such as random orthogonal matrices. We provide a stability and a complexity analysis of the method. The numerical performance is compared with existing algorithms. In most cases, the method has the same operation count as the Hessenberg factorization of a dense matrix. Finally, we provide experiments for the application of computing a Riemannian barycenter on the special orthogonal group. |
| title | The eigenvalue decomposition of normal matrices by the skew-symmetric part |
| topic | Numerical Analysis 65F15, 15B10, 15B57, 62R30 |
| url | https://arxiv.org/abs/2410.12421 |