A Stieltjes Algorithm for Generating Multivariate Orthogonal Polynomials

From MaRDI portal
Publication:6155902

DOI10.1137/22M1477131zbMATH Open1515.65045arXiv2202.04843OpenAlexW4378978085MaRDI QIDQ6155902FDOQ6155902

Akil C. Narayan, Zexin Liu

Publication date: 7 June 2023

Published in: SIAM Journal on Scientific Computing (Search for Journal in Brave)

Abstract: Orthogonal polynomials of several variables have a vector-valued three-term recurrence relation, much like the corresponding one-dimensional relation. This relation requires only knowledge of certain recurrence matrices, and allows simple and stable evaluation of multivariate orthogonal polynomials. In the univariate case, various algorithms can evaluate the recurrence coefficients given the ability to compute polynomial moments, but such a procedure is absent in multiple dimensions. We present a new Multivariate Stieltjes (MS) algorithm that fills this gap in the multivariate case, allowing computation of recurrence matrices assuming moments are available. The algorithm is essentially explicit in two and three dimensions, but requires the numerical solution to a non-convex problem in more than three dimensions. Compared to direct Gram-Schmidt-type orthogonalization, we demonstrate on several examples in up to three dimensions that the MS algorithm is far more stable, and allows accurate computation of orthogonal bases in the multivariate setting, in contrast to direct orthogonalization approaches.


Full work available at URL: https://arxiv.org/abs/2202.04843




Recommendations




Cites Work


Cited In (5)





This page was built for publication: A Stieltjes Algorithm for Generating Multivariate Orthogonal Polynomials

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6155902)