Title: Orthonormal polynomial vectors and least squares approximation for a discrete inner product
Authors: Van Barel, Marc ×
Bultheel, Adhemar #
Issue Date: Mar-1995
Publisher: Kent State Univ. Lib, Kent, OH
Series Title: Electronic Transactions on Numerical Analysis vol:3 pages:1-23
Abstract: We give the solution of a discrete least squares approximation problem in terms of orthonormal polynomial vectors with respect to a discrete inner product. The degrees of the polynomial elements of these vectors can be different. An algorithm is constructed computing the coefficients of recurrence relations for the orthonormal polynomial vectors. In case the weight vectors are prescribed in points on the real axis or on the unit circle, variants of the original algorithm can be designed which are an order of magnitude more efficient. Although the recurrence relations require all previous vectors to compute the next orthonormal polynomial vector, in the real or the unit-circle case only a fixed number of previous vectors are required. As an application, we approximate a vector-valued function by a vector rational function in a linearized least squares sense.
ISSN: 1068-9613
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:

There are no files associated with this item.

Request a copy


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