Explicit solution of the polynomial least-squares approximation problem on Chebyshev extrema nodes (Q875008): Difference between revisions
From MaRDI portal
m rollbackEdits.php mass rollback Tag: Rollback |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/j.laa.2006.11.014 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2111326439 / rank | |||
Normal rank | |||
Revision as of 08:36, 20 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Explicit solution of the polynomial least-squares approximation problem on Chebyshev extrema nodes |
scientific article |
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
