Geodesic
Fast algorithms for spectral differentiation matrices
Electronic transactions on numerical analysis, Tome 44 (2015), pp. 281-288
Recently Olver and Townsend presented a fast spectral method that relies on bases of ultraspherical polynomials to give differentiation matrices that are almost banded. The almost-banded structure allowed them to develop efficient algorithms for solving certain discretized systems in linear time. We show that one can also design fast algorithms for standard spectral methods because the underlying matrices, though dense, have the same rank structure as those of Olver and Townsend.
Classification : 65N35, 33C45, 65F05
Keywords: spectral methods, rank-structured matrices 
@article{ETNA_2015__44__a16,
     author = {Aurentz,  Jared L.},
     title = {Fast algorithms for spectral differentiation matrices},
     journal = {Electronic transactions on numerical analysis},
     pages = {281--288},
     year = {2015},
     volume = {44},
     zbl = {1327.65250},
     language = {en},
     url = {http://geodesic.mathdoc.fr/item/ETNA_2015__44__a16/}
}
TY  - JOUR
AU  - Aurentz,  Jared L.
TI  - Fast algorithms for spectral differentiation matrices
JO  - Electronic transactions on numerical analysis
PY  - 2015
SP  - 281
EP  - 288
VL  - 44
UR  - http://geodesic.mathdoc.fr/item/ETNA_2015__44__a16/
LA  - en
ID  - ETNA_2015__44__a16
ER  - 
%0 Journal Article
%A Aurentz,  Jared L.
%T Fast algorithms for spectral differentiation matrices
%J Electronic transactions on numerical analysis
%D 2015
%P 281-288
%V 44
%U http://geodesic.mathdoc.fr/item/ETNA_2015__44__a16/
%G en
%F ETNA_2015__44__a16
Aurentz,  Jared L. Fast algorithms for spectral differentiation matrices. Electronic transactions on numerical analysis, Tome 44 (2015), pp. 281-288. http://geodesic.mathdoc.fr/item/ETNA_2015__44__a16/