Bounds on the spectral sparsification of symmetric and off-diagonal nonnegative real matrices
From MaRDI portal
(Redirected from Publication:5063290)
Abstract: We say that a square real matrix is emph{off-diagonal nonnegative} if and only if all entries outside its diagonal are nonnegative real numbers. In this note we show that for any off-diagonal nonnegative symmetric matrix , there exists a nonnegative symmetric matrix which is sparse and close in spectrum to .
Recommendations
Cites work
- A matrix hyperbolic cosine algorithm and applications
- A useful variant of the Davis-Kahan theorem for statisticians
- Constructing linear-sized spectral sparsification in almost-linear time
- scientific article; zbMATH DE number 47363 (Why is no real title available?)
- scientific article; zbMATH DE number 967931 (Why is no real title available?)
- Principal component analysis.
- Quadratic programming with one negative eigenvalue is NP-hard
- Spectral sparsification of graphs
- The Rotation of Eigenvectors by a Perturbation. III
This page was built for publication: Bounds on the spectral sparsification of symmetric and off-diagonal nonnegative real matrices
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5063290)