The minimal radius of Galerkin information for the problem of numerical differentiation

DOI10.1016/J.JCO.2023.101787OpenAlexW4385566795MaRDI QIDQ6154548FDOQ6154548

Authors: S. G. Solodkij, S. A. Stasyuk 

Publication date: 15 February 2024

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

Full work available at URL: https://doi.org/10.1016/j.jco.2023.101787

Recommendations

• Optimization of the methods of numerical differentiation for bivariate functions
• Application of Fourier truncation method to numerical differentiation for bivariate functions
• Galerkin method with trigonometric basis on stable numerical differentiation
• scientific article; zbMATH DE number 3921804
• Truncation method in problems of numerical summation and differentiation

zbMATH Keywords

numerical differentiationhyperbolic crosstruncation methodinformation complexitynumerical summationminimal radius of Galerkin information

Mathematics Subject Classification ID

Fourier series in special orthogonal functions (Legendre polynomials, Walsh functions, etc.) (42C10) Numerical solutions of ill-posed problems in abstract spaces; regularization (65J20) Numerical differentiation (65D25)

Cites Work

• Multivariate approximation
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Optimal approximation of multivariate periodic Sobolev functions in the sup-norm
• Title not available (Why is that?)
• Title not available (Why is that?)
• A scheme for stable numerical differentiation
• Optimization of projection methods for solving ill-posed problems
• Inverse Problems Light: Numerical Differentiation
• Fourier truncation method for high order numerical derivatives
• The minimal radius of Galerkin information for severely ill-posed problems
• Title not available (Why is that?)
• Optimal order of accuracy in Vasin's method for differentiation of noisy functions
• Numerical differentiation for the second order derivatives of functions of two variables
• On numerical differentiation
• A truncated Legendre spectral method for solving numerical differentiation
• Stable summation of orthogonal series with noisy coefficients.
• Application of Fourier truncation method to numerical differentiation for bivariate functions
• Estimates of efficiency for two methods of stable numerical summation of smooth functions
• Hyperbolic cross and the complexity of various classes of ill-posed linear problems
• Summation of smooth functions of two variables with perturbed Fourier coefficients
• The minimal radius of Galerkin information for the Fredholm problem of the first kind
• Legendre polynomials as a recommended basis for numerical differentiation in the presence of stochastic white noise
• Title not available (Why is that?)

This page was built for publication: The minimal radius of Galerkin information for the problem of numerical differentiation

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