The CBiCG class of algorithms for complex symmetric linear systems with applications in several electromagnetic model problems
DOI10.1016/j.cpc.2015.01.018zbMath1344.65041OpenAlexW1999709823MaRDI QIDQ311824
Markus Clemens, Ting-Zhu Huang, Xian-Ming Gu, Liang Li
Publication date: 13 September 2016
Published in: Computer Physics Communications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cpc.2015.01.018
Krylov subspace methodcomputational electromagneticsconjugate gradientBiCG methodcomplex symmetric matrix
Iterative numerical methods for linear systems (65F10) Finite element, Galerkin and related methods applied to problems in optics and electromagnetic theory (78M10) Finite volume methods, finite integration techniques applied to problems in optics and electromagnetic theory (78M12)
Related Items (20)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A hybridizable discontinuous Galerkin method combined to a Schwarz algorithm for the solution of 3d time-harmonic Maxwell's equation
- Application of the incomplete Cholesky factorization preconditioned Krylov subspace method to the vector finite element method for 3-D electromagnetic scattering problems
- Relaxationsmethoden bester Strategie zur Lösung linearer Gleichungssysteme
- Lanczos-type variants of the COCR method for complex nonsymmetric linear systems
- A COCR method for solving complex symmetric linear systems
- BiCGstab(\(l\)) and other hybrid Bi-CG methods
- Numerical methods in computational electrodynamics. Linear systems in practical applications
- Eigenanalysis of some preconditioned Helmholtz problems
- Software for simplified Lanczos and QMR algorithms
- Preconditioning of complex symmetric linear systems with applications in optical tomography
- Comparison of multigrid and incomplete LU shifted-Laplace preconditioners for the inhomogeneous Helmholtz equation
- 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
- A Quasi-Minimal Residual Variant of the Bi-CGSTAB Algorithm for Nonsymmetric Systems
- A Generalization of the Conjugate-Gradient Method to Solve Complex Systems
- A Transpose-Free Quasi-Minimal Residual Algorithm for Non-Hermitian Linear Systems
This page was built for publication: The CBiCG class of algorithms for complex symmetric linear systems with applications in several electromagnetic model problems