A matrix completion problem over integral domains*: thecasewith 2n - 3 prescribed blocks *
Let ∧ = {λ1,...,λnk} be amultisetofelements ofanintegral domain R.Let P be a partially prescribed n X n block matrix such that each prescribed entry is a k—block (a k X k matrix over R). If P has at most 2n — 3 prescribed entries then the unprescribed...
Guardado en:
| Autores principales: | , , |
|---|---|
| Lenguaje: | English |
| Publicado: |
Universidad Católica del Norte, Departamento de Matemáticas
2014
|
| Acceso en línea: | http://www.scielo.cl/scielo.php?script=sci_arttext&pid=S0716-09172014000200007 |
| Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
| Sumario: | Let ∧ = {λ1,...,λnk} be amultisetofelements ofanintegral domain R.Let P be a partially prescribed n X n block matrix such that each prescribed entry is a k—block (a k X k matrix over R). If P has at most 2n — 3 prescribed entries then the unprescribed entries of P can be filled with k—blocks to obtain a matrix over R with spectrum ∧ (some natural conditions on the prescribed entries are required). We describe an algorithm to construct such completion. |
|---|