Journal ArticleOPEN ACCESS

Geometric weakly admissible meshes, discrete least squares approximations and approximate Fekete points

  • Bos L
  • Calvi J
  • Levenberg N
  • et al.
Mathematics of Computation (2011) 80(275) 1623-1638
DOI: 10.1090/s0025-5718-2011-02442-7
73Citations
Citations of this article
22Readers
Mendeley users who have this article in their library.

Abstract

Using the concept of Geometric Weakly Admissible Meshes (see §2 below) together with an algorithm based on the classical QR factorization of matrices, we compute efficient points for discrete multivariate least squares approximation and Lagrange interpolation.

Cite

CITATION STYLE

APA

Bos, L., Calvi, J.-P., Levenberg, N., Sommariva, A., & Vianello, M. (2011). Geometric weakly admissible meshes, discrete least squares approximations and approximate Fekete points. Mathematics of Computation, 80(275), 1623–1638. https://doi.org/10.1090/s0025-5718-2011-02442-7

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free