Jump to Content
Your Recent History
View Cart
Logged Out Log In
SIAM J. Numer. Anal. 48, pp. 1984-1999 (16 pages)
Computing Multivariate Fekete and Leja Points by Numerical Linear Algebra
Alerts
Alert Me When Cited
Alert Me When Corrected
Tools
Download Citation
Add to MyScitation
Blog This Article
Print-Friendly
Research Toolkit
Share
Email Abstract
Connotea
CiteULike
del.icio.us
BibSonomy
Tweet this Article
Add to FacebookWe 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.
© 2010 Society for Industrial and Applied Mathematics
RELATED DATABASES
To view database links for this article,
you need to log in.
KEYWORDS
PUBLICATION DATA
ARTICLE DATA
History
Received December 03, 2009
Accepted September 08, 2010
Published online November 30, 2010
Accepted September 08, 2010
Published online November 30, 2010
Digital Object Identifier
For access to fully linked references, you need to log in.
For access to citing articles, you need to log in.
ALL SIAM Content
Scitation
Google Scholar