On the optimal stability of bases of univariate functions
From MaRDI portal
Publication:1601095
DOI10.1007/s002110100327zbMath1004.65020OpenAlexW1981711750MaRDI QIDQ1601095
Publication date: 17 June 2002
Published in: Numerische Mathematik (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s002110100327
Numerical computation using splines (65D07) Spline approximation (41A15) Algorithms for approximation of functions (65D15)
Related Items
Shape preserving properties of generalized Bernstein operators on extended Chebyshev spaces, Recursive de Casteljau bisection and rounding errors, Tests for the recognition of total positivity, Running error for the evaluation of rational Bézier surfaces, On the accuracy of de Casteljau-type algorithms and Bernstein representations, Running error for the evaluation of rational Bézier surfaces through a robust algorithm, On the evaluation of rational triangular Bézier surfaces and the optimal stability of the basis, Optimal stability of the Lagrange formula and conditioning of the Newton formula, The Bernstein polynomial basis: a centennial retrospective, Unnamed Item, Error analysis of efficient evaluation algorithms for tensor product surfaces, Accurate Computations and Applications of Some Classes of Matrices, A note on the optimal stability of bases of univariate functions, On the generalized Ball bases, Optimal bases for a class of mixed spaces and their associated spline spaces, Bernstein operators for extended Chebyshev systems, A general class of Bernstein-like bases, Bernstein operators for exponential polynomials, Approximating of conic sections by DP curves with endpoint interpolation, Evaluation of the derivative of a polynomial in Bernstein form, Corner cutting systems, Algorithm 960
