Conjugate Gradient-Like Algorithms for Solving Nonsymmetric Linear Systems
From MaRDI portal
Publication:3681827
DOI10.2307/2007961zbMATH Open0566.65019OpenAlexW4254781517MaRDI QIDQ3681827FDOQ3681827
Authors: Y. Saad, Martin H. Schultz 
Publication date: 1985
Full work available at URL: https://doi.org/10.2307/2007961
Recommendations
Krylov subspacesconjugate gradient methodPetrov-Galerkin methodlarge sparse nonsymmetric matrixorthogonalization methodsconjugate residual methods
Computational methods for sparse matrices (65F50) Iterative numerical methods for linear systems (65F10) Orthogonalization in numerical linear algebra (65F25)
Cited In (63)
- Iterative methods for unsymmetric linear systems
- Fast and accurate randomized algorithms for linear systems and eigenvalue problems
- A matrix sampling approach for efficient SimRank computation
- Revisiting \((k,\ell)\)-step methods
- An EM-based iterative method for solving large sparse linear systems
- Title not available (Why is that?)
- Algebraic inverse fast multipole method: a fast direct solver that is better than HODLR based fast direct solver
- SIRT- and CG-type methods for the iterative solution of sparse linear least-squares problems
- A class of optimized row projection methods for solving large nonsymmetric linear systems
- Breakdowns in the implementation of the Lánczos method for solving linear systems
- Title not available (Why is that?)
- A note on the restarted CG method and reduced space additive correction
- Numerical experiments of some Krylov subspace methods for black oil model
- Superlinearly convergent CG methods via equivalent preconditioning for nonsymmetric elliptic operators
- Generalized conjugate directions
- Iterative algorithms for the solution of nonsymmetric systems in the modelling of weak plasma turbulence
- Analysis of the convergence of the minimal and the orthogonal residual methods
- Applying powell's symmetrical technique to conjugate gradient methods
- On a conjugate gradient-type method for solving complex symmetric linear systems
- Conjugate residual squared method and its improvement for non-symmetric linear systems
- A parallel preconditioned conjugate gradient package for solving sparse linear systems on a Cray Y-MP
- A Brief Introduction to Krylov Space Methods for Solving Linear Systems
- Iterative accelerating algorithms with Krylov subspaces for the solution to large-scale nonlinear problems
- Newton-Krylov methods applied to a system of convection-diffusion-reaction equations
- BiCGStab, VPAStab and an adaptation to mildly nonlinear systems
- Parallel implementation of BVM methods
- Poisson equation solver with fourth-order accuracy by using interpolated differential operator scheme
- Avoiding breakdown in variants of the BI-CGSTAB algorithm
- Tensor-Krylov methods for large nonlinear equations
- A variable explicit/implicit numerical method for calculating advection on unstructured meshes
- Modified Lanczos method for solving large sparse linear systems
- Using program package NSPCG to analyze the trunk reservation service protection method
- A new taxonomy of conjugate gradient methods
- Improving directions of negative curvature in an efficient manner
- Mixed \(L^2\)-Wasserstein optimal mapping between prescribed density functions
- Numerical solution of large nonsymmetric eigenvalue problems
- Projection-minimization methods for nonsymmetric linear systems
- Incomplete block-matrix factorization iterative methods for convection- diffusion problems
- An overview of NSPCG: A nonsymmetric preconditioned conjugate gradient package
- Vector sequence transformations: Methodology and applications to linear systems
- Roundoff error analysis of algorithms based on Krylov subspace methods
- Spatially discrete nonlinear diffusion equations
- Block preconditioning and domain decomposition methods. II
- A generalized conjugate gradient, least square method
- Norm descent conjugate gradient methods for solving symmetric nonlinear equations
- Contraction numbers for additive correction methods
- The methods of Vorobyev and Lanczos
- A posteriori error analysis of round-off errors in the numerical solution of ordinary differential equations
- On conjugate gradient type methods and polynomial preconditioners for a class of complex non-Hermitian matrices
- Lanczos-type algorithms for solving systems of linear equations
- Efficient time integration of Navier-Stokes equations
- Comparison of different Krylov subspace methods embedded in an implicit finite volume scheme for the computation of viscous and inviscid flow fields on unstructured grids
- Breakdowns and stagnation in iterative methods
- A new family of preconditioned iterative solvers for nonsymmetric linear systems
- Distributed minimal residual (DMR) method for acceleration of iterative algorithms
- A composite step bi-conjugate gradient algorithm for nonsymmetric linear systems
- Explicit approximate inverse preconditioning techniques
- A survey of preconditioned iterative methods for linear systems of algebraic equations
- Sensitivity-based methods for convergence acceleration of iterative algorithms.
- Krylov subspace projection method and its application to oil reservoir simulation
- The Arnoldi process, short recursions, and displacement ranks
- The block grade of a block Krylov space
- On the equivalence between the scheduled relaxation Jacobi method and Richardson's non-stationary method
This page was built for publication: Conjugate Gradient-Like Algorithms for Solving Nonsymmetric Linear Systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3681827)
