IDEAS home Printed from https://ideas.repec.org/a/wly/jnljam/v2012y2012i1n401059.html

A Preconditioned Iteration Method for Solving Sylvester Equations

Author

Listed:
  • Jituan Zhou
  • Ruirui Wang
  • Qiang Niu

Abstract

A preconditioned gradient‐based iterative method is derived by judicious selection of two auxil‐ iary matrices. The strategy is based on the Newton’s iteration method and can be regarded as a generalization of the splitting iterative method for system of linear equations. We analyze the convergence of the method and illustrate that the approach is able to considerably accelerate the convergence of the gradient‐based iterative method.

Suggested Citation

  • Jituan Zhou & Ruirui Wang & Qiang Niu, 2012. "A Preconditioned Iteration Method for Solving Sylvester Equations," Journal of Applied Mathematics, John Wiley & Sons, vol. 2012(1).
  • Handle: RePEc:wly:jnljam:v:2012:y:2012:i:1:n:401059
    DOI: 10.1155/2012/401059
    as

    Download full text from publisher

    File URL: https://doi.org/10.1155/2012/401059
    Download Restriction: no

    File URL: https://libkey.io/10.1155/2012/401059?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    References listed on IDEAS

    as
    1. M. Y. Waziri & W. J. Leong & M. Mamat, 2012. "A Two‐Step Matrix‐Free Secant Method for Solving Large‐Scale Systems of Nonlinear Equations," Journal of Applied Mathematics, John Wiley & Sons, vol. 2012(1).
    2. M. Y. Waziri & W. J. Leong & M. Mamat, 2012. "A Two-Step Matrix-Free Secant Method for Solving Large-Scale Systems of Nonlinear Equations," Journal of Applied Mathematics, Hindawi, vol. 2012, pages 1-9, March.
    3. Danny C. Sorensen & Yunkai Zhou, 2003. "Direct methods for matrix Sylvester and Lyapunov equations," Journal of Applied Mathematics, John Wiley & Sons, vol. 2003(6), pages 277-303.
    4. Danny C. Sorensen & Yunkai Zhou, 2003. "Direct methods for matrix Sylvester and Lyapunov equations," Journal of Applied Mathematics, Hindawi, vol. 2003, pages 1-27, January.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. F. Toutounian & D. Khojasteh Salkuyeh & M. Mojarrab, 2015. "LSMR Iterative Method for General Coupled Matrix Equations," Journal of Applied Mathematics, John Wiley & Sons, vol. 2015(1).
    2. Ovgu Cidar Iyikal, 2022. "Numerical Solution of Sylvester Equation Based on Iterative Predictor‐Corrector Method," Journal of Mathematics, John Wiley & Sons, vol. 2022(1).
    3. Xu Li & Yu-Jiang Wu & Ai-Li Yang & Jin-Yun Yuan, 2014. "A Generalized HSS Iteration Method for Continuous Sylvester Equations," Journal of Applied Mathematics, John Wiley & Sons, vol. 2014(1).
    4. Kanmin Wang & Zhibing Liu & Chengfeng Xu, 2014. "A Modified Gradient Based Algorithm for Solving Matrix Equations AXB + CXTD = F," Journal of Applied Mathematics, John Wiley & Sons, vol. 2014(1).

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Kanmin Wang & Zhibing Liu & Chengfeng Xu, 2014. "A Modified Gradient Based Algorithm for Solving Matrix Equations AXB + CXTD = F," Journal of Applied Mathematics, John Wiley & Sons, vol. 2014(1).
    2. M. Y. Waziri & Z. A. Majid, 2013. "An Enhanced Matrix-Free Secant Method via Predictor-Corrector Modified Line Search Strategies for Solving Systems of Nonlinear Equations," International Journal of Mathematics and Mathematical Sciences, Hindawi, vol. 2013, pages 1-6, February.
    3. Binhuan Wang & Lanqiu Yao & Jiyuan Hu & Huilin Li, 2023. "A New Algorithm for Convex Biclustering and Its Extension to the Compositional Data," Statistics in Biosciences, Springer;International Chinese Statistical Association, vol. 15(1), pages 193-216, April.

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:wly:jnljam:v:2012:y:2012:i:1:n:401059. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Wiley Content Delivery (email available below). General contact details of provider: https://onlinelibrary.wiley.com/journal/4185 .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.