Sparse polynomial prediction
From MaRDI portal
Publication:6080698
Recommendations
- Learning sparse polynomial functions
- Sparse Polynomial Approximation of High-Dimensional Functions
- Sparse hierarchical regression with polynomials
- Sparse generalised polynomials
- Sparse Polynomial Optimization
- Sparse bivariate polynomial factorization
- Sparse Estimation of Polynomial and Rational Dynamical Models
- Sparse polynomial interpolation based on derivatives
Cites work
- A Sparse Grid Stochastic Collocation Method for Partial Differential Equations with Random Input Data
- Abstract tubes, improved inclusion-exclusion identities and inequalities and importance sampling
- Alexander duality in experimental designs
- Algebraic method in experimental design
- Betti numbers and minimal free resolutions for multi-state system reliability bounds
- Computational topology. An introduction
- Fast prediction of deterministic functions using sparse grid experimental designs
- Generalised confounding with Grobner bases
- High dimensional integration of smooth functions over cubes
- High dimensional polynomial interpolation on sparse grids
- scientific article; zbMATH DE number 1560708 (Why is no real title available?)
- scientific article; zbMATH DE number 3321507 (Why is no real title available?)
This page was built for publication: Sparse polynomial prediction
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6080698)