Buscar
Mostrando ítems 1-6 de 6
Lower complexity bounds for interpolation algorithms
(Academic Press Inc Elsevier Science, 2011-04)
We introduce and discuss a new computational model for the HermiteLagrange interpolation with nonlinear classes of polynomial interpolants. We distinguish between an interpolation problem and an algorithm that solves it. ...
Finite element methods for the Stokes system based on a Zienkiewicz type N-simplex
(ElsevierAmsterdam, 2014-04-09)
Hermite interpolation is increasingly showing to be a powerful numerical solution tool, as
applied to different kinds of second order boundary value problems. In this work we present
two Hermite finite element methods ...
Lagrange interpolation and entire functions
(Universidad Nacuional de Colombia; Sociedad Colombiana de matemáticas, 1990)
For a function f defined almost everywhere on R. Let {Ln (f)} be the sequence of Lagrange interpolation polynomials that approximates f, where the nodes are taken to be the zeros of a certain sequence of orthogonal ...
Métodos de interpolação polinomial
(Universidade Tecnológica Federal do ParanáCampo MouraoPrograma de Pós-Graduação em Matemática, 2013)
We present some methods of polynomial interpolation among them have, interpolation Lagrange, Newton, Hermite, Reverse, Spline Linear, Quadratic and Cubic Spline Spline using these methods is to determine a single polynomial ...