Abstract and Applied Analysis

Norm-Constrained Least-Squares Solutions to the Matrix Equation A X B = C

An-bao Xu and Zhenyun Peng

Full-text: Open access

Abstract

An iterative method to compute the least-squares solutions of the matrix A X B = C over the norm inequality constraint is proposed. For this method, without the error of calculation, a desired solution can be obtained with finitely iterative step. Numerical experiments are performed to illustrate the efficiency and real application of the algorithm.

Article information

Source
Abstr. Appl. Anal., Volume 2013, Special Issue (2013), Article ID 781276, 10 pages.

Dates
First available in Project Euclid: 26 February 2014

Permanent link to this document
https://projecteuclid.org/euclid.aaa/1393447689

Digital Object Identifier
doi:10.1155/2013/781276

Mathematical Reviews number (MathSciNet)
MR3081609

Citation

Xu, An-bao; Peng, Zhenyun. Norm-Constrained Least-Squares Solutions to the Matrix Equation $AXB=C$. Abstr. Appl. Anal. 2013, Special Issue (2013), Article ID 781276, 10 pages. doi:10.1155/2013/781276. https://projecteuclid.org/euclid.aaa/1393447689


Export citation

References

  • Z.-Y. Peng, “A matrix LSQR iterative method to solve matrix equation $AXB=C$,” International Journal of Computer Mathe-matics, vol. 87, no. 8, pp. 1820–1830, 2010.
  • Y.-X. Peng, X.-Y. Hu, and L. Zhang, “An iteration method for the symmetric solutions and the optimal approximation solution of the matrix equation $AXB=C$,” Applied Mathematics and Computation, vol. 160, no. 3, pp. 763–777, 2005.
  • Z.-Y. Peng, “New matrix iterative methods for constraint so-lutions of the matrix equation $AXB=C$,” Journal of Computational and Applied Mathematics, vol. 235, no. 3, pp. 726–735, 2010.
  • M.-L. Liang, C.-H. You, and L.-F. Dai, “An efficient algorithm for the generalized centro-symmetric solution of matrix equation $AXB=C$,” Numerical Algorithms, vol. 44, no. 2, pp. 173–184, 2007.
  • G.-X. Huang, F. Yin, and K. Guo, “An iterative method for the skew-symmetric solution and the optimal approximate solution of the matrix equation $AXB=C$,” Journal of Computational and Applied Mathematics, vol. 212, no. 2, pp. 231–244, 2008.
  • M. Rojas and D. C. Sorensen, “A trust-region approach to the regularization of large-scale discrete forms of ill-posed problems,” SIAM Journal on Scientific Computing, vol. 23, no. 6, pp. 1842–1860, 2002.
  • M. Bertero and P. Boccacci, Introduction to Inverse Problems in Imaging, Institute of Physics Publishing, Bristol, UK, 1998.
  • N. I. M. Gould, S. Lucidi, M. Roma, and P. L. Toint, “Solving the trust-region subproblem using the Lanczos method,” SIAM Journal on Optimization, vol. 9, no. 2, pp. 504–525, 1999.
  • T. Steihaug, “The conjugate gradient method and trust regions in large scale optimization,” SIAM Journal on Numerical Analysis, vol. 20, no. 3, pp. 626–637, 1983.
  • L. Toint, “Towards an efficient sparsity exploiting Newton method for minimization,” in Proceedings of the Conference on Sparse Matrices and Their Uses, Academic Press, London, UK, 1981.
  • J. J. Moré and D. C. Sorensen, “Computing a trust region step,” SIAM Journal on Scientific and Statistical Computing, vol. 4, no. 3, pp. 553–572, 1983.
  • P. C. Hansen, M. Jacobsen, J. M. Rasmussen, and H. Sorensen, “The PP-TSVD algorithm for image restoration problems,” in Methods and Applications of Inversion, P. C. Hansen, B. H. Jacobsen, and K. Mosegaard, Eds., vol. 92 of Lecture Notes in Earth Sciences, pp. 171–186, Spring, Berlin, Germany, 2000.
  • M. R. Banham and A. K. Katsaggelos, “Digital image restoration,” IEEE Signal Processing Magazine, vol. 14, no. 2, pp. 24–41, 1997.