Sciweavers

598 search results - page 5 / 120
» The Structure of Sparse Resultant Matrices
Sort
View
ISSAC
2007
Springer
106views Mathematics» more  ISSAC 2007»
14 years 2 months ago
Numerical techniques for computing the inertia of products of matrices of rational numbers
Consider a rational matrix, particularly one whose entries have large numerators and denominators, but which is presented as a product of very sparse matrices with relatively smal...
John P. May, B. David Saunders, David Harlan Wood
CF
2005
ACM
13 years 10 months ago
Sparse matrix storage revisited
In this paper, we consider alternate ways of storing a sparse matrix and their effect on computational speed. They involve keeping both the indices and the non-zero elements in t...
Malik Silva
CORR
2010
Springer
133views Education» more  CORR 2010»
13 years 8 months ago
Nonuniform Sparse Recovery with Gaussian Matrices
Compressive sensing predicts that sufficiently sparse vectors can be recovered from highly incomplete information. Efficient recovery methods such as 1-minimization find the sparse...
Ulas Ayaz, Holger Rauhut
SIAMMAX
2010
224views more  SIAMMAX 2010»
13 years 3 months ago
Robust Approximate Cholesky Factorization of Rank-Structured Symmetric Positive Definite Matrices
Abstract. Given a symmetric positive definite matrix A, we compute a structured approximate Cholesky factorization A RT R up to any desired accuracy, where R is an upper triangula...
Jianlin Xia, Ming Gu
IPPS
2008
IEEE
14 years 3 months ago
On the representation and multiplication of hypersparse matrices
Multicore processors are marking the beginning of a new era of computing where massive parallelism is available and necessary. Slightly slower but easy to parallelize kernels are ...
Aydin Buluç, John R. Gilbert