Polynomial least squares fitting in the Bernstein basis

DOI10.1016/j.laa.2010.06.031zbMath1202.65017arXiv0806.2797MaRDI QIDQ5962279

Ana Marco, José-Javier Martıńez

Publication date: 21 September 2010

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

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

zbMATH Keywords

algorithm; condition number; polynomial regression; least squares; ill-conditioned matrix; normal equations; total positivity; QR factorization; computer aided geometric design; Bernstein basis; Bernstein-Vandermonde matrix; bidiagonal decomposition; polynomial fitting; triangular system

Mathematics Subject Classification ID

65D10: Numerical smoothing, curve fitting

62J05: Linear regression; mixed models

65F50: Computational methods for sparse matrices

15A23: Factorization of matrices

65F20: Numerical solutions to overdetermined systems, pseudoinverses

65F35: Numerical computation of matrix norms, conditioning, scaling

15A06: Linear equations (linear algebraic aspects)

Related Items

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, Linearizations of matrix polynomials in Bernstein bases, The Bernstein polynomial basis: a centennial retrospective, 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, Accurate polynomial interpolation by using the Bernstein basis

Uses Software

• mctoolbox
• TNTool

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A fast and accurate algorithm for solving Bernstein-Vandermonde linear systems
• Total positivity and Neville elimination
• A matricial description of Neville elimination with applications to total positivity
• Shape preserving representations and optimality of the Bernstein basis
• Numerical methods for solving linear least squares problems
• Accurate Computations with Totally Nonnegative Matrices
• Optimal Conditioning of Bernstein Collocation Matrices
• Accuracy and Stability of Numerical Algorithms