Lattice enumeration via linear programming
From MaRDI portal
Recommendations
Cites work
- Change of variable in spaces of mixed smoothness and numerical integration of multivariate functions on the unit cube
- Convex and Discrete Geometry
- Cubature formulas, discrepancy, and nonlinear approximation
- CVXPY: a Python-embedded modeling language for convex optimization
- Enumeration of the Chebyshev-Frolov lattice points in axis-parallel boxes
- High-dimensional integration: The quasi-Monte Carlo way
- scientific article; zbMATH DE number 2107836 (Why is no real title available?)
- scientific article; zbMATH DE number 914714 (Why is no real title available?)
- Interior-point methods
- Introduction to uncertainty quantification
- Lattice-based integration algorithms: Kronecker sequences and rank-1 lattices
- Numerical performance of optimized Frolov lattices in tensor product reproducing kernel Sobolev spaces
- On ``Upper error bounds for quadrature formulas on function classes by K. K. Frolov
- On generation and enumeration of orthogonal Chebyshev-Frolov lattices
- On the orthogonality of the Chebyshev-Frolov lattice and applications
- Sparse grids
- The role of Frolov's cubature formula for functions with bounded mixed derivative
This page was built for publication: Lattice enumeration via linear programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6191365)