How to generate unknown orthogonal polynomials out of known orthogonal polynomials
Journal of Computational and Applied Mathematics - Orthogonal polynomials and numerical methods
ACM Transactions on Mathematical Software (TOMS)
Sensitivity analysis for computing orthogonal polynomials of Sobolev type
Proceedings of the conference on Approximation and computation : a fetschrift in honor of Walter Gautschi: a fetschrift in honor of Walter Gautschi
Computing orthogonal polynomials in Sobolev spaces
Numerische Mathematik
Algorithm 880: A testing infrastructure for symmetric tridiagonal eigensolvers
ACM Transactions on Mathematical Software (TOMS)
A minimisation approach for computing the ground state of Gross-Pitaevskii systems
Journal of Computational Physics
High-order time-splitting Hermite and Fourier spectral methods
Journal of Computational Physics
Gauss-Green cubature and moment computation over arbitrary geometries
Journal of Computational and Applied Mathematics
Hi-index | 0.01 |
A suite of Matlab programs has been developed as part of the book "Orthogonal Polynomials: Computation and Approximation" Oxford University Press, Oxford, 2004, by Gautschi. The package contains routines for generating orthogonal polynomials as well as routines dealing with applications. In this paper, a brief review of the first part of the package is given, dealing with procedures for generating the three-term recurrence relation for orthogonal polynomials and more general recurrence relations for Sobolev orthogonal polynomials. Moment-based methods and discretization methods, and their implementation in Matlab, are among the principal topics discussed.