Shohat-Favard and Chebyshev's methods in d-orthogonality
The author studies orthogonal polynomials with respect to \(d\) linear forms simultaneously, the so-called \(d\)-orthogonal polynomials that satisfy a \(d+1\)-term recurrence relation [cf. \textit{J. Van Iseghem}, J. Comput. Appl. Math. 19, 141-150 (1987; Zbl 0626.65013)]. After giving the theoretical background, the author discusses recurrence schemes for the explicit calculation from a.o. given moments. These algorithms are then tested against examples for which the exact solution is known. All algorithms (written as \textit{Mathematica}-packages) and results can be downloaded from \url{http://netlib.bell-labs.com/} in the \textit{numeralgo} library of \textit{netlib}. Apart from an improvement on the number of exact digits found, the method also takes care of a clever memory management.
- Frobenius-Padé approximants for \(d\)-orthogonal series: theory and computational aspects
- Symbolic approach to the general quadratic polynomial decomposition
- Common points between perturbed Chebyshev polynomials of second kind
- na15
- Cauchy-Stieltjes families with polynomial variance functions and generalized orthogonality
- On semi-classical \(d\)-orthogonal polynomials
- The quadratic decomposition of the normalized derivatives of the classical orthogonal polynomials
- On connection coefficients of d-orthogonal polynomials in terms of orthogonal polynomials and the canonical basis
- A general method for deriving some semi-classical properties of perturbed second degree forms: the case of the Chebyshev form of second kind
This page was built for publication: Shohat-Favard and Chebyshev's methods in \(d\)-orthogonality
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1805938)
