Title of article
Explicit solution of the polynomial least-squares approximation problem on Chebyshev extrema nodes Original Research Article
Author/Authors
Alfredo Eisinberg، نويسنده , , Giuseppe Fedele، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2007
Pages
10
From page
553
To page
562
Abstract
In this paper we propose an explicit solution to the polynomial least squares approximation problem on Chebyshev extrema nodes. We also show that the inverse of the normal matrix on this set of nodes can be represented as the sum of two symmetric matrices: a full rank matrix which admits a Cholesky factorization and a 2-rank matrix. Finally we discuss the numerical properties of the proposed formulas.
Keywords
combinatorial identities , Cholesky factorization , polynomial approximation
Journal title
Linear Algebra and its Applications
Serial Year
2007
Journal title
Linear Algebra and its Applications
Record number
825534
Link To Document