Optimal Kronecker product approximation of block Toeplitz matrices (Q2706248)
From MaRDI portal
| This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Optimal Kronecker product approximation of block Toeplitz matrices |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Optimal Kronecker product approximation of block Toeplitz matrices |
scientific article |
Statements
19 March 2001
0 references
block Toeplitz matrix
0 references
conjugate gradient method
0 references
Kronecker product
0 references
image restoration
0 references
preconditioning
0 references
singular value decompostition
0 references
Hubble space telescope
0 references
0 references
0 references
0 references
Optimal Kronecker product approximation of block Toeplitz matrices (English)
0 references
The problem is to find \((n,n)\)-matrices \(A_k, B_k\) that minimize \(\|T-\sum A_k\otimes B_k\|_F\), where \(\otimes\) denotes the Kronecker product and \(T\) is a banded \((n,n)\)-block Toeplitz matrix with banded \((n,n)\)-Toeplitz blocks. It is proved that the optimal matrices are banded Toeplitz matrices, and an efficient approximative method is given. Application to an image restoration problem from the Hubble space telescope illustrates the effectiveness of the method.
0 references