<?xml version="1.0" encoding="UTF-8"?>
<!DOCTYPE article PUBLIC "-//NLM//DTD JATS (Z39.96) Journal Publishing DTD v1.4 20241031//EN"
        "https://jats.nlm.nih.gov/publishing/1.4/JATS-journalpublishing1-4.dtd">
<article  article-type="research-article"        dtd-version="1.4">
            <front>

                <journal-meta>
                                                                <journal-id>tjmcs</journal-id>
            <journal-title-group>
                                                                                    <journal-title>Turkish Journal of Mathematics and Computer Science</journal-title>
            </journal-title-group>
                                        <issn pub-type="epub">2148-1830</issn>
                                                                                            <publisher>
                    <publisher-name>Matematikçiler Derneği</publisher-name>
                </publisher>
                    </journal-meta>
                <article-meta>
                                        <article-id/>
                                                                <article-categories>
                                            <subj-group  xml:lang="en">
                                                            <subject>Mathematical Sciences</subject>
                                                    </subj-group>
                                            <subj-group  xml:lang="tr">
                                                            <subject>Matematik</subject>
                                                    </subj-group>
                                    </article-categories>
                                                                                                                                                        <title-group>
                                                                                                                        <article-title>Solving the Singular Semi-Sylvester Equation Using Drazin-Inverse and DGMRES Algorithm</article-title>
                                                                                                                                        </title-group>
            
                                                    <contrib-group content-type="authors">
                                                                        <contrib contrib-type="author">
                                                                    <contrib-id contrib-id-type="orcid">
                                        https://orcid.org/0000-0002-3326-9458</contrib-id>
                                                                <name>
                                    <surname>Adib</surname>
                                    <given-names>Majid</given-names>
                                </name>
                                                            </contrib>
                                                                                </contrib-group>
                        
                                        <pub-date pub-type="pub" iso-8601-date="20190630">
                    <day>06</day>
                    <month>30</month>
                    <year>2019</year>
                </pub-date>
                                        <volume>11</volume>
                                        <issue>1</issue>
                                        <fpage>1</fpage>
                                        <lpage>7</lpage>
                        
                        <history>
                                    <date date-type="received" iso-8601-date="20190218">
                        <day>02</day>
                        <month>18</month>
                        <year>2019</year>
                    </date>
                                                    <date date-type="accepted" iso-8601-date="20190606">
                        <day>06</day>
                        <month>06</month>
                        <year>2019</year>
                    </date>
                            </history>
                                        <permissions>
                    <copyright-statement>Copyright © 2013, Turkish Journal of Mathematics and Computer Science</copyright-statement>
                    <copyright-year>2013</copyright-year>
                    <copyright-holder>Turkish Journal of Mathematics and Computer Science</copyright-holder>
                </permissions>
            
                                                                                                <abstract><p>In this paper, we want to solve the singular semi-Sylvester equation using the Drazin-inverse and the Drazin-inversegeneralized minimum residual method (DGMRES(m) algorithm).First, we transform the semi-Sylvester equation into a multiplelinear systems. Then, we present the conditions and assumptionsneeded to apply the DGMRES(m) algorithm. We compare ourproposed method with the Galerkin projection method in point ofview CPU-time, accuracy and iteration number. Finally, by somenumerical experiments, we show the efficiency of the proposedmethod.</p></abstract>
                                                                                    
            
                                                            <kwd-group>
                                                    <kwd>Semi-Sylvester equations</kwd>
                                                    <kwd>  Multiple linear systems</kwd>
                                                    <kwd>  DGM- RES algorithm</kwd>
                                            </kwd-group>
                                                        
                                                                                                                                                    </article-meta>
    </front>
    <back>
                            <ref-list>
                                    <ref id="ref1">
                        <label>1</label>
                        <mixed-citation publication-type="journal">Autoulas, A.C., Approximation of Large-Scale Dynamical Systems, Advances in Design and Control, Siam, Philadelphia, PA, USA, 2005.</mixed-citation>
                    </ref>
                                    <ref id="ref2">
                        <label>2</label>
                        <mixed-citation publication-type="journal">Arnoldi, W.E., The principle of minimized iterations in the solution of the matrix eigenvalue problem, Quarterly of applied mathematics, 9(2007), 17--290.</mixed-citation>
                    </ref>
                                    <ref id="ref3">
                        <label>3</label>
                        <mixed-citation publication-type="journal">Baur, U., Benner, P., Cross-gramian based model reduction for data-sparse systems, Electronic Transactions on Numerical Analysis, 31(2008), 256--270.</mixed-citation>
                    </ref>
                                    <ref id="ref4">
                        <label>4</label>
                        <mixed-citation publication-type="journal">Ben-Israel, A., Greville, T.N., Generalized Inverses: Theory and Applications, volume 15. Springer Science \&amp; Business Media, 2003.</mixed-citation>
                    </ref>
                                    <ref id="ref5">
                        <label>5</label>
                        <mixed-citation publication-type="journal">Benner, P., Factorized Solution of Sylvester Equations with Applications in Control, Sign (H), 1:2, 2004.</mixed-citation>
                    </ref>
                                    <ref id="ref6">
                        <label>6</label>
                        <mixed-citation publication-type="journal">Bhatia, R., Rosenthal, P., How and why to solve the operator equation axxb= y, Bulletin of the London Mathematical Society, 29(1997), 1--21.</mixed-citation>
                    </ref>
                                    <ref id="ref7">
                        <label>7</label>
                        <mixed-citation publication-type="journal">Campbell, S.L., Meyer, C.D., Generalized Inverses of Linear Transformations, Siam, 2009.</mixed-citation>
                    </ref>
                                    <ref id="ref8">
                        <label>8</label>
                        <mixed-citation publication-type="journal">Chan, T.F., Ng, M.K., Galerkin projection methods for solving multiple linear systems, SIAM Journal on Scientic Computing, 21(1999), 836--850.</mixed-citation>
                    </ref>
                                    <ref id="ref9">
                        <label>9</label>
                        <mixed-citation publication-type="journal">Dangarra, J., Sullivan, F.,  Guest Editors Introduction to The Top 10 Algorithms, Comput. Scince. Eng, 2(1):2, 2000.</mixed-citation>
                    </ref>
                                    <ref id="ref10">
                        <label>10</label>
                        <mixed-citation publication-type="journal">Datta, B.N., Numerical Methods for Linear Control Systems: Design and Analysis, volume 1. Academic Press, 2004.</mixed-citation>
                    </ref>
                                    <ref id="ref11">
                        <label>11</label>
                        <mixed-citation publication-type="journal">Guennouni, A.E., Jbilou, K., Riquet, A., Block krylov subspace methods for solving large sylvester equations, Numerical Algorithms, 29(2002), 1--3.</mixed-citation>
                    </ref>
                                    <ref id="ref12">
                        <label>12</label>
                        <mixed-citation publication-type="journal">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.</mixed-citation>
                    </ref>
                                    <ref id="ref13">
                        <label>13</label>
                        <mixed-citation publication-type="journal">Golub, G., Van Loan, C., Matrix Computations, 2nd Missing. This means that the interpolation was to be ed, 1989.</mixed-citation>
                    </ref>
                                    <ref id="ref14">
                        <label>14</label>
                        <mixed-citation publication-type="journal">Hoskins, W., Meek, D., Walton, D., The numerical solution of the matrix equationxa+ay= f,  BIT Numerical Mathematics, 17(1977), 184--190.</mixed-citation>
                    </ref>
                                    <ref id="ref15">
                        <label>15</label>
                        <mixed-citation publication-type="journal">Jbilou, K., Low rank approximate solutions to large sylvester matrix equations, Applied mathematics and computation, 177(2006), 365--376.</mixed-citation>
                    </ref>
                                    <ref id="ref16">
                        <label>16</label>
                        <mixed-citation publication-type="journal">Karimi, S., Attarzadeh, F., A new iterative scheme for solving the semi sylvester equation, Applied Mathematics, 4(2013), 1--6.</mixed-citation>
                    </ref>
                                    <ref id="ref17">
                        <label>17</label>
                        <mixed-citation publication-type="journal">Lu, L., Wachspress, E.L., Solution of lyapunov equations by alternating direction implicit iteration, Computers \&amp; Mathematics with Applications, 21(1991), 43--58.</mixed-citation>
                    </ref>
                                    <ref id="ref18">
                        <label>18</label>
                        <mixed-citation publication-type="journal">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.</mixed-citation>
                    </ref>
                                    <ref id="ref19">
                        <label>19</label>
                        <mixed-citation publication-type="journal">Saad, Y., Iterative Methods for Sparse Linear Systems. SIAM, 2003.</mixed-citation>
                    </ref>
                                    <ref id="ref20">
                        <label>20</label>
                        <mixed-citation publication-type="journal">Saad, Y., Schultz, M.H., Gmres: A generalized minimal residual algorithm for solving nonsymmetric linear systems, SIAM Journal on scientic and statistical computing, 7(1986), 856--869,</mixed-citation>
                    </ref>
                                    <ref id="ref21">
                        <label>21</label>
                        <mixed-citation publication-type="journal">Sidi, A., A unied approach to krylov subspace methods for the drazin-inverse solution of singular nonsymmetric linear systems, Linear Algebra and its Applications, 298(1999), 99--113.</mixed-citation>
                    </ref>
                                    <ref id="ref22">
                        <label>22</label>
                        <mixed-citation publication-type="journal">Sidi, A., Dgmres: A gmres-type algorithm for drazin-inverse solution of singular non-symmetric linear systems, Linear Algebra and its Applications, 335(2001), 189--204.</mixed-citation>
                    </ref>
                                    <ref id="ref23">
                        <label>23</label>
                        <mixed-citation publication-type="journal">Sima, V., Algorithms for Linear-Quadratic Optimization, volume 200. CRC Press, 1996.</mixed-citation>
                    </ref>
                                    <ref id="ref24">
                        <label>24</label>
                        <mixed-citation publication-type="journal">Sorensen, D.C., Antoulas, A., The sylvester equation and approximate balanced reduction, Linear Algebra and its Applications, 351(2002), 671--700.</mixed-citation>
                    </ref>
                                    <ref id="ref25">
                        <label>25</label>
                        <mixed-citation publication-type="journal">Wei, Y., Wu, H., Additional results on index splittings for drazin inverse solutions of singular linear systems, Electronic Journal of Linear Algebra, 27(2001), 300--332.</mixed-citation>
                    </ref>
                            </ref-list>
                    </back>
    </article>
