
An efficient algorithm to compute the exponential of skewHermitian matrices for the time integration of the Schrödinger equation
We present a practical algorithm to approximate the exponential of skew...
read it

Exploiting variable precision in GMRES
We describe how variable precision floating point arithmetic can be used...
read it

Some fast algorithms multiplying a matrix by its adjoint
We present a noncommutative algorithm for the multiplication of a 2 x 2...
read it

Acceleration of multiple precision matrix multiplication based on multicomponent floatingpoint arithmetic using AVX2
In this paper, we report the results obtained from the acceleration of m...
read it

Mathematical Foundations of the GraphBLAS
The GraphBLAS standard (GraphBlas.org) is being developed to bring the p...
read it

An algorithm for hiding and recovering data using matrices
We present an algorithm for the recovery of a matrix M (nonsingular ∈ ...
read it

SemiAutomatic Task Graph Construction for ℋMatrix Arithmetic
A new method to construct task graphs for matrix arithmetic is introduc...
read it
Computing the matrix sine and cosine simultaneously with a reduced number of products
A new procedure is presented for computing the matrix cosine and sine simultaneously by means of Taylor polynomial approximations. These are factorized so as to reduce the number of matrix products involved. Two versions are developed to be used in single and double precision arithmetic. The resulting algorithms are more efficient than schemes based on Padé approximations for a wide range of norm matrices.
READ FULL TEXT
Comments
There are no comments yet.