Polynomial least squares fitting in the Bernstein basis

Details Polynomial least squares fitting in the Bernstein basis Polynomial least squares fitting in the Bernstein basis

2008-06-17

arxiv.org/abs/0806.2797v1

Mathematics

Numerical Analysis

13 pages

Scientific paper

The problem of polynomial regression in which the usual monomial basis is replaced by the Bernstein basis is considered. The coefficient matrix A of the overdetermined system to be solved in the least squares sense is then a rectangular Bernstein-Vandermonde matrix. In order to use the method based on the QR decomposition of A, the first stage consists of computing the bidiagonal decomposition of the coefficient matrix A. Starting from that bidiagonal decomposition, an algorithm for obtaining the QR decomposition of A is the applied. Finally, a triangular system is solved by using the bidiagonal decomposition of the R-factor of A. Some numerical experiments showing the behavior of this approach are included.

Affiliated with

Also associated with

No associations

Rating

Polynomial least squares fitting in the Bernstein basis does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Polynomial least squares fitting in the Bernstein basis, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Polynomial least squares fitting in the Bernstein basis will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-408963