Routines for the diagonalization of complex matrices
classification
⚛️ physics.comp-ph
hep-ph
keywords
complexdecompositionmatricesalgorithmsavailablecompactdiagonalizationeigenvalue
read the original 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.
This paper has not been read by Pith yet.
Forward citations
Cited by 1 Pith paper
-
Sample efficient graph classification using binary Gaussian boson sampling
Binary-detector Gaussian boson sampling is proposed for sample-efficient graph classification, with an investigation into its connection to the Torontonian matrix function.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.