Routines for the diagonalization of complex matrices
T. Hahn

TL;DR
This paper introduces Jacobi-type iterative algorithms for complex matrix decompositions, including eigenvalue, singular value, and Takagi factorizations, implemented as compact Fortran 77 routines.
Contribution
It provides a set of efficient, freely available algorithms for complex matrix factorizations using Jacobi-type methods.
Findings
Algorithms successfully perform eigenvalue, SVD, and Takagi factorizations.
Implementation as compact Fortran 77 subroutines enhances accessibility.
The methods are suitable for complex matrices in scientific computations.
Abstract
Jacobi-type iterative algorithms for the eigenvalue decomposition, singular value decomposition, and Takagi factorization of complex matrices are presented. They are implemented as compact Fortran 77 subroutines in a freely available library.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Code & Models
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsMatrix Theory and Algorithms · Numerical methods for differential equations · Advanced Optimization Algorithms Research
