Tests for the recognition of total positivity
From MaRDI portal
Publication:2392957
accurate computationstotal positivitytotally positive matricesneville eliminationsign regular matrices
Direct numerical methods for linear systems and matrix inversion (65F05) Eigenvalues, singular values, and eigenvectors (15A18) Numerical computation of eigenvalues and eigenvectors of matrices (65F15) Computer-aided design (modeling of curves and surfaces) (65D17) Numerical computation of determinants (65F40)
Recommendations
Cites work
- scientific article; zbMATH DE number 3144516 (Why is no real title available?)
- scientific article; zbMATH DE number 4058754 (Why is no real title available?)
- scientific article; zbMATH DE number 1136347 (Why is no real title available?)
- scientific article; zbMATH DE number 3348831 (Why is no real title available?)
- A Corner Cutting Algorithm for Evaluating Rational Bézier Surfaces and the Optimal Stability of the Basis
- A Sufficient condition for strict total positivity of a matrix
- A Totally Positive Factorization of Rectangular Matrices by the Neville Elimination
- A class of \(P\)-matrices with applications to the localization of the eigenvalues of a real matrix
- A collection of examples where Neville elimination outperforms Gaussian elimination
- A fast and accurate algorithm for solving Bernstein-Vandermonde linear systems
- A matricial description of Neville elimination with applications to total positivity
- A note on the optimal stability of bases of univariate functions
- A reduction theorem for totally positive matrices
- A stable test for strict sign regularity
- A survey of total positivity
- A test for strict sign-regularity
- Accuracy and Stability of Numerical Algorithms
- Accurate Computations with Totally Nonnegative Matrices
- Accurate Eigenvalues and SVDs of Totally Nonnegative Matrices
- Accurate computations of matrices with bidiagonal decomposition using methods for totally positive matrices.
- Accurate computations with Said-Ball-Vandermonde matrices
- Accurate computations with collocation matrices of rational bases
- Almost strict total positivity and a class of Hurwitz polynomials
- Almost strictly totally positive matrices
- Backward error analysis for totally positive linear systems
- Backward error analysis of Neville elimination
- Bidiagonal Factorizations of Totally Nonnegative Matrices
- Bidiagonal decompositions of oscillating systems of vectors
- Bidiagonal factorizations and quasi-oscillatory rectangular matrices
- Characterizations and Decompositions of Almost Strictly Positive Matrices
- Characterizations and stable tests for the Routh--Hurwitz conditions and for total positivity
- Coincidence properties of birth and death processes
- Combinatorics and total positivity
- Computing the singular value decomposition with high relative accuracy
- Conditioning and accurate computations with Pascal matrices
- Consecutive-column and -row properties of matrices and the Loewner-Neville factorization
- Corner cutting algorithms associated with optimal shape preserving representations
- Corner cutting algorithms for the Bézier representation of free form curves
- Corner cutting systems
- Determinantal criteria for total positivity
- Double Bruhat cells and total positivity
- Eigenvalue localization for totally positive matrices
- Eigenvalue localization refinements for matrices related to positivity
- Exclusion and Inclusion Intervals for the Real Eigenvalues of Positive Matrices
- Factorizations of Cauchy-Vandermonde matrices
- Inner totally positive matrices
- Intervals of almost totally positive matrices
- Least supported bases and local linear independence
- Matrices with bidiagonal decomposition, accurate computations and corner cutting algorithms
- On an alternative to Gerschgorin circles and ovals of Cassini
- On sufficient conditions for the total positivity and for the multiple positivity of matrices
- On the Multivariate Horner Scheme
- On the characterization of almost strictly totally positive matrices
- On the optimal stability of bases of univariate functions
- On totally positive matrices
- Optimal conditioning of Bernstein collocation matrices
- Optimally stable multivariate bases
- Progressive iterative approximation and bases with the fastest convergence rates
- Running relative error for the evaluation of polynomials
- Scaled Pivots and Scaled Partial Pivoting Strategies
- Scaled pivoting in Gauss and Neville elimination for totally positive systems
- Shape preserving representations and optimality of the Bernstein basis
- Shape preserving representations for trigonometric polynomial curves
- Shape preserving representations in computer aided geometric design
- Some properties of totally positive matrices
- Strictly totally positive systems
- The Accurate and Efficient Solution of a Totally Positive Generalized Vandermonde Linear System
- The LU-factorization of totally positive matrices
- Total Positivity, $QR$ Factorization, and Neville Elimination
- Total positivity and Neville elimination
- Total positivity and the embedding problem for Markov chains
- Total positivity: tests and parametrizations.
- Totally nonnegative matrices
- Totally positive bases for shape preserving curve design and optimality of B-splines
- Totally positive matrices
- Totally positive matrices
- Variation Diminishing Transformations: A Direct Approach to Total Positivity and its Statistical Applications
Cited in
(18)- Accurate computations and applications of some classes of matrices
- Correction to a Theorem on Total Positivity
- Determinantal criteria for total positivity
- Scaffoldings of totally positive matrices and line insertion
- The realization of positive definite matrices via planar networks and mixing-type sub-cluster algebras
- Characterizing total positivity: Single vector tests via linear complementarity, sign non‐reversal and variation diminution
- Totally positive matrices
- Improved tests and characterizations of totally nonnegative matrices
- An optimal test for almost strict total positivity
- On sufficient conditions for the total positivity and for the multiple positivity of matrices
- Parametrizations of \(k\)-nonnegative matrices: cluster algebras and \(k\)-positivity tests
- Exploring the total positivity of yields correlations
- On the characterization of totally nonpositive matrices
- Diagonal entries of the combined matrix of a totally negative matrix
- Efficient recognition of totally nonnegative matrix cells
- Characterizations and stable tests for the Routh--Hurwitz conditions and for total positivity
- On parametrization of totally nonpositive matrices and applications
- Sign non-reversal property for totally non-negative and totally positive matrices, and testing total positivity of their interval hull
This page was built for publication: Tests for the recognition of total positivity
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2392957)
