What is the complexity of ill-posed problems?

DOI10.1080/01630568708816268zbMATH Open0621.65051OpenAlexW1975181159MaRDI QIDQ3757277FDOQ3757277

A. G. Werschulz

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

Recommendations

• On the average case solvability of ill-posed problems
• Linear ill-posed problems are solvable on the average for all Gaussian measures
• An information-based approach to ill-posed problems
• Complexity of linear ill-posed problems in Hilbert space
• scientific article; zbMATH DE number 4162161

zbMATH Keywords

computational complexityoptimal algorithmsworst-caseaverage-caseoptimal informationfinite errorill-posed linear problemsFredholm problem of the first kind

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Numerical methods for integral equations (65R20) Equations and inequalities involving linear operators, with vector unknowns (47A50) Fredholm integral equations (45B05) Numerical solutions to equations with linear operators (65J10)

Cites Work

• Average case optimal algorithms in Hilbert spaces
• Title not available (Why is that?)
• Can adaption help on the average?
• Average case optimality
• Noncomputability in analysis and physics: A complete determination of the class of noncomputable linear operators
• How powerful is continuous nonlinear information for linear problems?

Cited In (14)

• On optimization of projection methods for solving some classes of severely ill-posed problems
• epsilon -entropy and epsilon -capacity in the theory of ill-posed problems
• Are linear algorithms always good for linear problems?
• Computability of Solutions of Operator Equations
• On the average case solvability of ill-posed problems
• Title not available (Why is that?)
• Complexity of linear ill-posed problems in Hilbert space
• Linear ill-posed problems are solvable on the average for all Gaussian measures
• What is the complexity of elliptic systems?
• An information-based approach to ill-posed problems
• Average approximations and moments of measures
• Are unbounded linear operators computable on the average for Gaussian measures?
• Hyperbolic cross and the complexity of various classes of ill-posed linear problems
• Optimal residual algorithms for linear operator equations

This page was built for publication: What is the complexity of ill-posed problems?

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3757277)