Fast discrete algorithms for sparse Fourier expansions of high dimensional functions

Journal of Complexity

Volumn 26, Issue 1, 2010, Pages 51-81

  Jiang, Ying ^a   Xu, Yuesheng ^a,b  

^a SUN YAT SEN UNIVERSITY   (China)

^b SYRACUSE UNIVERSITY   (United States)

Author keywords

Fast discrete algorithm; Hyperbolic cross Fourier expansion; Sparse grid

Indexed keywords

FOURIER ANALYSIS; FOURIER OPTICS; FOURIER TRANSFORMS; INTERPOLATION; NUMERICAL METHODS; POLYNOMIAL APPROXIMATION; WAVEFORM ANALYSIS;

DISCRETE ALGORITHMS; FOURIER EXPANSION; LAGRANGE INTERPOLATION METHOD; MULTIVARIATE APPROXIMATIONS; NUMERICAL PERFORMANCE; OPTIMAL APPROXIMATION ORDER; SPARSE GRID; TRIGONOMETRIC POLYNOMIAL;

APPROXIMATION ALGORITHMS;

EID: 71649098161     PISSN: 0885064X     EISSN: 10902708     Source Type: Journal    
DOI: 10.1016/j.jco.2009.10.001     Document Type: Article

References (40)

1. Chen H., Chui C.K., and Micchelli C.A. Asymptotically optimal sampling schemes for periodic functions II: The multivariate case. In: Chui C.K., Schempp W., and Zeller K. (Eds). Multivariate Approximation Theory IV, ISNM 90 (1989), Birkhäuser, Basel 73-86
2. Griebel M., and Knapek S. Optimized tensor-product approximation spaces. Constr. Approx. 16 (2000) 525-540
3. Temlyakov V. Approximation of functions with bounded mixed derivative. Trudy Mat. Inst. Steklov. 178 (1986) 1-112
4. Cai H., and Xu Y. A fast Fourier-Galerkin method for solving singular boundary integral equations. SIAM J. Numer. Anal. 46 (2008) 1965-1984
5. Frank K., Heinrich S., and Pereverzev S. Information complexity of multivariate Fredholm equations in sobolev classes. J. Complexity 12 (1996) 17-34
6. S. Knapek, Hyperbolic cross approximation of integral operators with smooth kernel, Technical Report 665, SFB 256, Univ. Bonn, 2000
7. p-metric. Sibirsk. Mat. Zh. 15 (1974) 395-412
8. p-metric. English transl. in Siberian Math. J. 15 (1974)
9. Pereverzev S.V. Hyperbolic cross and the complexity of the approximate solution of Fredholm integral equations of the second kind with differentiable kernels. Siberian Math. J. 32 (1991) 85-92
10. Baszenski G., and Delvos F.J. A discrete Fourier transform scheme for Boolean sums of trigonometric operators. In: Chui C.K., Schempp W., and Zeller K. (Eds). Multivariate Approximation Theory IV, ISNM 90 (1989), Birkhäuser, Basel 15-24
11. Hallatschek K. Fourier transform on sparse grids with hierarchical bases. Numer. Math. 63 (1992) 83-97
12. Gradinaru V. Fourier transform on sparse grids: Code design and the time dependent Schrödinger equation. Computing 80 (2007) 1-22
13. Gradinaru V. Strang splitting for the time dependent Schrödinger equation on sparse grids. SIAM J. Numer. Anal. 46 (2007) 103-123
14. Filon L.N.G. On a quadrature formula for trigonometric integrals. Proc. Roy Soc. Edinburgh 49 (1928) 38-47
15. Iserles A. On the numerical quadrature of highly-oscillating integrals I: Fourier transforms. IMA J. Numer. Anal. 24 (2004) 365-391
16. Iserles A. On the numerical quadrature of highly-oscillating integrals II: Irregular oscillators. IMA J. Numer. Anal. 25 (2005) 25-44
17. Iserles A., and Nørsett S.P. On quadrature methods for highly oscillatory integrals and their implementation. BIT 44 (2004) 755-772
18. Iserles A., and Nørsett S.P. Efficient quadrature of highly-oscillatory integrals using derivatives. Proc. Roy. Soc. A 461 (2005) 1383-1399
19. Levin D. Procedures for computing one-and-two dimensional integrals of functions with rapid irregular oscillations. Math. Comp. 38 (1982) 531-538
20. Cooley J.W., and Tukey J.W. An algorithm for the machine calculation of complex Fourier series. Math. Comp. 19 (1965) 297-301
21. Tolimieri R., An M., and Lu C. Mathematics of Multidimensional Fourier Transform Algorithms (1997), Springer-Verlag, New York
22. Chen Z., Micchelli C.A., and Xu Y. A construction of interpolating wavelets on invariant sets. Math. Comp. 68 (1999) 1569-1587
23. Micchelli C.A., Sauer T., and Xu Y. A construction of refinable sets for interpolating wavelets. Result. Math. 34 (1998) 359-372
24. Bungartz H.-J., and Griebel M. Sparse grids. Acta Numer. 13 (2004) 147-269
25. Achatz S., and München. Higher order sparse grids methods for elliptic partial differential equations with variable coefficients. Computing 71 (2003) 1-15
26. Bungartz H.-J. Finite Elements of Higher Order on Sparse Grids (1998), Shaker Verlag, Aachen
27. Bungartz H.-J., and Dornseifer T. Sparse grids: Recent developments for elliptic partial differential equations. In: Hackbusch W., and Wittum G. (Eds). Multigrid Methods V (1998), Springer, Berlin/Heidelberg 45-70
28. Liu F., and Zhou A. Two-scale Boolean Galerkin discretizations for Fredholm integral equations of the second kind. SIAM J. Numer. Anal. 45 (2007) 296-312
29. Nitsche P. Sparse approximation of singularity functions. Constr. Approx. 21 (2005) 63-81
30. S. Schneider, Adaptive solution of elliptic PDE by hierarchical tensor product finite elements, Ph.D. Thesis, Institut für Informatik, TU München, 2000
31. Xu Y., and Zhou A. Fast Boolean approximation methods for solving integral equations in high dimensions. J. Integral Equations Appl. 16 (2004) 83-110
32. Zenger C. In: Hackbusch W. (Ed). Sparse Grids. Parallel Algorithms for Partial Differential Equations vol. 31 (1991) 241-251
33. Rokhlin V., and Tygert M. Fast algorithms for spherical harmonic expansions. SIAM J. Sci. Comput. 27 (2006) 1903-1928
34. Xu Y. Common Zeros of Polynomials in Several Variables and Higher Dimensional Quadrature. Pitman Research Notes in Mathematics Series (1994), Longman, Essex
35. Sloan I., and Kachoyan P. Lattice methods for multiple integration: Theory, error analysis and examples. SIAM J. Numer. Anal. 24 (1987) 116-128
36. Sloan I., and Joe S. Lattice Methods for Multiple Integration (1994), Oxford University Press, New York
37. Temlyakov V. Approximation of Periodic Functions. Computational Mathematics and Analysis Series (1993), Nova Science Publishers, Inc., Commack, New York
38. Bittner K. Fast algorithms for spline wavelets on sparse grids. SIAM J. Sci. Comput. 20 (1999) 1192-1213
39. Barthelmann V., Novak E., and Ritter K. High dimensional polynomial interpolation on sparse grids. Adv. Comput. Math. 12 (2000) 273-288
40. Schumaker L. Spline Functions: Basic Theory. 2nd ed. (2007), Cambridge University Press, Cambridge