scientific article; zbMATH DE number 4162161

MaRDI QIDQ3489366zbMATH OpenFDO

Authors Thomas I. Seidman

Publication date 1990

zbMATH Keywords

computational complexityprior informationill-posed inverse problemsinformation based complexity

Mathematics Subject Classification ID

Complexity and performance of numerical algorithms (65Y20) Analysis of algorithms and problem complexity (68Q25) General theory of numerical analysis in abstract spaces (65J05)

Recommendations

• scientific article; zbMATH DE number 4080059
• Complexity of linear ill-posed problems in Hilbert space
• Ill-posed problems -- or when the inexact is more exact
• Publication:4867018
• Hyperbolic cross and complexity of severely ill-posed problems
• Complexity estimates for severely ill-posed problems under a posteriori selection of regularization parameter
• Ill-Posed Problems: From Linear to Nonlinear and Beyond
• What is the complexity of ill-posed problems?
• On a new class of ill-posed problems
• Complexity of projective methods for the solution of ill-posed problems

Cited in

(3)

• Into higher dimensions for nonsmooth dynamical systems
• What is the complexity of ill-posed problems?
• Complexity of linear ill-posed problems in Hilbert space

This page was built for publication:

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