Tests for the recognition of total positivity
From MaRDI portal
Publication:2392957
DOI10.1007/S40324-013-0008-ZzbMATH Open1273.65042OpenAlexW2032918950MaRDI QIDQ2392957FDOQ2392957
Authors: J. M. Peña 
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
Recommendations
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)
Cites Work
- Computing the singular value decomposition with high relative accuracy
- Shape preserving representations and optimality of the Bernstein basis
- Totally positive matrices
- A class of \(P\)-matrices with applications to the localization of the eigenvalues of a real matrix
- Bidiagonal Factorizations of Totally Nonnegative Matrices
- Accuracy and Stability of Numerical Algorithms
- Title not available (Why is that?)
- Total positivity and Neville elimination
- A matricial description of Neville elimination with applications to total positivity
- Shape preserving representations for trigonometric polynomial curves
- Combinatorics and total positivity
- Accurate computations with collocation matrices of rational bases
- Title not available (Why is that?)
- Accurate Computations with Totally Nonnegative Matrices
- Optimal conditioning of Bernstein collocation matrices
- Double Bruhat cells and total positivity
- Title not available (Why is that?)
- Accurate Eigenvalues and SVDs of Totally Nonnegative Matrices
- The Accurate and Efficient Solution of a Totally Positive Generalized Vandermonde Linear System
- Total positivity: tests and parametrizations.
- A fast and accurate algorithm for solving Bernstein-Vandermonde linear systems
- Accurate computations with Said-Ball-Vandermonde matrices
- A stable test for strict sign regularity
- Eigenvalue localization for totally positive matrices
- Totally positive matrices
- Conditioning and accurate computations with Pascal matrices
- Shape preserving representations in computer aided geometric design
- Totally nonnegative matrices
- Eigenvalue localization refinements for matrices related to positivity
- On an alternative to Gerschgorin circles and ovals of Cassini
- On the characterization of almost strictly totally positive matrices
- Total positivity and the embedding problem for Markov chains
- Characterizations and stable tests for the Routh--Hurwitz conditions and for total positivity
- Variation Diminishing Transformations: A Direct Approach to Total Positivity and its Statistical Applications
- Coincidence properties of birth and death processes
- On sufficient conditions for the total positivity and for the multiple positivity of matrices
- A test for strict sign-regularity
- The LU-factorization of totally positive matrices
- Total Positivity, $QR$ Factorization, and Neville Elimination
- A Totally Positive Factorization of Rectangular Matrices by the Neville Elimination
- Title not available (Why is that?)
- Determinantal criteria for total positivity
- Almost strictly totally positive matrices
- Some properties of totally positive matrices
- Characterizations and Decompositions of Almost Strictly Positive Matrices
- Inner totally positive matrices
- A collection of examples where Neville elimination outperforms Gaussian elimination
- Backward error analysis of Neville elimination
- Progressive iterative approximation and bases with the fastest convergence rates
- A reduction theorem for totally positive matrices
- On totally positive matrices
- Consecutive-column and -row properties of matrices and the Loewner-Neville factorization
- On the optimal stability of bases of univariate functions
- Least supported bases and local linear independence
- Accurate computations of matrices with bidiagonal decomposition using methods for totally positive matrices.
- Corner cutting algorithms associated with optimal shape preserving representations
- Totally positive bases for shape preserving curve design and optimality of B-splines
- Factorizations of Cauchy-Vandermonde matrices
- On the Multivariate Horner Scheme
- Corner cutting algorithms for the Bézier representation of free form curves
- 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
- Scaled Pivots and Scaled Partial Pivoting Strategies
- Backward error analysis for totally positive linear systems
- Strictly totally positive systems
- Optimally stable multivariate bases
- Scaled pivoting in Gauss and Neville elimination for totally positive systems
- Corner cutting systems
- Intervals of almost totally positive matrices
- A survey of total positivity
- Running relative error for the evaluation of polynomials
- Bidiagonal decompositions of oscillating systems of vectors
- Almost strict total positivity and a class of Hurwitz polynomials
- Bidiagonal factorizations and quasi-oscillatory rectangular matrices
- Exclusion and Inclusion Intervals for the Real Eigenvalues of Positive Matrices
- Matrices with bidiagonal decomposition, accurate computations and corner cutting algorithms
- A note on the optimal stability of bases of univariate functions
Cited In (18)
- Diagonal entries of the combined matrix of a totally negative matrix
- Determinantal criteria for total positivity
- Sign non-reversal property for totally non-negative and totally positive matrices, and testing total positivity of their interval hull
- Totally positive matrices
- An optimal test for almost strict total positivity
- Exploring the total positivity of yields correlations
- On sufficient conditions for the total positivity and for the multiple positivity of matrices
- Characterizations and stable tests for the Routh--Hurwitz conditions and for total positivity
- Parametrizations of \(k\)-nonnegative matrices: cluster algebras and \(k\)-positivity tests
- Efficient recognition of totally nonnegative matrix cells
- Improved tests and characterizations of totally nonnegative matrices
- On the characterization of totally nonpositive matrices
- On parametrization of totally nonpositive matrices and applications
- Accurate computations and applications of some classes of matrices
- Scaffoldings of totally positive matrices and line insertion
- The realization of positive definite matrices via planar networks and mixing-type sub-cluster algebras
- Correction to a Theorem on Total Positivity
- Characterizing total positivity: Single vector tests via linear complementarity, sign non‐reversal and variation diminution
Uses Software
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)
