scientific article; zbMATH DE number 4162161

zbMATH Open0707.65035MaRDI QIDQ3489366FDOQ3489366

Thomas I. Seidman

Publication date: 1990

Title of this publication is not available (Why is that?)

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)

Cited In (2)

• Into higher dimensions for nonsmooth dynamical systems
• Complexity of linear ill-posed problems in Hilbert space

   Recommendations

• Title not available (Why is that?) 👍 👎
• Complexity of linear ill-posed problems in Hilbert space 👍 👎
• Ill-posed problems -- or when the inexact is more exact 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• 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? 👍 👎
• Title not available (Why is that?) 👍 👎
• Complexity of projective methods for the solution of ill-posed problems 👍 👎

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)