We discuss and compare two greedy algorithms, that compute discrete versions of Fekete-like points for multivariate compact sets by basic tools of numerical linear algebra. The first gives the so-called ``Approximate Fekete Points'' by QR factorization with column pivoting of Vandermonde-like matrices. The second computes Discrete Leja Points by LU factorization with row pivoting. Moreover, we study the asymptotic distribution of such points when they are extracted from Weakly Admissible Meshes.
Computing Multivariate Fekete and Leja Points by Numerical Linear Algebra
BOS, LEONARD PETER;DE MARCHI, Stefano;
2010-01-01
Abstract
We discuss and compare two greedy algorithms, that compute discrete versions of Fekete-like points for multivariate compact sets by basic tools of numerical linear algebra. The first gives the so-called ``Approximate Fekete Points'' by QR factorization with column pivoting of Vandermonde-like matrices. The second computes Discrete Leja Points by LU factorization with row pivoting. Moreover, we study the asymptotic distribution of such points when they are extracted from Weakly Admissible Meshes.
File in questo prodotto:
Non ci sono file associati a questo prodotto.
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
