Linear-Time Copositivity Detection for Tridiagonal Matrices and Extension to Block-Tridiagonality

DOI10.1137/S0895479898341487zbMath0953.65028OpenAlexW1974700317MaRDI QIDQ4943663

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

zbMATH Keywords

tridiagonal matrixcopositive matrixblock pivotingcopositivity detectionrecursive dimensional reduction strategy

Mathematics Subject Classification ID

Computational methods for sparse matrices (65F50) Hermitian, skew-Hermitian, and related matrices (15B57)

Related Items (8)

SPN graphs: when copositive = SPN ⋮ Copositive optimization -- recent developments and applications ⋮ Think co(mpletely)positive! Matrix properties, examples and a clustered bibliography on copositive optimization ⋮ An algorithm for determining copositive matrices ⋮ Copositivity detection by difference-of-convex decomposition and \(\omega \)-subdivision ⋮ Algorithmic copositivity detection by simplicial partition ⋮ A Complete Semidefinite Algorithm for Detecting Copositive Matrices and Tensors ⋮ Detecting copositivity of a symmetric matrix by an adaptive ellipsoid-based approximation scheme

This page was built for publication: Linear-Time Copositivity Detection for Tridiagonal Matrices and Extension to Block-Tridiagonality