Numerical differentiation by a Tikhonov regularization method based on the discrete cosine transform
From MaRDI portal
Publication:2883309
DOI10.1080/00036811.2011.598862zbMath1237.65017WikidataQ58134301 ScholiaQ58134301MaRDI QIDQ2883309
Publication date: 11 May 2012
Published in: Applicable Analysis (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/00036811.2011.598862
Tikhonov regularization; parameter choice rules; Gibbs phenomena; (multidimensional) numerical differentiation
65D25: Numerical differentiation
65J20: Numerical solutions of ill-posed problems in abstract spaces; regularization
Related Items
Numerical differentiation for two-dimensional functions by a Fourier extension method, A Hermite extension method for numerical differentiation, Numerical differentiation by a Fourier extension method with super-order regularization
Cites Work
- Comparing parameter choice methods for regularization of ill-posed problems
- Robust smoothing of gridded data in one and higher dimensions with missing values
- The use of higher order finite difference schemes is not dangerous
- Efficient computation for Whittaker-Henderson smoothing
- Smoothing noisy data with spline functions: Estimating the correct degree of smoothing by the method of generalized cross-validation
- Regularization tools: A Matlab package for analysis and solution of discrete ill-posed problems
- A new approach to numerical differentiation and integration
- Numerical differentiation by radial basis functions approximation
- Numerical differentiation procedures for non-exact data
- On stable numerical differentiation
- Inverse Problems Light: Numerical Differentiation
- Numerical differentiation from a viewpoint of regularization theory
- An a posteriori parameter choice for ordinary and iterated Tikhonov regularization of ill-posed problems leading to optimal convergence rates
- Differentiation of Approximately Specified Functions
- Analysis of Discrete Ill-Posed Problems by Means of the L-Curve
- On the Computation of the Discrete Cosine Transform
- The Discrete Cosine Transform
- The Use of the L-Curve in the Regularization of Discrete Ill-Posed Problems
- Fast computation of a discretized thin-plate smoothing spline for image data
- On the Gibbs Phenomenon and Its Resolution
- Geometry of linear ill-posed problems in variable Hilbert scales
- Reconstruction of numerical derivatives from scattered noisy data
- A numerical differentiation method and its application to reconstruction of discontinuity
- A Regularization Parameter in Discrete Ill-Posed Problems
- A General Heuristic for Choosing the Regularization Parameter in Ill-Posed Problems
- Fourier Series and Numerical Methods for Partial Differential Equations
- Least Squares Methods for Ill-Posed Problems with a Prescribed Bound
- Finding Numerical Derivatives for Unstructured and Noisy Data by Multiscale Kernels