Lattice enumeration via linear programming

DOI10.1007/s00211-023-01376-6OpenAlexW4389554043MaRDI QIDQ6191365

Moulay Abdellah Chkifa

Publication date: 9 February 2024

Published in: Numerische Mathematik (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00211-023-01376-6

Mathematics Subject Classification ID

Lattices and convex bodies in (n) dimensions (aspects of discrete geometry) (52C07) Linear programming (90C05) Approximate quadratures (41A55) Numerical quadrature and cubature formulas (65D32)

Cites Work

• Unnamed Item
• Unnamed Item
• Lattice-based integration algorithms: Kronecker sequences and rank-1 lattices
• Cubature formulas, discrepancy, and nonlinear approximation
• Interior-point methods
• On the orthogonality of the Chebyshev-Frolov lattice and applications
• Numerical performance of optimized Frolov lattices in tensor product reproducing kernel Sobolev spaces
• On generation and enumeration of orthogonal Chebyshev-Frolov lattices
• Enumeration of the Chebyshev-Frolov lattice points in axis-parallel boxes
• Change of variable in spaces of mixed smoothness and numerical integration of multivariate functions on the unit cube
• The Role of Frolov's Cubature Formula for Functions with Bounded Mixed Derivative
• CVXPY: A Python-Embedded Modeling Language for Convex Optimization
• Introduction to Uncertainty Quantification
• On “Upper Error Bounds for Quadrature Formulas on Function Classes” by K.K. Frolov
• Sparse grids
• Convex and Discrete Geometry
• High-dimensional integration: The quasi-Monte Carlo way

This page was built for publication: Lattice enumeration via linear programming