Repository logo

Infoscience

  • English
  • French
Log In
Logo EPFL, École polytechnique fédérale de Lausanne

Infoscience

  • English
  • French
Log In
  1. Home
  2. Academic and Research Output
  3. Journal articles
  4. Computation of connection coefficients and measure modifications for orthogonal polynomials
 
research article

Computation of connection coefficients and measure modifications for orthogonal polynomials

Narayan, Akil
•
Hesthaven, Jan S.  
2012
BIT Numerical Mathematics

We observe that polynomial measure modifications for families of univariate orthogonal polynomials imply sparse connection coefficient relations. We therefore propose connecting L (2) expansion coefficients between a polynomial family and a modified family by a sparse transformation. Accuracy and conditioning of the connection and its inverse are explored. The connection and recurrence coefficients can simultaneously be obtained as the Cholesky decomposition of a matrix polynomial involving the Jacobi matrix; this property extends to continuous, non-polynomial measure modifications on finite intervals. We conclude with an example of a useful application to families of Jacobi polynomials with parameters (gamma,delta) where the fast Fourier transform may be applied in order to obtain expansion coefficients whenever 2 gamma and 2 delta are odd integers.

  • Files
  • Details
  • Metrics
Loading...
Thumbnail Image
Name

BIT522012.pdf

Access type

openaccess

Size

232.23 KB

Format

Adobe PDF

Checksum (MD5)

1092e701b45f31d23284ca85a4cd6f24

Logo EPFL, École polytechnique fédérale de Lausanne
  • Contact
  • infoscience@epfl.ch

  • Follow us on Facebook
  • Follow us on Instagram
  • Follow us on LinkedIn
  • Follow us on X
  • Follow us on Youtube
AccessibilityLegal noticePrivacy policyCookie settingsEnd User AgreementGet helpFeedback

Infoscience is a service managed and provided by the Library and IT Services of EPFL. © EPFL, tous droits réservés