Results 231 to 240 of about 425,063 (266)

Parallel Performance of Block ILU Preconditioners for a Block-tridiagonal Matrix

The Journal of Supercomputing, 2003
The parallel implementation for Krylov subspace methods of the block ILU preconditioners for block-tridiagonal matrices proposed by the author [BIT 40, 583-605 (2000; Zbl 0961.65040)] is discussed. Especially an efficient implementation for a five-point discretisation of an elliptic second-order partial differential equation is discussed, and more ...
openaire   +1 more source

Matrix Transposition on a Mesh with Blocking Transmissions

Parallel Processing Letters, 1998
A time-optimal procedure to transpose in situ a matrix stored over a distributed memory 2-dimensional mesh-connected parallel computer is shown. The matrix need not be square. Only nearest-neighbor blocking communications is used, and a small bounded buffer space is required.
Micha Hofri, David L. Thomson
openaire   +1 more source

Sparse matrix block-cyclic redistribution

Proceedings 13th International Parallel Processing Symposium and 10th Symposium on Parallel and Distributed Processing. IPPS/SPDP 1999, 2003
Run-time support for the CYCLIC(k) redistribution on the SPMD computation model is presently very relevant for the scientific community. This work is focused to the characterization of the sparse matrix redistribution and its associate problematic due to the use of compressed representations.
Gerardo Bandera, Emilio L. Zapata
openaire   +1 more source

The block numerical range of matrix polynomials

Applied Mathematics and Computation, 2009
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Hong-bo Guo, Xin-Guo Liu, Wei-Guo Wang
openaire   +1 more source

On the Congruence Centralizers of a Block Diagonal Matrix and the Horn–Sergeichuk Matrix

Computational Mathematics and Mathematical Physics, 2022
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire   +2 more sources

The Congruent Centralizer of a Block Diagonal Matrix

Journal of Mathematical Sciences, 2017
Let \(A\) be a complex \(n\times n\) block diagonal matrix of the form \[ A=\left( \begin{matrix} B & 0\\ 0 & C \end{matrix} \right), \] where \(B\) and \(C\) have no common eigenvalues. Let \(X\) be an arbitrary matrix commuting with \(A.\) Then \(X\) has the same block diagonal form as the matrix \(A\).
openaire   +1 more source

The Determinant of a Triangular-Block Matrix

SIAM Review, 1996
Matthew Roughan, Kenneth Pope
openaire   +1 more source

Block ILU Preconditioners for a Nonsymmetric Block-Tridiagonal M-Matrix

BIT Numerical Mathematics, 2000
The paper is directed to preconditioning linear equations that arise from finite difference methods or finite elements. It is assumed that the matrix elements outside of the diagonal blocks are not positive. The assumption holds for finite difference methods and for some finite element methods of lowest order. Comparison theorems for \(M\)-matrices can
openaire   +2 more sources

Hybrid 2D/1D Blocking as Optimal Matrix-Matrix Multiplication

2013
Multiplication of huge matrices generates more cache misses than smaller matrices. 2D block decomposition of matrices that can be placed in L1 CPU cache decreases the cache misses since the operations will access data only stored in L1 cache. However, it also requires additional reads, writes, and operations compared to 1D partitioning, since the ...
Marjan Gusev, Sasko Ristov, Goran Velkoski   +2 more
openaire   +1 more source

On the Similarity of Block Matrix

Advances in Applied Mathematics, 2021
openaire   +1 more source