Displaying 261 – 280 of 372

Showing per page

Rational interpolants with preassigned poles, theoretical aspects

Amiran Ambroladze, Hans Wallin (1999)

Studia Mathematica

Let ⨍ be an analytic function on a compact subset K of the complex plane ℂ, and let r n ( z ) denote the rational function of degree n with poles at the points b n i i = 1 n and interpolating ⨍ at the points a n i i = 0 n . We investigate how these points should be chosen to guarantee the convergence of r n to ⨍ as n → ∞ for all functions ⨍ analytic on K. When K has no “holes” (see [8] and [3]), it is possible to choose the poles b n i i , n without limit points on K. In this paper we study the case of general compact sets K, when such a separation...

Sharp summability for Monge transport density via interpolation

Luigi De Pascale, Aldo Pratelli (2004)

ESAIM: Control, Optimisation and Calculus of Variations

Using some results proved in De Pascale and Pratelli [Calc. Var. Partial Differ. Equ. 14 (2002) 249-274] (and De Pascale et al. [Bull. London Math. Soc. 36 (2004) 383-395]) and a suitable interpolation technique, we show that the transport density relative to an L p source is also an L p function for any 1 p + .

Sharp summability for Monge Transport density via Interpolation

Luigi De Pascale, Aldo Pratelli (2010)

ESAIM: Control, Optimisation and Calculus of Variations

Using some results proved in De Pascale and Pratelli [Calc. Var. Partial Differ. Equ.14 (2002) 249-274] (and De Pascale et al. [Bull. London Math. Soc.36 (2004) 383-395]) and a suitable interpolation technique, we show that the transport density relative to an Lp source is also an Lp function for any 1 p + .

Smooth approximation of data with applications to interpolating and smoothing

Segeth, Karel (2013)

Programs and Algorithms of Numerical Mathematics

In the paper, we are concerned with some computational aspects of smooth approximation of data. This approach to approximation employs a (possibly infinite) linear combinations of smooth functions with coefficients obtained as the solution of a variational problem, where constraints represent the conditions of interpolating or smoothing. Some 1D numerical examples are presented.

Smooth approximation spaces based on a periodic system

Segeth, Karel (2015)

Programs and Algorithms of Numerical Mathematics

A way of data approximation called smooth was introduced by Talmi and Gilat in 1977. Such an approach employs a (possibly infinite) linear combination of smooth basis functions with coefficients obtained as the unique solution of a minimization problem. While the minimization guarantees the smoothness of the approximant and its derivatives, the constraints represent the interpolating or smoothing conditions at nodes. In the contribution, a special attention is paid to the periodic basis system exp ( - k x ) ....

Sobolev Type Decomposition of Paley-Wiener-Schwartz Space with Application to Sampling Theory

Dryanov, Dimiter (2007)

Serdica Mathematical Journal

2000 Mathematics Subject Classification: 94A12, 94A20, 30D20, 41A05.We characterize Paley-Wiener-Schwartz space of entire functions as a union of three-parametric linear normed subspaces determined by the type of the entire functions, their polynomial asymptotic on the real line, and the index p ≥ 1 of a Sobolev type Lp-summability on the real line with an appropriate weight function. An entire function belonging to a sub-space of the decomposition is exactly recovered by a sampling series, locally...

Currently displaying 261 – 280 of 372