Accurate Computations with Collocation Matrices of q-Bernstein Polynomials
From MaRDI portal
Publication:5264999
DOI10.1137/140993211zbMath1319.65025MaRDI QIDQ5264999
Jorge Delgado, Juan Manuel Peña
Publication date: 21 July 2015
Published in: SIAM Journal on Matrix Analysis and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/140993211
eigenvalue; totally positive matrices; singular value; accurate computations; bidiagonal decompositions; collocation matrices; \(q\)-Bernstein basis; \(q\)-Bernstein-Vandermonde matrices
65F15: Numerical computation of eigenvalues and eigenvectors of matrices
65F20: Numerical solutions to overdetermined systems, pseudoinverses
Related Items
Accurate Computations and Applications of Some Classes of Matrices, A qd-type method for computing generalized singular values of BF matrix pairs with sign regularity to high relative accuracy, Characterizations and accurate computations for tridiagonal Toeplitz matrices, On the accuracy of de Casteljau-type algorithms and Bernstein representations, Bidiagonal decompositions of Vandermonde-type matrices of arbitrary rank, An evaluation algorithm for \(q\)-Bézier triangular patches formed by convex combinations, Accurate and fast computations with Green matrices, The \(q\)-versions of the Bernstein operator: from mere analogies to further developments, Accurate solutions of product linear systems associated with rank-structured matrices, Computing singular value decompositions of parameterized matrices with total nonpositivity to high relative accuracy, On the convergence of the \(q\)-Bernstein polynomials for power functions, Accurate solutions of structured generalized Kronecker product linear systems, Accurate computations with Wronskian matrices, Computing eigenvalues of quasi-generalized Vandermonde matrices to high relative accuracy, Accurate computations with Gram and Wronskian matrices of geometric and Poisson bases, Accurate eigenvalues of some generalized sign regular matrices via relatively robust representations, Accurate computations for eigenvalues of products of Cauchy-polynomial-Vandermonde matrices, Extremal and optimal properties of B-bases collocation matrices, Error analysis, perturbation theory and applications of the bidiagonal decomposition of rectangular totally positive h-Bernstein-Vandermonde matrices, Accurate singular values of a class of parameterized negative matrices, Accurate bidiagonal decomposition of totally positive h-Bernstein-Vandermonde matrices and applications, Accurate solutions of weighted least squares problems associated with rank-structured matrices, Accurate algorithms for Bessel matrices, Accurate bidiagonal decomposition and computations with generalized Pascal matrices, Accurate and fast computations with positive extended Schoenmakers-Coffey matrices
Uses Software
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
- Explicit factorization of the Vandermonde matrix
- \(q\)-Bernstein polynomials and Bézier curves
- Shape preserving representations and optimality of the Bernstein basis
- Computing the singular value decomposition with high relative accuracy
- On the \(q\)-Bernstein polynomials of rational functions with real poles
- Accurate computations with collocation matrices of rational bases
- Generating Functions for the $q$-Bernstein Bases
- Accurate Computations with Totally Nonnegative Matrices
- Convexity and generalized Bernstein polynomials
- Accurate Eigenvalues and SVDs of Totally Nonnegative Matrices
- The Accurate and Efficient Solution of a Totally Positive Generalized Vandermonde Linear System
- Accurate computations with totally positive Bernstein-Vandermonde matrices
- Totally positive matrices
