An efficient discretization scheme for solving ill-posed problems
From MaRDI portal
Publication:819641
DOI10.1016/J.JMAA.2005.06.009zbMATH Open1091.65050OpenAlexW2042566396MaRDI QIDQ819641FDOQ819641
Recommendations
- Approximation of solution components for ill-posed problems by the Tikhonov method with total variation
- A variant of finite-dimensional Tikhonov regularization with a-posteriori parameter choice
- On Morozov's method for Tikhonov regularization as an optimal order yielding algorithm
- Tikhonov regularization with nondifferentiable stabilizing functionals
- Regularization of ill-posed operator equations: an overview
- scientific article; zbMATH DE number 2079588
- Convergence analysis of a regularized degenerate kernel method for Fredholm integral equations of the first kind
- scientific article; zbMATH DE number 4098073
- Optimal order yielding discrepancy principle for simplified regularization in Hilbert scales: finite-dimensional realizations
- scientific article; zbMATH DE number 4086900
Cites Work
- scientific article; zbMATH DE number 3868512 (Why is no real title available?)
- An A Posteriori Parameter Choice for Ordinary and Iterated Tikhonov Regularization of Ill-Posed Problems Leading to Optimal Convergence Rates
- An adaptive discretization for Tikhonov-Phillips regularization with a posteriori parameter selection
- Integral equations of the third kind
- On a generalized arcangeli's method for tikhonov regularization with inexact data
- On the regularization of projection methods for solving ill-posed problems
- Wavelet-Galerkin methods for ill-posed problems
Cited In (24)
- Adaptive scheme of discretization for one semi-iterative method in solving ill-posed problems
- Title not available (Why is no real title available?)
- On the block Lanczos and block Golub–Kahan reduction methods applied to discrete ill‐posed problems
- An efficient discretization scheme for solving nonlinear ill-posed problems
- On adaptive discretization schemes for the solution of ill-posed problems with semiiterative methods
- An efficient discrete Landweber iteration for nonlinear problems
- Schultz matrix iteration based method for stable solution of discrete ill-posed problems
- A modified steepest descent scheme for solving a class of parameter identification problems
- Numerical solution of a linear Fredholm equation of the first kind by a multigrid method
- On the efficient discretization of integral equations of the third kind
- Title not available (Why is no real title available?)
- Title not available (Why is no real title available?)
- An approach to the discretization of ill-posed problems
- An implicit shift bidiagonalization algorithm for ill-posed systems
- Discretization strategy for linear ill-posed problems in variable Hilbert scales
- Title not available (Why is no real title available?)
- The ILU method for finite-element discretizations
- A posteriori parameter choice with an efficient discretization scheme for solving ill-posed problems
- On the efficient method of solving ill-posed problems by adaptive discretization
- Title not available (Why is no real title available?)
- Simplified GSVD computations for the solution of linear discrete ill-posed problems
- A modified convergence analysis for steepest descent scheme for solving nonlinear operator equation
- Discrete Legendre spectral projection-based methods for Tikhonov regularization of first kind Fredholm integral equations
- On the sparse representation of operators for solving ill-posed problems
This page was built for publication: An efficient discretization scheme for solving ill-posed problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q819641)
