| 2009 |
36 | | Ian H. Sloan,
Robert S. Womersley:
A variational characterisation of spherical designs.
Journal of Approximation Theory 159(2): 308-318 (2009) |
| 2008 |
35 | | Ian H. Sloan,
Alvise Sommariva:
Approximation on the sphere using radial basis functions plus polynomials.
Adv. Comput. Math. 29(2): 147-177 (2008) |
34 | | Frances Y. Kuo,
Ian H. Sloan,
Henryk Wozniakowski:
Lattice rule algorithms for multivariate approximation in the average case setting.
J. Complexity 24(2): 283-323 (2008) |
| 2007 |
33 | | Stephan Dahlke,
Klaus Ritter,
Ian H. Sloan,
Joseph F. Traub:
Algorithms and Complexity for Continuous Problems, 24.09. - 29.09.2006
Internationales Begegnungs- und Forschungszentrum fuer Informatik (IBFI), Schloss Dagstuhl, Germany 2007 |
32 | | Kerstin Hesse,
Frances Y. Kuo,
Ian H. Sloan:
A component-by-component approach to efficient numerical integration over products of spheres.
J. Complexity 23(1): 25-51 (2007) |
31 | | Kerstin Hesse,
H. N. Mhaskar,
Ian H. Sloan:
Quadrature in Besov spaces on the Euclidean sphere.
J. Complexity 23(4-6): 528-552 (2007) |
30 | | Josef Dick,
Peter Kritzer,
Frances Y. Kuo,
Ian H. Sloan:
Lattice-Nyström method for Fredholm integral equations of the second kind with convolution type kernels.
J. Complexity 23(4-6): 752-772 (2007) |
29 | | Frances Y. Kuo,
Ian H. Sloan,
Henryk Wozniakowski:
Periodization strategy may fail in high dimensions.
Numerical Algorithms 46(4): 369-391 (2007) |
| 2006 |
28 | | Stephan Dahlke,
Klaus Ritter,
Ian H. Sloan,
Joseph F. Traub:
06391 Abstracts Collection -- Algorithms and Complexity for Continuous Problems.
Algorithms and Complexity for Continuous Problems 2006 |
27 | | Benjamin J. Waterhouse,
Frances Y. Kuo,
Ian H. Sloan:
Randomly shifted lattice rules on the unit cube for unbounded integrands in high dimensions.
J. Complexity 22(1): 71-101 (2006) |
26 | | Leszek Plaskota,
Ian H. Sloan:
Guest Editors' preface.
J. Complexity 22(5): (2006) |
25 | | Kerstin Hesse,
Ian H. Sloan:
Cubature over the sphere S2 in Sobolev spaces of arbitrary order.
Journal of Approximation Theory 141(2): 118-133 (2006) |
24 | | Xiaoqun Wang,
Ian H. Sloan:
Efficient Weighted Lattice Rules with Applications to Finance.
SIAM J. Scientific Computing 28(2): 728-750 (2006) |
| 2005 |
23 | | Frances Y. Kuo,
Ian H. Sloan:
Quasi-Monte Carlo methods can be efficient for integration over products of spheres.
J. Complexity 21(2): 196-210 (2005) |
22 | | Kerstin Hesse,
Ian H. Sloan:
Optimal lower bounds for cubature error on the sphere S2.
J. Complexity 21(6): 790-803 (2005) |
21 | | R. D. Grigorieff,
Ian H. Sloan:
Discrete orthogonal projections on multiple knot periodic splines.
Journal of Approximation Theory 137(2): 201-225 (2005) |
20 | | Xiaoqun Wang,
Ian H. Sloan:
Why Are High-Dimensional Finance Problems Often of Low Effective Dimension?.
SIAM J. Scientific Computing 27(1): 159-183 (2005) |
| 2004 |
19 | | Ian H. Sloan,
Robert S. Womersley:
Extremal Systems of Points and Numerical Integration on the Sphere.
Adv. Comput. Math. 21(1-2): 107-125 (2004) |
18 | | Erich Novak,
Ian H. Sloan,
Henryk Wozniakowski:
Tractability of Approximation for Weighted Korobov Spaces on Classical and Quantum Computers.
Foundations of Computational Mathematics 4(2): 121-156 (2004) |
17 | | Ian H. Sloan,
Xiaoqun Wang,
Henryk Wozniakowski:
Finite-order weights imply tractability of multivariate integration.
J. Complexity 20(1): 46-74 (2004) |
16 | | Josef Dick,
Ian H. Sloan,
Xiaoqun Wang,
Henryk Wozniakowski:
Liberating the weights.
J. Complexity 20(5): 593-623 (2004) |
15 | | Fred J. Hickernell,
Ian H. Sloan,
Grzegorz W. Wasilkowski:
On tractability of weighted integration over bounded and unbounded regions in Reals.
Math. Comput. 73(248): 1885-1901 (2004) |
14 | | Fred J. Hickernell,
Ian H. Sloan,
Grzegorz W. Wasilkowski:
On strong tractability of weighted multivariate integration.
Math. Comput. 73(248): 1903-1911 (2004) |
| 2002 |
13 | | Ian H. Sloan,
Henryk Wozniakowski:
Tractability of Integration in Non-periodic and Periodic Weighted Tensor Product Hilbert Spaces.
J. Complexity 18(2): 479-499 (2002) |
12 | | Ian H. Sloan,
Andrew V. Reztsov:
Component-by-component construction of good lattice rules.
Math. Comput. 71(237): 263-273 (2002) |
11 | | Ian H. Sloan,
Frances Y. Kuo,
Stephen Joe:
On the step-by-step construction of quasi--Monte Carlo integration rules that achieve strong tractability error bounds in weighted Sobolev spaces.
Math. Comput. 71(240): 1609-1640 (2002) |
| 2001 |
10 | | Robert S. Womersley,
Ian H. Sloan:
How good can polynomial interpolation on the sphere be?
Adv. Comput. Math. 14(3): 195-226 (2001) |
9 | | Ian H. Sloan,
Arthur G. Werschultz:
ANNOUNCEMENT: 2001 Best Paper Award Committee.
J. Complexity 17(3): 495- (2001) |
8 | | Ian H. Sloan,
Henryk Wozniakowski:
Tractability of Multivariate Integration for Weighted Korobov Classes.
J. Complexity 17(4): 697-721 (2001) |
| 2000 |
7 | | Dongwoo Sheen,
Ian H. Sloan,
Vidar Thomée:
A parallel method for time-discretization of parabolic problems based on contour integral representation and quadrature.
Math. Comput. 69(229): 177-195 (2000) |
| 1998 |
6 | | Ian H. Sloan,
Henryk Wozniakowski:
When Are Quasi-Monte Carlo Algorithms Efficient for High Dimensional Integrals?
J. Complexity 14(1): 1-33 (1998) |
| 1997 |
5 | | Y. Jeon,
Ian H. Sloan,
E. P. Stephan,
J. Elschner:
Discrete qualocation methods for logarithmic-kernel integral equations on a piecewise smooth boundary.
Adv. Comput. Math. 7(4): 547-571 (1997) |
4 | | Erich Novak,
Ian H. Sloan,
Henryk Wozniakowski:
Tractability of Tensor Product Linear Operators.
J. Complexity 13(4): 387-418 (1997) |
3 | | Ian H. Sloan,
Henryk Wozniakowski:
An intractability result for multiple integration.
Math. Comput. 66(219): 1119-1124 (1997) |
| 1996 |
2 | | Ch. Lubich,
Ian H. Sloan,
Vidar Thomée:
Nonsmooth data error estimates for approximations of an evolution equation with a positive-type memory term.
Math. Comput. 65(213): 1-17 (1996) |
1 | | Ronald Cools,
Ian H. Sloan:
Minimal cubature formulae of trigonometric degree.
Math. Comput. 65(216): 1583-1600 (1996) |