A fast algorithm for expansion over spherical harmonics
type: Item
instance of: scholarly article
title: A fast algorithm for expansion over spherical harmonics
zbMATH Open document ID: 0838.65009
DOI: 10.1007/BF01198013
published in: Applicable Algebra in Engineering, Communication and Computing
publication date: 1996-05-30T00:00:00Z
review text: A usual way to obtain algorithms for expansion over spherical harmonics is to use an integration method over some grid on the unit sphere. From the author's abstract: ``We provide an algorithm of complexity \(O(NL \log^2L)\) for multiplication of the matrix of values of spherical harmonics in points of an arbitrary grid on the unit sphere. The algorithm is based on interrelation between spherical harmonics and Legendre polynomials and on a fast algorithm for expansion over Legendre polynomials''. Here \(N\) stands for the number of the grid points and \(L\) is the maximal degree of the spherical harmonics involved.
Mathematics Subject Classification ID: 65D20
Mathematics Subject Classification ID: 33C55
zbMATH DE Number: 817201
zbMATH Keywords: expansion over spherical harmonics
zbMATH Keywords: complexity
zbMATH Keywords: Legendre polynomials
zbMATH Keywords: fast algorithm
author: M. A. Frumkin
reviewed by: Nácere Hayek
MaRDI profile type: Publication
cites work: Q4091421
cites work: Q5725805
cites work: Computation of spherical harmonic expansion coefficients via FFT's
cites work: Q3675490
cites work: Additive complexity in directed computations
cites work: Spherical harmonics
cites work: Fast Fourier transform and convolution algorithms
cites work: Q3320678
cites work: Q5521058
description: scientific article; zbMATH DE number 817201