Displaying 761 – 780 of 2606

Showing per page

Discrete smoothing splines and digital filtration. Theory and applications

Jiří Hřebíček, František Šik, Vítězslav Veselý (1990)

Aplikace matematiky

Two universally applicable smoothing operations adjustable to meet the specific properties of the given smoothing problem are widely used: 1. Smoothing splines and 2. Smoothing digital convolution filters. The first operation is related to the data vector r = ( r 0 , . . . , r n - 1 ) T with respect to the operations 𝒜 , and to the smoothing parameter α . The resulting function is denoted by σ α ( t ) . The measured sample r is defined on an equally spaced mesh Δ = { t i = i h } i = 0 n - 1 ...

Distinguishing and integrating aleatoric and epistemic variation in uncertainty quantification

Kamaljit Chowdhary, Paul Dupuis (2013)

ESAIM: Mathematical Modelling and Numerical Analysis - Modélisation Mathématique et Analyse Numérique

Much of uncertainty quantification to date has focused on determining the effect of variables modeled probabilistically, and with a known distribution, on some physical or engineering system. We develop methods to obtain information on the system when the distributions of some variables are known exactly, others are known only approximately, and perhaps others are not modeled as random variables at all.The main tool used is the duality between risk-sensitive integrals and relative entropy, and we...

Distortion mismatch in the quantization of probability measures

Siegfried Graf, Harald Luschgy, Gilles Pagès (2008)

ESAIM: Probability and Statistics

We elucidate the asymptotics of the Ls-quantization error induced by a sequence of Lr-optimal n-quantizers of a probability distribution P on d when s > r. In particular we show that under natural assumptions, the optimal rate is preserved as long as s < r+d (and for every s in the case of a compactly supported distribution). We derive some applications of these results to the error bounds for quantization based cubature formulae in numerical integration on d and on the Wiener space.

Distribution of nodes on algebraic curves in N

Thomas Bloom, Norman Levenberg (2003)

Annales de l’institut Fourier

Given an irreducible algebraic curves A in N , let m d be the dimension of the complex vector space of all holomorphic polynomials of degree at most d restricted to A . Let K be a nonpolar compact subset of A , and for each d = 1 , 2 , . . . , choose m d points { A d j } j = 1 , . . . , m d in K . Finally, let Λ d be the d -th Lebesgue constant of the array { A d j } ; i.e., Λ d is the operator norm of the Lagrange interpolation operator L d acting on C ( K ) , where L d ( f ) is the Lagrange interpolating polynomial for f of degree d at the points { A d j } j = 1 , . . . , m d . Using techniques of pluripotential...

Duality, reflexivity and atomic decompositions in Banach spaces

Daniel Carando, Silvia Lassalle (2009)

Studia Mathematica

We study atomic decompositions and their relationship with duality and reflexivity of Banach spaces. To this end, we extend the concepts of "shrinking" and "boundedly complete" Schauder basis to the atomic decomposition framework. This allows us to answer a basic duality question: when an atomic decomposition for a Banach space generates, by duality, an atomic decomposition for its dual space. We also characterize the reflexivity of a Banach space in terms of properties of its atomic decompositions....

Efficient greedy algorithms for high-dimensional parameter spaces with applications to empirical interpolation and reduced basis methods

Jan S. Hesthaven, Benjamin Stamm, Shun Zhang (2014)

ESAIM: Mathematical Modelling and Numerical Analysis - Modélisation Mathématique et Analyse Numérique

We propose two new algorithms to improve greedy sampling of high-dimensional functions. While the techniques have a substantial degree of generality, we frame the discussion in the context of methods for empirical interpolation and the development of reduced basis techniques for high-dimensional parametrized functions. The first algorithm, based on a saturation assumption of the error in the greedy algorithm, is shown to result in a significant reduction of the workload over the standard greedy...

Eigenvalues in the large sieve inequality, II

Olivier Ramaré (2010)

Journal de Théorie des Nombres de Bordeaux

We explore numerically the eigenvalues of the hermitian form q Q a mod * q n N ϕ n e ( n a / q ) 2 when N = q Q φ ( q ) . We improve on the existing upper bound, and produce a (conjectural) plot of the asymptotic distribution of its eigenvalues by exploiting fairly extensive computations. The main outcome is that this asymptotic density most probably exists but is not continuous with respect to the Lebesgue measure.

Currently displaying 761 – 780 of 2606