598 search results - page 5 / 120 » The Structure of Sparse Resultant Matrices |
105
click to vote
ISSAC
2007
Springer
15 years 9 months ago
2007
Springer
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...
121
Voted
CF
2005
ACM
15 years 5 months ago
2005
ACM
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...
124
Voted
CORR
2010
Springer
15 years 3 months ago
2010
Springer
Compressive sensing predicts that sufficiently sparse vectors can be recovered from highly incomplete information. Efficient recovery methods such as 1-minimization find the sparse...
138
Voted
SIAMMAX
2010
14 years 10 months ago
2010
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...
120
click to vote
IPPS
2008
IEEE
15 years 10 months ago
2008
IEEE
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 ...