SavedAdd your journal

Journals / Turkish Journal of Mathematics and Computer Science / 2019 / Cilt: 11 - Sayı: 1

Solving the Singular Semi-Sylvester Equation Using Drazin-Inverse and DGMRES Algorithm

Majid ADİB
Pages
1–7
DOI
—
🏛️Bibliographic metadata and full text access for this article are provided via DergiPark.
DergiPark Record ↗
✨

AI Summary & Key Takeaways

AI Insight
⚡ TL;DR(Too Long; Didn't Read)

Finally, by some numerical experiments, we show the efficiency of the proposed method.

📌 3 Key Takeaways

🎯
Objective & Hypothesis:In this paper, we want to solve the singular semi-Sylvester equation using the Drazin-inverse and the Drazin-inverse generalized minimum residual method (DGMRES(m) algorithm).
📊
Key Findings & Data:First, we transform the semi-Sylvester equation into a multiple linear systems.
💡
Conclusion & Impact:Finally, by some numerical experiments, we show the efficiency of the proposed method.
🔬Design:Research Article
📍Scope:Comprehensive Sample
⚙️Variables:Semi-Sylvester equations · Multiple linear systems · DGM- RES algorithm

Abstract

In this paper, we want to solve the singular semi-Sylvester equation using the Drazin-inverse and the Drazin-inverse generalized minimum residual method (DGMRES(m) algorithm). First, we transform the semi-Sylvester equation into a multiple linear systems. Then, we present the conditions and assumptions needed to apply the DGMRES(m) algorithm. We compare our proposed method with the Galerkin projection method in point of view CPU-time, accuracy and iteration number. Finally, by some numerical experiments, we show the efficiency of the proposed method.

🔖

Cite This Article

ADİB, M. (2019). Solving the Singular Semi-Sylvester Equation Using Drazin-Inverse and DGMRES Algorithm. Turkish Journal of Mathematics and Computer Science, Cilt: 11 - Sayı: 1, 1–7. https://ajindex.com/articles/374675

📄 Full Text PDF Viewer

📄

PDF görüntüleyici hazırlanıyor...

References (9)

  1. Autoulas, A.C., Approximation of Large-Scale Dynamical Systems, Advances in Design and Control, Siam, Philadelphia, PA, USA, 2005.
  2. Arnoldi, W.E., The principle of minimized iterations in the solution of the matrix eigenvalue problem, Quarterly of applied mathematics, 9(2007), 17--290. Baur, U., Benner, P., Cross-gramian based model reduction for data-sparse systems, Electronic Transactions on Numerical Analysis, 31(2008), 256--270. Ben-Israel, A., Greville, T.N., Generalized Inverses: Theory and Applications, volume 15. Springer Science \& Business Media, 2003.
  3. Benner, P., Factorized Solution of Sylvester Equations with Applications in Control, Sign (H), 1:2, 2004.
  4. Bhatia, R., Rosenthal, P., How and why to solve the operator equation axxb= y, Bulletin of the London Mathematical Society, 29(1997), 1--21. Campbell, S.L., Meyer, C.D., Generalized Inverses of Linear Transformations, Siam, 2009.
  5. Chan, T.F., Ng, M.K., Galerkin projection methods for solving multiple linear systems, SIAM Journal on Scientic Computing, 21(1999), 836--850. Dangarra, J., Sullivan, F., Guest Editors Introduction to The Top 10 Algorithms, Comput. Scince. Eng, 2(1):2, 2000.
  6. Datta, B.N., Numerical Methods for Linear Control Systems: Design and Analysis, volume 1. Academic Press, 2004.
  7. Guennouni, A.E., Jbilou, K., Riquet, A., Block krylov subspace methods for solving large sylvester equations, Numerical Algorithms, 29(2002), 1--3. Golub, G., Nash, S., Van Loan, C., A hessenberg-schur method for the problem ax+ xb= c, IEEE Transactions on Automatic Control, 24(1979), 909--913. Golub, G., Van Loan, C., Matrix Computations, 2nd Missing. This means that the interpolation was to be ed, 1989.
  8. Hoskins, W., Meek, D., Walton, D., The numerical solution of the matrix equationxa+ay= f, BIT Numerical Mathematics, 17(1977), 184--190. Jbilou, K., Low rank approximate solutions to large sylvester matrix equations, Applied mathematics and computation, 177(2006), 365--376. Karimi, S., Attarzadeh, F., A new iterative scheme for solving the semi sylvester equation, Applied Mathematics, 4(2013), 1--6. Lu, L., Wachspress, E.L., Solution of lyapunov equations by alternating direction implicit iteration, Computers \& Mathematics with Applications, 21(1991), 43--58. Robbe, M. anf Sadkane, M., Use of near-breakdowns in the block arnoldi method for solving large sylvester equations, Applied Numerical Mathematics, 58(2008), 486--498. Saad, Y., Iterative Methods for Sparse Linear Systems. SIAM, 2003.
  9. Saad, Y., Schu