Results 221 to 230 of about 425,063 (266)

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

The exponential distance matrix of block graphs

Applied Mathematics and Computation, 2023
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Rundan Xing, Zhibin Du
openaire   +2 more sources

Inertias of Block Band Matrix Completions

SIAM Journal on Matrix Analysis and Applications, 1998
Summary: This paper classifies the ranks and inertias of Hermitian completion for the partially specified \(3 \times 3\) block band Hermitian matrix (also known as a ``bordered matrix'') \[ P=\begin{pmatrix} A&B&?\\ B^*&C&D\\ ?&D^*&E \end{pmatrix}.
Nir Cohen, Jerome Dancis
openaire   +1 more source

Conditioning of the Exponential of a Block Triangular Matrix

Numerical Algorithms, 2001
A 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   +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

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

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

A q-analogue of distance matrix of block graphs

Advances in Applied Mathematics, 2023
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Rundan Xing, Zhibin Du
openaire   +1 more source

Matrix Multipliers for a Block Schur Product

Results in Mathematics, 2021
The 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