Total positivity and accurate computations with Gram matrices of Bernstein bases

DOI10.1007/s11075-022-01284-0zbMath1503.65076OpenAlexW4293062468WikidataQ114224281 ScholiaQ114224281MaRDI QIDQ2674583

B. Rubio, Juan Manuel Peña, Esmeralda Mainar

Publication date: 14 September 2022

Published in: Numerical Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11075-022-01284-0

zbMATH Keywords

Gram matricestotally positive matriceshigh relative accuracybidiagonal decompositionsBernstein bases

Mathematics Subject Classification ID

Numerical computation of eigenvalues and eigenvectors of matrices (65F15) Positive matrices and their generalizations; cones of matrices (15B48)

Related Items (1)

On the accuracy of de Casteljau-type algorithms and Bernstein representations

Uses Software

• TNTool

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Bézier representation of the constrained dual Bernstein polynomials
• The Bernstein polynomial basis: a centennial retrospective
• Gram matrix of Bernstein basis: properties and applications
• Multi-degree reduction of tensor product Bézier surfaces with general boundary constraints
• Multi-degree reduction of Bézier curves with constraints, using dual Bernstein basis polynomials
• Optimal multi-degree reduction of Bézier curves with \(G^2\)-continuity
• Total positivity and Neville elimination
• A matricial description of Neville elimination with applications to total positivity
• The rational Bernstein bases and the multirational blossoms
• Accurate computation of the Moore-Penrose inverse of strictly totally positive matrices
• Shape preserving representations and optimality of the Bernstein basis
• Construction of dual bases
• Evaluation and subdivision algorithms for general classes of totally positive rational bases
• Accurate algorithms for Bessel matrices
• Solutions of differential equations in a Bernstein polynomial basis
• Constrained polynomial degree reduction in the \(L_2\)-norm equals best weighted Euclidean approximation of Bézier coefficients
• Fast simplicial finite element algorithms using Bernstein polynomials
• Explicit \(G^2\)-constrained degree reduction of Bézier curves by quadratic optimization
• Numerical solution of KdV equation using modified bernstein polynomials
• Accurate computations with Laguerre matrices
• Bernstein Polynomials and Brownian Motion
• Accurate Computations with Totally Nonnegative Matrices
• On the optimal stability of the Bernstein basis
• Structured Inversion of the Bernstein Mass Matrix
• The Accurate and Efficient Solution of a Totally Positive Generalized Vandermonde Linear System
• Accurate computations with totally positive Bernstein-Vandermonde matrices
• Totally positive matrices

This page was built for publication: Total positivity and accurate computations with Gram matrices of Bernstein bases