Gowri Suryanarayana
Katholieke Universiteit Leuven
Network
Latest external collaboration on country level. Dive into details by clicking on the dots.
Publication
Featured researches published by Gowri Suryanarayana.
Journal of Complexity | 2016
Ronald Cools; Frances Y. Kuo; Dirk Nuyens; Gowri Suryanarayana
We develop algorithms for multivariate integration and approximation in the weighted half-period cosine space of smooth non-periodic functions. We use specially constructed tent-transformed rank-1 lattice points as cubature nodes for integration and as sampling points for approximation. For both integration and approximation, we study the connection between the worst-case errors of our algorithms in the cosine space and the worst-case errors of some related algorithms in the well-known weighted Korobov space of smooth periodic functions. By exploiting this connection, we are able to obtain constructive worst-case error bounds with good convergence rates for the cosine space.
Advances in Computational Mathematics | 2016
Dirk Nuyens; Gowri Suryanarayana; Markus Weimar
We study multivariate integration of functions that are invariant under permutations (of subsets) of their arguments. We find an upper bound for the nth minimal worst case error and show that under certain conditions, it can be bounded independent of the number of dimensions. In particular, we study the application of unshifted and randomly shifted rank-1 lattice rules in such a problem setting. We derive conditions under which multivariate integration is polynomially or strongly polynomially tractable with the Monte Carlo rate of convergence 𝓞(n−1/2)
Constructive Approximation | 2017
Dirk Nuyens; Gowri Suryanarayana; Markus Weimar
\mathcal {O}(n^{-1/2})
Stochastic Processes and their Applications | 2014
Albert Ferreiro-Castilla; Andreas E. Kyprianou; Robert Scheichl; Gowri Suryanarayana
. Furthermore, we prove that those tractability results can be achieved with shifted lattice rules and that the shifts are indeed necessary. Finally, we show the existence of rank-1 lattice rules whose worst case error on the permutation- and shift-invariant spaces converge with (almost) optimal rate. That is, we derive error bounds of the form 𝓞(n−λ/2)
Journal of Fourier Analysis and Applications | 2016
Gowri Suryanarayana; Dirk Nuyens; Ronald Cools
\mathcal {O}(n^{-\lambda /2})
Archive | 2014
Dirk Nuyens; Gowri Suryanarayana; Ronald Cools; Frances Y. Kuo
for all 1≤λ<2α, where α denotes the smoothness of the spaces.
arXiv: Numerical Analysis | 2018
Yuya Suzuki; Gowri Suryanarayana; Dirk Nuyens
We study multivariate integration of functions that are invariant under the permutation (of a subset) of their arguments. Recently, in Nuyens et al. (Adv Comput Math 42(1):55–84, 2016), the authors derived an upper estimate for the nth minimal worst case error for such problems and showed that under certain conditions this upper bound only weakly depends on the dimension. We extend these results by proposing two (semi-) explicit construction schemes. We develop a component-by-component algorithm to find the generating vector for a shifted rank-1 lattice rule that obtains a rate of convergence arbitrarily close to
Archive | 2017
Yuya Suzuki; Gowri Suryanarayana; Dirk Nuyens
Archive | 2015
Gowri Suryanarayana; Dirk Nuyens; Ronald Cools
\mathcal {O}(n^{-\alpha })
Archive | 2015
Ronald Cools; Frances Y. Kuo; Dirk Nuyens; Gowri Suryanarayana