Add to ORKGThis article presents new properties of the mesh array for matrix multiplication. In contrast to the standard array that requires 3n-2 steps to complete its computation, the mesh array requires only 2n-1 steps. Symmetries of the mesh array computed values are presented which enhance the efficiency of the array for specific applications. In multiplying symmetric matrices, the results are obtained in 3n/2+1steps. The mesh array is examined for its application as a scrambling system
AbstractThis paper develops optimal algorithms to multiply an n × n symmetric tridiagonal matrix by:...
In the processing of dynamically changing data, for example, radar data (RD), a crucial part is made...
Submitted for publication to IEEE TPDS The performance of both serial and parallel implementations o...
We consider systolic arrays for matrix computations involving complex elements, and show that in cer...
In this paper is investigated a possible optimization of some linear algebra problems which can be s...
In this paper, the index space of the (n×n)-matrix multiply-add problem C = C +A·B is represented as...
AbstractThis paper presents an efficient parallel implementation of matrix multiplication on three p...
A volume-efficient retimed hexagonal array for computing matrix product is described. The new array ...
Effective arranging of numerical data and design of associated computational algorithms are importan...
A volume-efficient retimed hexagonal array for computing matrix product is described. The new array ...
We consider the problem of matrix transpose on mesh-connected processor networks. On the theoretical...
Using super-resolution techniques to estimate the direction that a signal arrived at a radio receive...
In this paper we show how mesh-connected n x n-processor arrays with dynamically reconfigurable buss...
. A distributed algorithm with the same functionality as the single-processor level 3 BLAS operation...
Some level-2 and level-3 Distributed Basic Linear Algebra Subroutines (DBLAS) that have been impleme...
AbstractThis paper develops optimal algorithms to multiply an n × n symmetric tridiagonal matrix by:...
In the processing of dynamically changing data, for example, radar data (RD), a crucial part is made...
Submitted for publication to IEEE TPDS The performance of both serial and parallel implementations o...
We consider systolic arrays for matrix computations involving complex elements, and show that in cer...
In this paper is investigated a possible optimization of some linear algebra problems which can be s...
In this paper, the index space of the (n×n)-matrix multiply-add problem C = C +A·B is represented as...
AbstractThis paper presents an efficient parallel implementation of matrix multiplication on three p...
A volume-efficient retimed hexagonal array for computing matrix product is described. The new array ...
Effective arranging of numerical data and design of associated computational algorithms are importan...
A volume-efficient retimed hexagonal array for computing matrix product is described. The new array ...
We consider the problem of matrix transpose on mesh-connected processor networks. On the theoretical...
Using super-resolution techniques to estimate the direction that a signal arrived at a radio receive...
In this paper we show how mesh-connected n x n-processor arrays with dynamically reconfigurable buss...
. A distributed algorithm with the same functionality as the single-processor level 3 BLAS operation...
Some level-2 and level-3 Distributed Basic Linear Algebra Subroutines (DBLAS) that have been impleme...
AbstractThis paper develops optimal algorithms to multiply an n × n symmetric tridiagonal matrix by:...
In the processing of dynamically changing data, for example, radar data (RD), a crucial part is made...
Submitted for publication to IEEE TPDS The performance of both serial and parallel implementations o...