An iterative method for solving the generalized total least squares problem

Document Type : Research Article

Authors

1 Department of Mathematics, College of Sciences, Shiraz University, Shiraz 7187919556, Iran & Department of Mathematics, Faculty of Intelligent Systems Engineering and Data Science, Persian Gulf University, Bushehr, Iran

2 Department of Mathematics, Faculty of Intelligent Systems Engineering and Data Science, Persian Gulf University, Bushehr, Iran

Abstract

This paper introduces a novel method for solving the generalized total least squares problem, an extension of the total least squares problem. The generalized total least squares problem emerges when solving overdetermined linear systems with the multiple right-hand sides $\mathbf{AX} \thickapprox \mathbf{B}$, where both the observation matrix $\mathbf{B}$ and the data matrix $\mathbf{A}$ contain errors. Our approach involves extending the Taylor series expansion to reformulate the generalized total least squares problem into a linear problem, allowing us to employ the tensor form of the generalized least squares algorithm for efficient computation. This technique streamlines the computational process and enhances solution accuracy. For a more detailed survey, we compare the proposed method for solving the generalized total least squares problem with one of the matrix format methods for the associated total least squares problem. Empirical results show that our method significantly improves computational efficiency and solution precision. Additionally, we demonstrate its practical application in the context of image blurring.

Keywords

Main Subjects


[1] M. Bagheri, A. Tajaddini, F. Kyanfar, A. Salemi, Alternative Arnoldi process for ill-conditioned
tensor equations with application to image restoration, Comput. Appl. Math. 43 (2024) 375.
[2] A. Bjorck, P. Heggerness, P. Mathstoms, Methods for large scale total least squares problems,
SIAM J. Matrix Anal. Appl. 22 (2000) 413–429.
[3] A. Bjorck, Numerical Methods for Least Squares Problems, SIAM, 1996.
[4] E.Kh. Dehdezi, S. Karimi, A rapid and powerful iterative method for computing inverses of a parse
tensors with applications, Appl. Math. Comput. 415 (2022) 126720.
[5] B. De Moor, J. David, Total linear least squares and the algebraic Riccati equation, Systems Con-
trol Lett. 18 (1992) 329–337.
[6] B. De Moor, Total least squares for affinely structured matrices and the noisy realization problem,
IEEE Trans. Signal Process. 42 (1994) 3104–3113.
[7] D. Fasino, A. Fazzi, A Gauss-Newton iteration for total least squares problems, BIT. 58 (2018)
281–299.
[8] H. Fu, J. Barlow, regularized structured total least squares algorithm for high-resolution image
reconstruction, Linear Algebra Appl. 391 (2004) 75–98.
[9] G.H. Golub,Some modified matrix eigenvalue problems, SIAM Rev. 15 (1973) 318–344 .
[10] G.H. Golub, C.F. Van Loan. An analysis of the total least squares problem, SIAM J. Numer. Anal.
17 (1980) 883–893.
[11] G.H. Golub, C.F. Van Loan, Matrix Computations, Fourth Eidition, Johns Hopkins University
Press, Baltimore, 2013.
[12] A. Graham, Kronecker Products and Matrix Calculus with Applications, Dover Publications, 2018.
[13] F. Han, Y. Wei, P. Xie, Regularized and structured tensor total least squares methods with applica-
tions, J. Optim. Theory Appl. 202 (2024) 1–36.
[14] K. Hermus, W. Verhelst, P. Lemmerling, P. Wambacq, S. Van Huffel, Perceptual audio modeling
with exponentially damped sinusoids, Signal. Process. 85 (2005) 163–176.
[15] B. Huang, C. Ma, Global least squares methods based on tensor form to solve a class of generalized
Sylvester tensor equations, Appl. Math. Comput. 369 (2020) 124892.
[16] V. Khang Nguyen, Partial derivative of matrix function with respect to a vector variable, Vietnam
J. Math. 30 (2012) 269–279.
[17] TG. Kolda, B. W. Bader, Tensor decompositions and application, SIAM Rev. 51 (2009) 455–500.
[18] P. Lemmerling, N. Mastronardi, S. Van Huffel, Efficient implementation of a structured total least
squares based speech compression method, Linear Algebra Appl. 366 (2003) 295–315.
[19] I. Markovsky, J.C. Willems, S. Van Huffel, B. De Moor, R. Pintelon, Application of structured
total least squares for system identification and model reduction, IEEE Trans. Automat. Control.
50 (2005) 1490–1500.
[20] I. Markovsky,S. Van Huffel, B. De Moor, A new rank revealing method for the total least squares
problem, SIAM J. Matrix Anal. Appl. 28 (2007) 810–825.
[21] M. Muhlich, R. Mester, The role of total least squares in motion analysis, Proceding European
Conference on Computer Vision, (1998) 305-321.
[22] A. Pruessner, D. OLeary, Blind deconvolution using a regularized structured total least norm algo-
rithm, SIAM J. Matrix Anal. Appl. 24 (2003) 1018–1037.
[23] A. F. Qasim, F. Meziane, R. Aspin, Digital watermarking: Applicability for developing trust in
medical imaging workflows state of the art review, Comput. Sci. Rev. 27 (2018) 45–60.
[24] L. Reichel, U.O. Ugwu, Tensor Arnoldi-Tikhonov and GMRES-Type methods for ill-posed problems
with a t-product structure, J. Sci. Comput. 59 (2022) 59.
[25] B. Roorda, C. Heij, Global total least squares modeling of multivariate time series, IEEE Trans.
Automat. Control. 40 (1995) 50–63.
[26] Y. Shen, B. Li, Y. Chen, An iterative solution of weighted total least-squares adjustment, J. Geod.
85 (2011) 229–238.
[27] S. Van Huffel, J. Vandewalle, Analysis and solution of the nongeneric total least squares problem,
SIAM J. Matrix Anal. Appl. 9 (1988) 360–372.
[28] S. Van Huffel, Partial singular value decomposition algorithm, J. Comput. Appl. Math. 33 (1990)
105–112.
[29] S. Van Huffel, J. Vandewalle The Total Least Squares Problem: Computational Aspects and Anal-
ysis, SIAM, 1991.
[30] P. Verboven, P. Guillaume, B. Cauberghe, E. Parloo, S. Vanlanduit, Frequency-domain generalized
total least squares identification for modal analysis, J. Sound Vibration. 278 (2004) 21–38.
[31] A. Yeredor, Multiple delays estimation for chirp signals using structured total least squares, Linear
Algebra Appl. 391 (2004) 261–286.
[32] H. Zare, M. Hajarian, An efficient Gauss-Newton algorithm for solving regularized total least
squares problems, Numer. Algorithms. 89 (2022) 1049–1073.