The minimal radius of Galerkin information for the Fredholm problem of the first kind

DOI10.1006/JCOM.1996.0025zbMATH Open0862.68065OpenAlexW1974681249MaRDI QIDQ2365415FDOQ2365415

Authors: Yanyan Li 

Publication date: 23 March 1997

Published in: Journal of Complexity (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/jcom.1996.0025

Recommendations

• Information complexity of projection algorithms for the solution of Fredholm equations of the first kind. I
• scientific article; zbMATH DE number 1247479
• On the informational and algorithmic complexities of some classes of Fredholm equations of the first kind

zbMATH Keywords

information complexityGalerkin information

Mathematics Subject Classification ID

Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30)

Cited In (10)

• An optimal method for recovering the mixed derivative \(f^{(2,2)}\) of bivariate functions
• On optimization of projection methods for solving some classes of severely ill-posed problems
• The minimal radius of Galerkin information for the problem of numerical differentiation
• The optimal approximations for solving linear ill-posed problems
• The worst case complexity of the fredholm equation of the second kind with non-periodic free term and noise information
• The worst case complexity of the fredholm equation with periodic free term and noisy information^∗
• COMPLEXITY ESTIMATES FOR SEVERELY ILL-POSED PROBLEMS UNDER A POSTERIORI SELECTION OF REGULARIZATION PARAMETER
• An optimal method for high-order mixed derivatives of bivariate functions
• Hyperbolic cross and the complexity of various classes of ill-posed linear problems
• Optimization of the methods of numerical differentiation for bivariate functions

This page was built for publication: The minimal radius of Galerkin information for the Fredholm problem of the first kind

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