The discrete Picard condition for discrete ill-posed problems
From MaRDI portal
Publication:757000
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 of the first kind Fredholm equations. Essentially, the condition is that the Fourier coefficients of the right hand side, in terms of the generalized singular value decomposition associated with a regularized problem, decay to zero faster on average than the generalized singular values. The author proposes a numerical check of the satisfaction of the discrete Picard condition based on a moving geometric mean of the Fourier coefficients of the right hand side. Some numerical illustrations of the ideas as applied to Fredholm integral equations of the first kind are proved.
Recommendations
- Numerical tools for analysis and solution of Fredholm integral equations of the first kind
- Analysis of Discrete Ill-Posed Problems by Means of the L-Curve
- What are the proper condition numbers of discretized ill-posed problems?
- Truncated Singular Value Decomposition Solutions to Discrete Ill-Posed Problems with Ill-Determined Numerical Rank
- Regularization tools: A Matlab package for analysis and solution of discrete ill-posed problems
Cites work
- A bidiagonalization algorithm for solving large and sparse ill-posed systems of linear equations
- A Bidiagonalization-Regularization Procedure for Large Scale Discretizations of Ill-Posed Problems
- A Practical Examination of Some Numerical Methods for Linear Discrete Ill-Posed Problems
- A Technique for the Numerical Solution of Certain Integral Equations of the First Kind
- A weighted pseudoinverse, generalized singular values, and constrained least squares problems
- Algorithms for the regularization of ill-conditioned least squares problems
- An Algorithm for the Regularization of Ill-Conditioned, Banded Least Squares Problems
- Computation of the singular value expansion
- Confidence Intervals for Inequality-Constrained Least Squares Problems, with Applications to Ill-Posed Problems
- Generalized Cross-Validation as a Method for Choosing a Good Ridge Parameter
- Generalizing the Singular Value Decomposition
- scientific article; zbMATH DE number 3868512 (Why is no real title available?)
- scientific article; zbMATH DE number 3978335 (Why is no real title available?)
- scientific article; zbMATH DE number 4001918 (Why is no real title available?)
- scientific article; zbMATH DE number 4038559 (Why is no real title available?)
- scientific article; zbMATH DE number 4089995 (Why is no real title available?)
- Integral equations of immunology
- Numerical iterative filters applied to first kind Fredholm integral equations
- On the solution of singular linear systems of algebraic equations by semiiterative methods
- Perturbation bounds for discrete Tikhonov regularisation
- Pitfalls in the Numerical Solution of Linear Ill-Posed Problems
- Regularization, GSVD and truncated GSVD
- SIRT- and CG-type methods for the iterative solution of sparse linear least-squares problems
- The truncated SVD as a method for regularization
- Towards a Generalized Singular Value Decomposition
- Transient transport across the blood-retina barrier
- Truncated Singular Value Decomposition Solutions to Discrete Ill-Posed Problems with Ill-Determined Numerical Rank
Cited in
(43)- Accelerated Landweber iterations for the solution of ill-posed equations
- Regularization tools: A Matlab package for analysis and solution of discrete ill-posed problems
- Polynomial basis conversion made stable by truncated singular value decomposition
- Tikhonov regularisation in standard form for polynomial basis conversion
- Method of fundamental solutions and high order algorithm to solve nonlinear elastic problems
- Some notes about the continuous-in-time financial model
- Regularization, GSVD and truncated GSVD
- Regularization methods in dynamic MRI
- Condition estimation for regression and feature selection
- Unbiased predictive risk estimation of the Tikhonov regularization parameter: convergence with increasing rank approximations of the singular value decomposition
- Iterative hybrid regularization for extremely noisy full models in single particle analysis
- Stably numerical solving inverse boundary value problem for data assimilation
- New model function methods for determining regularization parameters in linear inverse problems
- Space-dependent source determination in a time-fractional diffusion equation using a local discontinuous Galerkin method
- Stabilization of generalized empirical interpolation method (GEIM) in presence of noise: a novel approach based on Tikhonov regularization
- Tikhonov regularization and randomized GSVD
- A stopping criterion for iterative regularization methods
- Embedded techniques for choosing the parameter in Tikhonov regularization.
- scientific article; zbMATH DE number 1810107 (Why is no real title available?)
- Inheritance of the discrete Picard condition in Krylov subspace methods
- Near-optimal spectral filtering and error estimation for solving ill-posed problems
- Minimax entropy solutions of ill-posed problems
- A GCV based Arnoldi-Tikhonov regularization method
- Imaging algorithm for synthetic aperture interferometric radiometer in near field
- 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)
- Preconditioned RRGMRES for discrete ill-posed problems
- Estimation of the regularization parameter in linear discrete ill-posed problems using the Picard parameter
- A convergence result for some Krylov-Tikhonov methods in Hilbert spaces
- The low rank approximations and Ritz values in LSQR for linear discrete ill-posed problem
- Fixing nonconvergence of algebraic iterative reconstruction with an unmatched backprojector
- Extension of GKB-FP algorithm to large-scale general-form Tikhonov regularization.
- An iterative algorithm for large size least-squares constrained regularization problems
- A descent method for regularization of ill-posed problems
- Krylov methods for inverse problems: Surveying classical, and introducing new, algorithmic approaches
- Ill-posedness determination of moving force identification and parameters selection for regularization methods
- The Steklov-Poincaré technique for data completion: preconditioning and filtering
- Numerical properties of solutions of LASSO regression
- Subspace projection regularization for large-scale Bayesian linear inverse problems
- Deep-QLP and spline based quadrature rules for Fredholm integral equations of the first kind
- Automatic stopping rule for iterative methods in discrete ill-posed problems
- Regularization properties of Krylov iterative solvers CGME and LSMR for linear discrete ill-posed problems with an application to truncated randomized SVDs
- Effective condition number of the Hermite finite element methods for biharmonic equations
This page was built for publication: The discrete Picard condition for discrete ill-posed problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q757000)
