Results 121 to 130 of about 546 (161)

On a Hermite Interpolation by Polynomials of Two Variables

SIAM Journal on Numerical Analysis, 2002
The authors study Hermite interpolation by polynomials of two variables. They prove the existence of a unique solution -- the so-called poisedness of the problem -- for the case of interpolation points \((x,y)\) placed on different circles centered at the origin equidistantly on each circle.
Bojanov, Borislav, Xu, Yuan
openaire   +2 more sources

Weighted (0;0,2)-interpolation on the roots of Hermite polynomials

Acta Mathematica Hungarica, 1996
The paper is concerned with a weighted \((0; 0,2)\)-interpolation problem. It is shown that for each even natural number \(n\) and arbitrary numbers \((\alpha_{j, n})^n_{j= 1}\), \((\beta_{ j,n })^{n- 1}_{j=1}\), \((\gamma_{ j,n })^{n-1}_{j =1}\), there exists a uniquely determined polynomial \(P_n\) of degree at most \(3n-2\) such that \[ P_n (x_{j,n})
Srivastava, Rekha, Mathur, K. K.
openaire   +1 more source

Interpolation of fuzzy data by Hermite polynomial

International Journal of Computer Mathematics, 2005
We consider the interpolation of fuzzy data by a differentiable fuzzy-valued function. We do it by setting some conditions on the interpolant and its first derivative.
H. Sadeghi Goghary, S. Abbasbandy
openaire   +1 more source

On the computation of Hermite interval interpolating polynomials

Computing, 1977
Two algorithms for the computation of Hermite interval interpolating polynomial have been proposed, one of which is recommended for fast computation and the other for obtaining the most accurate results.
Bhattacharjee, G. P., Majumder, K. L.
openaire   +2 more sources

New algorithm for computing the Hermite interpolation polynomial

Numerical Algorithms, 2017
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Messaoudi, A., Sadaka, R., Sadok, H.
openaire   +2 more sources

Generalized Hermite-Fejér interpolation polynomials

2000
The author gives a survey of generalized Hermite-Fejér interpolation polynomials with emphasis on the Chebyshev nodes. Properties of the generalized processes are compared with those of the Lagrange and Hermite-Fejér methods, and recent results for the Lebesgue constant and Lebesgue function are discussed.
openaire   +1 more source

Sparse Polynomial Hermite Interpolation

Proceedings of the 2022 International Symposium on Symbolic and Algebraic Computation, 2022
openaire   +1 more source

Expansions for the Fundamental Hermite Interpolation Polynomials in Terms of Chebyshev Polynomials

Ukrainian Mathematical Journal, 2001
Summary: We obtain explicit expansions of the fundamental Hermite interpolation polynomials in terms of Chebyshev polynomials in the case where the nodes considered are either zeros of the \((n+1)\)-th degree Chebyshev polynomial or extremum points of the \(n\)-th degree Chebyshev polynomial.
openaire   +3 more sources

A new non‐polynomial univariate interpolation formula of Hermite type

Advances in Computational Mathematics, 1999
The interpolant mentioned in the title represents a real analytic function \(f\) on a subset \(\Omega\) of the real line as a linear combination of certain basis functions \(U_n^k\) with coefficients \(f_n^k \) which are the derivatives \(f_n^k = f^{(k)}(x_n)\) of \(f\) at certain grid points \(x_n\in \Omega\).
openaire   +1 more source

Hermite interpolation polynomials and distributions of ordered data

Statistical Methodology, 2009
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire   +1 more source