Results 301 to 310 of about 5,896,098 (374)

Incomplete block‐matrix factorization of M‐matrices using two‐step iterative method for matrix inversion and preconditioning

Mathematical methods in the applied sciences, 2020
Using the general method of Owe Axelsson given in 1986 for incomplete factorization of M‐matrices in block‐matrix form, we give a recursive approach to construct incomplete block‐matrix factorization of M‐matrices by proposing a two‐step iterative method
S. C. Buranay, O. C. Iyikal
semanticscholar   +1 more source

Integer-valued polynomials over block matrix algebras

Journal of Algebra and its Applications, 2020
In this paper, we state a generalization of the ring of integer-valued polynomials over upper triangular matrix rings. The set of integer-valued polynomials over some block matrix rings is studied.
J. Sedighi Hafshejani, A. Naghipour, M. R. Rismanchian   +2 more
semanticscholar   +1 more source

Block deformation analysis: Density matrix blocks as intramolecular deformation density

Journal of Computational Chemistry, 2020
AbstractBlock deformation analysis as deformation density of atomic orbitals is introduced to analyze intramolecular interactions. In this respect, density matrix blocks in terms of natural atomic orbitals are employed to find interacting and noninteracting multicenter subsystem and extract the corresponding deformation density.
Isa Ravaei, Seyed Mohammad Azami
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}.
Cohen, Nir, Dancis, Jerome
openaire   +1 more source

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