Pages that link to "Item:Q1078972"
From MaRDI portal
The following pages link to Subdivision algorithms converge quadratically (Q1078972):
Displaying 12 items.
- Computing the range of values of real functions using B-spline form (Q272547) (← links)
- Polytope-based computation of polynomial ranges (Q426184) (← links)
- The Bernstein polynomial basis: a centennial retrospective (Q448993) (← links)
- On Chebyshevian spline subdivision (Q860690) (← links)
- Subdivision methods for solving polynomial equations (Q1006659) (← links)
- Compactly supported fundamental functions for spline interpolation (Q1104033) (← links)
- Algorithms for generating B-nets and graphically displaying spline surfaces on three- and four-directional meshes (Q1183540) (← links)
- Error estimates for approximations from control nets (Q1208494) (← links)
- Convergence of subdivision and degree elevation (Q1895905) (← links)
- Control curves and knot intersection for trigonometric splines (Q1899300) (← links)
- An \(\mathcal{O}(p^3)\) \(hp\)-version FEM in two dimensions: preconditioning and post-processing (Q1988014) (← links)
- Regular algebraic curve segments (III) -- applications in interactive design and data fitting (Q5941138) (← links)
