Matrix completion problems
In the paper the author gives results about the following two problems over an arbitrary field: Problem 1. Under which conditions does there exist a matrix with prescribed eigenvalues, characteristic polynomials, when some of its entries are prescribed and others vary. Problem 2. For given partitioned matrix with known some of its blocks, under which conditions does there exist such matrix with prescribed characteristic polynomial or the number of nontrivial invariant polynomials. Many results of different authors are given and also some own results of the author of the paper, generalizing some of the represented results.
- A geometric approach to the Carlson problem
- A note on an inverse problem for nonnegative matrices
- An inequality for nonnegative matrices and the inverse eigenvalue problem
- Characteristic polynomials and controllability of partially prescribed matrices
- Editorial board
- Eigenvalues of completions of submatrices
- Eigenvalues of Matrices with Prescribed Entries
- Eigenvalues of matrices with several prescribed blocks
- Eigenvalues of matrices with several prescribed blocks. II
- Eigenvalues of nonnegative symmetric matrices
- Eigenvalues, invariant factors, highest weights, and Schubert calculus
- Existence of matrices with prescribed eigenvalues and entries
- Existence of matrices with prescribed entries
- Existenzsätze in der Theorie der Matrizen und lineare Kontrolltheorie
- scientific article; zbMATH DE number 4179559 (Why is no real title available?)
- scientific article; zbMATH DE number 3950733 (Why is no real title available?)
- scientific article; zbMATH DE number 4071103 (Why is no real title available?)
- scientific article; zbMATH DE number 3693465 (Why is no real title available?)
- scientific article; zbMATH DE number 3760340 (Why is no real title available?)
- scientific article; zbMATH DE number 193053 (Why is no real title available?)
- scientific article; zbMATH DE number 193132 (Why is no real title available?)
- scientific article; zbMATH DE number 3472240 (Why is no real title available?)
- scientific article; zbMATH DE number 2183250 (Why is no real title available?)
- scientific article; zbMATH DE number 3053876 (Why is no real title available?)
- Imbedding conditions for \(\lambda\)-matrices
- Inequalities for the degrees of elementary divisors of modules
- Interlacing inequalities and control theory
- Interlacing inequalities for invariant factors
- Invariant polynomials of matrices with prescibed entries
- Inverse Eigenvalue Problems
- Matrices with prescribed characteristic polynomial and a prescribed submatrix. III
- Matrices with prescribed characteristic polynomial and principal blocks
- Matrices with prescribed characteristic polynomial and principal blocks. II
- Matrices with Prescribed Characteristic Polynomials
- Matrices with Prescribed Characteristic Roots and Diagonal Elements
- Matrices with prescribed eigenvalues and blocks
- Matrices with prescribed eigenvalues and principal submatrices
- Matrices with Prescribed Entries and Characteristic Polynomial
- Matrices with Prescribed Entries and Eigenvalues. I
- Matrices with Prescribed Entries and Eigenvalues. II
- Matrices with prescribed entries and eigenvalues. III
- Matrices with prescribed invariant factors and off-diagonal submatrices
- Matrices with prescribed off-diagonal elements
- Matrices with Prescribed Principal Elements and Singular Values
- Matrices with prescribed rows and invariant factors
- Matrix Analysis
- Methods of constructing certain stochastic matrices
- Methods of constructing certain stochastic matrices. II
- On an inverse problem for nonnegative and eventually nonnegative matrices
- On the eigenvalues of non-negative Jacobi matrices
- On the eigenvalues of the matrix
- On the number of invariant polynomials of partially prescribed matrices
- Possible spectra of totally positive matrices
- Stable bundles, representation theory and Hermitian operators
- The characteristic polynomial of a matrix with prescribed off-diagonal blocks
- The honeycomb model of GL_n(\mathbb C) tensor products I: Proof of the saturation conjecture
- The number of invariant polynomials of a matrix with prescribed complementary submatrices
- The number of invariant polynomials of a matrix with prescribed off-diagonal blocks
- The number of nonconstant invariant polynomials of matrices with several prescribed blocks
- The quadratic eigenvalue problem
- The spectra of nonnegative matrices via symbolic dynamics
- Completion problems for real matrices. II
- Matrix completion discriminant analysis
- Completely controllable pairs of matrices with prescribed positions
- Unimodular polynomial matrices over finite fields
- Matrices with prescribed eigenvalues and prescribed submatrices. II
- A note on matrices with prescribed off-diagonal submatrix and characteristic polynomial
- Normal completions of block partial matrices
- Matrix completions for linear matrix equations
- Some matrix completion problems
- The number of linear transformations defined on a subspace with given invariant factors
- Powers of defective matrices from diagonalizable dilations
- Matrix completion with sparse measurement errors
- A note on matrix completion problems
- Matrix completion from noisy entries
- Sums of nilpotent matrices
- Some matrix completions over integral domains
- The nonsingular matrix completion problem
- Matrices with prescribed invariant factors
- scientific article; zbMATH DE number 4158856 (Why is no real title available?)
- Recent progress on matrix completion problems
- Controllability of pairs of matrices with prescribed entries
- scientific article; zbMATH DE number 1336312 (Why is no real title available?)
- scientific article; zbMATH DE number 523915 (Why is no real title available?)
- scientific article; zbMATH DE number 691429 (Why is no real title available?)
- scientific article; zbMATH DE number 1560265 (Why is no real title available?)
- Poisson Matrix Recovery and Completion
- 2n-by-2n symplectic completions of matrices of order 2n-1
- An inverse problem for the collapsing sum
- A new approach to square matrix completion problem
- Matrix polynomials with completely prescribed eigenstructure
- Matrix Completion From a Few Entries
- Research problem: The completion number of a graph
- Matrix completion problems with arbitrary locations of prescribed entries
- Matrix completion problems of block type
- Using noncommutative Gröbner bases in solving partially prescribed matrix inverse completion problems
- Counting zero kernel pairs over a finite field
- Row or Column Completion of Polynomial Matrices of Given Degree
- On prescribed characteristic polynomials
- Arbitrary matrix coefficient assignment for block matrix bilinear control systems in the Hessenberg form
- Nil-clean companion matrices
- On the eigenvalues of matrices with given upper triangular part
- A matrix completion problem over integral domains: the case with 2n-3 prescribed entries
This page was built for publication: Matrix completion problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1014511)