Results 111 to 120 of about 951 (142)

Uniform Lebesgue Constants of Local Spline Approximation

Proceedings of the Steklov Institute of Mathematics, 2018
The new splines with equidistant knots were proposed in a previous article of the author of this article. The splines define a linear (noninterpolation) method \(S\) of approximation of functions on the real line or on its interval. The uniform Lebesgue constants (the norms of linear operators from \(C\) to \(C\)) of these splines are studied in this ...
openaire   +2 more sources

Lebesgue Constants for Some Interpolating L-Splines

Proceedings of the Steklov Institute of Mathematics, 2018
The author considers interpolating splines that are bounded on the real axis, have equidistant knots, and correspond to linear differential operators of the form \(\mathcal{L}_3 := D(D^2+\alpha^2)\), where \(\alpha > 0\). Exact values for the uniform Lebesgue constant of such splines are found and compared to the Lebesgue constants of other \(\mathcal ...
openaire   +2 more sources

The Lebesgue Constant for Sinc Approximations

2014
Let Λ n denote the Lebesgue constant for Sinc approximation using n consecutive terms of the Sinc expansion of a function f. In this contribution we derive explicit values of a and b and the expression \(\varLambda_{n} = a\,\log (n) + b + \mathcal{O}(1/n^{2})\).
Frank Stenger, Hany A. M. El-Sharkawy, Gerd Baumann   +2 more
openaire   +1 more source

Parallel State Fusion LSTM-based Early-cycle Stage Lithium-ion Battery RUL Prediction Under Lebesgue Sampling Framework

Reliability Engineering and System Safety, 2023
Guangzheng Lyu, Heng Zhang, Qiang Miao
exaly  

Lebesgue constants in polynomial interpolation

2006
Summary: Lagrange interpolation is a classical method for approximating a continuous function by a polynomial that agrees with the function at a number of chosen points (the 'nodes'). However, the accuracy of the approximation is greatly influenced by the location of these nodes.
openaire   +2 more sources

Neighborhood multi-granulation rough sets-based attribute reduction using Lebesgue and entropy measures in incomplete neighborhood decision systems

Knowledge-Based Systems, 2020
Lin Sun, Lanying Wang, Wei-Ping Ding
exaly  

Optimal Lebesgue constants on the square

2020
Si mostrano le condizioni sufficienti per avere costanti di Lebesgue ottimali (anche pesate) per l'approssimazione polinomiale discreta di una funzione di due variabili, nota su una griglia di zeri di Jacobi. Si considera sia l'interpolazione bivariata di Lagrange che l'approssimazione generalizzata di tipo de la Vallée Poussin, ottenuta mediante una ...
D Occorsio, W Themistoclakis
openaire   +2 more sources

Summability of Fourier transforms on mixed-norm Lebesgue spaces via associated Herz spaces

Analysis and Applications, 2023
Dachun Yang, Wen Yuan
exaly  

Lebesgue Constants Determined by Extremal Sets

1984
Let \( - 1 \leq {\text{x}}_{\text{0}}^{\text{n}} < {\text{x}}_1^{\text{n}} < \ldots < {\text{x}}_{\text{n}}^{\text{n}} < {\text{x}}_{\text{n+ 1}} ^{\text{n}} \leq 1 \) be n + 2 points in the interval I = [−1, 1]. Then $$ {{\rm{X}}_{\rm{n}}} = \left\{ {{\rm{x}}_{\rm{i}}^{\rm{n}}} \right\}_{{\rm{i = 0}}}^{{\rm{n}} + 1} $$ (1.1)
openaire   +1 more source

Lebesgue constants of polyhedra

Mathematical Notes of the Academy of Sciences of the USSR, 1982
openaire   +2 more sources