Bounds on the Lattice Rule Criterion R

1993 ◽  
Vol 61 (204) ◽  
pp. 821
Author(s):  
Stephen Joe
Keyword(s):  
1992 ◽  
Vol 46 (3) ◽  
pp. 479-495 ◽  
Author(s):  
Stephen Joe ◽  
David C. Hunt

A lattice rule is a quadrature rule used for the approximation of integrals over the s-dimensional unit cube. Every lattice rule may be characterised by an integer r called the rank of the rule and a set of r positive integers called the invariants. By exploiting the group-theoretic structure of lattice rules we determine the number of distinct lattice rules having given invariants. Some numerical results supporting the theoretical results are included. These numerical results are obtained by calculating the Smith normal form of certain integer matrices.


Algorithms ◽  
2020 ◽  
Vol 13 (5) ◽  
pp. 110
Author(s):  
Philippe Blondeel ◽  
Pieterjan Robbe ◽  
Cédric Van hoorickx ◽  
Stijn François ◽  
Geert Lombaert ◽  
...  

Civil engineering applications are often characterized by a large uncertainty on the material parameters. Discretization of the underlying equations is typically done by means of the Galerkin Finite Element method. The uncertain material parameter can be expressed as a random field represented by, for example, a Karhunen–Loève expansion. Computation of the stochastic responses, i.e., the expected value and variance of a chosen quantity of interest, remains very costly, even when state-of-the-art Multilevel Monte Carlo (MLMC) is used. A significant cost reduction can be achieved by using a recently developed multilevel method: p-refined Multilevel Quasi-Monte Carlo (p-MLQMC). This method is based on the idea of variance reduction by employing a hierarchical discretization of the problem based on a p-refinement scheme. It is combined with a rank-1 Quasi-Monte Carlo (QMC) lattice rule, which yields faster convergence compared to the use of random Monte Carlo points. In this work, we developed algorithms for the p-MLQMC method for two dimensional problems. The p-MLQMC method is first benchmarked on an academic beam problem. Finally, we use our algorithm for the assessment of the stability of slopes, a problem that arises in geotechnical engineering, and typically suffers from large parameter uncertainty. For both considered problems, we observe a very significant reduction in the amount of computational work with respect to MLMC.


1992 ◽  
Vol 59 (200) ◽  
pp. 557 ◽  
Author(s):  
Stephen Joe ◽  
Ian H. Sloan
Keyword(s):  

1993 ◽  
Vol 61 (204) ◽  
pp. 821-821
Author(s):  
Stephen Joe
Keyword(s):  

2021 ◽  
Author(s):  
Venelin Todorov ◽  
Ivan Dimov ◽  
Stefka Fidanova ◽  
Stoyan Poryazov

2008 ◽  
Vol 24 (2) ◽  
pp. 283-323 ◽  
Author(s):  
Frances Y. Kuo ◽  
Ian H. Sloan ◽  
Henryk Woźniakowski

1992 ◽  
Vol 59 (200) ◽  
pp. 557-557
Author(s):  
Stephen Joe ◽  
Ian H. Sloan
Keyword(s):  

Sign in / Sign up

Export Citation Format

Share Document