نتایج جستجو برای: polynomial interpolation
تعداد نتایج: 129583 فیلتر نتایج به سال:
Barycentric interpolation is a variant of Lagrange polynomial interpolation that is fast and stable. It deserves to be known as the standard method of polynomial interpolation.
We present a finite difference scheme, applicable to general irregular planar domains, to approximate the biharmonic equation. The irregular domain is embedded in a Cartesian grid. In order to approximate ∆Φ at a grid point we interpolate the data on the (irregular) stencil by a polynomial of degree six. The finite difference scheme is ∆2QΦ(0, 0), where QΦ is the interpolation polynomial. The i...
Background and aim: The concentration of fluoride in drinking water resources is very important in peoples' health issue. One of the main resources of fluoride intake for people is drinking water. Therefore, this study aimed to determine the fluoride concentration in rural drinking water resources of Bardaskan County using geographic information system. Methods: In this descriptive/cross-sec...
The aim of this paper is to study the Lagrange multivariate interpolation problems in the space of polynomials of w-degree n. Some new results concerning the polynomial spaces of w-degree n are given. An algorithm for obtaining the w-minimal interpolation space is presented. Key–Words: Lagrange multivariate polynomial interpolation, whomogeneous polynomial spaces, Generalize degree.
The noisy polynomial interpolation problem is a new in-tractability assumption introduced last year in oblivious polynomial evaluation. It also appeared independently in password identiication schemes, due to its connection with secret sharing schemes based on Lagrange's polynomial interpolation. This paper presents new algorithms to solve the noisy polynomial interpolation problem. In particul...
The noisy polynomial interpolation problem is a new intractability assumption introduced last year in oblivious polynomial evaluation. It also appeared independently in password identification schemes, due to its connection with secret sharing schemes based on Lagrange’s polynomial interpolation. This paper presents new algorithms to solve the noisy polynomial interpolation problem. In particul...
4 Discretization using Polynomial Interpolation Consider a function to be a continuous function defined over and let represent the values of the function at an arbitrary set of points in the domain Another function, say in that assumes values exactly at is called an interpolation function. Most popular form of interpolating functions are polynomials. Polynomial interpolation has many important ...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید