Matrices with Bidiagonal Decomposition, Accurate Computations and Corner Cutting Algorithms

DOI10.1007/978-3-0348-0648-0_3zbMath1317.65059OpenAlexW70793372MaRDI QIDQ5261221

Juan Manuel Peña, Alvaro Barreras

Publication date: 2 July 2015

Published in: Concrete Operators, Spectral Theory, Operators in Harmonic Analysis and Approximation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-0348-0648-0_3

zbMATH Keywords

totally positive matricescomputer aided geometric designbidiagonal decompositionhigh relative accuracycorner cutting algorithm

Mathematics Subject Classification ID

Factorization of matrices (15A23) Computer-aided design (modeling of curves and surfaces) (65D17)

Related Items (1)

Tests for the recognition of total positivity

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A fast and accurate algorithm for solving Bernstein-Vandermonde linear systems
• Accurate computations with Said-Ball-Vandermonde matrices
• Computing curves invariant under halving
• Corner cutting algorithms for the Bézier representation of free form curves
• Total positivity and Neville elimination
• Accurate SVDs of weakly diagonally dominant M-matrices
• LDU decompositions with \(L\) and \(U\) well conditioned
• Accurate computations of matrices with bidiagonal decomposition using methods for totally positive matrices
• Accurate Computations with Totally Nonnegative Matrices
• Bidiagonal Factorizations of Totally Nonnegative Matrices
• Accurate Eigenvalues and SVDs of Totally Nonnegative Matrices
• The Accurate and Efficient Solution of a Totally Positive Generalized Vandermonde Linear System
• Totally positive matrices

This page was built for publication: Matrices with Bidiagonal Decomposition, Accurate Computations and Corner Cutting Algorithms