Application of the incomplete Cholesky factorization preconditioned Krylov subspace method to the vector finite element method for 3-D electromagnetic scattering problems
From MaRDI portal
Publication:615044
DOI10.1016/j.cpc.2009.09.019zbMath1205.78059MaRDI QIDQ615044
Yan-Fei Jing, Yong Zhang, Liang Li, Ting-Zhu Huang
Publication date: 5 January 2011
Published in: Computer Physics Communications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cpc.2009.09.019
precondition; finite element method; electromagnetic scattering; Krylov subspace method; complex symmetric matrix; incomplete Cholesky factorization
65F50: Computational methods for sparse matrices
65F10: Iterative numerical methods for linear systems
78M10: Finite element, Galerkin and related methods applied to problems in optics and electromagnetic theory
65F08: Preconditioners for iterative methods
Related Items
The CBiCG class of algorithms for complex symmetric linear systems with applications in several electromagnetic model problems, A splitting iterative method for the discrete dynamic linear systems, Lanczos-type variants of the COCR method for complex nonsymmetric linear systems, An evaluation of reordering algorithms to reduce the computational cost of the incomplete Cholesky-conjugate gradient method, Modified complex-symmetric and skew-Hermitian splitting iteration method for a class of complex-symmetric indefinite linear systems
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Mixed finite elements in \(\mathbb{R}^3\)
- QMR: A quasi-minimal residual method for non-Hermitian linear systems
- On a conjugate gradient-type method for solving complex symmetric linear systems
- Preconditioning techniques for large linear systems: A survey
- GMRES: A Generalized Minimal Residual Algorithm for Solving Nonsymmetric Linear Systems
- An Incomplete Factorization Technique for Positive Definite 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
- An Iterative Solution Method for Linear Systems of Which the Coefficient Matrix is a Symmetric M-Matrix
- An Approximate Minimum Degree Ordering Algorithm
- ILUT: A dual threshold incomplete LU factorization
- Methods of conjugate gradients for solving linear systems