On conjugate gradient type methods and polynomial preconditioners for a class of complex non-Hermitian matrices

DOI10.1007/BF01386412zbMath0702.65034OpenAlexW1979921936MaRDI QIDQ915367

Roland W. Freund

Publication date: 1990

Published in: Numerische Mathematik (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/133450

zbMATH Keywords

numerical experimentserror boundsHelmholtz equationconjugate gradient methodscomplex matricespolynomial preconditioningEuclidean error minimizationGalerkin conditionminimal residual property

Mathematics Subject Classification ID

Iterative numerical methods for linear systems (65F10) Laplace operator, Helmholtz equation (reduced wave equation), Poisson equation (35J05) Numerical solution of discretized equations for boundary value problems involving PDEs (65N22)

Related Items

Polynomial Preconditioned GMRES and GMRES-DR, A framework for generalized conjugate gradient methods -- with special emphasis on contributions by Rüdiger Weiß, GMRES convergence bounds for eigenvalue problems, ITERATIVE SOLUTION OF SHIFTED POSITIVE-DEFINITE LINEAR SYSTEMS ARISING IN A NUMERICAL METHOD FOR THE HEAT EQUATION BASED ON LAPLACE TRANSFORMATION AND QUADRATURE, On iterative solution of linear equations arising in BVPs of ODEs, The convergence rate of the Chebyshev SIM under a perturbation of a complex line-segment spectrum, A splitting method for complex symmetric indefinite linear system, Solving the time-fractional Schrödinger equation by Krylov projection methods, Preconditioning complex symmetric linear systems, A theoretical overview of Krylov subspace methods, Several variants of the Hermitian and skew-Hermitian splitting method for a class of complex symmetric linear systems, A splitting iterative method for the discrete dynamic linear systems, On Non-Hermitian Positive (Semi)Definite Linear Algebraic Systems Arising from Dissipative Hamiltonian DAEs, A flexible short recurrence Krylov subspace method for matrices arising in the time integration of port-Hamiltonian systems and ODEs/DAEs with a dissipative Hamiltonian, A preconditioner based on a splitting-type iteration method for solving complex symmetric indefinite linear systems, Deflated GMRES for systems with multiple shifts and multiple right-hand sides, On the use of rational iterative methods for solving large sparse linear systems, Milestones in the development of iterative solution methods, Multicomponent transport algorithms for partially ionized mixtures, Krylov subspace methods for functions of fractional differential operators, Projected iterative algorithms for complex symmetric systems arising in magnetized multicomponent transport, Lanczos-type algorithms for solving systems of linear equations, Complex conjugate gradient methods, Solving the Three-Dimensional High-frequency Helmholtz Equation Using Contour Integration and Polynomial Preconditioning, Real valued iterative methods for solving complex symmetric linear systems, A comparison between the complex symmetric based and classical computation of the singular value decomposition of normal matrices, Minimal residual-like condition with collinearity for shifted Krylov subspace methods, Improved seed methods for symmetric positive definite linear equations with multiple right‐hand sides, On using the shifted minimal residual method for quantum-mechanical wave packet simulation, On the stable implementation of the generalized minimal error method, Shift-and-Invert Krylov Methods for Time-Fractional Wave Equations, Proxy-GMRES: Preconditioning via GMRES in Polynomial Space, Preconditioned Multishift BiCG for $\mathcal{H}_2$-Optimal Model Reduction

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Chebyshev semi-iterative methods, successive overrelaxation iterative methods, and second order Richardson iterative methods. I, II
• Zolotarev's first problem - the best approximation by polynomials of degree \(\leq n-2\) to \(x^ n-n\sigma x^{n-1}\) in [-1,1]
• On the constrained Chebyshev approximation problem on ellipses
• The numerical solution of the Helmholtz equation for wave propagation problems in underwater acoustics
• Updating fermions with the Lanczos method
• On a class of Chebyshev approximation problems which arise in connection with a conjugate gradient type method
• Necessary and sufficient conditions for the simplification of generalized conjugate-gradient algorithms
• Extrapolation vs. projection methods for linear systems of equations
• Finite-difference solutions of a non-linear Schrödinger equation
• Variational Iterative Methods for Nonsymmetric Systems of Linear Equations
• A Taxonomy for Conjugate Gradient Methods
• Necessary and Sufficient Conditions for the Existence of a Conjugate Gradient Method
• Krylov Subspace Methods on Supercomputers
• Polynomial Preconditioners for Conjugate Gradient Calculations
• Conjugate Gradient-Like Algorithms for Solving Nonsymmetric Linear Systems
• An Efficient Implementation of a Conformal Mapping Method Based on the Szegö Kernel
• On Hybrid Semi-Iterative Methods
• Solution of Sparse Indefinite Systems of Linear Equations
• A Lanczos Method for a Class of Nonsymmetric Systems of Linear Equations
• Orthogonal Error Methods
• The method of minimum iterations with minimum errors for a system of linear algebraic equations with a symmetrical matrix
• Some properties of functions of exponential type
• Methods of conjugate gradients for solving linear systems