Orthogonal polynomials on a class of planar algebraic curves
Marco Fasondini, Sheehan Olver, Yuan Xu

TL;DR
This paper develops a method to construct and compute bivariate orthogonal polynomials on certain algebraic curves using univariate semiclassical OPs, with efficient algorithms for connection coefficients.
Contribution
It introduces a novel construction of bivariate orthogonal polynomials on algebraic curves and provides an efficient Lanczos-based algorithm for their computation.
Findings
Connection coefficients form a banded matrix.
Lanczos algorithm computes coefficients in O(Nd^4) operations.
Bivariate OPs are expressed in terms of univariate semiclassical OPs.
Abstract
We construct bivariate orthogonal polynomials (OPs) on algebraic curves of the form in where and is a polynomial of arbitrary degree , in terms of univariate semiclassical OPs. We compute connection coeffeicients that relate the bivariate OPs to a polynomial basis that is itself orthogonal and whose span contains the OPs as a subspace. The connection matrix is shown to be banded and the connection coefficients and Jacobi matrices for OPs of degree are computed via the Lanczos algorithm in operations.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsPolynomial and algebraic computation · Numerical methods for differential equations · Advanced Numerical Analysis Techniques
