Two efficient inexact algorithms for a class of large sparse complex linear systems
From MaRDI portal
(Redirected from Publication:305900)
The paper is concerned with the iterative numerical solution of complex nonsingular systems of linear equations. The authors propose an inexact variant of the generalized successive overrelaxation method, in which the conjugate gradient and the preconditioned conjugate gradient methods are regarded as its inner iterations. They prove convergence of the new method and provide numerical experiments.
Recommendations
Cites work
- A shift-splitting preconditioner for non-Hermitian positive definite matrices
- Accelerated Hermitian and skew-Hermitian splitting iteration methods for saddle-point problems
- Block preconditioning of real-valued iterative algorithms for complex linear systems
- Efficient preconditioning for sequences of parametric complex symmetric linear systems
- Finite elements in computational electromagnetism
- Generalized successive overrelaxation iterative method for a class of complex symmetric linear system of equations
- Hermitian and Skew-Hermitian Splitting Methods for Non-Hermitian Positive Definite Linear Systems
- scientific article; zbMATH DE number 1953444 (Why is no real title available?)
- scientific article; zbMATH DE number 2098242 (Why is no real title available?)
- Iterative system solvers for the frequency analysis of linear mechanical systems
- Lopsided PMHSS iteration method for a class of complex symmetric linear systems
- Matrices
- Modified HSS iteration methods for a class of complex symmetric linear systems
- Numerical challenges in lattice quantum chromodynamics. Joint interdisciplinary workshop of John von Neumann Institute for Computing, Jülich, and Institute of Applied Computer Science, Wuppertal Univ., Germany, August 1999
- Numerical methods in computational electrodynamics. Linear systems in practical applications
- Numerical solution of saddle point problems
- On generalized successive overrelaxation methods for augmented linear systems
- On parameterized inexact Uzawa methods for generalized saddle point problems
- On preconditioned MHSS iteration methods for complex symmetric linear systems
- Optical tomography in medical imaging
- Preconditioned GSOR iterative method for a class of complex symmetric system of linear equations
- Preconditioned MHSS iteration methods for a class of block two-by-two linear systems with applications to distributed control problems
- Real valued iterative methods for solving complex symmetric linear systems
Cited in
(11)- RETRACTED: The generalized double steps scale-SOR iteration method for solving complex symmetric linear systems
- A new two-parameter iteration method for indefinite complex symmetric linear systems
- Efficient iteration methods for complex systems with an indefinite matrix term
- Exact inverse solution techniques for a class of complex valued block two-by-two linear systems
- Improved CRI iteration methods for a class of complex symmetric linear systems
- A preconditioned SSOR iteration method for solving complex symmetric system of linear equations
- A new double-step splitting iteration method for certain block two-by-two linear systems
- Modified Newton-AGSOR method for solving nonlinear systems with block two-by-two complex symmetric Jacobian matrices
- A new sparse Gaussian elimination algorithm and the Niederreiter linear system for trinomials over F₂
- Accelerated generalized SOR method for a class of complex systems of linear equations
- Randomized Projection Methods for Linear Systems with Arbitrarily Large Sparse Corruptions
This page was built for publication: Two efficient inexact algorithms for a class of large sparse complex linear systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q305900)
