Open main menu
Home
Random
Recent changes
Special pages
Community portal
Preferences
About Wikipedia
Disclaimers
Incubator escapee wiki
Search
User menu
Talk
Dark mode
Contributions
Create account
Log in
Editing
List of algorithms
(section)
Warning:
You are not logged in. Your IP address will be publicly visible if you make any edits. If you
log in
or
create an account
, your edits will be attributed to your username, along with other benefits.
Anti-spam check. Do
not
fill this in!
====Interpolation and extrapolation==== {{further|Interpolation|Extrapolation}} * [[Birkhoff interpolation]]: an extension of polynomial interpolation * [[Cubic interpolation]] * [[Hermite interpolation]] * [[Lagrange interpolation]]: interpolation using [[Lagrange polynomial]]s * [[Linear interpolation]]: a method of curve fitting using linear polynomials * [[Monotone cubic interpolation]]: a variant of cubic interpolation that preserves monotonicity of the data set being interpolated. * [[Multivariate interpolation]] ** [[Bicubic interpolation]]: a generalization of [[cubic interpolation]] to two dimensions ** [[Bilinear interpolation]]: an extension of [[linear interpolation]] for interpolating functions of two variables on a regular grid ** [[Lanczos resampling]] ("Lanzosh"): a multivariate interpolation method used to compute new values for any digitally sampled data ** [[Nearest-neighbor interpolation]] ** [[Tricubic interpolation]]: a generalization of [[cubic interpolation]] to three dimensions * [[Pareto interpolation]]: a method of estimating the median and other properties of a population that follows a [[Pareto distribution]]. * [[Polynomial interpolation]] ** [[Neville's algorithm]] * [[Spline interpolation]]: Reduces error with [[Runge's phenomenon]]. ** [[De Boor algorithm]]: [[B-spline]]s ** [[De Casteljau's algorithm]]: [[Bézier curve]]s * [[Trigonometric interpolation]]
Edit summary
(Briefly describe your changes)
By publishing changes, you agree to the
Terms of Use
, and you irrevocably agree to release your contribution under the
CC BY-SA 4.0 License
and the
GFDL
. You agree that a hyperlink or URL is sufficient attribution under the Creative Commons license.
Cancel
Editing help
(opens in new window)