Calculates the nodal first derivative matrix for CGL nodes in [x0,x1] Assumes the nodal coordinates to be in ascending order in the domain [-1,1].
References
"Spectral differencing with a twist", Richard Baltensperger and Manfred R. Trummer, SIAM J. Sci. Comput., Vol. 24, No. 5, pp. 1465–1487, 2003.
Costa, B. and Don, W. S. (2000), 'On the computation of high order pseudospectral derivatives', Applied Numerical Mathematics, 33, 151-159.
Maleki, M., Hashim, I., and Abbasbandy, S. (2012), 'Analysis of IVPs and BVPs on semi-infinite domains via collocation methods', Journal of Applied Mathematics, doi:10.1155/2012/696574.
| Type | Intent | Optional | Attributes | Name | ||
|---|---|---|---|---|---|---|
| real(kind=rp), | intent(in) | :: | x0 |
Domain bounds [x0, x1] |
||
| real(kind=rp), | intent(in) | :: | x1 |
Domain bounds [x0, x1] |
||
| integer, | intent(in) | :: | n |
Degree of the polynomial |
||
| real(kind=rp), | intent(inout), | dimension(:), target | :: | rwrk |
Workspace array of minimum size 2*(n+1) |
|
| real(kind=rp), | intent(out), | dimension(:,:) | :: | dm |
(n+1,n+1). Nodal first derivative matrix |