- interpolation algorithm
-
алгоритм интерполяции
English-Russian dictionary of geology. 2011.
English-Russian dictionary of geology. 2011.
Interpolation search — is an algorithm for searching for a given key value in an indexed array that has been ordered by the values of the key. It parallels how humans search through a telephone book for a particular name, the key value by which the book s entries are… … Wikipedia
Interpolation — In the mathematical subfield of numerical analysis, interpolation is a method of constructing new data points within the range of a discrete set of known data points. In engineering and science one often has a number of data points, as obtained… … Wikipedia
Interpolation attack — In cryptography, an interpolation attack is a type of cryptanalytic attack against block ciphers.In the attack, an algebraic function is used to represent an S box. This may be a simple quadratic, or a polynomial or rational function over a… … Wikipedia
Interpolation (computer programming) — In the context of computer animation, interpolation refers to the use of (usually) piecewise polynomial interpolation to draw images semi automatically. For all applications of this type, a set of key points is defined by the graphic artist.… … Wikipedia
Inverse quadratic interpolation — In numerical analysis, inverse quadratic interpolation is a root finding algorithm, meaning that it is an algorithm for solving equations of the form f ( x ) = 0. The idea is to use quadratic interpolation to approximate the inverse of f . This… … Wikipedia
Stairstep interpolation — In image processing, stairstep interpolation is a general method for interpolating the pixels after enlarging an image. The key idea is to interpolate multiple times in small increments using any interpolation algorithm that is better than… … Wikipedia
Root-finding algorithm — A root finding algorithm is a numerical method, or algorithm, for finding a value x such that f(x) = 0, for a given function f. Such an x is called a root of the function f. This article is concerned with finding scalar, real or complex roots,… … Wikipedia
Bicubic interpolation — In mathematics, bicubic interpolation is an extension of cubic interpolation for interpolating data points on a two dimensional regular grid. The interpolated surface is smoother than corresponding surfaces obtained by bilinear interpolation or… … Wikipedia
Remez algorithm — The Remez algorithm (sometimes also called Remes algorithm, Remez/Remes exchange algorithm), published by Evgeny Yakovlevich Remez in 1934 [E. Ya. Remez, Sur la détermination des polynômes d approximation de degré donnée , Comm. Soc. Math.… … Wikipedia
Neville's algorithm — In mathematics, Neville s algorithm is an algorithm used for polynomial interpolation that was derived by the mathematician Eric Harold Neville. Given n + 1 points, there is a unique polynomial of degree ≤ n which goes through the given points.… … Wikipedia
Generalized quaternion interpolation — is an interpolation method used by the slerp algorithm. It is closed form and fixed time, but it cannot be applied to the more general problem of interpolating more than two unit quaternions.Definition of unconstrained interpolationGeneral… … Wikipedia