Amanote Research
Register
Sign In
Finding the Distance to Instability of a Large Sparse Matrix
doi 10.1109/cacsd.2006.285440
Full Text
Open PDF
Abstract
Available in
full text
Date
October 1, 2006
Authors
Daniel Kressner
Publisher
IEEE
Related search
Finding Frequent Patterns in a Large Sparse Graph
Finding a Large Submatrix of a Gaussian Random Matrix
Annals of Statistics
Uncertainty
Statistics
Probability
Sparse Estimation of a Covariance Matrix
Biometrika
Statistics
Probability
Uncertainty
Applied Mathematics
Biological Sciences
Agricultural
Mathematics
The Distance Matrix of a Bidirected Tree
Electronic Journal of Linear Algebra
Number Theory
Algebra
Reducing the Total Bandwidth of a Sparse Unsymmetric Matrix
SIAM Journal on Matrix Analysis and Applications
Analysis
Sparse Matrix Multiplication: The Distributed Block-Compressed Sparse Row Library
Parallel Computing
Computer Graphics
Computer Networks
Hardware
Communications
Computer-Aided Design
Architecture
Theoretical Computer Science
Artificial Intelligence
Software
Fast Sparse Matrix Multiplication
Lecture Notes in Computer Science
Computer Science
Theoretical Computer Science
Visualizing Sparse Matrix Computations
A Lower Bound on Cycle-Finding in Sparse Digraphs