Polynomial least squares fitting in the Bernstein basis

DOI10.1016/J.LAA.2010.06.031zbMATH Open1202.65017arXiv0806.2797OpenAlexW1965192858MaRDI QIDQ5962279FDOQ5962279

Authors: Ana Marco, José-Javier Martínez 

Publication date: 21 September 2010

Published in: Linear Algebra and its Applications (Search for Journal in Brave)

Abstract: 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.

Full work available at URL: https://arxiv.org/abs/0806.2797

Recommendations

• Accurate least squares fitting with a general class of shape preserving bases
• Accurate polynomial interpolation by using the Bernstein basis
• A fast and accurate algorithm for solving Bernstein-Vandermonde linear systems
• Jacobi-Bernstein Basis Transformation
• Accurate computations with totally positive Bernstein-Vandermonde matrices

zbMATH Keywords

least squaresalgorithmnormal equationscondition numbertotal positivityill-conditioned matrixpolynomial regressionQR factorizationBernstein basispolynomial fittingcomputer aided geometric designtriangular systembidiagonal decompositionBernstein-Vandermonde matrix

Mathematics Subject Classification ID

Linear regression; mixed models (62J05) Numerical smoothing, curve fitting (65D10) Computational methods for sparse matrices (65F50) Factorization of matrices (15A23) Numerical solutions to overdetermined systems, pseudoinverses (65F20) Linear equations (linear algebraic aspects) (15A06) Numerical computation of matrix norms, conditioning, scaling (65F35)

Cites Work

• Shape preserving representations and optimality of the Bernstein basis
• Numerical methods for solving linear least squares problems
• Title not available (Why is that?)
• Accuracy and Stability of Numerical Algorithms
• Total positivity and Neville elimination
• A matricial description of Neville elimination with applications to total positivity
• Accurate Computations with Totally Nonnegative Matrices
• Optimal conditioning of Bernstein collocation matrices
• Title not available (Why is that?)
• Title not available (Why is that?)
• A fast and accurate algorithm for solving Bernstein-Vandermonde linear systems
• Title not available (Why is that?)

Cited In (15)

• Least squares problems involving generalized Kronecker products and application to bivariate polynomial regression
• The accurate and efficient solutions of linear systems for generalized sign regular matrices with certain signature
• Accurate polynomial interpolation by using the Bernstein basis
• Linearizations of matrix polynomials in Bernstein bases
• Iterated Bernstein operators for distribution function and density estimation: balancing between the number of iterations and the polynomial degree
• Accurate computations of eigenvalues of quasi-Cauchy-Vandermonde matrices
• Computing eigenvalues of quasi-generalized Vandermonde matrices to high relative accuracy
• Accurate solutions of weighted least squares problems associated with rank-structured matrices
• Bézier projection: a unified approach for local projection and quadrature-free refinement and coarsening of NURBS and T-splines with particular application to isogeometric design and analysis
• Accurate Computation of Generalized Eigenvalues of Regular SR-BP Pairs
• Accurate computations of singular values and linear systems for polynomial-Vandermonde-type matrices
• Accurate singular values of a class of parameterized negative matrices
• A study of numerical integration based on Legendre polynomial and RLS algorithm
• Iterative rational least squares fitting
• The Bernstein polynomial basis: a centennial retrospective

Uses Software

• mctoolbox
• TNTool

This page was built for publication: Polynomial least squares fitting in the Bernstein basis

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5962279)