An algorithm for finding optimal integration lattices of composite order

DOI10.1007/BF01994849zbMath0765.65027MaRDI QIDQ1195922

J. N. Lyness, Tor Sørevik

Publication date: 26 January 1993

Published in: BIT (Search for Journal in Brave)

zbMATH Keywords

algorithmoptimal integration lattices of composite orders

Mathematics Subject Classification ID

Multidimensional problems (41A63) Approximate quadratures (41A55) Numerical quadrature and cubature formulas (65D32)

Related Items (6)

Lattice rules of minimal and maximal rank with good figures of merit ⋮ Generalisations of the compound trapezoidal rule ⋮ Lattice Rules by Component Scaling ⋮ Good low degree rank-1 lattice rules of high dimension ⋮ Five-dimensional $K$-optimal lattice rules ⋮ Multidimensional pseudo-spectral methods on lattice grids

Cites Work

• Unnamed Item
• Unnamed Item
• Tables of good lattices in four and five dimensions
• Lattice methods for multiple integration
• A search program for finding optimal integration lattices
• The number of lattice rules
• Good lattic points, discrepancy, and numerical integration
• Notes on Integration and Integer Sublattices
• The Representation of Lattice Quadrature Rules as Multiple Sums
• Quasi-Monte Carlo methods and pseudo-random numbers

This page was built for publication: An algorithm for finding optimal integration lattices of composite order