Results 131 to 140 of about 180,343 (197)

A Regularization Parameter in Discrete Ill-Posed Problems

SIAM Journal on Scientific Computing, 1996
The author considers the Tikhonov regularization method for the discrete ill-posed problem of minimizing \[ J_\alpha(u)=|Ku-f|^2+\alpha|u|^2, \] where \(K\) is an \(m\times n\) matrix with a large condition number, \(m\geq n\), and \(\alpha>0\). The Euclidean norm is used.
T. Reginska
semanticscholar   +3 more sources

The discrete picard condition for discrete ill-posed problems

BIT, 1990
For Fredholm integral equations of the first kind with nondegenerate kernels the Picard criterion simultaneously provides an existence criterion and elucidates the essential ill-posedness of the problem. The author develops a discrete Picard condition for the overdetermined ill- conditioned linear algebraic systems which arise from the discretization ...
P. Hansen
semanticscholar   +3 more sources

GMRES, L-Curves, and Discrete Ill-Posed Problems

BIT Numerical Mathematics, 2002
The application of the generalized minimal residual (GMRES) method is discussed for solving large systems of linear equations that arise from the discretization of linear ill-posed problems. The situation is considered when the right-hand side vector is contaminated by measurement errors.
D. Calvetti, B. Lewis, L. Reichel
semanticscholar   +3 more sources

Numerical considerations of block GMRES methods when applied to linear discrete ill-posed problems

Journal of Computational and Applied Mathematics, 2023
Linear systems of equations with a matrix whose singular values decay to zero with increasing index number without a significant gap are commonly referred to as linear discrete ill-posed problems.
Lucas Onisk, L. Reichel, H. Sadok
semanticscholar   +1 more source

Home - About - Disclaimer - Privacy