Publications Meetings The Profession Membership Programs Math Samplings Policy & Advocacy In the News About the AMS

   
Mobile Device Pairing
Green Open Access
Mathematics of Computation
Mathematics of Computation
ISSN 1088-6842(online) ISSN 0025-5718(print)

 

Orthogonal polyanalytic polynomials and normal matrices


Author: Marko Huhtanen
Journal: Math. Comp. 72 (2003), 355-373
MSC (2000): Primary 42C05; Secondary 15A57
Published electronically: February 22, 2002
MathSciNet review: 1933825
Full-text PDF Free Access

Abstract | References | Similar Articles | Additional Information

Abstract: The Hermitian Lanczos method for Hermitian matrices has a well-known connection with a 3-term recurrence for polynomials orthogonal on a discrete subset of $\mathbb{R}$. This connection disappears for normal matrices with the Arnoldi method. In this paper we consider an iterative method that is more faithful to the normality than the Arnoldi iteration. The approach is based on enlarging the set of polynomials to the set of polyanalytic polynomials. Denoting by $d$ the number of elements computed so far, the arising scheme yields a recurrence of length bounded by $\sqrt{8d}$ for polyanalytic polynomials orthogonal on a discrete subset of $\mathbb{C}$. Like this slowly growing length of the recurrence, the method preserves, at least partially, the properties of the Hermitian Lanczos method. We employ the algorithm in least squares approximation and bivariate Lagrange interpolation.


References [Enhancements On Off] (What's this?)


Similar Articles

Retrieve articles in Mathematics of Computation with MSC (2000): 42C05, 15A57

Retrieve articles in all journals with MSC (2000): 42C05, 15A57


Additional Information

Marko Huhtanen
Affiliation: SCCM program, Computer Science Department, Stanford University, Stanford, California 94305
Address at time of publication: Department of Mathematics, MIT, 77 Massachusetts Avenue, Cambridge, Massachusetts 01239
Email: Marko.Huhtanen@hut.fi

DOI: http://dx.doi.org/10.1090/S0025-5718-02-01417-5
PII: S 0025-5718(02)01417-5
Keywords: Normal matrix, orthogonal polynanalytic polynomial, slowly growing length of the recurrence, least squares approximation, bivariate Lagrange interpolation
Received by editor(s): September 12, 2000
Received by editor(s) in revised form: March 1, 2001
Published electronically: February 22, 2002
Additional Notes: This work was supported by the Academy of Finland and the Alfred Kordelin Foundation
Article copyright: © Copyright 2002 American Mathematical Society