Preconditioning projection methods for solving algebraic linear systems
The author devises a method for finding appropriate parameters for an \(n\times n\) matrix \(M\) through a link with the conjugate gradient method and a sequence of \(m\times 1\) vectors \(\{u_i\}_{i=1}^\infty\) to improve the convergence of the projection aggregation method for solving a consistent linear system of \(n\) variables and \(m\) equations \((m\geq n)\). It is found that the applications of these results to a hard \(3D\) partial differential equations are highly promising. Finally the method is adapted to the solution of a system of linear inequalities.
- Explicit gradient information in multiobjective optimization
- Projections and preconditioning for inconsistent least-squares problems
- scientific article; zbMATH DE number 4218628 (Why is no real title available?)
- scientific article; zbMATH DE number 4045017 (Why is no real title available?)
- scientific article; zbMATH DE number 741199 (Why is no real title available?)
- Some preconditioners for systems of linear inequalities
- An acceleration scheme for Dykstra's algorithm
This page was built for publication: Preconditioning projection methods for solving algebraic linear systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1817786)