Fast 1D orthogonal polynomial transforms
·
147 commits
to master
since this release
This release adds fast solutions to classical orthogonal polynomial connection problems via divide and conquer for triangular banded generalized eigenproblems accelerated by the FMM. Dense (direct) connection coefficients are supported in multi-precision via mpfr. See the documentation starting here for a full list of new features and also the pull request #37.
Nothing has changed for exported multivariate transforms, but divide and conquer for symmetric definite generalized eigenproblems can also be used to accelerate the multivariate cases, see https://arxiv.org/abs/1711.07866, and most of the technology is in place. Subtleties regarding the rootfinding technique (passing tests on all platforms) will delay these to a subsequent release.