Matrices with bidiagonal decomposition, accurate computations and corner cutting algorithms

DOI10.1007/978-3-0348-0648-0_3MaRDI QIDQ5261221zbMATH OpenOpenAlexFDO

Authors Álvaro Barreras, J. M. Peña

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

bidiagonal decompositioncomputer aided geometric designcorner cutting algorithmhigh relative accuracytotally positive matrices

Mathematics Subject Classification ID

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

Recommendations

• Accurate bidiagonal decomposition and computations with generalized Pascal matrices
• Accurate computations with collocation matrices of a general class of bases
• Accurate computations of matrices with bidiagonal decomposition using methods for totally positive matrices.
• Accurate bidiagonal decomposition of totally positive h-Bernstein-Vandermonde matrices and applications
• Bidiagonal decomposition of rectangular totally positive Said-Ball-Vandermonde matrices: error analysis, perturbation theory and applications

Cites work

• A fast and accurate algorithm for solving Bernstein-Vandermonde linear systems
• Accurate computations of matrices with bidiagonal decomposition using methods for totally positive matrices.
• Accurate computations with Said-Ball-Vandermonde matrices
• Accurate Computations with Totally Nonnegative Matrices
• Accurate Eigenvalues and SVDs of Totally Nonnegative Matrices
• Accurate SVDs of weakly diagonally dominant M-matrices
• Bidiagonal Factorizations of Totally Nonnegative Matrices
• Computing curves invariant under halving
• Corner cutting algorithms for the Bézier representation of free form curves
• scientific article; zbMATH DE number 1136347 (Why is no real title available?)
• scientific article; zbMATH DE number 3348831 (Why is no real title available?)
• LDU decompositions with \(L\) and \(U\) well conditioned
• The Accurate and Efficient Solution of a Totally Positive Generalized Vandermonde Linear System
• Total positivity and Neville elimination
• Totally nonnegative matrices
• Totally positive matrices
• Totally positive matrices

Cited in

(9)

• Parallel tri- and bi-diagonalization of bordered bidiagonal matrices
• Tests for the recognition of total positivity
• Conditioning and accurate computations with Pascal matrices
• Accurate bidiagonal decomposition and computations with generalized Pascal matrices
• Accurate bidiagonal decomposition of collocation matrices of weighted ϕ ‐transformed systems
• Accelerated bisection techniques for tri‐ and quindiagonal matrices
• Computationally Efficient Decompositions of Oblique Projection Matrices
• Bidiagonal decomposition of rectangular totally positive Said-Ball-Vandermonde matrices: error analysis, perturbation theory and applications
• Accurate bidiagonal factorization of quantum Hilbert matrices

This page was built for publication: Matrices with bidiagonal decomposition, accurate computations and corner cutting algorithms

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