Results 301 to 310 of about 5,909,835 (371)

Building-block Identification by Simultaneity Matrix

Soft Computing, 2003
This paper presents a study of building blocks (BBs) in the context of genetic algorithms (GAs). In GAs literature, the BBs are common structures of high-quality solutions. The aim is to identify and maintain the BBs while performing solution recombination. To identify the BBs, we construct an $$\ell \times \ell$$ simultaneity matrix according to a set
Chatchawit Aporntewan, Prabhas Chongstitvatana   +1 more
openaire   +1 more source

Optimal block size for matrix multiplication using blocking

2014 37th International Convention on Information and Communication Technology, Electronics and Microelectronics (MIPRO), 2014
Matrix 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, Marjan Gusev, Goran Velkoski   +2 more
openaire   +1 more source

From matrix polynomial to determinant of block Toeplitz–Hessenberg matrix

Numerical Algorithms, 2023
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire   +2 more sources

Block Toeplitz Matrix Inversion

SIAM Journal on Applied Mathematics, 1973
An 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

Block-diagonalization and block-triangularization of a matrix via the matrix sign function

International Journal of Systems Science, 1984
Abstract 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, Y. T. TSAY, S. W. LIN, N. P. COLEMAN   +3 more
openaire   +1 more source

Block Kronecker linearizations of matrix polynomials and their backward errors

Numerische Mathematik, 2017
We introduce a new family of strong linearizations of matrix polynomials—which we call “block Kronecker pencils”—and perform a backward stability analysis of complete polynomial eigenproblems.
F. Dopico, Piers W. Lawrence, Javier Pérez, P. Dooren   +3 more
semanticscholar   +1 more source

PLZT matrix-type block-data composers

IEEE Journal of Quantum Electronics, 1973
The characteristics of PLZT matrix-type block data composers operated in the strain-biased, scattering, differential phase and edge-effect modes are described, and a comparison is given of these four modes of operation.
openaire   +2 more sources

Block matrix approximation via entropy loss function

Applications of Mathematics, 2020
The covariance matrix is one of the most important elements of probability calculation, it is a symmetric, positive-definite matrix. The question of how to approximate well has been raised many times. A solution to this problem is answered in this article. Symmetric, positive-definite matrices can be approximated by symmetric block partitioned matrices
Janiszewska, Malwina, Markiewicz, Augustyn, Mokrzycka, Monika   +2 more
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.
G. Bandera, E.L. Zapata
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