Explicit solution of the polynomial least-squares approximation problem on Chebyshev extrema nodes
2007
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:
- Correction
- Source
- Cite
- Save
- Machine Reading By IdeaReader
21
References
2
Citations
NaN
KQI