Results 251 to 260 of about 2,519,766 (293)

Evaluating products of matrix pencils and collapsing matrix products

Numerical Linear Algebra with Applications, 2001
AbstractThis paper describes three numerical methods to collapse a formal product ofppairs of matrices$$P=\mathop{\prod}\limits_{k=0}^{p-1} E_{k}^{-1}A_{k}$$down to the product of a single pairÊ−1Â. In the setting of linear relations, the product formally extends to the case in which some of theEk's are singular and it is impossible to explicitly form ...
Benner, Peter, Byers, Ralph
openaire   +3 more sources

Sparse Matrix-Matrix Products Executed Through Coloring

SIAM Journal on Matrix Analysis and Applications, 2015
Summary: Sparse matrix-matrix products appear in multigrid solvers among other applications. Some implementations of these products require the inner product of two sparse vectors. In this paper, we propose a new algorithm for computing sparse matrix-matrix products by exploiting their nonzero structure through the process of graph coloring.
McCourt, Michael, Smith, Barry, Zhang, Hong   +2 more
openaire   +1 more source

Accretive matrix products

Linear and Multilinear Algebra, 1975
Let Σ(F) be the class of hermitian positive definite elements of Mn (F), where F is either R, the real, or C, the complex field, and let For j ⩾ 0 and k ⩾ 1, all set products of the form: are determined for integers j k. This completes earlier work of Ballantine and Taussky which determined for integers j ⩾ 0.
C.S. Ballantine, C.R. Johnson
openaire   +1 more source

“Random” random matrix products

Journal d'Analyse Mathématique, 2001
This paper studies compositions of independent random bundle maps \(F(x,a)=f_Fx,T_F(x)a\), \(x\in X\), \(a\in \mathbb R^d\), where \(X\) is a Borel subset of a Polish space, whose distributions form a stationary process. This specializes to the case of products of independent random matrices evolving by a stationary process and generalizes many results
openaire   +2 more sources