The discrete Picard condition for discrete ill-posed problems

DOI10.1007/BF01933214zbMath0723.65147OpenAlexW2050001231MaRDI QIDQ757000

Per Christian Hansen

Publication date: 1990

Published in: BIT (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01933214

zbMATH Keywords

regularizationsingular value decompositionFourier coefficientsill-posed problemsFredholm integral equations of the first kindPicard criterionmoving geometric meannumerical checkoverdetermined ill-conditioned linear algebraic systems

Mathematics Subject Classification ID

Numerical solutions to overdetermined systems, pseudoinverses (65F20) Numerical methods for integral equations (65R20) Numerical methods for ill-posed problems for integral equations (65R30) Fredholm integral equations (45B05)

Related Items (38)

Regularization properties of Krylov iterative solvers CGME and LSMR for linear discrete ill-posed problems with an application to truncated randomized SVDs ⋮ A stopping criterion for iterative regularization methods ⋮ Near-Optimal Spectral Filtering and Error Estimation for Solving Ill-Posed Problems ⋮ Inheritance of the discrete Picard condition in Krylov subspace methods ⋮ Method of fundamental solutions and high order algorithm to solve nonlinear elastic problems ⋮ Preconditioned RRGMRES for Discrete Ill-Posed Problems ⋮ Some notes about the continuous-in-time financial model ⋮ Stably numerical solving inverse boundary value problem for data assimilation ⋮ Polynomial basis conversion made stable by truncated singular value decomposition ⋮ Tikhonov regularisation in standard form for polynomial basis conversion ⋮ Space-dependent source determination in a time-fractional diffusion equation using a local discontinuous Galerkin method ⋮ Embedded techniques for choosing the parameter in Tikhonov regularization ⋮ A GCV based Arnoldi-Tikhonov regularization method ⋮ Stabilization of generalized empirical interpolation method (GEIM) in presence of noise: a novel approach based on Tikhonov regularization ⋮ Estimation of the Regularization Parameter in Linear Discrete Ill-Posed Problems Using the Picard Parameter ⋮ Imaging algorithm for synthetic aperture interferometric radiometer in near field ⋮ Krylov methods for inverse problems: Surveying classical, and introducing new, algorithmic approaches ⋮ Efficient determination of the hyperparameter in regularized total least squares problems ⋮ \(L^1\) regularization method in electrical impedance tomography by using the \(L^1\)-curve (Pareto frontier curve) ⋮ Accelerated Landweber iterations for the solution of ill-posed equations ⋮ Effective condition number of the Hermite finite element methods for biharmonic equations ⋮ A Convergence Result for Some Krylov–Tikhonov Methods in Hilbert Spaces ⋮ Condition estimation for regression and feature selection ⋮ A descent method for regularization of ill-posed problems ⋮ Unbiased predictive risk estimation of the Tikhonov regularization parameter: convergence with increasing rank approximations of the singular value decomposition ⋮ An iterative algorithm for large size least-squares constrained regularization problems ⋮ New model function methods for determining regularization parameters in linear inverse problems ⋮ Ill-posedness determination of moving force identification and parameters selection for regularization methods ⋮ Minimax entropy solutions of ill-posed problems ⋮ Tikhonov Regularization and Randomized GSVD ⋮ Automatic stopping rule for iterative methods in discrete ill-posed problems ⋮ Fixing Nonconvergence of Algebraic Iterative Reconstruction with an Unmatched Backprojector ⋮ Regularization, GSVD and truncated GSVD ⋮ The low rank approximations and Ritz values in LSQR for linear discrete ill-posed problem ⋮ Extension of GKB‐FP algorithm to large‐scale general‐form Tikhonov regularization ⋮ Iterative hybrid regularization for extremely noisy full models in single particle analysis ⋮ Regularization methods in dynamic MRI ⋮ Regularization tools: A Matlab package for analysis and solution of discrete ill-posed problems

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• SIRT- and CG-type methods for the iterative solution of sparse linear least-squares problems
• Transient transport across the blood-retina barrier
• Computation of the singular value expansion
• The truncated SVD as a method for regularization
• On the solution of singular linear systems of algebraic equations by semiiterative methods
• A bidiagonalization algorithm for solving large and sparse ill-posed systems of linear equations
• Numerical iterative filters applied to first kind Fredholm integral equations
• Regularization, GSVD and truncated GSVD
• A weighted pseudoinverse, generalized singular values, and constrained least squares problems
• Pitfalls in the Numerical Solution of Linear Ill-Posed Problems
• An Algorithm for the Regularization of Ill-Conditioned, Banded Least Squares Problems
• Perturbation bounds for discrete Tikhonov regularisation
• Truncated Singular Value Decomposition Solutions to Discrete Ill-Posed Problems with Ill-Determined Numerical Rank
• Confidence Intervals for Inequality-Constrained Least Squares Problems, with Applications to Ill-Posed Problems
• A Technique for the Numerical Solution of Certain Integral Equations of the First Kind
• Generalized Cross-Validation as a Method for Choosing a Good Ridge Parameter
• A Bidiagonalization-Regularization Procedure for Large Scale Discretizations of Ill-Posed Problems
• Towards a Generalized Singular Value Decomposition
• Generalizing the Singular Value Decomposition
• Algorithms for the regularization of ill-conditioned least squares problems
• A Practical Examination of Some Numerical Methods for Linear Discrete Ill-Posed Problems
• Integral equations of immunology

This page was built for publication: The discrete Picard condition for discrete ill-posed problems