Analysis of discrete least squares on multivariate polynomial spaces with evaluations at low-discrepancy point sets
From MaRDI portal
Publication:2349093
DOI10.1016/J.JCO.2015.02.001zbMATH Open1320.62076OpenAlexW2051307541MaRDI QIDQ2349093FDOQ2349093
Authors: Giovanni Migliorati, F. Nobile 
Publication date: 16 June 2015
Published in: Journal of Complexity (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jco.2015.02.001
Recommendations
- Adaptive polynomial approximation by means of random discrete least squares
- Analysis of discrete \(L^2\) projection on polynomial spaces with random evaluations
- Discrete least-squares approximations over optimized downward closed polynomial spaces in arbitrary dimension
- Weighted discrete least-squares polynomial approximation using randomized quadratures
- Multivariate discrete least-squares approximations with a new type of collocation grid
nonparametric regressionerror analysisapproximation theorydiscrete least squaresmultivariate polynomial approximationlow-discrepancy point set
Nonparametric estimation (62G05) Complexity and performance of numerical algorithms (65Y20) Approximation by polynomials (41A10)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Walsh Spaces Containing Smooth Functions and Quasi–Monte Carlo Rules of Arbitrary High Order
- When are quasi-Monte Carlo algorithms efficient for high dimensional integrals?
- Title not available (Why is that?)
- Galerkin Finite Element Approximations of Stochastic Elliptic Partial Differential Equations
- Tractability of multivariate problems. Volume II: Standard information for functionals.
- On the discrepancy of generalized Niederreiter sequences
- On the stability and accuracy of least squares approximations
- Analysis of discrete \(L^2\) projection on polynomial spaces with random evaluations
- Approximation of quantities of interest in stochastic PDEs by the random discrete \(L^2\) projection on polynomial spaces
- Multivariate discrete least-squares approximations with a new type of collocation grid
- High-dimensional integration: The quasi-Monte Carlo way
- Propagation rules for \((u, m, \mathbf{e}, s)\)-nets and \((u, \mathbf{e}, s)\)-sequences
- Point sets and sequences with small discrepancy
- Duality theory and propagation rules for generalized digital nets
- Uncertainty propagation in CFD using polynomial chaos decomposition
- Improvements on the star discrepancy of \((t,s)\)-sequences
- New star discrepancy bounds for \((t,m,s)\)-nets and \((t,s)\)-sequences
- Some applications of multidimensional integration by parts
- Low discrepancy sequences in high dimensions: how well are their projections distributed?
- Finite-order weights imply tractability of multivariate integration
- Multivariate Markov-type and Nikolskii-type inequalities for polynomials associated with downward closed multi-index sets
- Discrete least squares polynomial approximation with random evaluations - application to parametric and stochastic elliptic PDEs
- Equidistribution properties of generalized nets and sequences
- Duality theory and propagation rules for higher order nets
- Über die Diskrepanz mehrdimensionaler Folgen mod 1
- A variant of Atanassov's method for \((t, s)\)-sequences and \((t, \mathbf{e}, s)\)-sequences
- Probabilistic discrepancy bound for Monte Carlo point sets
- Projections of digital nets and sequences
Cited In (21)
- Least squares orthogonal polynomial regression estimation for irregular design
- Analysis of discrete \(L^2\) projection on polynomial spaces with random evaluations
- Towards optimal sampling for learning sparse approximation in high dimensions
- An adaptive least-squares global sensitivity method and application to a plasma-coupled combustion prediction with parametric correlation
- Generalized polynomial chaos-informed efficient stochastic kriging
- Infinite-dimensional \(\ell ^1\) minimization and function approximation from pointwise data
- Weighted discrete least-squares polynomial approximation using randomized quadratures
- Constructing least-squares polynomial approximations
- Discrete least-squares approximations over optimized downward closed polynomial spaces in arbitrary dimension
- Convergence estimates in probability and in expectation for discrete least squares with noisy evaluations at random points
- Multivariate Markov-type and Nikolskii-type inequalities for polynomials associated with downward closed multi-index sets
- Multivariate discrete least-squares approximations with a new type of collocation grid
- On a near optimal sampling strategy for least squares polynomial regression
- Least squares approximation of polynomial chaos expansions with optimized grid points
- Least squares polynomial chaos expansion: a review of sampling strategies
- SDE based regression for linear random PDEs
- Function integration, reconstruction and approximation using rank-\(1\) lattices
- Discrete least squares polynomial approximation with random evaluations - application to parametric and stochastic elliptic PDEs
- Adaptive polynomial approximation by means of random discrete least squares
- An efficient adaptive forward-backward selection method for sparse polynomial chaos expansion
- Nonadaptive quasi-optimal points selection for least squares linear regression
This page was built for publication: Analysis of discrete least squares on multivariate polynomial spaces with evaluations at low-discrepancy point sets
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2349093)
