Fast Algorithms for Spherical Harmonic Expansions
暂无分享,去创建一个
[1] Shivkumar Chandrasekaran,et al. A divide-and-conquer algorithm for the eigendecomposition of symmetric block-diagonal plus semiseparable matrices , 2004, Numerische Mathematik.
[2] Alfred V. Aho,et al. Data Structures and Algorithms , 1983 .
[3] Mark Tygert,et al. Fast algorithms for spherical harmonic expansions, II , 2008, J. Comput. Phys..
[4] E. Michielssen,et al. A multilevel matrix decomposition algorithm for analyzing scattering from large structures , 1996 .
[5] V. Rokhlin,et al. Fast algorithms for polynomial interpolation, integration, and differentiation , 1996 .
[6] P. Swarztrauber,et al. SPHEREPACK 3.0: A Model Development Facility , 1999 .
[7] Bradley K. Alpert,et al. A Fast Spherical Filter with Uniform Resolution , 1997 .
[8] Reiji Suda,et al. A fast spherical harmonics transform algorithm , 2002, Math. Comput..
[9] D. F. Hays,et al. Table of Integrals, Series, and Products , 1966 .
[10] Rene F. Swarttouw,et al. Orthogonal polynomials , 2020, NIST Handbook of Mathematical Functions.
[11] Bradley K. Alpert,et al. A Fast Algorithm for the Evaluation of Legendre Expansions , 1991, SIAM J. Sci. Comput..
[12] Per-Gunnar Martinsson,et al. On interpolation and integration in finite-dimensional spaces of bounded functions , 2005 .
[13] Gene H. Golub,et al. Calculation of Gauss quadrature rules , 1967, Milestones in Matrix Computation.
[14] Paul N. Swarztrauber. Spectral Transform Methods for Solving the Shallow-Water Equations on the Sphere , 1996 .
[15] William H. Press,et al. Numerical recipes , 1990 .
[16] Stefan Kunis,et al. Fast spherical Fourier algorithms , 2003 .
[17] Paul N. Swarztrauber,et al. Shallow Water Flow on the Sphere , 2004 .
[18] Eugene E. Tyrtyshnikov,et al. Incomplete Cross Approximation in the Mosaic-Skeleton Method , 2000, Computing.
[19] Per-Gunnar Martinsson,et al. On the Compression of Low Rank Matrices , 2005, SIAM J. Sci. Comput..
[20] William H. Press,et al. Numerical Recipes in Fortran 77 , 1992 .
[21] Dennis M. Healy,et al. Towards Safe and Effective High-Order Legendre Transforms with Applications to FFTs for the 2-sphere , 2004, Adv. Comput. Math..
[22] Sean S. B. Moore,et al. FFTs for the 2-Sphere-Improvements and Variations , 1996 .
[23] Norman Yarvin,et al. An Improved Fast Multipole Algorithm for Potential Fields on the Line , 1999 .
[24] Irene A. Stegun,et al. Handbook of Mathematical Functions. , 1966 .
[25] V. Rokhlin,et al. A generalized one-dimensional fast multipole method with application to filtering of spherical harmonics , 1998 .
[26] Martin J. Mohlenkamp. A fast transform for spherical harmonics , 1997 .
[27] Ming Gu,et al. Efficient Algorithms for Computing a Strong Rank-Revealing QR Factorization , 1996, SIAM J. Sci. Comput..
[28] J. Crank. Tables of Integrals , 1962 .
[29] James S. Harris,et al. Tables of integrals , 1998 .
[30] Stanley C. Eisenstat,et al. A Divide-and-Conquer Algorithm for the Symmetric Tridiagonal Eigenproblem , 1995, SIAM J. Matrix Anal. Appl..
[31] F. Gantmacher,et al. Oscillation matrices and kernels and small vibrations of mechanical systems , 1961 .
[32] William H. Press,et al. Numerical Recipes: FORTRAN , 1988 .
[33] P. Swarztrauber,et al. Generalized Discrete Spherical Harmonic Transforms , 2000 .
[34] Reiji Suda. Fast Spherical Harmonic Transform Routine FLTSS Applied to the Shallow Water Test Set , 2005 .
[35] S. Eisenstat,et al. A Stable and Efficient Algorithm for the Rank-One Modification of the Symmetric Eigenproblem , 1994, SIAM J. Matrix Anal. Appl..