Sciweavers

412 search results - page 22 / 83
» Diagonalization
Sort
View
ICCS
2005
Springer
14 years 27 days ago
Vectorized Sparse Matrix Multiply for Compressed Row Storage Format
Abstract. The innovation of this work is a simple vectorizable algorithm for performing sparse matrix vector multiply in compressed sparse row (CSR) storage format. Unlike the vect...
Eduardo F. D'Azevedo, Mark R. Fahey, Richard Tran ...
MOC
2002
120views more  MOC 2002»
13 years 7 months ago
Analysis of iterative methods for saddle point problems: a unified approach
In this paper two classes of iterative methods for saddle point problems are considered: inexact Uzawa algorithms and a class of methods with symmetric preconditioners. In both cas...
Walter Zulehner
COMBINATORICA
2008
123views more  COMBINATORICA 2008»
13 years 6 months ago
Counting canonical partitions in the random graph
Algorithms are given for computing the number of n-element diagonal sets and the number of n-element strongly diagonal sets of binary sequences of length at most 2n - 2. The first...
Jean A. Larson
DAC
2006
ACM
14 years 8 months ago
Fast analysis of structured power grid by triangularization based structure preserving model order reduction
In this paper, a Triangularization Based Structure preserving (TBS) model order reduction is proposed to verify power integrity of on-chip structured power grid. The power grid is...
Hao Yu, Yiyu Shi, Lei He
ICC
2008
IEEE
134views Communications» more  ICC 2008»
14 years 1 months ago
Non-Differential DSTBCs for Partially-Coherent Cooperative Communication
— In a distributed space-time coding scheme, based on the relay channel model, the relay nodes co-operate to linearly process the transmitted signal from the source and forward t...
Jagadeesh Harshan, B. Sundar Rajan