Generalizing the SVD of a matrix under non-standard inner product and its applications to linear ill-posed problems (2312.10403v1)
Abstract: The singular value decomposition (SVD) of a matrix is a powerful tool for many matrix computation problems. In this paper, we consider generalizing the standard SVD to analyze and compute the regularized solution of linear ill-posed problems that arise from discretizing the first kind Fredholm integral equations. For the commonly used quadrature method for discretization, a regularizer of the form $|x|{M}2:=xTMx$ should be exploited, where $M$ is symmetric positive definite. To handle this regularizer, we give the weighted SVD (WSVD) of a matrix under the $M$-inner product. Several important applications of WSVD, such as low-rank approximation and solving the least squares problems with minimum $|\cdot|_M$-norm, are studied. We propose the weighted Golub-Kahan bidiagonalization (WGKB) to compute several dominant WSVD components and a corresponding weighted LSQR algorithm to iteratively solve the least squares problem. All the above tools and methods are used to analyze and solve linear ill-posed problems with the regularizer $|x|{M}2$. A WGKB-based subspace projection regularization method is proposed to efficiently compute a good regularized solution, which can incorporate the prior information about $x$ encoded by the regularizer $|x|_{M}2$. Several numerical experiments are performed to illustrate the fruitfulness of our methods.
- Å. Björck. A bidiagonalization algorithm for solving large and sparse ill-posed systems of linear equations. BIT Numer. Math., 28(3):659–670, 1988.
- Å. Björck. Numerical Methods for Least Squares Problems. SIAM, Philadelphia, 1996.
- N. A. Caruso and P. Novati. Convergence analysis of LSQR for compact operator equations. Linear Algebra Appl., 583:146–164, 2019.
- J. Demmel and W. Kahan. Accurate singular values of bidiagonal matrices. SIAM Journal on Scientific and Statistical Computing, 11(5):873–912, 1990.
- Z. Drmač and K. Veselić. New fast and accurate jacobi svd algorithm. i. SIAM Journal on matrix analysis and applications, 29(4):1322–1342, 2008.
- Z. Drmač and K. Veselić. New fast and accurate jacobi svd algorithm. ii. SIAM Journal on matrix analysis and applications, 29(4):1343–1362, 2008.
- C. Eckart and G. Young. The approximation of one matrix by another of lower rank. Psychometrika, 1(3):211–218, 1936.
- Regularization of Inverse Problems. Kluwer Academic Publishers, 2000.
- Accurate singular values and differential qd algorithms. Numerische Mathematik, 67:191–229, 1994.
- G. Golub and W. Kahan. Calculating the singular values and pseudo-inverse of a matrix. Journal of the Society for Industrial and Applied Mathematics, Series B: Numerical Analysis, 2(2):205–224, 1965.
- Matrix Computations. The Johns Hopkins University Press, Baltimore, 4th edition, 2013.
- P. C. Hansen. The truncated svd as a method for regularization. BIT Numer. Math., 27(4):534–553, 1987.
- P. C. Hansen. Analysis of discrete ill-posed problems by means of the L-curve. SIAM Rev., 34(4):561–580, 1992.
- P. C. Hansen. Rank-deficient and Discrete Ill-Posed Problems: Numerical Aspects of Linear Inversion. SIAM, Philadelphia, 1998.
- Deblurring Images: Matrices, Spectra and Filtering. SIAM, Philadelphia, 2006.
- Matrix analysis. Cambridge university press, 2012.
- I. T. Jolliffe and J. Cadima. Principal component analysis: a review and recent developments. Philosophical transactions of the royal society A: Mathematical, Physical and Engineering Sciences, 374(2065):20150202, 2016.
- M. Jozi and S. Karimi. A weighted singular value decomposition for the discrete inverse problems. Numerical Linear Algebra with Applications, 25(1):e2114, 2018.
- I. Karatzas and S. Shreve. Brownian motion and stochastic calculus, volume 113. Springer Science & Business Media, 2012.
- A. Kirsch et al. An introduction to the mathematical theory of inverse problems, volume 120. Springer, 2011.
- R. Kress. Linear Integral Equations. Applied Mathematical Sciences. Springer New York, 2013.
- I. Kyrchei. Weighted singular value decomposition and determinantal representations of the quaternion weighted moore–penrose inverse. Applied Mathematics and Computation, 309:1–16, 2017.
- V. A. Morozov. Regularization of incorrectly posed problems and the choice of regularization parameter. USSR Computational Mathematics and Mathematical Physics, 6(1):242–251, 1966.
- A bidiagonalization-regularization procedure for large scale discretizations of ill-posed problems. SIAM J. Sci. Statist. Comput., 2(4):474–489, 1981.
- LSQR: An algorithm for sparse linear equations and sparse least squares. ACM Trans. Math. Software, 8:43–71, 1982.
- P. Resnick and H. R. Varian. Recommender systems. Communications of the ACM, 40(3):56–58, 1997.
- I. Sergienko and E. Galba. Weighted singular value decomposition of matrices with singular weights based on weighted orthogonal transformations. Cybernetics and Systems Analysis, 51:514–528, 2015.
- H. D. Simon and H. Zha. Low-rank matrix approximation using the lanczos bidiagonalization process with applications. SIAM Journal on Scientific Computing, 21(6):2257–2274, 2000.
- C. R. SMITH III. Multivariable process control using singular value decomposition. The University of Tennessee, 1981.
- G. W. Stewart. On the early history of the singular value decomposition. SIAM Review, 35(4):551–566, 1993.
- Solutions of Ill-Posed Problems. Washington, DC, 1977.
- C. F. Van Loan. Generalizing the singular value decomposition. SIAM J. Numer. Anal., 13(1):76–83, 1976.