Accurate Computations with Totally Nonnegative Matrices
From MaRDI portal
Publication:3516125
DOI10.1137/04061903XzbMath1198.65057OpenAlexW2158200065MaRDI QIDQ3516125
Publication date: 1 August 2008
Published in: SIAM Journal on Matrix Analysis and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/04061903x
algorithmnumerical examplessingular value decompositioneigenvaluesSchur complementinversetotally positive matrixtotally nonnegative matrixbidiagonal decompositionhigh relative accuracy
Numerical computation of eigenvalues and eigenvectors of matrices (65F15) Numerical solutions to overdetermined systems, pseudoinverses (65F20) Positive matrices and their generalizations; cones of matrices (15B48) Direct numerical methods for linear systems and matrix inversion (65F05)
Related Items (76)
On the characterization of totally nonpositive matrices ⋮ Fast and accurate algorithms for Jacobi-Stirling matrices ⋮ Characterizations and accurate computations for tridiagonal Toeplitz matrices ⋮ Numerical problems with the Pascal triangle in moment computation ⋮ On semiring complexity of Schur polynomials ⋮ Accurate computations with Wronskian matrices of Bessel and Laguerre polynomials ⋮ On Tridiagonal Sign Regular Matrices and Generalizations ⋮ Accurate computations with Gram and Wronskian matrices of geometric and Poisson bases ⋮ A Matrix Approach to the Newton Formula and Divided Differences ⋮ Total Positivity: A New Inequality and Related Classes of Matrices ⋮ Accurate computations with matrices related to bases \(\{t^ie^{\lambda t}\}\) ⋮ Accurate computations with collocation matrices of the Lupaş-type \((p,q)\)-analogue of the Bernstein basis ⋮ Tests for the recognition of total positivity ⋮ Accurate bidiagonal decomposition and computations with generalized Pascal matrices ⋮ Accurate computations of matrices with bidiagonal decomposition using methods for totally positive matrices ⋮ Accurate polynomial interpolation by using the Bernstein basis ⋮ Accurate eigenvalues of some generalized sign regular matrices via relatively robust representations ⋮ Accurate eigenvalues of certain sign regular matrices ⋮ Total positivity and accurate computations with Gram matrices of Bernstein bases ⋮ A test and bidiagonal factorization for certain sign regular matrices ⋮ Bidiagonal factorizations with some parameters equal to zero ⋮ Accurate computation of eigenvalues of generalized sign regular quasi-Said-Ball-Vandermonde matrices ⋮ Polynomial total positivity and high relative accuracy through Schur polynomials ⋮ On the accuracy of de Casteljau-type algorithms and Bernstein representations ⋮ Accurate and fast computations with positive extended Schoenmakers-Coffey matrices ⋮ Bidiagonal decompositions of Vandermonde-type matrices of arbitrary rank ⋮ Accurate computations for eigenvalues of products of Cauchy-polynomial-Vandermonde matrices ⋮ Schur polynomials do not have small formulas if the determinant does not ⋮ The accurate and efficient solutions of linear systems for generalized sign regular matrices with certain signature ⋮ High relative accuracy through Newton bases ⋮ Accurate and fast computations with Green matrices ⋮ Gaussian Markov random fields and totally positive matrices ⋮ Depth of almost strictly sign regular matrices ⋮ On computing modified moments for half-range Hermite weights ⋮ Extremal and optimal properties of B-bases collocation matrices ⋮ Fast simplicial quadrature-based finite element operators using Bernstein polynomials ⋮ Componentwise error analysis for the block LU factorization of totally nonnegative matrices ⋮ Accurate computation of the Moore-Penrose inverse of strictly totally positive matrices ⋮ An optimal test for almost strict total positivity ⋮ Almost strictly totally negative matrices: an algorithmic characterization ⋮ Bidiagonal decompositions of oscillating systems of vectors ⋮ Componentwise backward error analysis of Neville elimination ⋮ Rank structure properties of rectangular matrices admitting bidiagonal-type factorizations ⋮ Accurate eigenvalues and exact zero Jordan blocks of totally nonnegative matrices ⋮ Conditioning and accurate computations with Pascal 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 computations with Lupaş matrices ⋮ Accurate Computations and Applications of Some Classes of Matrices ⋮ Accurate bidiagonal decomposition of totally positive Cauchy-Vandermonde matrices and applications ⋮ Fast inversion of the simplicial Bernstein mass matrix ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Accurate computations with Said-Ball-Vandermonde 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 ⋮ Unnamed Item ⋮ Accurate solutions of structured generalized Kronecker product linear systems ⋮ Accurate computations with collocation and Wronskian matrices of Jacobi polynomials ⋮ Polynomial least squares fitting in the Bernstein basis ⋮ Similarity to totally positive matrices and accurate computations ⋮ Accurate computations with Wronskian matrices ⋮ Bidiagonal decomposition of rectangular totally positive Said-Ball-Vandermonde matrices: error analysis, perturbation theory and applications ⋮ Subtraction-free complexity, cluster transformations, and spanning trees ⋮ Numerical methods for accurate computation of the eigenvalues of Hermitian matrices and the singular values of general matrices ⋮ Accurate algorithms for Bessel matrices ⋮ Computing eigenvalues of quasi-generalized Vandermonde matrices to high relative accuracy ⋮ On parametrization of totally nonpositive matrices and applications ⋮ Least squares problems involving generalized Kronecker products and application to bivariate polynomial regression ⋮ Compact cubic splines ⋮ On computing Schur functions and series thereof ⋮ Relative Perturbation Analysis for Eigenvalues and Singular Values of Totally Nonpositive Matrices ⋮ Matrices with Bidiagonal Decomposition, Accurate Computations and Corner Cutting Algorithms ⋮ Accurate Computations with Collocation Matrices of q-Bernstein Polynomials ⋮ Accurate Computation of Generalized Eigenvalues of Regular SR-BP Pairs ⋮ Algorithm 960
Uses Software
This page was built for publication: Accurate Computations with Totally Nonnegative Matrices
