IDEAS home Printed from https://ideas.repec.org/a/gam/jmathe/v9y2021i14p1600-d590052.html
   My bibliography  Save this article

Efficient Evaluation of Matrix Polynomials beyond the Paterson–Stockmeyer Method

Author

Listed:
  • Jorge Sastre

    (Instituto de Telecomunicaciones y Aplicaciones Multimedia, Universitat Politècnica de València, Camino de Vera s/n, 46022 Valencia, Spain)

  • Javier Ibáñez

    (Instituto de Instrumentación para Imagen Molecular, Universitat Politècnica de València, Camino de Vera s/n, 46022 Valencia, Spain)

Abstract

Recently, two general methods for evaluating matrix polynomials requiring one matrix product less than the Paterson–Stockmeyer method were proposed, where the cost of evaluating a matrix polynomial is given asymptotically by the total number of matrix product evaluations. An analysis of the stability of those methods was given and the methods have been applied to Taylor-based implementations for computing the exponential, the cosine and the hyperbolic tangent matrix functions. Moreover, a particular example for the evaluation of the matrix exponential Taylor approximation of degree 15 requiring four matrix products was given, whereas the maximum polynomial degree available using Paterson–Stockmeyer method with four matrix products is 9. Based on this example, a new family of methods for evaluating matrix polynomials more efficiently than the Paterson–Stockmeyer method was proposed, having the potential to achieve a much higher efficiency, i.e., requiring less matrix products for evaluating a matrix polynomial of certain degree, or increasing the available degree for the same cost. However, the difficulty of these family of methods lies in the calculation of the coefficients involved for the evaluation of general matrix polynomials and approximations. In this paper, we provide a general matrix polynomial evaluation method for evaluating matrix polynomials requiring two matrix products less than the Paterson-Stockmeyer method for degrees higher than 30. Moreover, we provide general methods for evaluating matrix polynomial approximations of degrees 15 and 21 with four and five matrix product evaluations, respectively, whereas the maximum available degrees for the same cost with the Paterson–Stockmeyer method are 9 and 12, respectively. Finally, practical examples for evaluating Taylor approximations of the matrix cosine and the matrix logarithm accurately and efficiently with these new methods are given.

Suggested Citation

  • Jorge Sastre & Javier Ibáñez, 2021. "Efficient Evaluation of Matrix Polynomials beyond the Paterson–Stockmeyer Method," Mathematics, MDPI, vol. 9(14), pages 1-23, July.
  • Handle: RePEc:gam:jmathe:v:9:y:2021:i:14:p:1600-:d:590052
    as

    Download full text from publisher

    File URL: https://www.mdpi.com/2227-7390/9/14/1600/pdf
    Download Restriction: no

    File URL: https://www.mdpi.com/2227-7390/9/14/1600/
    Download Restriction: no
    ---><---

    References listed on IDEAS

    as
    1. Sastre, Jorge & Ibáñez, Javier & Alonso, Pedro & Peinado, Jesús & Defez, Emilio, 2017. "Two algorithms for computing the matrix cosine function," Applied Mathematics and Computation, Elsevier, vol. 312(C), pages 66-77.
    2. Sastre, J. & Ibáñez, J. & Defez, E., 2019. "Boosting the computation of the matrix exponential," Applied Mathematics and Computation, Elsevier, vol. 340(C), pages 206-220.
    Full references (including those not matched with items on IDEAS)

    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. Sastre, J. & Ibáñez, J. & Defez, E., 2019. "Boosting the computation of the matrix exponential," Applied Mathematics and Computation, Elsevier, vol. 340(C), pages 206-220.
    2. Javier Ibáñez & Jorge Sastre & Pedro Ruiz & José M. Alonso & Emilio Defez, 2021. "An Improved Taylor Algorithm for Computing the Matrix Logarithm," Mathematics, MDPI, vol. 9(17), pages 1-19, August.
    3. Bader, Philipp & Blanes, Sergio & Casas, Fernando & Seydaoğlu, Muaz, 2022. "An efficient algorithm to compute the exponential of skew-Hermitian matrices for the time integration of the Schrödinger equation," Mathematics and Computers in Simulation (MATCOM), Elsevier, vol. 194(C), pages 383-400.
    4. Javier Ibáñez & José M. Alonso & Jorge Sastre & Emilio Defez & Pedro Alonso-Jordá, 2021. "Advances in the Approximation of the Matrix Hyperbolic Tangent," Mathematics, MDPI, vol. 9(11), pages 1-20, May.

    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:gam:jmathe:v:9:y:2021:i:14:p:1600-:d:590052. 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: MDPI Indexing Manager (email available below). General contact details of provider: https://www.mdpi.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.