Optimal Kronecker Product Approximation of Block Toeplitz Matrices
From MaRDI portal
Publication:2706248
DOI10.1137/S0895479898345540zbMath0969.65033MaRDI QIDQ2706248
Publication date: 19 March 2001
Published in: SIAM Journal on Matrix Analysis and Applications (Search for Journal in Brave)
preconditioningconjugate gradient methodKronecker productblock Toeplitz matriximage restorationHubble space telescopesingular value decompostition
Computational methods for sparse matrices (65F50) Numerical solutions to overdetermined systems, pseudoinverses (65F20)
Related Items (20)
Analysis and reanalysis of mechanical systems: concept of global near-regularity ⋮ How to prove that a preconditioner cannot be superlinear ⋮ Structured Matrix Approximations via Tensor Decompositions ⋮ Unnamed Item ⋮ A special Hermitian and skew-Hermitian splitting method for image restoration ⋮ Some rank equalities and inequalities for Kronecker products of matrices ⋮ Kronecker product approximations for image restoration with new mean boundary conditions ⋮ Kronecker product approximations for image restoration with whole-sample symmetric boundary conditions ⋮ Optimal Kronecker Product Approximation of Block Toeplitz Matrices ⋮ On condition numbers for Moore–Penrose inverse and linear least squares problem involving Kronecker products ⋮ Kriging and spatial design accelerated by orders of magnitude: combining low-rank covariance approximations with FFT-techniques ⋮ Singular Value Decomposition Approximation via Kronecker Summations for Imaging Applications ⋮ Lanczos based preconditioner for discrete ill-posed problems ⋮ Tensor ranks for the inversion of tensor-product binomials ⋮ Unnamed Item ⋮ Matrix inversion cases with size-independent tensor rank estimates ⋮ Even-order Toeplitz tensor: framework for multidimensional structured linear systems ⋮ Preconditioners based on fit techniques for the iterative regularization in the image deconvolution problem ⋮ Tensor properties of multilevel Toeplitz and related matrices ⋮ The ubiquitous Kronecker product
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Nonlinear total variation based noise removal algorithms
- A weighted-GCV method for Lanczos-hybrid regularization
- Lanczos based preconditioner for discrete ill-posed problems
- Iterative methods for image deblurring: A Matlab object-oriented approach
- GKB-FP: An algorithm for large-scale discrete ill-posed problems
- Optimal Kronecker Product Approximation of Block Toeplitz Matrices
- Choosing Regularization Parameters in Iterative Methods for Ill-Posed Problems
- Kronecker product approximations for image restoration with anti-reflective boundary conditions
- Fast design of multichannel FIR least-squares filters with optimum lag
- Superfast Solution of Real Positive Definite Toeplitz Systems
- A Bidiagonalization-Regularization Procedure for Large Scale Discretizations of Ill-Posed Problems
- Rank-Deficient and Discrete Ill-Posed Problems
- A Note on Antireflective Boundary Conditions and Fast Deblurring Models
- Kronecker Product Approximations forImage Restoration with Reflexive Boundary Conditions
- A Fast Algorithm for Deblurring Models with Neumann Boundary Conditions
- Conjugate Gradient Methods for Toeplitz Systems
- Computational Methods for Inverse Problems
- Displacement Structure: Theory and Applications
- Handbook of Mathematical Models in Computer Vision
- ForWaRD: Fourier-Wavelet Regularized Deconvolution for Ill-Conditioned Systems
- A Projection‐Based Approach to General‐Form Tikhonov Regularization
This page was built for publication: Optimal Kronecker Product Approximation of Block Toeplitz Matrices
