A maximal projection solution of ill-posed linear system in a column subspace, better than the least squares solution
From MaRDI portal
Publication:2364233
Recommendations
- A projection method for general form linear least-squares problems
- Orthogonal projection and total least squares
- Incomplete alternating projection method for large inconsistent linear systems
- scientific article; zbMATH DE number 4131947
- Projections and preconditioning for inconsistent least-squares problems
Cites work
- scientific article; zbMATH DE number 3476451 (Why is no real title available?)
- scientific article; zbMATH DE number 3493798 (Why is no real title available?)
- scientific article; zbMATH DE number 3511513 (Why is no real title available?)
- scientific article; zbMATH DE number 1012640 (Why is no real title available?)
- scientific article; zbMATH DE number 3092568 (Why is no real title available?)
- A doubly optimized solution of linear equations system expressed in an affine Krylov subspace
- A globally optimal iterative algorithm to solve an ill-posed linear system
- A globally optimal tri-vector method to solve an ill-posed linear system
- An optimal tri-vector iterative algorithm for solving ill-posed linear inverse problems
- Bi-CGSTAB: A Fast and Smoothly Converging Variant of Bi-CG for the Solution of Nonsymmetric Linear Systems
- CGS, A Fast Lanczos-Type Solver for Nonsymmetric Linear systems
- GMRES implementations and residual smoothing techniques for solving ill-posed linear systems
- GMRES: A Generalized Minimal Residual Algorithm for Solving Nonsymmetric Linear Systems
- Inexact Krylov Subspace Methods for Linear Systems
- Iterative Krylov Methods for Large Linear Systems
- Iterative solution of linear systems in the 20th century
- Krylov Subspace Methods for Solving Large Unsymmetric Linear Systems
- Methods of conjugate gradients for solving linear systems
- Novel algorithms based on the conjugate gradient method for inverting ill-conditioned matrices, and a new regularization method to solve ill-posed linear systems
- Parallel iterative methods for sparse linear systems
- QMR: A quasi-minimal residual method for non-Hermitian linear systems
- Recent computational developments in Krylov subspace methods for linear systems
- Solution of Sparse Indefinite Systems of Linear Equations
- The pre/post equilibrated conditioning methods to solve Cauchy problems
Cited in
(7)- Pseudo and anisotropic MFS for Laplace equation and optimal sources using maximal projection method with a substitution function
- A double optimal iterative algorithm in an affine Krylov subspace for solving nonlinear algebraic equations
- Maximizing the projection/minimizing the mass gap to choose optimal source points in the MFS for 2D and 3D Laplace equations
- Further results on global practical tracking via adaptive output feedback for uncertain nonlinear systems
- An algorithm with \(m\)-step residual history for solving linear equations: data interpolation by a multi-shape-factors RBF
- The meshless solutions of Laplacian non-harmonic and Cauchy problems by developing novel hybrid methods
- Path optimality conditions for minimum spanning tree problem with uncertain edge weights
This page was built for publication: A maximal projection solution of ill-posed linear system in a column subspace, better than the least squares solution
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2364233)