Optimal discretization of ill-posed problems
From MaRDI portal
ill-posed problemsInstitute of Mathematics of National Ukrainian Academy of Sciencesoptimal digitization
History of mathematics at institutions and academies (non-university) (01A74) Research exposition (monographs, survey articles) pertaining to numerical analysis (65-02) History of numerical analysis (65-03) Ill-posedness and regularization problems in numerical linear algebra (65F22) Numerical solutions of ill-posed problems in abstract spaces; regularization (65J20)
Cited in
(12)- An approach to the discretization of ill-posed problems
- A parameter choice strategy for a multilevel augmentation method in iterated Lavrentiev regularization
- On the a posteriori choice of a regularization parameter in the solution of severely ill-posed problems
- Old and new parameter choice rules for discrete ill-posed problems
- Application of Fourier truncation method to numerical differentiation for bivariate functions
- Estimates of efficiency for two methods of stable numerical summation of smooth functions
- scientific article; zbMATH DE number 1810107 (Why is no real title available?)
- Discretization strategy for linear ill-posed problems in variable Hilbert scales
- scientific article; zbMATH DE number 2169216 (Why is no real title available?)
- scientific article; zbMATH DE number 5587346 (Why is no real title available?)
- scientific article; zbMATH DE number 5238864 (Why is no real title available?)
- An efficient discretization scheme for solving nonlinear ill-posed problems
This page was built for publication: Optimal discretization of ill-posed problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2740370)
