A method to compute recurrence relation coefficients for bivariate orthogonal polynomials by unitary matrix transformations

DOI10.1007/s11075-010-9392-yzbMath1200.65017OpenAlexW1981106575MaRDI QIDQ1960252

Andrey Chesnokov, Marc Van Barel

Publication date: 13 October 2010

Published in: Numerical Algorithms (Search for Journal in Brave)

Full work available at URL: https://lirias.kuleuven.be/handle/123456789/254242

zbMATH Keywords

algorithmorthogonal polynomialsnumerical experimentsrecurrence relationsinverse eigenvalue problemunitary transformationsGivens rotationsPadua pointsbivariate interpolation and approximationdiscrete least squares problem

Mathematics Subject Classification ID

Orthogonal functions and polynomials, general theory of nontrigonometric harmonic analysis (42C05) Numerical interpolation (65D05) Computation of special functions and constants, construction of tables (65D20) Numerical methods for trigonometric approximation and interpolation (65T40) Numerical solutions to inverse eigenvalue problems (65F18)

Related Items (2)

Compression of Multivariate Discrete Measures and Applications ⋮ Numerical hyperinterpolation over nonstandard planar regions

Uses Software

• Padua2DM
• Padua2D
• OPQ

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• \texttt{Padua2DM}: Fast interpolation and cubature at the Padua points in \texttt{MATLAB/Octave}
• On generating discrete orthogonal bivariate polynomials
• On discrete orthogonal polynomials of several variables
• Bivariate Lagrange interpolation at the Padua points: the generating curve approach
• Downdating of Szegö polynomials and data-fitting applications
• Bivariate polynomial interpolation on the square at new nodal sets
• On an inverse eigenvalue problem for unitary Hessenberg matrices
• Orthonormal polynomial vectors and least squares approximation for a discrete inner product
• Bivariate Lagrange interpolation at the Padua points: The ideal theory approach
• On numerical methods for discrete least-squares approximation by trigonometric polynomials
• Updating and Downdating of Orthogonal Polynomials with Data Fitting Applications
• Discrete Least Squares Approximation by Trigonometric Polynomials
• Fast QR Decomposition of Vandermonde-Like Mmatrices and Polynomial Least Squares Approximation
• Vector Orthogonal Polynomials and Least Squares Approximation

This page was built for publication: A method to compute recurrence relation coefficients for bivariate orthogonal polynomials by unitary matrix transformations