IDEAS home Printed from https://ideas.repec.org/a/hin/jnljam/507175.html
   My bibliography  Save this article

Riemannian Gradient Algorithm for the Numerical Solution of Linear Matrix Equations

Author

Listed:
  • Xiaomin Duan
  • Huafei Sun
  • Xinyu Zhao

Abstract

A Riemannian gradient algorithm based on geometric structures of a manifold consisting of all positive definite matrices is proposed to calculate the numerical solution of the linear matrix equation . In this algorithm, the geodesic distance on the curved Riemannian manifold is taken as an objective function and the geodesic curve is treated as the convergence path. Also the optimal variable step sizes corresponding to the minimum value of the objective function are provided in order to improve the convergence speed. Furthermore, the convergence speed of the Riemannian gradient algorithm is compared with that of the traditional conjugate gradient method in two simulation examples. It is found that the convergence speed of the provided algorithm is faster than that of the conjugate gradient method.

Suggested Citation

  • Xiaomin Duan & Huafei Sun & Xinyu Zhao, 2014. "Riemannian Gradient Algorithm for the Numerical Solution of Linear Matrix Equations," Journal of Applied Mathematics, Hindawi, vol. 2014, pages 1-7, January.
    • Handle: RePEc:hin:jnljam:507175
    DOI: 10.1155/2014/507175
    as

    Download full text from publisher

    File URL: http://downloads.hindawi.com/journals/JAM/2014/507175.pdf
    Download Restriction: no
    File URL: http://downloads.hindawi.com/journals/JAM/2014/507175.xml
    Download Restriction: no
    File URL: https://libkey.io/10.1155/2014/507175?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
    ---><---

    Citations

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


    Cited by:

    1. Win, Aung Naing & Li, Mingming, 2022. "Numerical method based on fiber bundle for solving Lyapunov matrix equation," Mathematics and Computers in Simulation (MATCOM), Elsevier, vol. 193(C), pages 556-566.

    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:hin:jnljam:507175. 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.

    We have no bibliographic references for this item. You can help adding them by using 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: Mohamed Abdelhakeem (email available below). General contact details of provider: https://www.hindawi.com .

    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.