Column reduced digital nets

DOI10.1007/S11075-025-02050-8MaRDI QIDQ6848777zbMATH OpenFDO

Authors Vishnupriya Anupindi, Peter Kritzer

Publication date 5 March 2026

Published in Numerical Algorithms (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1007/S11075-025-02050-8

zbMATH Keywords

digital netdigital sequencenumerical integrationreduced digital net

Mathematics Subject Classification ID

Numerical integration (65D30)

Cites work

• A construction of \((t,s)\)-sequences with finite-row generating matrices using global function fields
• A reduced fast component-by-component construction of lattice points for integration in weighted spaces with fast decreasing weights
• Fast QMC matrix-vector multiplication
• High-dimensional integration: The quasi-Monte Carlo way
• scientific article; zbMATH DE number 5797591 (Why is no real title available?)
• scientific article; zbMATH DE number 53679 (Why is no real title available?)
• Lattice Rules
• Low-discrepancy point sets obtained by digital constructions over finite fields
• New star discrepancy bounds for \((t,m,s)\)-nets and \((t,s)\)-sequences
• On the discrepancy of generalized Niederreiter sequences
• The fast reduced QMC matrix-vector product
• Tractability properties of the weighted star discrepancy of regular grids
• When are quasi-Monte Carlo algorithms efficient for high dimensional integrals?

This page was built for publication: Column reduced digital nets

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6848777)