Tests for the recognition of total positivity
From MaRDI portal
Publication:2392957
DOI10.1007/s40324-013-0008-zzbMath1273.65042OpenAlexW2032918950MaRDI QIDQ2392957
Publication date: 5 August 2013
Published in: S\(\vec{\text{e}}\)MA Journal (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s40324-013-0008-z
total positivitytotally positive matricesaccurate computationsneville eliminationsign regular matrices
Numerical computation of eigenvalues and eigenvectors of matrices (65F15) Eigenvalues, singular values, and eigenvectors (15A18) Numerical computation of determinants (65F40) Computer-aided design (modeling of curves and surfaces) (65D17) Direct numerical methods for linear systems and matrix inversion (65F05)
Related Items
On the characterization of totally nonpositive matrices ⋮ Diagonal entries of the combined matrix of a totally negative matrix ⋮ An optimal test for almost strict total positivity ⋮ Accurate Computations and Applications of Some Classes of Matrices
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Totally positive bases for shape preserving curve design and optimality of B-splines
- Backward error analysis of Neville elimination
- Inner totally positive matrices
- Characterizations and stable tests for the Routh--Hurwitz conditions and for total positivity
- Progressive iterative approximation and bases with the fastest convergence rates
- On totally positive matrices
- Coincidence properties of birth and death processes
- A fast and accurate algorithm for solving Bernstein-Vandermonde linear systems
- Bidiagonal decompositions of oscillating systems of vectors
- Bidiagonal factorizations and quasi-oscillatory rectangular matrices
- Accurate computations with Said-Ball-Vandermonde matrices
- A collection of examples where Neville elimination outperforms Gaussian elimination
- A survey of total positivity
- Corner cutting algorithms for the Bézier representation of free form curves
- Factorizations of Cauchy-Vandermonde matrices
- Total positivity and Neville elimination
- Almost strictly totally positive matrices
- Some properties of totally positive matrices
- Backward error analysis for totally positive linear systems
- Strictly totally positive systems
- Scaled pivoting in Gauss and Neville elimination for totally positive systems
- A test for strict sign-regularity
- Least supported bases and local linear independence
- A matricial description of Neville elimination with applications to total positivity
- Shape preserving representations for trigonometric polynomial curves
- Consecutive-column and -row properties of matrices and the Loewner-Neville factorization
- On an alternative to Gerschgorin circles and ovals of Cassini
- Optimally stable multivariate bases
- On the optimal stability of bases of univariate functions
- Corner cutting algorithms associated with optimal shape preserving representations
- Almost strict total positivity and a class of Hurwitz polynomials
- Intervals of almost totally positive matrices
- Shape preserving representations and optimality of the Bernstein basis
- Combinatorics and total positivity
- On the characterization of almost strictly totally positive matrices
- Computing the singular value decomposition with high relative accuracy
- The LU-factorization of totally positive matrices
- Accurate computations with collocation matrices of rational bases
- Conditioning and accurate computations with Pascal matrices
- A note on the optimal stability of bases of univariate functions
- On sufficient conditions for the total positivity and for the multiple positivity of matrices
- Corner cutting systems
- A reduction theorem for totally positive matrices
- A Class of P-Matrices with Applications to the Localization of the Eigenvalues of a Real Matrix
- Accurate computations of matrices with bidiagonal decomposition using methods for totally positive matrices
- A stable test for strict sign regularity
- Eigenvalue Localization Refinements for Matrices Related to Positivity
- Total Positivity, $QR$ Factorization, and Neville Elimination
- Running Relative Error for the Evaluation of Polynomials
- Eigenvalue Localization for Totally Positive Matrices
- A Corner Cutting Algorithm for Evaluating Rational Bézier Surfaces and the Optimal Stability of the Basis
- Accurate Computations with Totally Nonnegative Matrices
- Optimal Conditioning of Bernstein Collocation Matrices
- Variation Diminishing Transformations: A Direct Approach to Total Positivity and its Statistical Applications
- Total positivity and the embedding problem for Markov chains
- A Sufficient condition for strict total positivity of a matrix
- Double Bruhat cells and total positivity
- Bidiagonal Factorizations of Totally Nonnegative Matrices
- Scaled Pivots and Scaled Partial Pivoting Strategies
- On the Multivariate Horner Scheme
- A Totally Positive Factorization of Rectangular Matrices by the Neville Elimination
- Accuracy and Stability of Numerical Algorithms
- Matrices with Bidiagonal Decomposition, Accurate Computations and Corner Cutting Algorithms
- Exclusion and Inclusion Intervals for the Real Eigenvalues of Positive Matrices
- Accurate Eigenvalues and SVDs of Totally Nonnegative Matrices
- The Accurate and Efficient Solution of a Totally Positive Generalized Vandermonde Linear System
- Characterizations and Decompositions of Almost Strictly Positive Matrices
- Totally positive matrices
- Determinantal criteria for total positivity
- Total positivity: tests and parametrizations.
