An iterative method for the Hermitian-generalized Hamiltonian solutions to the inverse problem \(AX=B\) with a submatrix constraint (Q469121)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Unfortunately, we do not yet have an article page for this item.
scientific article; zbMATH DE number 6367336
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An iterative method for the Hermitian-generalized Hamiltonian solutions to the inverse problem \(AX=B\) with a submatrix constraint |
scientific article; zbMATH DE number 6367336 |
Statements
An iterative method for the Hermitian-generalized Hamiltonian solutions to the inverse problem \(AX=B\) with a submatrix constraint (English)
0 references
10 November 2014
0 references
The paper considers the problem of finding a matrix \(A\) such that \(AX=B\) and a submatrix \(A\left[ p,q\right] \) has a given value. A conjugate gradient-like algorithm is proposed, which converges in finitely many steps to a solution if the problem is consistent. A special initial value of the iterations can be found, which results in a solution that is at the minimal Frobenius distance from a given matrix. The method is illustrated by a numerical example.
0 references
Hermitian matrices
0 references
Hamiltonian matrices
0 references
matrix equations
0 references
conjugate directions
0 references
inverse problem
0 references
submatrix constraint
0 references
optimal approximation
0 references
conjugate gradient-like algorithm
0 references
numerical example
0 references
0.8856828212738037
0 references
0.8475406765937805
0 references
0.8269757032394409
0 references
