scispace - formally typeset
Journal ArticleDOI

Monotone Piecewise Cubic Interpolation

F. N. Fritsch, +1 more
- 01 Apr 1980 - 
- Vol. 17, Iss: 2, pp 238-246
Reads0
Chats0
TLDR
In this article, a monotone piecewise bicubic interpolation algorithm was proposed for data on a rectangular mesh, where the first partial derivatives and first mixed partial derivatives are determined by the mesh points.
Abstract
In a 1980 paper [SIAM J. Numer. Anal., 17 (1980), pp. 238–246] the authors developed a univariate piecewise cubic interpolation algorithm which produces a monotone interpolant to monotone data. This paper is an extension of those results to monotone $\mathcal{C}^1 $ piecewise bicubic interpolation to data on a rectangular mesh. Such an interpolant is determined by the first partial derivatives and first mixed partial (twist) at the mesh points. Necessary and sufficient conditions on these derivatives are derived such that the resulting bicubic polynomial is monotone on a single rectangular element. These conditions are then simplified to a set of sufficient conditions for monotonicity. The latter are translated to a system of linear inequalities, which form the basis for a monotone piecewise bicubic interpolation algorithm.

read more

Content maybe subject to copyright    Report

Citations
More filters
Journal ArticleDOI

SciPy 1.0--Fundamental Algorithms for Scientific Computing in Python

TL;DR: SciPy as discussed by the authors is an open source scientific computing library for the Python programming language, which includes functionality spanning clustering, Fourier transforms, integration, interpolation, file I/O, linear algebra, image processing, orthogonal distance regression, minimization algorithms, signal processing, sparse matrix handling, computational geometry, and statistics.
Journal ArticleDOI

SciPy 1.0: fundamental algorithms for scientific computing in Python.

TL;DR: SciPy as discussed by the authors is an open-source scientific computing library for the Python programming language, which has become a de facto standard for leveraging scientific algorithms in Python, with over 600 unique code contributors, thousands of dependent packages, over 100,000 dependent repositories and millions of downloads per year.

Approximation scheme with applications to computational fluid-dynamics-- i surface approximations and partial derivative estimates

E.J. Kansa
TL;DR: In this article, the authors presented an enhanced multiquadrics (MQ) scheme for spatial approximations, which is a true scattered data, grid free scheme for representing surfaces and bodies in an arbitrary number of dimensions.
Journal ArticleDOI

Multiquadrics—A scattered data approximation scheme with applications to computational fluid-dynamics—I surface approximations and partial derivative estimates

TL;DR: In this article, the authors presented a powerful, enhanced multiquadrics (MQ) scheme developed for spatial approximations, which is a true scattered data, grid free scheme for representing surfaces and bodies in an arbitrary number of dimensions.
Journal ArticleDOI

A new procedure for gridding elevation and stream line data with automatic removal of spurious pits

TL;DR: In this article, a morphological approach to the interpolation of regular grid digital elevation models (DEMs) from surface specific elevation data points and selected stream lines is described, which has given rise to a computationally efficient interpolation procedure which couples the minimization of a terrain specific roughness penalty with an automatic drainage enforcement algorithm.
References
More filters
Book

A practical guide to splines

Carl de Boor
TL;DR: This book presents those parts of the theory which are especially useful in calculations and stresses the representation of splines as linear combinations of B-splines as well as specific approximation methods, interpolation, smoothing and least-squares approximation, the solution of an ordinary differential equation by collocation, curve fitting, and surface fitting.
Journal ArticleDOI

A New Method of Interpolation and Smooth Curve Fitting Based on Local Procedures

Hiroshi Akima
- 01 Oct 1970 - 
TL;DR: Comparison indicates that the curve obtained by this new method is closer to a manually drawn curve than those drawn by other mathematical methods.
Journal ArticleDOI

Scalar- and planar-valued curve fitting using splines under tension

TL;DR: The spline under tension was introduced by Schweikert in an attempt to imitate cubic splines but avoid the spurious critical points they induce.
Journal ArticleDOI

An Algorithm for Computing a Shape-Preserving Osculatory Quadratic Spline

TL;DR: An algorithm is presented for calculating an osculatory quadratm sphne that preserves the monotonicity and convexity of the data when consmtent with the given derivatives at the data points and a discussion of pathologms that can occur when these algorithms are maplemented.