Josef Dick

Orcid: 0000-0003-0142-6022

According to our database1, Josef Dick authored at least 94 papers between 2004 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
An α-Robust and Second-Order Accurate Scheme for a Subdiffusion Equation.
J. Sci. Comput., June, 2024

The fast reduced QMC matrix-vector product.
J. Comput. Appl. Math., April, 2024

Some tractability results for multivariate integration in subspaces of the Wiener algebra.
CoRR, 2024

QMC integration based on arbitrary (t,m,s)-nets yields optimal convergence rates on several scales of function spaces.
CoRR, 2024

Time-fractional diffusion equations with randomness, and efficient numerical estimations of expected values.
CoRR, 2024

A Locking-free modified conforming FEM for planar elasticity.
CoRR, 2024

High-order QMC nonconforming FEMs for nearly incompressible planar stochastic elasticity equations.
CoRR, 2024

An α-robust second-order accurate scheme for a subdiffusion equation.
CoRR, 2024

2023
Sparse grid approximation of the stochastic Landau-Lifshitz-Gilbert equation.
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

Changes of the Editorial Board.
J. Complex., 2022

2021
Toeplitz Monte Carlo.
Stat. Comput., 2021

Weighted integration over a hyperrectangle based on digital nets and sequences.
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

A quasi-Monte Carlo data compression algorithm for machine learning.
J. Complex., 2021

2020
Tractability properties of the discrepancy in Orlicz norms.
J. Complex., 2020

Editorial board announcements.
J. Complex., 2020

Weighted integration over a cube based on digital nets and sequences.
CoRR, 2020

A note on the periodic L<sub>2</sub>-discrepancy of Korobov's p-sets.
CoRR, 2020

Deep Learning Based Unsupervised and Semi-supervised Classification for Keratoconus.
Proceedings of the 2020 International Joint Conference on Neural Networks, 2020

2019
Richardson Extrapolation of Polynomial Lattice Rules.
SIAM J. Numer. Anal., 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

Higher order Quasi-Monte Carlo integration for Bayesian PDE Inversion.
Comput. Math. Appl., 2019

2018
On the Optimal Order of Integration in Hermite Spaces with Finite Smoothness.
SIAM J. Numer. Anal., 2018

Changes of the Editorial Board.
J. Complex., 2018

Digital net properties of a polynomial analogue of Frolov's construction.
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

On a projection-corrected component-by-component construction.
J. Complex., 2016

Lattice based integration algorithms: Kronecker sequences and rank-1 lattices.
CoRR, 2016

2015
Fast QMC Matrix-Vector Multiplication.
SIAM J. Sci. Comput., 2015

Numerical integration in log-Korobov and log-cosine spaces.
Numer. Algorithms, 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

Proof techniques in quasi-Monte Carlo theory.
J. Complex., 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

Lattice rules for nonperiodic smooth integrands.
Numerische Mathematik, 2014

Approximation of analytic functions in Korobov spaces.
J. Complex., 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

Discrepancy Estimates For Acceptance-Rejection Samplers Using Stratified Inputs.
Proceedings of the Monte Carlo and Quasi-Monte Carlo Methods, 2014

Explicit constructions of point sets and sequences with low discrepancy.
Proceedings of the Uniform Distribution and Quasi-Monte Carlo Methods, 2014

Applications of geometric discrepancy in numerical analysis and statistics.
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

High-dimensional integration: The quasi-Monte Carlo way.
Acta Numer., 2013

2012
Random weights, robust lattice rules and the geometry of the cbc<i>r</i>c algorithm.
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

A higher order Blokh-Zyablov propagation rule for higher order nets.
Finite Fields Their Appl., 2012

Point Sets on the Sphere S<sup>2</sup> with Small Spherical Cap Discrepancy.
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

A construction of polynomial lattice rules with small gain coefficients.
Numerische Mathematik, 2011

Exponential convergence and tractability of multivariate integration for Korobov spaces.
Math. Comput., 2011

Construction algorithms for higher order polynomial lattice rules.
J. Complex., 2011

Duality theory and propagation rules for higher order nets.
Discret. Math., 2011

2010
Duality theory and propagation rules for generalized digital nets.
Math. Comput., 2010

2009
A multivariate fast discrete Walsh transform with an application to function interpolation.
Math. Comput., 2009

Duality for digital sequences.
J. Complex., 2009

On the approximation of smooth functions using generalized digital nets.
J. Complex., 2009

2008
Walsh Spaces Containing Smooth Functions and Quasi-Monte Carlo Rules of Arbitrary High Order.
SIAM J. Numer. Anal., 2008

The construction of good extensible rank-1 lattices.
Math. Comput., 2008

On the exact t-value of Niederreiter and Sobol' sequences.
J. Complex., 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

A note on the existence of sequences with small star discrepancy.
J. Complex., 2007

Constructions of general polynomial lattice rules based on the weighted star discrepancy.
Finite Fields Their Appl., 2007

The construction of good extensible Korobov rules.
Computing, 2007

2006
Cyclic Digital Nets, Hyperplane Nets, and Multivariate Integration in Sobolev Spaces.
SIAM J. Numer. Anal., 2006

Good Lattice Rules in Weighted Korobov Spaces with General Weights.
Numerische Mathematik, 2006

A best possible upper bound on the star discrepancy of (t, m, 2)-nets.
Monte Carlo Methods Appl., 2006

A Taylor space for multivariate integration.
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
Construction Algorithms for Digital Nets with Low Weighted Star Discrepancy.
SIAM J. Numer. Anal., 2005

Construction algorithms for polynomial lattice rules for multivariate integration.
Math. Comput., 2005

Diaphony, discrepancy, spectral test and worst-case error.
Math. Comput. Simul., 2005

Multivariate integration in weighted Hilbert spaces based on Walsh functions and weighted Sobolev spaces.
J. Complex., 2005

2004
On Korobov Lattice Rules in Weighted Spaces.
SIAM J. Numer. Anal., 2004

Reducing the construction cost of the component-by-component construction of good lattice rules.
Math. Comput., 2004

Liberating the weights.
J. Complex., 2004

On the convergence rate of the component-by-component construction of good lattice rules.
J. Complex., 2004


  Loading...