Skip to content

Commit dbf3e77

Browse files
clarify array of spherical harmonic coefficients
1 parent d46ad69 commit dbf3e77

File tree

1 file changed

+3
-2
lines changed

1 file changed

+3
-2
lines changed

README.md

Lines changed: 3 additions & 2 deletions
Original file line numberDiff line numberDiff line change
@@ -94,7 +94,7 @@ julia> @time norm(ipaduatransform(paduatransform(v))-v)
9494

9595
## The Spherical Harmonic Transform
9696

97-
Let `A` be a matrix of spherical harmonic expansion coefficients arranged by increasing alternating order. Then `sph2fourier` converts the representation into a bivariate Fourier series, and `fourier2sph` converts it back.
97+
Let `A` be a matrix of spherical harmonic expansion coefficients arranged by increasing order in absolute value, alternating between negative and positive. Then `sph2fourier` converts the representation into a bivariate Fourier series, and `fourier2sph` converts it back.
9898
```julia
9999
julia> A = rand(Float64, 251, 501); FastTransforms.zero_spurious_modes!(A);
100100

@@ -103,6 +103,7 @@ julia> B = sph2fourier(A);
103103
julia> C = fourier2sph(B);
104104

105105
julia> norm(A-C)
106+
7.422366861016818e-14
106107

107108
julia> A = rand(Float64, 1024, 2047); FastTransforms.zero_spurious_modes!(A);
108109

@@ -117,7 +118,7 @@ julia> norm(A-C)
117118

118119
```
119120

120-
As with other fast transforms, `plan_sph2fourier` saves effort by caching the pre-computation. Be warned that for dimensions larger than `1000`, this is no small feat!
121+
As with other fast transforms, `plan_sph2fourier` saves effort by caching the pre-computation. Be warned that for dimensions larger than `1,000`, this is no small feat!
121122

122123
# References:
123124

0 commit comments

Comments
 (0)