Polynomial Preconditioners for Conjugate Gradient Calculations
From MaRDI portal
Publication:3677062
Recommendations
- Efficient Polynomial Preconditioning for the Conjugate Gradient Method
- Practical Use of Polynomial Preconditionings for the Conjugate Gradient Method
- Yet another polynomial preconditioner for the conjugate gradient algorithm
- scientific article; zbMATH DE number 4098613
- Preconditioned conjugate gradient methods applied to certain symmetric linear systems
Cited in
(62)- Computation of minimum eigenvalue through minimization of rayleigh's quotient for large sparse matrices using vector computer:
- Application of polynomial preconditioners to conservation laws
- Parallel matrix-free polynomial preconditioners with application to flow simulations in discrete fracture networks
- Polynomial preconditioners for regularized linear inverse problems
- Proxy-GMRES: Preconditioning via GMRES in Polynomial Space
- Parallel preconditioned conjugate-gradient type algorithms for general sparsity structures
- A primal-dual projection algorithm for efficient constraint preconditioning
- Comparison of Lanczos and CGS solvers for solving numerical heat transfer problems
- On polynomial preconditioning and asymptotic convergence factors for indefinite Hermitian matrices
- Iterative solution of linear systems in the 20th century
- Yet another polynomial preconditioner for the conjugate gradient algorithm
- Multisplitting preconditioners for a symmetric positive definite matrix
- Accelerated simultaneous iterations for large finite element eigenproblems
- Shifted FSAI preconditioners for the efficient parallel solution of non-linear groundwater flow models
- Optimal preconditioners of a given sparsity pattern
- Comparison of several iterative techniques in the solution of symmetric banded equations on a two-pipe Cyber 205
- Data structures to vectorize CG algorithms for general sparsity patterns
- An overview of NSPCG: A nonsymmetric preconditioned conjugate gradient package
- scientific article; zbMATH DE number 961479 (Why is no real title available?)
- Pole placement preconditioning
- Construction and efficient implementation of implicit preconditioning methods. I
- On conjugate gradient type methods and polynomial preconditioners for a class of complex non-Hermitian matrices
- The behavior of conjugate gradient algorithms on a multivector processor with a hierarchical memory
- A preconditioned alternating inner‐outer iterative solution method for the mixed finite element formulation of the Navier‐Stokes equations
- A modified SSOR-like preconditioner for non-Hermitian positive definite matrices
- Performance of the conjugate gradient method on VICTOR
- scientific article; zbMATH DE number 961534 (Why is no real title available?)
- A polynomial preconditioner for the CMRH algorithm
- A local solution adapted Tri-Tree multigrid generator and iterative equation solver for mixed finite element formulation of the Navier-Stokes equations
- Approximate polynomial preconditionings applied to biharmonic equations
- Preconditioning for sparse linear systems at the dawn of the 21st century: history, current developments, and future perspectives
- Adaptive polynomial preconditioning for Hermitian indefinite linear systems
- Polynomial preconditioning on vector computers
- Preconditioned multishift BiCG for \(\mathcal{H}_2\)-optimal model reduction
- A note on a block preconditioner
- The prolonged adaptive multigrid method for finite element Navier-Stokes equations
- Comparison of Krylov subspace methods with preconditioning techniques for solving boundary value problems
- Polynomial preconditioning and the generalized minimal residual algorithm solver for the 2-D Boltzmann transport equation
- Parallel algorithms for the solution of certain large sparse linear systems
- A short survey on preconditioning techniques for large-scale dense complex linear systems in electromagnetics
- Fast generalized cross validation using Krylov subspace methods
- Polynomial preconditioners based on factorized sparse approximate inverses
- A numerical study of optimized sparse preconditioners
- A preconditioned conjugate gradient method on a distributed memory multiprocessor
- Implementation of an element-by-element solution algorithm for the finite element method on a coarse-grained parallel computer
- Generalized ADI preconditioning
- Conjugate gradient solution of finite element equations on the IBM 3090 vector computer utilizing polynomial preconditionings
- On vectorizing the preconditioned generalized conjugate residual methods
- Résolution de grands systèmes linéaires creux par méthodes itératives parallèles
- Polynomial Preconditioned GMRES and GMRES-DR
- Restarted GMRES preconditioned by deflation
- Leapfrog variants of iterative methods for linear algebraic equations
- Parallel solution techniques in computational structural mechanics
- A block preconditioned steepest descent method for symmetric eigenvalue problems
- Norm estimates for the \(l^ 2\)-inverses of multivariate Toeplitz matrices
- Vector Computations for Sparse Linear Systems
- Efficient Polynomial Preconditioning for the Conjugate Gradient Method
- Necessary and sufficient conditions for the simplification of generalized conjugate-gradient algorithms
- Simultaneous nonlinear structural analysis and design
- Numerical performance of projection methods in finite element consolidation models
- Preconditioning complex symmetric linear systems
- Preconditioning techniques for large linear systems: A survey
This page was built for publication: Polynomial Preconditioners for Conjugate Gradient Calculations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3677062)
