Piecewise polynomial approximation on optimal meshes
From MaRDI portal
Publication:1226236
DOI10.1016/0021-9045(75)90084-2zbMath0327.41007MaRDI QIDQ1226236
D. F. Hale, Hermann G. Burchard
Publication date: 1975
Published in: Journal of Approximation Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0021-9045(75)90084-2
41A10: Approximation by polynomials
41A25: Rate of convergence, degree of approximation
41A15: Spline approximation
Related Items
Unicity in piecewise polynomial 𝐿¹-approximation via an algorithm, Some results in segmented approximation, On the relationship between functions with the same optimal knots in spline and piecewise polynomial approximation, Consistencies and rates of convergence of jump-penalized least squares estimators, Sequential algorithms of optimal order global error for the uniform recovery of functions with monotone (r-1) derivatives, Estimates of the derivatives of rational functions in \(L_ p[-1,1\)], A quantile domain perspective on the relationships between optimal grouping, spacing and stratification problems, Adaptive approximation, On the optimal choice of nodes in the collocation-projection method for solving linear operator equations, On best error bounds for approximation by piecewise polynomial functions, Best approximation by piecewise polynomials with variable knots and degrees, Optimal interval refinement near singularities, On the degree of nonlinear spline approximation in Besov-Sobolev spaces, Further asymptotic properties of best approximation by splines, Spline approximation of random processes and design problems, Quadrature formulae for singular functions, Computing a spline with quasi-optimal nodes, On the Degree of Convergence of Piecewise Polynomial Approximation on Optimal Meshes
Cites Work
