Article
Publicly Available
Frontmatter
Published/Copyright:
September 1, 2023
Published Online: 2023-09-01
Published in Print: 2023-09-01
© 2023 Walter de Gruyter GmbH, Berlin/Boston
Articles in the same Issue
- Frontmatter
- Pass-efficient randomized LU algorithms for computing low-rank matrix approximation
- Convergence of Langevin-simulated annealing algorithms with multiplicative noise II: Total variation
- Total variation bound for Milstein scheme without iterated integrals
- Bootstrap choice of non-nested autoregressive model with non-normal innovations
- Computation of the steady-state probability of Markov chain evolving on a mixed state space
Articles in the same Issue
- Frontmatter
- Pass-efficient randomized LU algorithms for computing low-rank matrix approximation
- Convergence of Langevin-simulated annealing algorithms with multiplicative noise II: Total variation
- Total variation bound for Milstein scheme without iterated integrals
- Bootstrap choice of non-nested autoregressive model with non-normal innovations
- Computation of the steady-state probability of Markov chain evolving on a mixed state space
