A doubly optimized solution of linear equations system expressed in an affine Krylov subspace
From MaRDI portal
Publication:2511212
DOI10.1016/j.cam.2013.10.013zbMath1293.65047OpenAlexW2059922671MaRDI QIDQ2511212
Publication date: 5 August 2014
Published in: Journal of Computational and Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cam.2013.10.013
linear equations systemoptimizationsdouble optimal solutionaffine Krylov subspacedoubly optimized solution
Iterative numerical methods for linear systems (65F10) Linear equations (linear algebraic aspects) (15A06)
Related Items (4)
A maximal projection solution of ill-posed linear system in a column subspace, better than the least squares solution ⋮ An algorithm with \(m\)-step residual history for solving linear equations: data interpolation by a multi-shape-factors RBF ⋮ A double optimal descent algorithm for iteratively solving ill-posed linear inverse problems ⋮ A double optimal iterative algorithm in an affine Krylov subspace for solving nonlinear algebraic equations
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On the confluent Vandermonde matrix calculation algorithm
- Numerical recipes for the high efficient inverse of the confluent Vandermonde matrices
- QMR: A quasi-minimal residual method for non-Hermitian linear systems
- A dynamical Tikhonov regularization for solving ill-posed linear algebraic systems
- An optimal tri-vector iterative algorithm for solving ill-posed linear inverse problems
- Novel Algorithms Based on the Conjugate Gradient Method for Inverting Ill-Conditioned Matrices, and a New Regularization Method to Solve Ill-Posed Linear Systems
- A Highly Accurate Technique for Interpolations Using Very High-Order Polynomials, and Its Applications to Some Ill-Posed Linear Problems
- Recent computational developments in Krylov subspace methods for linear systems
- GMRES: A Generalized Minimal Residual Algorithm for Solving Nonsymmetric Linear Systems
- Krylov Subspace Methods for Solving Large Unsymmetric Linear Systems
- Inexact Krylov Subspace Methods for Linear Systems
- A DISCREPANCY PRINCIPLE FOR THE SOURCE POINTS LOCATION IN USING THE MFS FOR SOLVING THE BHCP
This page was built for publication: A doubly optimized solution of linear equations system expressed in an affine Krylov subspace