Abstract
As is well known, linear operator equations have wide applications in many areas of engineering and applied mathematics. In the present paper, we are interested in solving the linear operator equation
where J, K and L should be partially bisymmetric under a prescribed submatrix constraint. Three conjugate gradient-like algorithms are derived for solving this constrained operator equation including the Lyapunov, Stein and Sylvester matrix equations and the quadratic inverse eigenvalue problem as special cases. The algorithms converge to the solutions of the linear operator equation within a finite number of iterations in the absence of round-off errors. At the end, the accuracy and efficiency of the introduced algorithms are demonstrated numerically with three examples.
Similar content being viewed by others
References
Aishima K (2018) A quadratically convergent algorithm based on matrix equations for inverse eigenvalue problems. Linear Algebra Appl 542:310–333
Bai ZJ (2003) The solvability conditions for the inverse eigenvalue problem of Hermitian and generalized skew-Hamiltonian matrices and its approximation. Inverse Probl 19:1185–1194
Bai ZJ, Chan RH, Morini B (2004) An inexact Cayley transform method for inverse eigenvalue problems. Inverse Probl 20:1675–1689
Bourgeois G (2011) How to solve the matrix equation \(XA -AX = f ( X )\). Linear Algebra Appl 434:657–668
Broyden CG, Vespucci MT (2004) Krylov solvers for linear algebraic systems. Elsevier, Amsterdam
Bunch JR (1985) Stability of methods for solving Toeplitz systems of equations. SIAM J Sci Stat Comput 6:349–364
Cai J, Chen J (2017) Iterative solutions of generalized inverse eigenvalue problem for partially bisymmetric matrices. Linear Multilinear Algebra 65:1643–1654
Cantoni A, Butler P (1976) Properties of the eigenvectors of persymmetric matrices with applications to communication theory. IEEE Trans Commun 24:804–809
Chen Y, Peng Z, Zhou T (2010) LSQR iterative common symmetric solutions to matrix equations \(AXB = E\) and \(CXD = F\). Appl Math Comput 217:230–236
Chronopoulos AT (1991) S-step iterative methods for (non)symmetric (in)definite linear systems. SIAM J Numer Anal 28:1776–1789
Chronopoulos AT (1994) On the squared unsymmetric Lanczos method. J Comput Appl Math 54:65–78
Chronopoulos AT, Kincaid D (2001) On the Odir iterative method for non-symmetric indefinite linear systems. Numer Linear Algebra Appl 8:71–82
Chronopoulos AT, Kucherov AB (2010) Block s-step Krylov iterative methods. Numer Linear Algebra Appl 17:3–15
Chronopoulos AT, Swanson CD (1996) Parallel iterative s-step methods for unsymmetric linear systems. Parallel Comput 22:623–641
Chu MT, Golub G (2005) Inverse eigenvalue problems: theory, algorithms, and applications. Oxford University Press, New York
Chu MT, Buono ND, Yu B (2007) Structured quadratic inverse eigenvalue problem, I. Serially linked systems. SIAM J Sci Comput 29:2668–2685
Datta L, Morgera SD (1989) On the reducibility of centrosymmetric matrices—applications in engineering problems. Circuits Syst Signal Process 8:71–96
Ding F, Chen T (2005a) Iterative least squares solutions of coupled Sylvester matrix equations. Syst Control Lett 54:95–107
Ding F, Chen T (2005b) Gradient based iterative algorithms for solving a class of matrix equations. IEEE Trans Autom Control 50:1216–1221
Ding F, Chen T (2006) On iterative solutions of general coupled matrix equations. SIAM J Control Optim 44:2269–2284
Gigola S, Lebtahi L, Thome N (2015) Inverse eigenvalue problem for normal \(J\)-Hamiltonian matrices. Appl Math Lett 48:36–40
Gigola S, Lebtahi L, Thome N (2016) The inverse eigenvalue problem for a Hermitian reflexive matrix and the optimization problem. J Comput Appl Math 291:449–457
Gladwell GML (2004) Inverse problems in vibration, 2nd edn. Martinus Nijhoff, Dordrecht
Hajarian M (2016a) Least squares solution of the linear operator equation. J Optim Theory Appl 170:205–219
Hajarian M (2016b) Symmetric solutions of the coupled generalized Sylvester matrix equations via BCR algorithm. J Frankl Inst 353:3233–3248
Hajarian M (2017) Convergence results of the biconjugate residual algorithm for solving generalized Sylvester matrix Equation. Asian J Control 17:961–968
Hajarian M (2018) Matrix form of biconjugate residual algorithm to solve the discrete-time periodic Sylvester matrix equations. Asian J Control 20:49–56
Hajarian M (2019) An efficient algorithm based on Lanczos type of BCR to solve constrained quadratic inverse eigenvalue problems. J Comput Appl Math 346:418–431
Hajarian M (2020) BCR algorithm for solving quadratic inverse eigenvalue problems with partially bisymmetric matrices. Asian J Control 22:687–695
Hu JJ, Ma CF (2017) Minimum-norm Hamiltonian solutions of a class of generalized Sylvester-conjugate matrix equations. Comput Math Appl 73(5):747–764
Huang BH, Ma CF (2017) On the least squares generalized Hamiltonian solution of generalized coupled Sylvester-conjugate matrix equations. Comput Math Appl 74:532–555
Kyrchei II (2010) Cramer’s rule for some quaternion matrix equations. Appl Math Comput 217:2024–2030
Kyrchei I (2012) Analogs of Cramer’s rule for the minimum norm least squares solutions of some matrix equations. Appl Math Comput 218:6375–6384
Liu Z, Faßbender H (2007) An inverse eigenvalue problem and an associated approximation problem for generalized \(K\)-centrohermitian matrices. J Comput Appl Math 206:578–585
Ma W (2015) A backward error for the symmetric generalized inverse eigenvalue problem. Linear Algebra Appl 464:90–99
Ma S, Chronopoulos AT (1990) Implementation of iterative methods for large sparse nonsymmetric linear systems on a parallel vector machine. Int J High Perform Comput Appl 4:9–24
Melman A (2000) Symmetric centrosymmetric matrix–vector multiplication. Linear Algebra Appl 320:193–198
Moghaddam MR, Mirzaei H, Ghanbari K (2015) On the generalized inverse eigenvalue problem of constructing symmetric pentadiagonal matrices from three mixed eigendata. Linear Multilinear Algebra 63:1154–1166
Peng XY, Liu W, Xiong HJ (2011) The constrained inverse eigenvalue problem and its approximation for normal matrices. Linear Algebra Appl 435:3115–3123
Qian J, Cheng M (2014) Quadratic inverse eigenvalue problem for damped gyroscopic systems. J Comput Appl Math 255:306–312
Shen WP, Li C, Jin XQ (2015) An inexact Cayley transform method for inverse eigenvalue problems with multiple eigenvalues. Inverse Probl 31:085007
Shen W, Li C, Jin X (2016) An Ulm-like Cayley transform method for inverse eigenvalue problems with multiple eigenvalues. Numer Math: Theory Methods Appl 9:664–685
Vespucci MT, Broyden CG (2001) Implementation of different computational variations of biconjugate residual methods. Comput Math Appl 42:1239–1253
Weaver JR (1985) Centrosymmetric (cross-symmetric) matrices, their basic properties, eigenvalues, and eigenvectors. Am Math Mon 92:711–717
Wei Y, Dai H (2016) An inverse eigenvalue problem for the finite element model of a vibrating rod. J Comput Appl Math 300:172–182
Xie YJ, Ma CF (2015) The scaling conjugate gradient iterative method for two types of linear matrix equations. Comput Math Appl 70(5):1098–1113
Yamamoto T (2006) Toward the Sinc-Galerkin method for the Poisson problem in one type of curvilinear coordinate domain. Electron Trans Numer Anal 23:63–75
Yuan YX, Dai H (2009) A generalized inverse eigenvalue problem in structural dynamic model updating. J Comput Appl Math 226:42–49
Yuan SF, Wang QW, Xiong ZP (2013) Linear parameterized inverse eigenvalue problem of bisymmetric matrices. Linear Algebra Appl 439:1990–2007
Zhang ZZ, Hu X, Zhang L (2002) The solvability conditions for the inverse eigenvalue problem of Hermitian-generalized Hamiltonian matrices. Inverse Probl 18:1369–1376
Zhou FZ, Hu XY, Zhang L (2003) The solvability conditions for the inverse eigenvalue problems of centro-symmetric matrices. Linear Algebra Appl 364:147–160
Zhou B, Li ZY, Duan GR, Wang Y (2009a) Solutions to a family of matrix equations by using the Kronecker matrix polynomials. Appl Math Comput 212:327–336
Zhou B, Duan GR, Li ZY (2009b) A stein matrix equation approach for computing coprime matrix fraction description. IET Control Theory Appl 3(6):691–700
Acknowledgements
The author would like to thank the editor and the anonymous reviewers for their valuable comments and careful reading of the original manuscript which substantially improved the quality and presentation of this paper.
Author information
Authors and Affiliations
Corresponding author
Additional information
Communicated by Andreas Fischer.
Publisher's Note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
Rights and permissions
About this article
Cite this article
Hajarian, M. Conjugate gradient-like algorithms for constrained operator equation related to quadratic inverse eigenvalue problems. Comp. Appl. Math. 40, 137 (2021). https://doi.org/10.1007/s40314-021-01523-5
Received:
Revised:
Accepted:
Published:
DOI: https://doi.org/10.1007/s40314-021-01523-5
Keywords
- Linear operator equation
- Quadratic inverse eigenvalue problem
- Partially bisymmetric matrix
- Submatrix constraint
- Conjugate gradient-like algorithm