A maximal projection solution of ill-posed linear system in a column subspace, better than the least squares solution
DOI10.1016/J.CAMWA.2014.04.011zbMATH Open1367.65060OpenAlexW2151933820MaRDI QIDQ2364233FDOQ2364233
Authors: Chein-Shan Liu 
Publication date: 18 July 2017
Published in: Computers & Mathematics with Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.camwa.2014.04.011
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
inverse problemsleast squares solutionlinear equations systemcolumn subspacemaximal projection algorithmmaximal projection solution
Ill-posedness and regularization problems in numerical linear algebra (65F22) Linear equations (linear algebraic aspects) (15A06)
Cites Work
- CGS, A Fast Lanczos-Type Solver for Nonsymmetric Linear systems
- GMRES: A Generalized Minimal Residual Algorithm for Solving Nonsymmetric Linear Systems
- Methods of conjugate gradients for solving linear systems
- Parallel iterative methods for sparse linear systems
- QMR: A quasi-minimal residual method for non-Hermitian linear systems
- Bi-CGSTAB: A Fast and Smoothly Converging Variant of Bi-CG for the Solution of Nonsymmetric Linear Systems
- Title not available (Why is that?)
- Solution of Sparse Indefinite Systems of Linear Equations
- Title not available (Why is that?)
- Title not available (Why is that?)
- Recent computational developments in Krylov subspace methods for linear systems
- Krylov Subspace Methods for Solving Large Unsymmetric Linear Systems
- Iterative Krylov Methods for Large Linear Systems
- Iterative solution of linear systems in the 20th century
- GMRES implementations and residual smoothing techniques for solving ill-posed 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
- An optimal tri-vector iterative algorithm for solving ill-posed linear inverse problems
- A globally optimal iterative algorithm to solve an ill-posed linear system
- Title not available (Why is that?)
- The pre/post equilibrated conditioning methods to solve Cauchy problems
- Inexact Krylov Subspace Methods for Linear Systems
- Title not available (Why is that?)
- A doubly optimized solution of linear equations system expressed in an affine Krylov subspace
- A globally optimal tri-vector method to solve an ill-posed linear system
Cited In (7)
- Pseudo and anisotropic MFS for Laplace equation and optimal sources using maximal projection method with a substitution function
- Maximizing the projection/minimizing the mass gap to choose optimal source points in the MFS for 2D and 3D Laplace equations
- A double optimal iterative algorithm in an affine Krylov subspace for solving nonlinear algebraic 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
Uses Software
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)
