Preconditioned conjugate gradients for solving singular systems
From MaRDI portal
Publication:1112553
DOI10.1016/0377-0427(88)90358-5zbMath0659.65031OpenAlexW2047714674MaRDI QIDQ1112553
Publication date: 1988
Published in: Journal of Computational and Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0377-0427(88)90358-5
numerical examplepreconditioned conjugate gradient methodrank deficiencynonsingular incomplete Cholesky decompositionsemi-definite Neumann- problemsSparse singular systems
Computational methods for sparse matrices (65F50) Iterative numerical methods for linear systems (65F10) Direct numerical methods for linear systems and matrix inversion (65F05) Numerical solution of discretized equations for boundary value problems involving PDEs (65N22)
Related Items (51)
A breakdown-free block conjugate gradient method ⋮ An efficient multiple marker front-capturing method for two-phase flows ⋮ Decomposition of a planar vector field into irrotational and rotational components ⋮ A geometric view of Krylov subspace methods on singular systems ⋮ A spectral analysis of subspace enhanced preconditioners ⋮ A two-step algorithm for solving singular linear systems with index one ⋮ On deflation and singular symmetric positive semi-definite matrices ⋮ Graph perturbations ⋮ Core-annular flow through a horizontal pipe: Hydrodynamic counterbalancing of buoyancy force on core ⋮ Conjugate gradient type methods and preconditioning ⋮ Nonuniformly weighted Schwarz smoothers for spectral element multigrid ⋮ \(P\)-proper splittings ⋮ Robust multigrid for high-order discontinuous Galerkin methods: a fast Poisson solver suitable for high-aspect ratio Cartesian grids ⋮ Topology optimization of freely floating elastic continua using the inertia relief method ⋮ Comparison of the deflated preconditioned conjugate gradient method and algebraic multigrid for composite materials ⋮ Graphs with absorption: numerical methods for the absorption inverse and the computation of centrality measures ⋮ Comparison of two-level preconditioners derived from deflation, domain decomposition and multigrid methods ⋮ P1$$ {P}_1 $$–Nonconforming quadrilateral finite element space with periodic boundary conditions: Part I. Fundamental results on dimensions, bases, solvers, and error analysis ⋮ Spectral preconditioners for the efficient numerical solution of a continuous branched transport model ⋮ Triangular and skew-symmetric splitting method for numerical solutions of Markov chains ⋮ Complementary finite element methods applied to the numerical homogenization of 3D absolute permeability ⋮ Parallel preconditioned conjugate gradient algorithm on GPU ⋮ Krylov Subspace Solvers and Preconditioners ⋮ Semistability of Steepest Descent with Momentum for Quadratic Functions ⋮ Efficient finite element solvers for the Maxwell equations in the frequency domain ⋮ Gradient methods for computing the Drazin-inverse solution ⋮ Sparse tensor finite elements for elliptic multiple scale problems ⋮ On the accuracy of spectral solvers for micromechanics based fatigue modeling ⋮ Multilevel frames for sparse tensor product spaces ⋮ New algorithms for solving singular linear system ⋮ The deflated conjugate gradient method: convergence, perturbation and accuracy ⋮ Properties and computation of continuous-time solutions to linear systems ⋮ Lower eigenvalue bounds for singular pencils of matrices ⋮ Fast and robust solvers for pressure-correction in bubbly flow problems ⋮ Numerical simulation and experimental validation of coupled flow, heat transfer and electromagnetic problems in electrical transformers ⋮ Two-Level Nyström--Schur Preconditioner for Sparse Symmetric Positive Definite Matrices ⋮ A finite element method for elliptic problems with stochastic input data ⋮ Efficient modelling techniques for complicated boundary conditions applied to structured grids ⋮ The construction of projection vectors for a deflated ICCG method applied to problems with extreme contrasts in the coefficients ⋮ A general finite element preconditioning for the conjugate gradient method ⋮ Fast and accurate surface normal integration on non-rectangular domains ⋮ Reuse, recycle, reduce (3R) - strategies for the calculation of transient magnetic fields ⋮ Incomplete factorizations of singular linear systems ⋮ Generalized Conjugate Gradient Methods for ℓ1 Regularized Convex Quadratic Programming with Finite Convergence ⋮ Finite element minimization of curvature functionals with anisotropy ⋮ Algebraic Two-Level Convergence Theory for Singular Systems ⋮ Efficient iterative solution of constrained finite element analyses ⋮ Finite volume modelling of free-surface draining vortices ⋮ An efficient preconditioned CG method for the solution of a class of layered problems with extreme contrasts in the coefficients ⋮ Domain decomposition and parallel processing of a finite element model of the shallow water equations ⋮ Conjugate gradients for symmetric positive semidefinite least-squares problems
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The rate of convergence of conjugate gradients
- Guidelines for the usage of incomplete decompositions in solving sets of linear equations as they occur in practical problems
- A practical finite element approximation of a semi-definite Neumann problem on a curved domain
- An Iterative Solution Method for Linear Systems of Which the Coefficient Matrix is a Symmetric M-Matrix
This page was built for publication: Preconditioned conjugate gradients for solving singular systems
