A globally optimal iterative algorithm to solve an ill-posed linear system
From MaRDI portal
Recommendations
- A globally optimal tri-vector method to solve an ill-posed linear system
- An optimally generalized steepest-descent algorithm for solving ill-posed linear systems
- The concept of best vector used to solve ill-posed linear inverse problems
- An optimal tri-vector iterative algorithm for solving ill-posed linear inverse problems
- A double optimal descent algorithm for iteratively solving ill-posed linear inverse problems
Cited in
(9)- An optimal tri-vector iterative algorithm for solving ill-posed linear inverse problems
- A Globally Optimal Iterative Algorithm Using the Best Descent Vector \mathaccentV dot05F x = l [ a c F + B T F ], with the Critical Value a c , for Solving a System of Nonlinear Algebraic Equations F ( x )= 0
- Solving Helmholtz equation with high wave number and ill-posed inverse problem using the multiple scales Trefftz collocation method
- A globally optimal tri-vector method to solve an ill-posed linear system
- A maximal projection solution of ill-posed linear system in a column subspace, better than the least squares solution
- The concept of best vector used to solve ill-posed linear inverse problems
- Optimal algorithms in a Krylov subspace for solving linear inverse problems by MFS
- A double optimal descent algorithm for iteratively solving ill-posed linear inverse problems
- An optimally generalized steepest-descent algorithm for solving ill-posed linear systems
This page was built for publication: A globally optimal iterative algorithm to solve an ill-posed linear system
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2964623)
