You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
# A faster method now exists via the `GramMatrix` architecture and its associated displacement equation. Given the modified orthogonal polynomial moments implied by the normalized Jacobi series for $u(x)$, we pad this vector to the necessary size and construct the `GramMatrix` with these moments, the multiplication operator, and the constant $\tilde{P}_0^{(\alpha,\beta)}(x)$:
# And compute its cholesky factorization. The upper-triangular Cholesky factor represents the connection between original Jacobi and semi-classical Jacobi as ${\bf P}^{(\alpha,\beta)}(x) = {\bf Q}(x) R$.
77
77
R =cholesky(G).U
78
-
R[1:10, 1:10]
78
+
UpperTriangular(view(R, 1:7, 1:7))
79
79
80
80
# Every else works almost as before, including evaluation on a Chebyshev grid:
81
81
q = k ->lmul!(P1, ldiv!(R, [zeros(k); 1.0; zeros(n-k)]))
@@ -110,4 +110,4 @@ G′ = GramMatrix(μ′, XP′, p0′)
110
110
R′ =cholesky(G′).U
111
111
DP =UpperTriangular(diagm(1=>[sqrt(n*(n+α+β+1)) for n in1:n])) # The classical differentiation matrix representing 𝒟 P^{(α,β)}(x) = P^{(α+1,β+1)}(x) D_P.
0 commit comments