We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
There was an error while loading. Please reload this page.
2 parents f08c6bc + bfc9a39 commit 5c94d71Copy full SHA for 5c94d71
s2fft/recursions/price_mcewen.py
@@ -21,9 +21,11 @@ def generate_precomputes(
21
L_lower: int = 0,
22
) -> List[np.ndarray]:
23
r"""
24
- Compute recursion coefficients with :math:`\mathcal{O}(L^2)` memory overhead.
25
- In practice one could compute these on-the-fly but the memory overhead is
26
- negligible and well worth the acceleration.
+ Compute recursion coefficients with :math:`\mathcal{O}(L^3)` memory overhead.
+
+ The corresponding JAX implementation in :py:func:`generate_precomputes_jax` has a
27
+ :math:`\mathcal{O}(L^2)` overhead and so should generally be preferred, particularly
28
+ for large :math:`L`.
29
30
Args:
31
L (int): Harmonic band-limit.
0 commit comments