Matrix completion problems of block type
Copyright policy )Matrix completion problems of block type
Block matrices of dimension \(n\times n\) over a field with characteristic zero are considered which are partitioned into \(2\times 2\)-block matrices such that both blocks in the diagonal are square. The authors consider the cases that one or both blocks in the first row of this block matrix are given. It is shown that completion of such a matrix to a matrix with given characteristic polynomial is possible by finite rational computation in \(K\). The resulting algorithms were implemented in MAPLE, experiences with this implementation are discussed.
- Lomonosov Moscow State University Russian Federation
- Russian Academy of Sciences Russian Federation
Eigenvalues, singular values, and eigenvectors, MAPLE, inverse problem, eigenvalue problem, block matrices, Numerical solutions to inverse eigenvalue problems, characteristic polynomial, Inverse problems in linear algebra, Symbolic computation and algebraic computation, algorithms, matrix completion
Eigenvalues, singular values, and eigenvectors, MAPLE, inverse problem, eigenvalue problem, block matrices, Numerical solutions to inverse eigenvalue problems, characteristic polynomial, Inverse problems in linear algebra, Symbolic computation and algebraic computation, algorithms, matrix completion
selected citations These citations are derived from selected sources.This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).0 popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.Average influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).Average impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.Average
Citations provided by BIP!Popularity provided by BIP!