Lanczos-type variants of the COCR method for complex nonsymmetric linear systems
From MaRDI portal
Publication:843497
DOI10.1016/J.JCP.2009.05.022zbMATH Open1173.65316OpenAlexW2145097673MaRDI QIDQ843497FDOQ843497
Recommendations
- A COCR method for solving complex symmetric linear systems
- An Extension of the COCR Method to Solving Shifted Linear Systems with Complex Symmetric Matrices
- Block variants of the COCG and COCR methods for solving complex symmetric linear systems with multiple right-hand sides
- The CBiCG class of algorithms for complex symmetric linear systems with applications in several electromagnetic model problems
- Conjugate Gradient-Type Methods for Linear Systems with Complex Symmetric Coefficient Matrices
Cites work
- scientific article; zbMATH DE number 4176341 (Why is no real title available?)
- scientific article; zbMATH DE number 3917549 (Why is no real title available?)
- scientific article; zbMATH DE number 3736894 (Why is no real title available?)
- scientific article; zbMATH DE number 51614 (Why is no real title available?)
- scientific article; zbMATH DE number 3511513 (Why is no real title available?)
- scientific article; zbMATH DE number 1069613 (Why is no real title available?)
- scientific article; zbMATH DE number 934729 (Why is no real title available?)
- A COCR method for solving complex symmetric linear systems
- A Generalization of the Conjugate-Gradient Method to Solve Complex Systems
- A Look-Ahead Lanczos Algorithm for Unsymmetric Matrices
- A Theoretical Comparison of the Arnoldi and GMRES Algorithms
- A Transpose-Free Quasi-Minimal Residual Algorithm for Non-Hermitian Linear Systems
- A framework for generalized conjugate gradient methods -- with special emphasis on contributions by Rüdiger Weiß
- A generalized nonsymmetric Lanczos procedure
- A theoretical overview of Krylov subspace methods
- An Efficient Implementation of the Nonsymmetric Lanczos Algorithm
- An Implementation of the Look-Ahead Lanczos Algorithm for Non-Hermitian Matrices
- An Improved Spectral Graph Partitioning Algorithm for Mapping Parallel Computations
- An extension of the conjugate residual method to nonsymmetric linear systems
- An overview of approaches for the stable computation of hybrid BiCG methods
- Application of the incomplete Cholesky factorization preconditioned Krylov subspace method to the vector finite element method for 3-D electromagnetic scattering problems
- Bi-CGSTAB: A Fast and Smoothly Converging Variant of Bi-CG for the Solution of Nonsymmetric Linear Systems
- BiCGstab(\(l\)) for linear equations involving unsymmetric matrices with complex spectrum
- By how much can residual minimization accelerate the convergence of orthogonal residual methods?
- CGS, A Fast Lanczos-Type Solver for Nonsymmetric Linear systems
- Complex conjugate gradient methods
- Conjugate Gradient Type Methods for Indefinite, Asymmetric, and Complex Systems
- GMRES: A Generalized Minimal Residual Algorithm for Solving Nonsymmetric Linear Systems
- Geometric aspects of the theory of Krylov subspace methods
- Hybrid procedures for solving linear systems
- Iterative Krylov Methods for Large Linear Systems
- Iterative solution of linear systems in the 20th century
- Methods of conjugate gradients for solving linear systems
- Padé-type approximation and general orthogonal polynomials
- Parallel iterative methods for sparse linear systems
- Peaks, plateaus, numerical instabilities in a Galerkin minimal residual pair of methods for solving \(Ax=b\)
- Preconditioning techniques for large linear systems: A survey
- Properties of generalized conjugate gradient methods
- QMR: A quasi-minimal residual method for non-Hermitian linear systems
- Recent computational developments in Krylov subspace methods for linear systems
- Reduction to Tridiagonal Form and Minimal Realizations
- Relations between Galerkin and Norm-Minimizing Iterative Methods for Solving Linear Systems
- Relaxationsmethoden bester Strategie zur Lösung linearer Gleichungssysteme
- Residual Smoothing Techniques for Iterative Methods
- Residual smoothing and peak/plateau behavior in Krylov subspace methods
- Residual smoothing techniques: Do they improve the limiting accuracy of iterative solvers?
- Solution of Sparse Indefinite Systems of Linear Equations
- Variants of BICGSTAB for Matrices with Complex Spectrum
Cited in
(24)- Exploiting the composite step strategy to the biconjugate \(A\)-orthogonal residual method for non-Hermitian linear systems
- A new iterative method for solving complex symmetric linear systems
- Restarted simpler GMRES augmented with harmonic Ritz vectors and approximate errors
- A novel class of block methods based on the block \(AA^T\)-Lanczos bi-orthogonalization process for matrix equations
- Global GPBiCG method for complex non-Hermitian linear systems with multiple right-hand sides
- Tridiagonalization of systems of coupled linear differential equations with variable coefficients by a Lanczos-like method
- BiCGCR2: A new extension of conjugate residual method for solving non-Hermitian linear systems
- Tensor product-type methods for solving Sylvester tensor equations
- Developing BiCOR and CORS methods for coupled Sylvester-transpose and periodic Sylvester matrix equations
- A COCR method for solving complex symmetric linear systems
- A simpler GMRES and its adaptive variant for shifted linear systems.
- Solution of generalized shifted linear systems with complex symmetric matrices
- A generalized product-type BiCOR method and its application in signal deconvolution
- The CBiCG class of algorithms for complex symmetric linear systems with applications in several electromagnetic model problems
- Flexible and deflated variants of the block shifted GMRES method
- A comparative study of iterative solutions to linear systems arising in quantum mechanics
- A quasi-minimal residual variant of the BiCORSTAB method for nonsymmetric linear systems
- A hybrid-mesh hybridizable discontinuous Galerkin method for solving the time-harmonic Maxwell's equations
- A hybridized iterative algorithm of the BiCORSTAB and GPBiCOR methods for solving non-Hermitian linear systems
- A transpose-free quasi-minimal residual variant of the CORS method for solving non-Hermitian linear systems
- A new quasi-minimal residual method based on a biconjugate \(A\)-orthonormalization procedure and coupled two-term recurrences
- An Extension of the COCR Method to Solving Shifted Linear Systems with Complex Symmetric Matrices
- Preconditioning complex symmetric linear systems
- A new family of global methods for linear systems with multiple right-hand sides
This page was built for publication: Lanczos-type variants of the COCR method for complex nonsymmetric linear systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q843497)
