On Generating Discrete Orthogonal Bivariate Polynomials |
| |
Authors: | Marko Huhtanen Rasmus Munk Larsen |
| |
Affiliation: | (1) SCCM program, Computer Science Department, Stanford University, Stanford, CA 94305, USA;(2) SCCM program, Computer Science Department, and SOI-MDI, W.W. Hansen Experimental Physics Laboratory, Stanford University, Stanford, CA 94305, USA |
| |
Abstract: | In this paper we present an algorithm for recursively generating orthogonal bivariate polynomials on a discrete set S 2. For this purpose we employ commuting pairs of real symmetric matrices H, K n×n to obtain, in a certain sense, a two dimensional Hermitian Lanczos method. The resulting algorithm relies on a recurrence having a slowly growing length. Practical implementation issues an applications are considered. The method can be generalized to compute orthogonal polynomials depending on an arbitrary number of variables. |
| |
Keywords: | Lanczos algorithm bivariate polynomial slowly growing length of the recurrence curve fitting least squares approximation bivariate interpolation |
本文献已被 SpringerLink 等数据库收录! |
|