Explicit solution of the polynomial least-squares approximation problem on Chebyshev extrema nodes (Q875008)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 5141634
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Explicit solution of the polynomial least-squares approximation problem on Chebyshev extrema nodes |
scientific article; zbMATH DE number 5141634 |
Statements
Explicit solution of the polynomial least-squares approximation problem on Chebyshev extrema nodes (English)
0 references
10 April 2007
0 references
The paper presents an explicit solution to the polynomial least squares approximation problem on Chebyshev extrema nodes. It is shown that the inverse of the normal matrix on the given 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. Further, an efficient algorithm is developed and studied. The numerical properties of the proposed algorithm are thoroughly discussed. Several numerical experiments are carried out to confirm and illustrate that the proposed algorithm is fast and accurate.
0 references
polynomial approximation
0 references
Cholesky factorization
0 references
combinatorial identities
0 references
least squares approximation
0 references
Chebyshev extrema nodes
0 references
algorithm
0 references
numerical experiments
0 references
0.8011960387229919
0 references
0.7377604246139526
0 references
0.7372376322746277
0 references
0.7318242788314819
0 references
