Sciweavers

8669 search results - page 89 / 1734
» Computing matrix representations
Sort
View
ICPADS
2002
IEEE
14 years 2 months ago
Adaptive Matrix Multiplication in Heterogeneous Environments
In this paper, an adaptive matrix multiplication algorithm for dynamic heterogeneous environments is developed and evaluated. Unlike the state-of-the-art approaches, where load ba...
Bo Hong, Viktor K. Prasanna
JCM
2008
76views more  JCM 2008»
13 years 9 months ago
Waterfilling Estimation for AWGN MIMO Channel Modeled as a Random Matrix
Waterfilling solutions provide optimal power distribution in multiple-input multiple-output (MIMO) system design. However, the optimal distribution is usually obtained through cost...
Victor M. Vergara, Silvio E. Barbin, Ramiro Jordan
JSC
2002
61views more  JSC 2002»
13 years 8 months ago
Subquadratic Computation of Vector Generating Polynomials and Improvement of the Block Wiedemann Algorithm
This paper describes a new algorithm for computing linear generators (vector generating polynomials) for matrix sequences, running in subquadratic time. This algorithm applies in ...
Emmanuel Thomé
PARLE
1994
14 years 16 days ago
Run-Time Optimization of Sparse Matrix-Vector Multiplication on SIMD Machines
Sparse matrix-vector multiplication forms the heart of iterative linear solvers used widely in scientific computations (e.g., finite element methods). In such solvers, the matrix-v...
Louis H. Ziantz, Can C. Özturan, Boleslaw K. ...
MP
2006
93views more  MP 2006»
13 years 9 months ago
Computation of Error Bounds for P-matrix Linear Complementarity Problems
Abstract We give new error bounds for the linear complementarity problem where the involved matrix is a P-matrix. Computation of rigorous error bounds can be turned into a P-matrix...
Xiaojun Chen, Shuhuang Xiang