Half-Precision Kronecker Product SVD Preconditioner for Structured Inverse Problems (2311.15393v1)
Abstract: In this paper we investigate the use of half-precision Kronecker product singular value decomposition (SVD) approximations as preconditioners for large-scale Tikhonov regularized least squares problems. Half precision reduces storage requirements and has the potential to greatly speedup computations on certain GPU architectures. We consider both standard PCG and flexible PCG algorithms, and investigate, through numerical experiments on image deblurring problems, the trade-offs between potentially faster convergence with the additional cost per iteration when using this preconditioning approach. Moreover, we also investigate the use of several regularization parameter choice methods, including generalized cross validation and the discrepancy principle.
- Learning regularization parameters of inverse problems via deep neural networks. Inverse Problems, 37(10):105017, 2021.
- Adaptive precision in block-jacobi preconditioning for iterative sparse linear system solvers. Concurrency and Computation: Practice and Experience, 31(6):e4460, 2019.
- Å. Björck. Least squares methods. Handbook of numerical analysis, 1:465–652, 1990.
- D. Calvetti and E. Somersalo. Introduction to Bayesian Scientific Computing. Springer-Verlag, New York, 2007.
- A weighted-gcv method for lanczos-hybrid regularization. Electronic Transactions on Numerical Analysis, 28:149–167, 2008.
- Regularization of Inverse Problems. Kluwer Academic Publishers, Dordrecht, 2000.
- IR tools: a matlab package of iterative regularization methods and large-scale test problems. Numerical Algorithms, 81:773 – 811, 2019.
- Tikhonov regularization and total least squares. SIAM journal on matrix analysis and applications, 21(1):185–194, 1999.
- P. C. Hansen. Discrete Inverse Problems: Insight and Algorithms. SIAM, 2010.
- N. J. Higham. The accuracy of floating point summation. SIAM Journal on Scientific Computing, 14(4):783–799, 1993.
- N. J. Higham and S. Pranesh. Simulating low precision floating-point arithmetic. SIAM Journal on Scientific Computing, 41(5):C585–C602, 2019.
- J. Kamm and J. G. Nagy. Kronecker product and SVD approximations in image restoration. Linear Algebra Appl., 284:177–192, 1998.
- J. Kamm and J. G. Nagy. Optimal Kronecker product approximation of block Toeplitz matrices. SIAM J. Matrix Anal. Appl., 22:155–172, 2000.
- Towards numerical benchmark for half-precision floating point arithmetic. In 2017 IEEE High Performance Extreme Computing Conference (HPEC), pages 1–5. IEEE, 2017.
- J. L. Mueller and S. Siltanen. Linear and Nonlinear Inverse Problems with Practical Applications. SIAM, Philadelphia, PA, 2012.
- Kronecker product approximation in three-dimensional imaging applications. IEEE Trans. Image Proc., pages 604–613, 2006.
- Kronecker product approximation for image restoration with reflexive boundary conditions. SIAM J. Matrix Anal. Appl., 25:829–841, 2004.
- Y. Notay. Flexible conjugate gradients. SIAM J. Sci. Comput., 22(4):1444–1460, 2000.
- C. F. Van Loan. The ubiquitous Kronecker product. J. Comp. Appl. Math., 123:85–100, 2000.
- C. F. Van Loan and N. P. Pitsianis. Approximation with Kronecker products. In M. S. Moonen and G. H. Golub, editors, Linear Algebra for Large Scale and Real Time Applications, pages 293–314. Kluwer Publications, 1993.
- C. R. Vogel. Computational Methods for Inverse Problems. SIAM, Philadelphia, PA, 2002.
Sponsored by Paperpile, the PDF & BibTeX manager trusted by top AI labs.
Get 30 days freePaper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.