Solution of generalized shifted linear systems with complex symmetric matrices
From MaRDI portal
Publication:385885
DOI10.1016/j.jcp.2012.04.046zbMath1277.65021OpenAlexW2072262681MaRDI QIDQ385885
Tomohiro Sogabe, Shao-Liang Zhang, Takeo Fujiwara, Takeo Hoshi
Publication date: 12 December 2013
Published in: Journal of Computational Physics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jcp.2012.04.046
Krylov subspace methodscomplex symmetric matricesgeneralized shifted linear systemsthe COCG methodthe electronic structure theorythe QMR\_SYM method
Iterative numerical methods for linear systems (65F10) Linear equations (linear algebraic aspects) (15A06)
Related Items (4)
Low rank approximation in \(G_0W_0\) calculations ⋮ Kω -- open-source library for the shifted Krylov subspace method of the form \((z I - H)x = b\) ⋮ Simultaneous band reduction of two symmetric matrices ⋮ A simpler GMRES and its adaptive variant for shifted linear systems
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- BiCGStab(\(\ell\)) for families of shifted linear systems
- Arnoldi methods for large Sylvester-like observer matrix equations, and an associated algorithm for partial spectrum assignment
- On a weighted quasi-residual minimization strategy for solving complex symmetric shifted linear systems
- Lanczos-type variants of the COCR method for complex nonsymmetric linear systems
- A COCR method for solving complex symmetric linear systems
- An extension of the conjugate residual method to nonsymmetric linear systems
- QMR: A quasi-minimal residual method for non-Hermitian linear systems
- On a conjugate gradient-type method for solving complex symmetric linear systems
- Approximate inverse preconditioning for shifted linear systems
- Restarted full orthogonalization method for shifted linear systems
- Preconditioning techniques for large linear systems: A survey
- Software for simplified Lanczos and QMR algorithms
- On the Numerical Solution of $(\lambda^2 A + \lambda B + C), x = b$ and Application to Structural Dynamics
- A Numerical Method for Calculating the Green's Function Arising from Electronic Structure Theory
- Recent computational developments in Krylov subspace methods for linear systems
- Direct Methods for Sparse Linear Systems
- IDR(s): A Family of Simple and Fast Algorithms for Solving Large Nonsymmetric Systems of Linear Equations
- GMRES: A Generalized Minimal Residual Algorithm for Solving Nonsymmetric Linear Systems
- Conjugate Gradient-Type Methods for Linear Systems with Complex Symmetric Coefficient Matrices
- Bi-CGSTAB: A Fast and Smoothly Converging Variant of Bi-CG for the Solution of Nonsymmetric Linear Systems
- Solution of Sparse Indefinite Systems of Linear Equations
- Restarted GMRES for Shifted Linear Systems
- The Solution of Parametrized Symmetric Linear Systems
- Methods of conjugate gradients for solving linear systems
This page was built for publication: Solution of generalized shifted linear systems with complex symmetric matrices
