On generating discrete orthogonal bivariate polynomials
From MaRDI portal
Publication:698575
DOI10.1023/A:1021907210628zbMATH Open1013.65014MaRDI QIDQ698575FDOQ698575
Authors: Marko Huhtanen, Rasmus Munk Larsen
Publication date: 17 June 2003
Published in: BIT (Search for Journal in Brave)
Recommendations
- A method to compute recurrence relation coefficients for bivariate orthogonal polynomials by unitary matrix transformations
- A Stieltjes Algorithm for Generating Multivariate Orthogonal Polynomials
- On generating orthogonal polynomials for discrete measures
- Construction of polynomials that are orthogonal with respect to a discrete bilinear form
- Two variable orthogonal polynomials and structured matrices
numerical examplescurve fittingLanczos algorithmbivariate orthogonal polynomialsleast square approximation .
Computation of special functions and constants, construction of tables (65D20) Numerical smoothing, curve fitting (65D10)
Cited In (10)
- On Generating Polynomials which are Orthogonal over Several Intervals
- Numerical hyperinterpolation over nonstandard planar regions
- Compression of Multivariate Discrete Measures and Applications
- A probabilistic origin for a new class of bivariate polynomials
- A method to compute recurrence relation coefficients for bivariate orthogonal polynomials by unitary matrix transformations
- On the computation of sets of points with low Lebesgue constant on the unit disk
- Practical algorithms for multivariate rational approximation
- Title not available (Why is that?)
- On generating orthogonal polynomials for discrete measures
- The real linear eigenvalue problem in \(\mathbb C^n\)
This page was built for publication: On generating discrete orthogonal bivariate polynomials
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q698575)