Geometric weakly admissible meshes, discrete least squares approximations and approximate Fekete points
نویسندگان
چکیده
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.
منابع مشابه
Weakly Admissible Meshes and Discrete Extremal Sets
We present a brief survey on (Weakly) Admissible Meshes and corresponding Discrete Extremal Sets, namely Approximate Fekete Points and Discrete Leja Points. These provide new computational tools for polynomial least squares and interpolation on multidimensional compact sets, with different applications such as numerical cubature, digital filtering, spectral and high-order methods for PDEs.
متن کاملLocating good points for multivariate polynomial approximation
Locating good points for multivariate polynomial approximation, in particular interpolation, is an open challenging problem, even in standard domains. One set of points that is always good, in theory, is the so-called Fekete points. They are defined to be those points that maximize the (absolute value of the) Vandermonde determinant on the given compact set. However, these are known analyticall...
متن کاملPolynomial Meshes: Computation and Approximation
We present the software package WAM, written in Matlab, that generates Weakly Admissible Meshes and Discrete Extremal Sets of Fekete and Leja type, for 2d and 3d polynomial least squares and interpolation on compact sets with various geometries. Possible applications range from data fitting to high-order methods for PDEs.
متن کاملPolynomial approximation and cubature at approximate Fekete and Leja points of the cylinder
The paper deals with polynomial interpolation, least-square approximation and cubature of functions defined on the rectangular cylinder, K = D × [−1, 1], with D the unit disk. The nodes used for these processes are the Approximate Fekete Points (AFP) and the Discrete Leja Points (DLP) extracted from suitable Weakly Admissible Meshes (WAMs) of the cylinder. ¿From the analysis of the growth of th...
متن کاملComputing Multivariate Fekete and Leja Points by Numerical Linear Algebra
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 st...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Math. Comput.
دوره 80 شماره
صفحات -
تاریخ انتشار 2011