Sciweavers

282 search results - page 8 / 57
» Additive Preconditioning for Matrix Computations
Sort
View
ASAP
2006
IEEE
121views Hardware» more  ASAP 2006»
14 years 2 months ago
Reconfigurable Fixed Point Dense and Sparse Matrix-Vector Multiply/Add Unit
In this paper, we propose a reconfigurable hardware accelerator for fixed-point-matrix-vector-multiply/add operations, capable to work on dense and sparse matrices formats. The pr...
Humberto Calderon, Stamatis Vassiliadis
COMBINATORICS
2006
107views more  COMBINATORICS 2006»
13 years 11 months ago
The Linear Complexity of a Graph
The linear complexity of a matrix is a measure of the number of additions, subtractions, and scalar multiplications required to multiply that matrix and an arbitrary vector. In th...
David L. Neel, Michael E. Orrison
ISSAC
1994
Springer
165views Mathematics» more  ISSAC 1994»
14 years 2 months ago
Constructing Permutation Representations for Large Matrix Groups
New techniques, both theoretical and practical, are presented for constructing a permutation representation for a matrix group. We assume that the resulting permutation degree, n,...
Gene Cooperman, Larry Finkelstein, Bryant W. York,...
COMPGEOM
2011
ACM
13 years 2 months ago
Zigzag persistent homology in matrix multiplication time
We present a new algorithm for computing zigzag persistent homology, an algebraic structure which encodes changes to homology groups of a simplicial complex over a sequence of sim...
Nikola Milosavljevic, Dmitriy Morozov, Primoz Skra...
CORR
2007
Springer
74views Education» more  CORR 2007»
13 years 10 months ago
Redesigning Decision Matrix Method with an indeterminacy-based inference process
For academics and practitioners concerned with computers, business and mathematics, one central issue is supporting decision makers. In this paper, we propose a generalization of ...
Jose L. Salmeron, Florentin Smarandache