IDEAS home Printed from https://ideas.repec.org/a/eee/apmaco/v453y2023ics0096300323002242.html
   My bibliography  Save this article

Fast verified computation for real powers of large matrices with Kronecker structure

Author

Listed:
  • Miyajima, Shinya

Abstract

Let ⊗ be the Kronecker product, In be the n×n identity matrix, α∈R, A∈Cm×m, B∈Cn×n, C∈Cm×n, and vec(C) be a column vector by stacking the columns of C. We propose two fast numerical algorithms for computing interval vectors containing (In⊗A+B⊗Im)αvec(C), where C has rank one. Particular emphasis is put on the computational costs of these algorithms, which are only O(m3+n3) if |α|≪min(m,n). The first algorithm is based on numerical spectral decomposition of A and B. Radii given by the first algorithm are smaller than those by the second algorithm when numerically computed eigenvector matrices for A and B are well-conditioned. The second algorithm is based on numerical block diagonalization, and applicable even when the computed eigenvector matrices are singular or ill-conditioned. Numerical results show efficiency of the algorithms.

Suggested Citation

  • Miyajima, Shinya, 2023. "Fast verified computation for real powers of large matrices with Kronecker structure," Applied Mathematics and Computation, Elsevier, vol. 453(C).
  • Handle: RePEc:eee:apmaco:v:453:y:2023:i:c:s0096300323002242
    DOI: 10.1016/j.amc.2023.128055
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0096300323002242
    Download Restriction: Full text for ScienceDirect subscribers only

    File URL: https://libkey.io/10.1016/j.amc.2023.128055?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
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Miyajima, Shinya, 2019. "Verified computation for the matrix Lambert W function," Applied Mathematics and Computation, Elsevier, vol. 362(C), pages 1-1.
    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. Lóczi, Lajos, 2022. "Guaranteed- and high-precision evaluation of the Lambert W function," Applied Mathematics and Computation, Elsevier, vol. 433(C).

    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:eee:apmaco:v:453:y:2023:i:c:s0096300323002242. 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: Catherine Liu (email available below). General contact details of provider: https://www.journals.elsevier.com/applied-mathematics-and-computation .

    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.