Results 311 to 320 of about 5,909,835 (371)
Some of the next articles are maybe not open access.

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

Block Band Matrix Subspace Iteration

Computer-Aided Civil and Infrastructure Engineering, 1991
Abstract: For a microcomputer user in civil engineering, the. major factor of concern is not necessarily the computing time but the incore memory. It is particularly important for dynamic and nonlinear analyses. Solution techniques employing secondary memory to extend the capacity of a microcomputer in solving engineering problems are active research ...
openaire   +1 more source

The inverse of a block-circulant matrix

IEEE Transactions on Antennas and Propagation, 1983
The inverse A^{-1} of a block-circulant matrix (BCM) A is given in a closed form, by using the fact that a BCM is a combination of permutation matrices, whose eigenvalues and eigenvectors are found with the help of the complex roots of unity. Special results are also given when A is block symmetric or symmetric.
De Mazancourt, T., Gerlic, D.
openaire   +2 more sources

On the Similarity of Block Matrix

Advances in Applied Mathematics, 2021
宇 程
semanticscholar   +1 more source

Inverse Spectrum Problems for Block Jacobi Matrix

1993
A spectrum function for the block Jacobi matrix is defined which allows to determine conditions for existence and uniqueness for the corresponding inverse spectrum problem. Two numerical algorithms for solving the inverse spectrum problem are proposed and their behaviour is illustrated on several examples of order up to 15.
Zhu, Benren   +2 more
openaire   +2 more sources

Numerical study of the mechanical behaviour of unwelded block in matrix rocks under direct shearing

Bulletin of Engineering Geology and the Environment, 2023
A. Sheikhpourkhani   +3 more
semanticscholar   +1 more source

Matrix Measures and Random Walks with a Block Tridiagonal Transition Matrix

SIAM Journal on Matrix Analysis and Applications, 2007
Summary: We study the connection between matrix measures and random walks with a block tridiagonal transition matrix. We derive sufficient conditions such that the blocks of the \(n\)-step block tridiagonal transition matrix of the Markov chain can be represented as integrals with respect to a matrix valued spectral measure.
Dette, Holger   +3 more
openaire   +2 more sources

An efficient, block-by-block algorithm for inverting a block tridiagonal, nearly block Toeplitz matrix

Computational Science & Discovery, 2012
We present an algorithm for computing any block of the inverse of a block tridiagonal, nearly block Toeplitz matrix (defined as a block tridiagonal matrix with a small number of deviations from the purely block Toeplitz structure). By exploiting both the block tridiagonal and the nearly block Toeplitz structures, this method scales independently of the
Matthew G Reuter, Judith C Hill
openaire   +1 more source

Block-Equations and Matrix-Inversion

1983
An “ordinary” system of linear equations can be formulated in matrix notation, as follows: $$ {\rm{A}} \cdot \underline {\rm{x}} = \underline {\rm{b}} $$
openaire   +1 more source

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   +2 more
openaire   +1 more source

Home - About - Disclaimer - Privacy