On the simplification of generalized conjugate-gradient methods for nonsymmetrizable linear systems
From MaRDI portal
Die Arbeit befaßt sich mit Modifikationen des Verfahrens der konjugierten Gradienten (cg-Verfahren) für nichtsymmetrische Gleichungssysteme \(Ax=b\). Gibt es eine Matrix H mit \(HA=A^ TH\), so lassen sich Modifikationen des cg-Verfahrens mit den von symmetrischen Systemen her bekannten Eigenschaften des Verfahrens angeben. Es wird gezeigt, daß eine solche Matrix H immer existiert, i.a. aber schwer zu bestimmen ist. Geht man zu einem doppelt so großen Blockdiagonalsystem Ã\~x\(=\tilde b\) mit Diagonalblöcken A und \(A^ T\) über, so läßt sich ein entsprechendes \(\tilde H\) leicht finden. Die Formeln für das entsprechende cg-Verfahren werden angegeben und ein Zusammenhang mit der Methode von Lanczos aufgezeigt.
Cites work
- A Lanczos Method for a Class of Nonsymmetric Systems of Linear Equations
- Conjugate gradient type methods for unsymmetric and inconsistent systems of linear equations
- Generalized conjugate-gradient acceleration of nonsymmetrizable iterative methods
- scientific article; zbMATH DE number 3138903 (Why is no real title available?)
- scientific article; zbMATH DE number 3145563 (Why is no real title available?)
- scientific article; zbMATH DE number 3655254 (Why is no real title available?)
- scientific article; zbMATH DE number 3720254 (Why is no real title available?)
- scientific article; zbMATH DE number 3787937 (Why is no real title available?)
- scientific article; zbMATH DE number 3511513 (Why is no real title available?)
- scientific article; zbMATH DE number 3551784 (Why is no real title available?)
- scientific article; zbMATH DE number 3633619 (Why is no real title available?)
- scientific article; zbMATH DE number 819140 (Why is no real title available?)
- Hyperbolic Pairs in the Method of Conjugate Gradients
- Iterative methods for solving linear equations
- Krylov Subspace Methods for Solving Large Unsymmetric Linear Systems
- Methods of conjugate gradients for solving linear systems
- Numerical solution of nonlinear elliptic partial differential equations by a generalized conjugate gradient method
- Solution of Sparse Indefinite Systems of Linear Equations
- Some Stable Methods for Calculating Inertia and Solving Symmetric Linear Systems
- The Conjugate Gradient Method for Linear and Nonlinear Operator Equations
- The Conjugate Residual Method for Constrained Minimization Problems
- The Lanczos Algorithm with Selective Orthogonalization
- The Lanczos Biorthogonalization Algorithm and Other Oblique Projection Methods for Solving Large Unsymmetric Systems
- The method of minimum iterations with minimum errors for a system of linear algebraic equations with a symmetrical matrix
- The principle of minimized iterations in the solution of the matrix eigenvalue problem
- The Use of Conjugate Gradients for Systems of Linear Equations Possessing “Property A”
- The Use of Pre-conditioning in Iterative Methods for Solving Linear Equations with Symmetric Positive Definite Matrices
- Variational Iterative Methods for Nonsymmetric Systems of Linear Equations
- Variations on Arnoldi's method for computing eigenelements of large unsymmetric matrices
Cited in
(31)- Necessary and sufficient conditions for the simplification of generalized conjugate-gradient algorithms
- Penalty finite element analysis of incompressible flows using element by element solution algorithms
- Treatment of near-breakdown in the CGS algorithm
- Breakdowns and stagnation in iterative methods
- Multigrid methods to accelerate convergence of element-by-element solution algorithms for viscous incompressible flows
- On vector Hankel determinants
- The matrix and polynomial approaches to Lanczos-type algorithms
- Lanczos-type algorithms for solving systems of linear equations
- Variations of the GMRES iterative method
- Look-ahead in Bi-CGSTAB and other product methods for linear systems
- Two-dimensional finite element model of breast cancer cell motion through a microfluidic channel
- Laminar pulsatile two-phase non-Newtonian flow through a pipe
- GMRES algorithms over 35 years
- On the convergence of Q-OR and Q-MR Krylov methods for solving nonsymmetric linear systems
- Modified Lanczos method for solving large sparse linear systems
- Iterative methods for stabilized mixed velocity-pressure finite elements
- Recent computational developments in Krylov subspace methods for linear systems
- Implicit finite element methods for two-phase flow in oil reservoirs
- Iterative algorithms and software for solving large sparse linear systems
- A numerical comparison of conjugate gradient-like methods
- Numerical simulation of forming processes using a coupled fluid flow and heat transfer model
- Accuracy and convergence of element‐by‐element iterative solvers for incompressible fluid flows using penalty finite element model
- Properties of generalized conjugate gradient methods
- scientific article; zbMATH DE number 1569012 (Why is no real title available?)
- The use of conjugate gradients methods with a segregated finite volume procedure for solving transient, incompressible Navier–Stokes equations
- The concept of special inner products for deriving new conjugate gradient‐like solvers for non‐symmetric sparse linear systems
- On the roots of the orthogonal polynomials and residual polynomials associated with a conjugate gradient method
- An introduction to the NSPCG software package
- Recursive interpolation algorithm: A formalism for solving systems of linear equations. II: Iterative methods
- Mathematical modelling of chemical engineering systems by finite element analysis using PDE/PROTRAN
- Preconditioned biconjugate gradient methods for numerical reservoir simulation
This page was built for publication: On the simplification of generalized conjugate-gradient methods for nonsymmetrizable linear systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q791277)
