Multivariate approximation of functions on irregular domains by weighted least-squares methods

07/29/2019
by   Giovanni Migliorati, et al.
0

We propose and analyse numerical algorithms based on weighted least squares for the approximation of a real-valued function on a general bounded domain Ω⊂R^d. Given any n-dimensional approximation space V_n ⊂ L^2(Ω), the analysis in [4] shows the existence of stable and optimally converging weighted least-squares estimators, using a number of function evaluations m of the order n n. When an L^2(Ω)-orthonormal basis of V_n is available in analytic form, such estimators can be constructed using the algorithms described in [4]. If the basis also has product form, then the algorithms in [4] have computational complexity linear in d and m. In this paper we show that, when Ω is an irregular domain such that the analytic form of an L^2(Ω)-orthonormal basis in not available, stable and quasi-optimally weighted least-squares estimators can still be constructed from V_n, again with m of the order n n, but using a suitable surrogate basis of V_n orthonormal in a discrete sense. The computational cost for the calculation of the surrogate basis depends on the Christoffel function of Ω and V_n. Numerical results validating our analysis are presented.

READ FULL TEXT

page 17

page 18

page 19

research
01/28/2023

Convergence and Near-optimal Sampling for Multivariate Function Approximations in Irregular Domains via Vandermonde with Arnoldi

Vandermonde matrices are usually exponentially ill-conditioned and often...
research
02/28/2022

Stability analysis of RBF-FD and WLS based local strong form meshless methods on scattered nodes

The popularity of local meshless methods in the field of numerical simul...
research
03/26/2019

Simultaneous Approximation of Measurement Values and Derivative Data using Discrete Orthogonal Polynomials

This paper presents a novel method for polynomial approximation (Hermite...
research
04/09/2022

Stability and error guarantees for least squares approximation with noisy samples

Given n samples of a function f : D→ℂ in random points drawn with respec...
research
07/17/2020

Efficient Iterative Solutions to Complex-Valued Nonlinear Least-Squares Problems with Mixed Linear and Antilinear Operators

We consider a setting in which it is desired to find an optimal complex ...
research
08/28/2023

Efficient least squares approximation and collocation methods using radial basis functions

We describe an efficient method for the approximation of functions using...
research
06/15/2022

Neural Control of Discrete Weak Formulations: Galerkin, Least-Squares and Minimal-Residual Methods with Quasi-Optimal Weights

There is tremendous potential in using neural networks to optimize numer...

Please sign up or login with your details

Forgot password? Click here to reset