EuDML | Browse

Items

All a b c d e f g h i j k l m n o p q r s t u v w x y z Other

Previous Page 5 Next

Displaying 81 – 100 of 372

Discrete quadratic splines.

Rana, Surendra Singh (1990)

International Journal of Mathematics and Mathematical Sciences

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...

Divergenzverhalten mehrdimensionaler Shannonscher Abtastreihen.

Holger Boche (1998)

Manuscripta mathematica

Divided differences.

de Boor, Carl (2005)

Surveys in Approximation Theory (SAT)[electronic only]

Duffin-Schaeffer type inequalities.

Popa, Ioan (2007)

General Mathematics

Eberlein integral and polynomial interpolation

Raj Kishor Singh (1971)

Czechoslovak Mathematical Journal

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...