Sciweavers

1802 search results - page 13 / 361
» Sparse Computations with PEI
Sort
View
ISSAC
2007
Springer
83views Mathematics» more  ISSAC 2007»
14 years 26 days ago
Parallel computation of the rank of large sparse matrices from algebraic K-theory
This paper deals with the computation of the rank and some integer Smith forms of a series of sparse matrices arising in algebraic K-theory. The number of non zero entries in the ...
Jean-Guillaume Dumas, Philippe Elbaz-Vincent, Pasc...
APLAS
2004
ACM
14 years 4 days ago
A MATLAB-Based Code Generator for Sparse Matrix Computations
Abstract. We present a matrix language compiler CMC which translates annotated MATLAB scripts into Fortran 90 programs. Distinguishing features of CMC include its applicability to ...
Hideyuki Kawabata, Mutsumi Suzuki, Toshiaki Kitamu...
IPPS
2000
IEEE
13 years 11 months ago
Ordering Unstructured Meshes for Sparse Matrix Computations on Leading Parallel Systems
Abstract. Computer simulations of realistic applications usually require solving a set of non-linear partial di erential equations PDEs over a nite region. The process of obtaini...
Leonid Oliker, Xiaoye S. Li, Gerd Heber, Rupak Bis...
CORR
1999
Springer
65views Education» more  CORR 1999»
13 years 6 months ago
Unambiguous Computation: Boolean Hierarchies and Sparse Turing-Complete Sets
It is known that for any class C closed under union and intersection, the Boolean closure of C, the Boolean hierarchy over C, and the symmetric difference hierarchy over C all are ...
Lane A. Hemaspaandra, Jörg Rothe
ISAAC
2010
Springer
233views Algorithms» more  ISAAC 2010»
13 years 4 months ago
Computing Sparse Multiples of Polynomials
We consider the problem of finding a sparse multiple of a polynomial. Given f F[x] of degree d, and a desired sparsity t, our goal is to determine if there exists a multiple h F[...
Mark Giesbrecht, Daniel S. Roche, Hrushikesh Tilak