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.011zbMath1367.65060OpenAlexW2151933820MaRDI QIDQ2364233

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

zbMATH Keywords

inverse problemsleast squares solutionlinear equations systemcolumn subspacemaximal projection algorithmmaximal projection solution

Mathematics Subject Classification ID

Ill-posedness and regularization problems in numerical linear algebra (65F22) Linear equations (linear algebraic aspects) (15A06)

Related Items (4)

Path Optimality Conditions for Minimum Spanning Tree Problem with Uncertain Edge Weights ⋮ An algorithm with \(m\)-step residual history for solving linear equations: data interpolation by a multi-shape-factors RBF ⋮ 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

Uses Software

• CGS

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• GMRES implementations and residual smoothing techniques for solving ill-posed linear systems
• The pre/post equilibrated conditioning methods to solve Cauchy problems
• QMR: A quasi-minimal residual method for non-Hermitian linear systems
• Iterative solution of linear systems in the 20th century
• A globally optimal tri-vector method to solve an ill-posed linear system
• A doubly optimized solution of linear equations system expressed in an affine Krylov subspace
• 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
• Novel Algorithms Based on the Conjugate Gradient Method for Inverting Ill-Conditioned Matrices, and a New Regularization Method to Solve Ill-Posed Linear Systems
• Recent computational developments in Krylov subspace methods for linear systems
• GMRES: A Generalized Minimal Residual Algorithm for Solving Nonsymmetric Linear Systems
• CGS, A Fast Lanczos-Type Solver for Nonsymmetric Linear systems
• Krylov Subspace Methods for Solving Large Unsymmetric Linear Systems
• Bi-CGSTAB: A Fast and Smoothly Converging Variant of Bi-CG for the Solution of Nonsymmetric Linear Systems
• Solution of Sparse Indefinite Systems of Linear Equations
• Inexact Krylov Subspace Methods for Linear Systems
• Iterative Krylov Methods for Large Linear Systems
• Methods of conjugate gradients for solving linear systems

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