What is the complexity of ill-posed problems?
From MaRDI portal
Publication:3757277
DOI10.1080/01630568708816268zbMath0621.65051OpenAlexW1975181159MaRDI QIDQ3757277
Publication date: 1987
Published in: Numerical Functional Analysis and Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/01630568708816268
computational complexityoptimal informationworst-caseoptimal algorithmsaverage-casefinite errorill-posed linear problemsFredholm problem of the first kind
Analysis of algorithms and problem complexity (68Q25) Numerical methods for integral equations (65R20) Numerical solutions to equations with linear operators (65J10) Equations and inequalities involving linear operators, with vector unknowns (47A50) Fredholm integral equations (45B05)
Related Items
Are linear algorithms always good for linear problems?, Linear ill-posed problems are solvable on the average for all Gaussian measures, Complexity of linear ill-posed problems in Hilbert space, Optimal residual algorithms for linear operator equations, On the average case solvability of ill-posed problems, Are unbounded linear operators computable on the average for Gaussian measures?, Computability of Solutions of Operator Equations, On optimization of projection methods for solving some classes of severely ill-posed problems, Hyperbolic cross and the complexity of various classes of ill-posed linear problems, Average approximations and moments of measures
Cites Work
