An algorithm for approximating the singular triplets of complex symmetric matrices

DOI<link itemprop=identifier href="https://doi.org/10.1002/(SICI)1099-1506(199711/12)4:6<469::AID-NLA122>3.0.CO;2-A" /><469::AID-NLA122>3.0.CO;2-A 10.1002/(SICI)1099-1506(199711/12)4:6<469::AID-NLA122>3.0.CO;2-AzbMath0889.65033OpenAlexW2006772390MaRDI QIDQ4383442

Eva Sjöström, Valeria Simoncini

Publication date: 1 April 1998

Full work available at URL: https://doi.org/10.1002/(sici)1099-1506(199711/12)4:6<469::aid-nla122>3.0.co;2-a

zbMATH Keywords

comparisonsingular value decompositionnumerical experimentsLanczos methoderror boundsiterative methodssingular vectorscomplex symmetric matrices

Mathematics Subject Classification ID

Numerical computation of eigenvalues and eigenvectors of matrices (65F15) Numerical solutions to overdetermined systems, pseudoinverses (65F20)

Uses Software

• testmatrix

Cites Work

• Matrix Analysis
• Unnamed Item
• Unnamed Item

This page was built for publication: An algorithm for approximating the singular triplets of complex symmetric matrices