Polynomial least squares fitting in the Bernstein basis
From MaRDI portal
(Redirected from Publication:5962279)
algorithmBernstein basisBernstein-Vandermonde matrixbidiagonal decompositioncomputer aided geometric designcondition numberill-conditioned matrixleast squaresnormal equationspolynomial fittingpolynomial regressionQR factorizationtotal positivitytriangular system
Linear equations (linear algebraic aspects) (15A06) Factorization of matrices (15A23) Linear regression; mixed models (62J05) Numerical smoothing, curve fitting (65D10) Numerical solutions to overdetermined systems, pseudoinverses (65F20) Numerical computation of matrix norms, conditioning, scaling (65F35) Computational methods for sparse matrices (65F50)
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.
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
Cites work
- A fast and accurate algorithm for solving Bernstein-Vandermonde linear systems
- A matricial description of Neville elimination with applications to total positivity
- Accuracy and Stability of Numerical Algorithms
- Accurate Computations with Totally Nonnegative Matrices
- scientific article; zbMATH DE number 3179593 (Why is no real title available?)
- scientific article; zbMATH DE number 491264 (Why is no real title available?)
- scientific article; zbMATH DE number 1136347 (Why is no real title available?)
- scientific article; zbMATH DE number 852536 (Why is no real title available?)
- Numerical methods for solving linear least squares problems
- Optimal conditioning of Bernstein collocation matrices
- Shape preserving representations and optimality of the Bernstein basis
- Total positivity and Neville elimination
Cited in
(22)- Iterated Bernstein operators for distribution function and density estimation: balancing between the number of iterations and the polynomial degree
- A study of numerical integration based on Legendre polynomial and RLS algorithm
- 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
- Iterative rational least squares fitting
- Accurate computations of eigenvalues of quasi-Cauchy-Vandermonde matrices
- Computing eigenvalues of quasi-generalized Vandermonde matrices to high relative accuracy
- Accurate singular values of a class of parameterized negative matrices
- Accurate solutions of weighted least squares problems associated with rank-structured matrices
- Least squares problems involving generalized Kronecker products and application to bivariate polynomial regression
- A structure-preserving matrix method for the deconvolution of two Bernstein basis polynomials
- Accurate polynomial interpolation by using the Bernstein basis
- Linearizations of matrix polynomials in Bernstein bases
- The Bernstein polynomial basis: a centennial retrospective
- Structured inversion of the Bernstein-Vandermonde matrix
- Accurate least squares fitting with a general class of shape preserving bases
- Accurate computation of generalized eigenvalues of regular SR-BP pairs
- The accurate and efficient solutions of linear systems for generalized sign regular matrices with certain signature
- Accurate polynomial fitting and evaluation via Arnoldi
- Accurate computations of singular values and linear systems for polynomial-Vandermonde-type matrices
- Accurate inverses and determinants of doubly strictly diagonally dominant Z-matrices
- Accurate inverses and determinants for SDD_k Z-matrices
- Accurate computations for the inverse of \(\{P_1, P_2\}\)-Nekrasov \(Z\)-matrices
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)
