An algorithm for approximating the singular triplets of complex symmetric matrices

DOI10.1002/(SICI)1099-1506(199711/12)4:6%3C469::AID-NLA122%3E3.0.CO;2-AMaRDI QIDQ4383442zbMATH OpenOpenAlexFDO

Authors Valeria Simoncini, Eva Sjöström

Publication date 1 April 1998

Full work available at URL https://doi.org/10.1002/(sici)1099-1506(199711/12)4:6%3C469::aid-nla122%3E3.0.co;2-a

zbMATH Keywords

error boundssingular value decompositioncomparisonnumerical experimentsiterative methodsLanczos methodsingular vectorscomplex symmetric matrices

Mathematics Subject Classification ID

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

Recommendations

• Singular value decompositions of complex symmetric matrices
• Approximating dominant singular triplets of large sparse matrices via modified moments
• A comparison between the complex symmetric based and classical computation of the singular value decomposition of normal matrices
• A harmonic Lanczos bidiagonalization method for computing interior singular triplets of large matrices
• Recursive Calculation of Dominant Singular Subspaces

Cites work

• scientific article; zbMATH DE number 3671573 (Why is no real title available?)
• scientific article; zbMATH DE number 741161 (Why is no real title available?)
• Matrix Analysis

Cited in

(1)

• Approximating dominant singular triplets of large sparse matrices via modified moments

Describes a project that uses

Uses Software

• testmatrix

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4383442)