نتایج جستجو برای: ortogonal zero interpolant

تعداد نتایج: 150042  

2012
Lluís Ferrer-Arnau Ramón Reig-Bolaño Pere Marti-Puig Amàlia Manjabacas Vicenç Parisi-Baradad

Classical Cubic spline interpolation needs to solve a set of equations of high dimension. In this work we show how to compute the interpolant using a FIR digital filter, with a reduced number of operations per interpolated point and high accuracy. Additionally, the computation can be made on real time as the signal samples are acquired. Following this approach, we show how to obtain easily the ...

Journal: :Discrete Applied Mathematics 1999
Lee Gross Gerald E. Farin

Sibson’s interpolant uses Voronoi diagrams in the plane to interpolate a set of scattered data points. This paper presents an extension of this method to handle the interpolation of a set of functional curves (transfinite surface interpolation). We derive a simple formula for this new surface type which can interpolate to any number of boundary curves. In addition, a unique surface may be creat...

Journal: :Energies 2022

Smart water flooding (SWF) is a promising enhanced oil recovery (EOR) technique due to its economic advantages. For this process, wettability alteration the most accepted controlling effect that leads increased factors (RFs). The main objective of work investigate how relative permeability curves’ interpolant affects SWF mechanisms’ assessment. Wettability described by shifting these curves in ...

A. Lamnii H. Mraoui

In this paper, we propose to extend the hierarchical bivariateHermite Interpolant to the spherical case. Let $T$ be an arbitraryspherical triangle of the unit sphere $S$ and  let $u$ be a functiondefined over the triangle $T$. For $kin mathbb{N}$, we consider aHermite spherical Interpolant problem $H_k$ defined by some datascheme $mathcal{D}_k(u)$ and which admits a unique solution $p_k$in the ...

1999
N. K. LEUNG R. J. RENKA

We describe a detailed computational procedure which, given data values at arbitrarily distributed points in the plane, determines if the data are convex and, if so, constructs a smooth convex surface that interpolates the data. The method consists of constructing a triangulation of the nodes (data abscissae) for which the triangle-based piecewise linear interpolant is convex, computing a set o...

Journal: :Numerische Mathematik 2009
Jean-Paul Berrut

In former articles we have given a formula for the error committed when interpolating a several times differentiable function by the sinc interpolant on a fixed finite interval. In the present workwe demonstrate the relevance of the formula through several applications: correction of the interpolant through the insertion of derivatives to increase its order of convergence, improvement of the ba...

Journal: :CoRR 2009
Pierre Hyvernat

This short note contains random thoughts about a factorization theorem for closure/interior operators on a powerset which is reminiscent to the notion of resolution for a monad/comonad. The question originated from formal topology but is interesting in itself. The result holds constructively (even if it classically has several variations); but usually not predicatively (in the sense that the in...

Journal: :Tecnología en Marcha 2021

La presente investigación bibliográfica recopila los conceptos básicos de la tecnología modulación en el Espacio Tiempo-Frecuencia Ortogonal (OTFS), que será utilizada para comunicación móvil quinta generación (5G), cual presenta ventajas inherentes frente a Multiplexación por División Frecuencia (OFDM) cuarta (4G). Entre ellas podemos destacar su capacidad transformar un canal se desvanece ale...

2007
L. Bos S. Waldron

For n + 1 points in IR, in general position, the Kergin polynomial interpolant of C functions may be extended to an interpolant of C functions. This results in an explicit set of reduced Kergin functionals naturally stratified by their dependence on certain directional derivatives of order k, 0 ≤ k ≤ d − 1. We show that the polynomials dual to the functionals depending on derivatives of order k...

Journal: :Bit Numerical Mathematics 2023

The theme of the present paper is numerical integration $C^r$ functions using randomized methods. We consider variance reduction methods that consist in two steps. First initial interval partitioned into subintervals and integrand approximated by a piecewise polynomial interpolant based on obtained partition. Then approximation applied difference its interpolant. final integral sum both. optima...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید