scispace - formally typeset
Journal ArticleDOI

The Numerical Evaluation of a Spline from its B-Spline Representation

Maurice G Cox
- 01 Mar 1978 - 
- Vol. 21, Iss: 2, pp 135-143
About
This article is published in Ima Journal of Applied Mathematics.The article was published on 1978-03-01. It has received 23 citations till now. The article focuses on the topics: Hermite spline & Smoothing spline.

read more

Citations
More filters
Book

Approximation theory and methods

TL;DR: This paper focuses on the approximation problem and existence of best approximations, and on the theory of minimax approximation, which is a very simple and straightforward way of approximating some approximating functions.
Book ChapterDOI

Practical spline approximation

TL;DR: This two-part paper describes the use of polynomial spline functions for purposes of interpolation and approximation and discusses strategies for selecting particular solutions to spline approximation problems having nonunique solutions and techniques for automatic knot placement.
Journal ArticleDOI

Smoothing and Differentiation of Spectroscopic Curves Using Spline Functions

TL;DR: In this article, the use of B-splines for smoothing and differentiation of spectroscopic curves has been investigated, and various schemes for automatic selection of knots used in fitting experimental curves have been investigated and some schemes have been applied to data obtained by Raman spectroscopy.

Software Support for Metrology Best Practice Guide No. 4. Discrete modelling and experimental data analysis.

TL;DR: This Best Practice Guide for discrete modelling covers all the main stages in experimental data analysis: construction of candidate models, model parametrization, error structure in the data, uncertainty of measurements, choice of parameter estimation algorithms and their implementation in software, with the concepts illustrated by case studies.
Dissertation

Efficient algorithms for arbitrary sample rate conversion with application to wave field synthesis

TL;DR: Improvements proposed in this thesis are not limited to WFS, but applicable to general-purpose ASRC problems, and enables the selection of ASRC algorithms that meet the requirements of an application with minimal complexity.
Related Papers (5)