Josef Dick
Orcid: 0000-0003-0142-6022
According to our database1,
Josef Dick
authored at least 89 papers
between 2004 and 2024.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
Online presence:
-
on zbmath.org
-
on orcid.org
On csauthors.net:
Bibliography
2024
High-order QMC nonconforming FEMs for nearly incompressible planar stochastic elasticity equations.
CoRR, 2024
2023
CoRR, 2023
Quasi-Monte Carlo sparse grid Galerkin finite element methods for linear elasticity equations with uncertainties.
CoRR, 2023
Quasi-Monte Carlo methods for mixture distributions and approximated distributions via piecewise linear interpolation.
CoRR, 2023
2022
Component-by-component construction of randomized rank-1 lattice rules achieving almost the optimal randomized error rate.
Math. Comput., 2022
Extrapolated Polynomial Lattice Rule Integration in Computational Uncertainty Quantification.
SIAM/ASA J. Uncertain. Quantification, 2022
2021
J. Comput. Appl. Math., 2021
Stability of lattice rules and polynomial lattice rules constructed by the component-by-component algorithm.
J. Comput. Appl. Math., 2021
J. Complex., 2021
2020
Proceedings of the 2020 International Joint Conference on Neural Networks, 2020
2019
Improved Efficiency of a Multi-Index FEM for Computational Uncertainty Quantification.
SIAM J. Numer. Anal., 2019
Computationally efficient Bayesian estimation of high-dimensional Archimedean copulas with discrete and mixed margins.
Stat. Comput., 2019
Spectral decomposition of discrepancy kernels on the Euclidean ball, the special orthogonal group, and the Grassmannian manifold.
CoRR, 2019
Comput. Math. Appl., 2019
2018
SIAM J. Numer. Anal., 2018
Finite Fields Their Appl., 2018
2017
A discrepancy bound for deterministic acceptance-rejection samplers beyond N<sup>-1/2</sup> in dimension 1.
Stat. Comput., 2017
Construction of interlaced polynomial lattice rules for infinitely differentiable functions.
Numerische Mathematik, 2017
2016
Multilevel Higher Order QMC Petrov-Galerkin Discretization for Affine Parametric Operator Equations.
SIAM J. Numer. Anal., 2016
Higher Order Quasi-Monte Carlo Integration for Holomorphic, Parametric Operator Equations.
SIAM/ASA J. Uncertain. Quantification, 2016
CoRR, 2016
2015
A reduced fast component-by-component construction of lattice points for integration in weighted spaces with fast decreasing weights.
J. Comput. Appl. Math., 2015
Spatial low-discrepancy sequences, spherical cone discrepancy, and applications in financial modeling.
J. Comput. Appl. Math., 2015
Construction of Interlaced Scrambled Polynomial Lattice Rules of Arbitrary High Order.
Found. Comput. Math., 2015
2014
Higher Order QMC Petrov-Galerkin Discretization for Affine Parametric Operator Equations with Random Field Inputs.
SIAM J. Numer. Anal., 2014
Optimal randomized changing dimension algorithms for infinite-dimensional integration on function spaces with ANOVA-type decomposition.
J. Approx. Theory, 2014
Numerical integration of Hölder continuous, absolutely convergent Fourier, Fourier cosine, and Walsh series.
J. Approx. Theory, 2014
Infinite-Dimensional Integration in Weighted Hilbert Spaces: Anchored Decompositions, Optimal Deterministic Algorithms, and Higher-Order Convergence.
Found. Comput. Math., 2014
The Inverse of the Star-Discrepancy Problem and the Generation of Pseudo-Random Numbers.
Proceedings of the Sequences and Their Applications - SETA 2014, 2014
Proceedings of the Monte Carlo and Quasi-Monte Carlo Methods, 2014
Proceedings of the Uniform Distribution and Quasi-Monte Carlo Methods, 2014
Proceedings of the Applied Algebra and Number Theory, 2014
2013
On the Fast Computation of the Weight Enumerator Polynomial and the t Value of Digital Nets over Finite Abelian Groups.
SIAM J. Discret. Math., 2013
2012
Numerische Mathematik, 2012
Quasi-Monte Carlo rules for numerical integration over the unit sphere \({\mathbb{S}^2}\).
Numerische Mathematik, 2012
Efficient calculation of the worst-case error and (fast) component-by-component construction of higher order polynomial lattice rules.
Numer. Algorithms, 2012
Finite Fields Their Appl., 2012
Discret. Comput. Geom., 2012
2011
Quasi-Monte Carlo Numerical Integration on R<sup>s</sup>: Digital Nets and Worst-Case Error.
SIAM J. Numer. Anal., 2011
Numerische Mathematik, 2011
Exponential convergence and tractability of multivariate integration for Korobov spaces.
Math. Comput., 2011
2010
Math. Comput., 2010
2009
A multivariate fast discrete Walsh transform with an application to function interpolation.
Math. Comput., 2009
J. Complex., 2009
2008
Walsh Spaces Containing Smooth Functions and Quasi-Monte Carlo Rules of Arbitrary High Order.
SIAM J. Numer. Anal., 2008
2007
Explicit Constructions of Quasi-Monte Carlo Rules for the Numerical Integration of High-Dimensional Periodic Functions.
SIAM J. Numer. Anal., 2007
The tent transformation can improve the convergence rate of quasi-Monte Carlo algorithms using digital nets.
Numerische Mathematik, 2007
The construction of extensible polynomial lattice rules with small weighted star discrepancy.
Math. Comput., 2007
Strong tractability of multivariate integration of arbitrary high order using digitally shifted polynomial lattice rules.
J. Complex., 2007
On the existence of higher order polynomial lattices based on a generalized figure of merit.
J. Complex., 2007
Lattice-Nyström method for Fredholm integral equations of the second kind with convolution type kernels.
J. Complex., 2007
Constructions of general polynomial lattice rules based on the weighted star discrepancy.
Finite Fields Their Appl., 2007
2006
Cyclic Digital Nets, Hyperplane Nets, and Multivariate Integration in Sobolev Spaces.
SIAM J. Numer. Anal., 2006
Numerische Mathematik, 2006
Monte Carlo Methods Appl., 2006
On the mean square weighted <i>L<sub>2</sub></i> discrepancy of randomized digital nets in prime base.
J. Complex., 2006
2005
SIAM J. Numer. Anal., 2005
Math. Comput., 2005
Math. Comput. Simul., 2005
Multivariate integration in weighted Hilbert spaces based on Walsh functions and weighted Sobolev spaces.
J. Complex., 2005
2004
Reducing the construction cost of the component-by-component construction of good lattice rules.
Math. Comput., 2004
On the convergence rate of the component-by-component construction of good lattice rules.
J. Complex., 2004