Journal of Computational and Applied Mathematics2022,Vol.40318.DOI:10.1016/j.cam.2021.113831

Fast associated classical orthogonal polynomial transforms

Klippenstein, Brock Slevinsky, Richard Mikael
Journal of Computational and Applied Mathematics2022,Vol.40318.DOI:10.1016/j.cam.2021.113831

Fast associated classical orthogonal polynomial transforms

Klippenstein, Brock 1Slevinsky, Richard Mikael1
扫码查看

作者信息

  • 1. Univ Manitoba
  • 折叠

Abstract

We discuss a fast approximate solution to the associated classical-classical orthogonal polynomial connection problem. We first show that associated classical orthogonal polynomials are solutions to a fourth-order quadratic eigenvalue problem with polynomial coefficients such that the differential operator is degree-preserving. Upon linearization, the discretization of this quadratic eigenvalue problem is block upper-triangular and banded. After a perfect shuffle, we extend a divide-and-conquer approach to the upper-triangular and banded generalized eigenvalue problem to the blocked case, which may be accelerated by one of a few different algorithms. Associated orthogonal polynomials arise from iterated Stieltjes transforms of orthogonal polynomials; hence, fast approximate conversion to classical cases combined with fast discrete sine and cosine transforms provides a modular mechanism for synthesis of singular integral transforms of classical orthogonal polynomial expansions. (C) 2021 Elsevier B.V. All rights reserved.

Key words

Associated classical orthogonal polynomials/Divide-and-conquer algorithms/Quadratic eigenvalue problems/4TH-ORDER DIFFERENTIAL-EQUATIONS/SINGULAR-VALUES/FAST ALGORITHM/JACOBI/RECURRENCE/MATRICES/BOUNDS

引用本文复制引用

出版年

2022
Journal of Computational and Applied Mathematics

Journal of Computational and Applied Mathematics

EISCI
ISSN:0377-0427
参考文献量55
段落导航相关论文