Linear-Time Copositivity Detection for Tridiagonal Matrices and Extension to Block-Tridiagonality
DOI10.1137/S0895479898341487zbMATH Open0953.65028OpenAlexW1974700317MaRDI QIDQ4943663FDOQ4943663
Authors: Immanuel M. Bomze
Publication date: 19 March 2000
Published in: SIAM Journal on Matrix Analysis and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/s0895479898341487
Recommendations
tridiagonal matrixcopositive matrixblock pivotingcopositivity detectionrecursive dimensional reduction strategy
Computational methods for sparse matrices (65F50) Hermitian, skew-Hermitian, and related matrices (15B57)
Cited In (8)
- Copositivity detection by difference-of-convex decomposition and \(\omega \)-subdivision
- Detecting copositivity of a symmetric matrix by an adaptive ellipsoid-based approximation scheme
- A complete semidefinite algorithm for detecting copositive matrices and tensors
- Think co(mpletely)positive! Matrix properties, examples and a clustered bibliography on copositive optimization
- Copositive optimization -- recent developments and applications
- SPN graphs: when copositive = SPN
- An algorithm for determining copositive matrices
- Algorithmic copositivity detection by simplicial partition
This page was built for publication: Linear-Time Copositivity Detection for Tridiagonal Matrices and Extension to Block-Tridiagonality
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4943663)