A comparative study of iterative solutions to linear systems arising in quantum mechanics

DOI10.1016/J.JCP.2010.07.034zbMath1200.65022OpenAlexW2039030905MaRDI QIDQ602951

Ting-Zhu Huang, Yan-Fei Jing, Bruno Carpentieri, Yong Duan

Publication date: 5 November 2010

Published in: Journal of Computational Physics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jcp.2010.07.034

zbMATH Keywords

quantum mechanicsKrylov subspace methodscomplex nonsymmetric matricescomputational chemistry model problemLanczos biconjugate \(A\)-orthonormalization methods

Mathematics Subject Classification ID

Iterative numerical methods for linear systems (65F10)

Related Items (8)

BiCGCR2: A new extension of conjugate residual method for solving non-Hermitian linear systems ⋮ A quasi-minimal residual variant of the BiCORSTAB method for nonsymmetric linear systems ⋮ Exploiting the composite step strategy to the biconjugate \(A\)-orthogonal residual method for non-Hermitian linear systems ⋮ A transpose-free quasi-minimal residual variant of the CORS method for solving non-Hermitian linear systems ⋮ LSQR algorithm with structured preconditioner for the least squares problem in quaternionic quantum theory ⋮ A new quasi-minimal residual method based on a biconjugate \(A\)-orthonormalization procedure and coupled two-term recurrences ⋮ A hybridized iterative algorithm of the BiCORSTAB and GPBiCOR methods for solving non-Hermitian linear systems ⋮ Accelerating the induced dimension reduction method using spectral information

Uses Software

• CGS

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Lanczos-type variants of the COCR method for complex nonsymmetric linear systems
• An extension of the conjugate residual method to nonsymmetric linear systems
• Iterative solution of linear systems in the 20th century
• Preconditioning techniques for large linear systems: A survey
• Solving Complex-Valued Linear Systems via Equivalent Real Formulations
• Recent computational developments in Krylov subspace methods for linear systems
• Block preconditioning of real-valued iterative algorithms for complex linear systems
• IDR(s): A Family of Simple and Fast Algorithms for Solving Large Nonsymmetric Systems of Linear Equations
• A Look-Ahead Lanczos Algorithm for Unsymmetric Matrices
• GMRES: A Generalized Minimal Residual Algorithm for Solving Nonsymmetric Linear Systems
• CGS, A Fast Lanczos-Type Solver for Nonsymmetric Linear systems
• Bi-CGSTAB: A Fast and Smoothly Converging Variant of Bi-CG for the Solution of Nonsymmetric Linear Systems
• Reduction to Tridiagonal Form and Minimal Realizations
• An Efficient Implementation of the Nonsymmetric Lanczos Algorithm
• An Implementation of the Look-Ahead Lanczos Algorithm for Non-Hermitian Matrices

This page was built for publication: A comparative study of iterative solutions to linear systems arising in quantum mechanics