A fast algorithm for scalar Nevanlinna-Pick interpolation.
Cetin Kaya Koc, Guanrong Chen (1993)
Numerische Mathematik
Similarity:
Cetin Kaya Koc, Guanrong Chen (1993)
Numerische Mathematik
Similarity:
S. Paszkowski (1969)
Applicationes Mathematicae
Similarity:
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...
Luc Wuytack (1972/73)
Numerische Mathematik
Similarity:
S. Hartman (1968)
Colloquium Mathematicae
Similarity:
R. Taberski (1971)
Colloquium Mathematicae
Similarity:
R. Taberski (1974)
Colloquium Mathematicae
Similarity:
R. Taberski (1972)
Colloquium Mathematicae
Similarity:
Branga, Adrian (1998)
General Mathematics
Similarity:
S. Ugniewski (1977)
Applicationes Mathematicae
Similarity:
Šolín, Pavel, Segeth, Karel
Similarity:
Interpolation on finite elements usually occurs in a Hilbert space setting, which means that interpolation techniques involving orthogonal projection are an alternative for the traditional Lagrange nodal interpolation schemes. In addition to the Lagrange interpolation, this paper discusses the global orthogonal projection and the projection-based interpolation. These techniques are compared from the point of view of quality, efficiency, sensitivity to input parameters and other aspects....
Milman, Mario (1998)
Annales Academiae Scientiarum Fennicae. Mathematica
Similarity:
G. Claessens (1976/1977)
Numerische Mathematik
Similarity: