Algorithm 2. Calculation of a rational function defined by interpolation conditions

S. Paszkowski

Displaying similar documents to “Algorithm 2. Calculation of a rational function defined by interpolation conditions”

A New Algorithm for Osculatory Rational Interpolation.

G. Claessens (1976/1977)

Numerische Mathematik

Similarity:

An Algorithm for Rational Interpolation Similar to the qd-Algorithm.

Luc Wuytack (1972/73)

Numerische Mathematik

Similarity:

A fast algorithm for scalar Nevanlinna-Pick interpolation.

Cetin Kaya Koc, Guanrong Chen (1993)

Numerische Mathematik

Similarity:

Reliable Rational Interpolation.

T.R. Hopkins, P.R. Graves-Morris (1980/81)

Numerische Mathematik

Similarity:

A new formal approach to the rational interpolation problem.

Marc Van Barel, Adhemar Bultheel (1992)

Numerische Mathematik

Similarity:

On the differences of simultaneous rational interpolants

Rene Piedra (1989)

Banach Center Publications

Similarity:

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

Similarity:

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