Multiple independent matrix problems of very small size appear in a variety of different fields. In this work, we study the implementation of elementary linear algebra subroutines so as to best use vectorizing compilers and vector hardware for multiple small problem instances. We cheek the performance improvement over the single-instance optimized codes on different vector supercomputers. We also describe how to automate the transformation of a single-instance linear algebra solver into a multiple instance solve
This thesis describes novel techniques and test implementations for optimizing numerically intensive...
This proposal concerned the design, analysis, and implementation of serial and parallel algorithms f...
One of the main principles in the new FEM package FEAST is a recursive Divide and Conquer strategy w...
We are presenting a new method and algorithm for solving several common problems of linear algebra a...
In a few number of applications, a need arises to do some usual linear algebra operations on a very ...
Two issues in linear algebra algorithms for multicomputers are addressed. First, how tounify paralle...
We present a method of computing with matrices over very small finite fields of size larger than 2. ...
Vector computers have been extensively used for years in matrix algebra to treat with large dense ma...
Abstract—Scientific programmers often turn to vendor-tuned Basic Linear Algebra Subprograms (BLAS) t...
A plethora of program analysis and optimization techniques rely on linear programming at their heart...
AbstractThe complexity of matrix multiplication has attracted a lot of attention in the last forty y...
Solution of homogeneous linear systems of equations is a basic operation of matrix computa-tions. Th...
Efficient Matlab codes in 2D and 3D have been proposed recently to assemble finite element matrices....
A technique for optimizing software is proposed that involves the use of a standardized set of compu...
Introduction We describe a novel architecture for a "linear algebra server" that operates...
This thesis describes novel techniques and test implementations for optimizing numerically intensive...
This proposal concerned the design, analysis, and implementation of serial and parallel algorithms f...
One of the main principles in the new FEM package FEAST is a recursive Divide and Conquer strategy w...
We are presenting a new method and algorithm for solving several common problems of linear algebra a...
In a few number of applications, a need arises to do some usual linear algebra operations on a very ...
Two issues in linear algebra algorithms for multicomputers are addressed. First, how tounify paralle...
We present a method of computing with matrices over very small finite fields of size larger than 2. ...
Vector computers have been extensively used for years in matrix algebra to treat with large dense ma...
Abstract—Scientific programmers often turn to vendor-tuned Basic Linear Algebra Subprograms (BLAS) t...
A plethora of program analysis and optimization techniques rely on linear programming at their heart...
AbstractThe complexity of matrix multiplication has attracted a lot of attention in the last forty y...
Solution of homogeneous linear systems of equations is a basic operation of matrix computa-tions. Th...
Efficient Matlab codes in 2D and 3D have been proposed recently to assemble finite element matrices....
A technique for optimizing software is proposed that involves the use of a standardized set of compu...
Introduction We describe a novel architecture for a "linear algebra server" that operates...
This thesis describes novel techniques and test implementations for optimizing numerically intensive...
This proposal concerned the design, analysis, and implementation of serial and parallel algorithms f...
One of the main principles in the new FEM package FEAST is a recursive Divide and Conquer strategy w...