Results 261 to 266 of about 1,052,390 (266)

Matrix completion problems of block type

Mathematical Notes, 2000
The solvability, either unconditional or under certain conditions, is proved for three matrix completion problems of block type. Being a problem of block type means that a matrixA must be constructed with a prescribed characteristic polynomial and one or several blocks in a 2 × 2 partition also prescribed.
V. N. Chugunov, Kh. D. Ikramov
openaire   +2 more sources

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   +4 more sources

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   +2 more sources

Block Matrix Techniques

2005
Fuzhen Zhang, Fuzhen Zhang
openaire   +2 more sources

The Determinant of a Triangular-Block Matrix

SIAM Review, 1996
Matthew Roughan, Kenneth Pope
openaire   +2 more sources

Recursive Algorithms to Update a Numerical Basis Matrix of the Null Space of the Block Row, (Banded) Block Toeplitz, and Block Macaulay Matrix

SIAM Journal on Scientific Computing, 2023
Vermeersch, Christof, De Moor, Bart
openaire   +1 more source