Results 261 to 270 of about 2,984,671 (302)
Some of the next articles are maybe not open access.
Block matrix models for dynamic networks
Applied Mathematics and Computation, 2021zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Al Mugahwi, Mohammed +4 more
openaire +3 more sources
Conditioning of the Exponential of a Block Triangular Matrix
Numerical Algorithms, 2001A new measure of conditioning for the exponential of a block triangular matrix is proposed. It is shown that different condition numbers must be used to assess the accuracy of different algorithms for implementing diagonal Padé with scaling and squaring.
L. DIECI, PAPINI, ALESSANDRA
openaire +4 more sources
Block-diagonalization and block-triangularization of a matrix via the matrix sign function
International Journal of Systems Science, 1984Abstract A matrix sign function in conjunction with a geometric approach is utilized to construct a block modal matrix and a (scalar) modal matrix of a system map, so that the system map can be block-diagonalized and block-triangularized, and that the Riccati-type problems can be solved.
L. S. SHIEH +3 more
openaire +1 more source
From matrix polynomial to determinant of block Toeplitz–Hessenberg matrix
Numerical Algorithms, 2023zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +3 more sources
Block Toeplitz Matrix Inversion
SIAM Journal on Applied Mathematics, 1973An iterative procedure for the inversion of a block Toeplitz matrix is given. Hitherto published procedures are obtained as special cases of the present procedure. The use of the procedure in time series analysis is briefly explained.
openaire +3 more sources
Optimal block size for matrix multiplication using blocking
2014 37th International Convention on Information and Communication Technology, Electronics and Microelectronics (MIPRO), 2014Matrix multiplication is a widely used algorithm in today's computing. Speeding up the multiplication of huge matrices is imperative for scientists and they are trying to discover the fastest algorithm. Blocking the matrices reduces the cache misses since both blocks can be stored in L1 cache and thus only the first access of an element will result in ...
Sasko Ristov +2 more
openaire +1 more source
Matrix Multipliers for a Block Schur Product
Results in Mathematics, 2021The paper is a continuation of the author's research started in [Khayyam J. Math. 5, No. 2, 40--50 (2019; Zbl 1438.15051); Bull. Iran. Math. Soc. 46, No. 6, 1775--1789 (2020; Zbl 07290394)]. Here he considers the generalization of the classical Schur product of matrices to the case when the entries come from a space of operators.
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, 2003Run-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 +2 more sources
Parallel Performance of Block ILU Preconditioners for a Block-tridiagonal Matrix
The Journal of Supercomputing, 2003The 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
The block numerical range of matrix polynomials
Applied Mathematics and Computation, 2009zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Hong-bo Guo, Xin-Guo Liu, Wei-Guo Wang
openaire +1 more source