An unconditionally convergent method for computing zeros of splines and polynomials

DOI10.1090/S0025-5718-07-01923-0zbMath1120.41014OpenAlexW1523443491MaRDI QIDQ3426025

Knut M. Mørken, Martin Reimers

Publication date: 7 March 2007

Published in: Mathematics of Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1090/s0025-5718-07-01923-0

Mathematics Subject Classification ID

Numerical computation using splines (65D07) Numerical computation of solutions to single equations (65H05) Spline approximation (41A15)

Related Items (10)

Computing the range of values of real functions using B-spline form ⋮ A rational cubic clipping method for computing real roots of a polynomial ⋮ Revisiting the problem of zeros of univariate scalar Béziers ⋮ Real-time rendering of algebraic B-spline surfaces via Bézier point insertion ⋮ Computing intersections of planar spline curves using knot insertion ⋮ Real root classification of parametric spline functions ⋮ Rational cubic clipping with linear complexity for computing roots of polynomials ⋮ Soil-structure-interaction effects on the flexural vibrations of a cantilever beam ⋮ A multiresolution analysis for tensor-product splines using weighted spline wavelets ⋮ Hybrid second order method for orthogonal projection onto parametric curve in \(n\)-dimensional Euclidean space

Cites Work

• Unnamed Item
• Computing zeroes of spline functions

This page was built for publication: An unconditionally convergent method for computing zeros of splines and polynomials