On the simplification of generalized conjugate-gradient methods for nonsymmetrizable linear systems
From MaRDI portal
Publication:791277
DOI10.1016/0024-3795(83)80026-3zbMATH Open0535.65018OpenAlexW1995020472MaRDI QIDQ791277FDOQ791277
Authors: Kang C. Jea, David M. Young
Publication date: 1983
Published in: Linear Algebra and its Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0024-3795(83)80026-3
Cites Work
- Methods of conjugate gradients for solving linear systems
- Title not available (Why is that?)
- Solution of Sparse Indefinite Systems of Linear Equations
- Title not available (Why is that?)
- Variations on Arnoldi's method for computing eigenelements of large unsymmetric matrices
- Variational Iterative Methods for Nonsymmetric Systems of Linear Equations
- Krylov Subspace Methods for Solving Large Unsymmetric Linear Systems
- The Lanczos Biorthogonalization Algorithm and Other Oblique Projection Methods for Solving Large Unsymmetric Systems
- Some Stable Methods for Calculating Inertia and Solving Symmetric Linear Systems
- The Use of Pre-conditioning in Iterative Methods for Solving Linear Equations with Symmetric Positive Definite Matrices
- The principle of minimized iterations in the solution of the matrix eigenvalue problem
- Title not available (Why is that?)
- The Conjugate Gradient Method for Linear and Nonlinear Operator Equations
- Conjugate gradient type methods for unsymmetric and inconsistent systems of linear equations
- Generalized conjugate-gradient acceleration of nonsymmetrizable iterative methods
- Title not available (Why is that?)
- The Lanczos Algorithm with Selective Orthogonalization
- A Lanczos Method for a Class of Nonsymmetric Systems of Linear Equations
- The Conjugate Residual Method for Constrained Minimization Problems
- The Use of Conjugate Gradients for Systems of Linear Equations Possessing “Property A”
- Numerical solution of nonlinear elliptic partial differential equations by a generalized conjugate gradient method
- Iterative methods for solving linear equations
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- The method of minimum iterations with minimum errors for a system of linear algebraic equations with a symmetrical matrix
- Hyperbolic Pairs in the Method of Conjugate Gradients
Cited In (31)
- The matrix and polynomial approaches to Lanczos-type algorithms
- Iterative algorithms and software for solving large sparse linear systems
- On the convergence of Q-OR and Q-MR Krylov methods for solving nonsymmetric linear systems
- Title not available (Why is that?)
- Variations of the GMRES iterative method
- Look-ahead in Bi-CGSTAB and other product methods for linear systems
- Preconditioned biconjugate gradient methods for numerical reservoir simulation
- The use of conjugate gradients methods with a segregated finite volume procedure for solving transient, incompressible Navier–Stokes equations
- Iterative methods for stabilized mixed velocity-pressure finite elements
- Necessary and sufficient conditions for the simplification of generalized conjugate-gradient algorithms
- Numerical simulation of forming processes using a coupled fluid flow and heat transfer model
- On vector Hankel determinants
- Recursive interpolation algorithm: A formalism for solving systems of linear equations. II: Iterative methods
- A numerical comparison of conjugate gradient-like methods
- Accuracy and convergence of element‐by‐element iterative solvers for incompressible fluid flows using penalty finite element model
- Modified Lanczos method for solving large sparse linear systems
- Implicit finite element methods for two-phase flow in oil reservoirs
- The concept of special inner products for deriving new conjugate gradient‐like solvers for non‐symmetric sparse linear systems
- An introduction to the NSPCG software package
- Mathematical modelling of chemical engineering systems by finite element analysis using PDE/PROTRAN
- On the roots of the orthogonal polynomials and residual polynomials associated with a conjugate gradient method
- Multigrid methods to accelerate convergence of element-by-element solution algorithms for viscous incompressible flows
- Lanczos-type algorithms for solving systems of linear equations
- Treatment of near-breakdown in the CGS algorithm
- Breakdowns and stagnation in iterative methods
- Laminar pulsatile two-phase non-Newtonian flow through a pipe
- Two-dimensional finite element model of breast cancer cell motion through a microfluidic channel
- Penalty finite element analysis of incompressible flows using element by element solution algorithms
- Properties of generalized conjugate gradient methods
- Recent computational developments in Krylov subspace methods for linear systems
- GMRES algorithms over 35 years
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)