Title: Vector orthogonal polynomials and least squares approximation
Authors: Bultheel, Adhemar ×
Van Barel, Marc #
Issue Date: Jul-1995
Publisher: Society for Industrial and Applied Mathematics
Series Title: SIAM Journal on Matrix Analysis and Applications vol:16 issue:3 pages:863-885
Abstract: We describe an algorithm for complex discrete least squares approximation, which turns out to be very efficient when function values are prescribed in points on the real axis or on the unit circle. In the case of polynomial approximation, this reduces to algorithms proposed by Rutishauser, Gragg, Harrod, Reichel, Ammar, and others. The underlying reason for efficiency is the existence of a recurrence relation for orthogonal polynomials, which are used to represent the solution. We show how these ideas can be generalized to least squares approximation problems of a more general nature.
ISSN: 0895-4798
Publication status: published
KU Leuven publication type: IT
Appears in Collections:Numerical Analysis and Applied Mathematics Section
× corresponding author
# (joint) last author

Files in This Item:
File Status SizeFormat
vop.pdf Published 2144KbAdobe PDFView/Open


All items in Lirias are protected by copyright, with all rights reserved.

© Web of science