Results 311 to 320 of about 5,896,098 (374)
Some of the next articles are maybe not open access.

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   +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

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

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

Home - About - Disclaimer - Privacy