Find link

language:

Find link is a tool written by Edward Betts.

searching for Polynomial interpolation 22 found (74 total)

alternate case: polynomial interpolation

Lebesgue constant (1,604 words) [view diff] exact match in snippet view article find links to article

conclude again that Chebyshev nodes are a very good choice for polynomial interpolation. However, there is an easy (linear) transformation of Chebyshev

Brahmagupta's interpolation formula (785 words) [view diff] exact match in snippet view article find links to article

Brahmagupta's interpolation formula is a second-order polynomial interpolation formula developed by the Indian mathematician and astronomer Brahmagupta

Nonuniform sampling (1,377 words) [view diff] no match in snippet view article find links to article

Nonuniform sampling is a branch of sampling theory involving results related to the Nyquist–Shannon sampling theorem. Nonuniform sampling is based on Lagrange

Remez algorithm (2,584 words) [view diff] exact match in snippet view article find links to article

the initial approximation because of their role in the theory of polynomial interpolation. For the initialization of the optimization problem for function

Trigonometric interpolation (2,490 words) [view diff] exact match in snippet view article find links to article

reduces the problem of trigonometric interpolation to that of polynomial interpolation on the unit circle. Existence and uniqueness for trigonometric

Bulirsch–Stoer algorithm (627 words) [view diff] exact match in snippet view article find links to article

terms in the denominator to account for nearby poles. While a polynomial interpolation or extrapolation only yields good results if the nearest pole is

Sample-rate conversion (984 words) [view diff] exact match in snippet view article find links to article

resampling by using polynomial interpolation. Farrow filter Using Farrow filter on the basis of piecewise cubic polynomial interpolation for digital signal

Stefano De Marchi (564 words) [view diff] exact match in snippet view article find links to article

quasi-optimal interpolation points explicitly known on the square, for polynomial interpolation of total degree. Their name is due to the University of Padua,

SLEPc (421 words) [view diff] exact match in snippet view article find links to article

inverse iteration and successive linear problems. A solver based on polynomial interpolation that relies on PEP solvers. A solver based on rational interpolation

Polynomial identity testing (851 words) [view diff] case mismatch in snippet view article find links to article

Michael F., "Fast Parallel Algorithms for Sparse Multivariate Polynomial Interpolation over Finite Fields", SIAM J. Comput., Vol 19, No.6, pp. 1059-1063

Data synchronization (1,591 words) [view diff] case mismatch in snippet view article find links to article

Starobinski; S. Agarwal. "Fast PDA Synchronization Using Characteristic Polynomial Interpolation" (PDF). IEEE INFOCOM 2002. doi:10.1109/INFCOM.2002.1019402. Y.

Privia (1,318 words) [view diff] case mismatch in snippet view article find links to article

Privia was produced from 2003 to 2006, and utilizes the Zygotech Polynomial Interpolation (ZPI) synthesis sound engine, as used in Casio's numerous former

Gibbs phenomenon (5,592 words) [view diff] exact match in snippet view article find links to article

this is commonly referred to as the Longo phenomenon. In the polynomial interpolation setting, the Gibbs phenomenon can be mitigated using the S-Gibbs

Ravi Agarwal (828 words) [view diff] case mismatch in snippet view article find links to article

1993, p. 312. R.P. Agarwal and P.J.Y. Wong, Error Inequalities in Polynomial Interpolation and Their Applications, Kluwer Academic Publishers, Dordrecht,

Parks–McClellan filter design algorithm (1,798 words) [view diff] exact match in snippet view article find links to article

the extrema are evenly spaced in the pass and stop band. Perform polynomial interpolation and re-estimate positions of the local extrema. Move extrema to

Simpson's rule (4,006 words) [view diff] exact match in snippet view article find links to article

( a + b ) / 2 {\displaystyle m=(a+b)/2} . One can use Lagrange polynomial interpolation to find an expression for this polynomial, P ( x ) = f ( a ) (

Non-uniform discrete Fourier transform (2,442 words) [view diff] exact match in snippet view article find links to article

efficiently, we first determine X ( z ) {\displaystyle X(z)} directly by polynomial interpolation: X ^ [ k ] = X ( z k ) , k = 0 , 1 , . . . , N − 1 {\displaystyle

Secret sharing (3,749 words) [view diff] exact match in snippet view article find links to article

the secret divided by k − 1. This scheme makes use of repeated polynomial interpolation and has potential applications in secure information dispersal

Schönhage–Strassen algorithm (4,601 words) [view diff] exact match in snippet view article find links to article

convolution problem to product problem, through FFT. By finding ifft (polynomial interpolation), for each c k {\displaystyle c_{k}} , one get the desired coefficients

Multiplication algorithm (6,422 words) [view diff] exact match in snippet view article find links to article

convolution problem to product problem, through fft. By finding ifft (polynomial interpolation), for each c k {\displaystyle c_{k}} , one get the desired coefficients

Probabilistic numerics (4,266 words) [view diff] exact match in snippet view article find links to article

numerics can be traced to a discussion of probabilistic approaches to polynomial interpolation by Henri Poincaré in his Calcul des Probabilités. In modern terminology

Reed–Solomon error correction (12,002 words) [view diff] exact match in snippet view article find links to article

Then calculate C(x) = R(x) − E(x) and take the inverse transform (polynomial interpolation) of C(x) to produce c(x). The Singleton bound states that the minimum