Pasar al contenido principal

Resultados relacionados

Resultados totales (Incluyendo duplicados): 2
Encontrada(s) 1 página(s)

RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publicación Artículo científico (JournalArticle)

Computing the matrix sine and cosine simultaneously with a reduced number of products

  • Seydaoglu, Muaz
  • Bader, Philipp
  • Casas, Fernando
  • Blanes Zamora, Sergio|||0000-0001-5819-8898
[EN] A new procedure is presented for computing the matrix cosine and sine simultaneously by means of Taylor polynomial approximations. These are factorized so as to reduce the number of matrix products involved. Two versions are developed to be used in single and double precision arithmetic. The resulting algorithms are more efficient than schemes based on Pade approximations for a wide range of norm matrices., The work of MS has been funded by the Scientific and Technological Research Council of Turkey (TUBITAK) with Grand Number 1059B191802292. PB, SB and FC acknowledge financial support from Ministerio de Economia, Industria y Competitividad(Spain) through projects MTM2016-77660-P and PID2019-104927GB-C21 (AEI/FEDER, UE).
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publicación Artículo científico (JournalArticle)

An efficient algorithm to compute the exponential of skew-Hermitian matrices for the time integration of the Schrodinger equation

  • Bader, Philipp
  • Casas, Fernando
  • Seydaoglu, Muaz
  • Blanes Zamora, Sergio|||0000-0001-5819-8898
[EN] We present a practical algorithm to approximate the exponential of skew-Hermitian matrices up to round-off error based on an efficient computation of Chebyshev polynomials of matrices and the corresponding error analysis. It is based on Chebyshev polynomials of degrees 2, 4, 8, 12 and 18 which are computed with only 1, 2, 3, 4 and 5 matrix-matrix products, respectively. For problems of the form exp(-i A), with A a real and symmetric matrix, an improved version is presented that computes the sine and cosine of A with a reduced computational cost. The theoretical analysis, supported by numerical experiments, indicates that the new methods are more efficient than schemes based on rational Pade approximants and Taylor polynomials for all tolerances and time interval lengths. The new procedure is particularly recommended to be used in conjunction with exponential integrators for the numerical time integration of the Schrodinger equation., SB and FC have been supported by Ministerio de Ciencia e Innovacion (Spain) through project PID2019-104927GB-C21 (AEI/FEDER, UE). The work of MS has been funded by the Scientific and Technological Research Council of Turkey (TUBITAK) with Grant Number 1059B191802292. SB and FC would like to thank the Isaac Newton Institute for Mathematical Sciences for support and hospitality during the programme "Geometry, compatibility and structure preservation in computational differential equations", when work on this paper was undertaken. This work was been additionally supported by EPSRC, United Kingdom Grant Number EP/R014604/1. The authors wish to thank the referee for his/her detailed list of comments and suggestions which were most helpful to improve the presentation of the paper.