Seydaoğlu, Muaz; Bader, Philipp; Blanes, Sergio; Casas, Fernando Computing the matrix sine and cosine simultaneously with a reduced number of products. (English) Zbl 1460.65047 Appl. Numer. Math. 163, 96-107 (2021). Summary: 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 Padé approximations for a wide range of norm matrices. Cited in 2 Documents MSC: 65F60 Numerical computation of matrix exponential and similar matrix functions Keywords:matrix sine function; matrix cosine function; Taylor series; Padé approximation; matrix polynomials Software:mftoolbox; Expokit PDFBibTeX XMLCite \textit{M. Seydaoğlu} et al., Appl. Numer. Math. 163, 96--107 (2021; Zbl 1460.65047) Full Text: DOI arXiv References: [1] Al-Mohy, A. H.; Higham, N. J.; Relton, S. D., New algorithms for computing the matrix sine and cosine separately or simultaneously, SIAM J. Sci. Comput., 37, A456-A487 (2015) · Zbl 1315.65045 [2] Bader, P.; Blanes, S.; Casas, F., An improved algorithm to compute the exponential of a matrix (2017), preprint [3] Bader, P.; Blanes, S.; Casas, F., Computing the matrix exponential with an optimized Taylor polynomial approximation, Mathematics, 7, 1174 (2019) [4] Bader, P.; Blanes, S.; Ponsoda, E.; Seydaoğlu, M., Symplectic integrators for the matrix Hill’s equation and its applications to engineering models, J. Comput. Appl. Math., 316, 47-59 (2017) · Zbl 1372.65327 [5] Bader, P.; Blanes, S.; Seydaoğlu, M., The scaling, splitting and squaring method for the exponential of perturbed matrices, SIAM J. Matrix Anal. Appl., 36, 594-614 (2015) · Zbl 1328.65097 [6] Blanes, S.; Casas, F., A Concise Introduction to Geometric Numerical Integration (2016), CRC Press: CRC Press Boca Raton, FL, USA · Zbl 1343.65146 [7] Blanes, S.; Casas, F.; Murua, A., An efficient algorithm based on splitting for the time integration of the Schrödinger equation, J. Comput. Phys., 303, 396-412 (2015) · Zbl 1349.65393 [8] Blanes, S.; Casas, F.; Oteo, J. A.; Ros, J., The Magnus expansion and some of its applications, Phys. Rep., 470, 151-238 (2009) [9] Blanes, S.; Casas, F.; Ros, J., High order optimized geometric integrators for linear differential equations, BIT Numer. Math., 42, 262-284 (2002) · Zbl 1008.65045 [10] Dolan, E. D.; More, J. J., Benchmarking optimization software with performance profiles, Math. Program., 91, 201-213 (2002) · Zbl 1049.90004 [11] Hairer, E.; Lubich, C.; Wanner, G., Geometric Numerical Integration. Structure-Preserving Algorithms for Ordinary Differential Equations (2006), Springer: Springer Berlin · Zbl 1094.65125 [12] Higham, N. J., Functions of Matrices: Theory and Computation (2008), Society for Industrial and Applied Mathematics: Society for Industrial and Applied Mathematics Philadelphia, PA, USA · Zbl 1167.15001 [13] Higham, N. J.; Al-Mohy, A. H., Computing matrix functions, Acta Numer., 19, 159-208 (2010) · Zbl 1242.65090 [14] Hochbruck, M.; Lubich, C., On Krylov subspace approximations to the matrix exponential operator, SIAM J. Numer. Anal., 34, 1911-1925 (1997) · Zbl 0888.65032 [15] Hochbruck, M.; Ostermann, A., Exponential integrators, Acta Numer., 19, 209-286 (2010) · Zbl 1242.65109 [16] Iserles, A., A First Course in the Numerical Analysis of Differential Equations (2008), Cambridge University Press [17] Iserles, A.; Munthe-Kaas, H. Z.; Nørsett, S. P.; Zanna, A., Lie group methods, Acta Numer., 9, 215-365 (2000) · Zbl 1064.65147 [18] Lei, L.; Nakamura, T., A fast algorithm for evaluating the matrix polynomial \(I + A + \cdots + A^{N - 1}\), IEEE Trans. Circuits Syst. I, Fundam. Theory Appl., 39, 299-300 (1992) · Zbl 0755.65043 [19] Leimkuhler, B.; Reich, S., Simulating Hamiltonian Dynamics (2004), Cambridge University Press · Zbl 1069.65139 [20] Liang, W.; Baer, R.; Saravanan, C.; Shao, Y.; Bell, A. T.; Head-Gordon, M., Fast methods for resumming matrix polynomials and Chebyshev matrix polynomials, J. Comput. Phys., 194, 575-587 (2004) · Zbl 1039.65002 [21] Lubich, C., From Quantum to Classical Molecular Dynamics: Reduced Models and Numerical Analysis (2008), European Mathematical Society · Zbl 1160.81001 [22] Moler, C. B.; Van Loan, C. F., Nineteen dubious ways to compute the exponential of a matrix, twenty-five years later, SIAM Rev., 45, 3-49 (2003) · Zbl 1030.65029 [23] Paterson, M. S.; Stockmeyer, L. J., On the number of nonscalar multiplications necessary to evaluate polynomials, SIAM J. Comput., 2, 60-66 (1973) · Zbl 0262.65033 [24] Sanz-Serna, J. M.; Calvo, M. P., Numerical Hamiltonian Problems (1994), Chapman & Hall: Chapman & Hall London · Zbl 0816.65042 [25] Sastre, J., Efficient evaluation of matrix polynomials, Linear Algebra Appl., 539, 229-250 (2018) · Zbl 1432.65029 [26] Sastre, J.; Ibáñez, J.; Alonso-Jordá, P.; Peinado, J.; Defez, E., Fast Taylor polynomial evaluation for the computation of the matrix cosine, J. Comput. Appl. Math., 354, 641-650 (2019) · Zbl 1434.65059 [27] Sastre, J.; Ibáñez, J.; Defez, E., Boosting the computation of the matrix exponential, Appl. Math. Comput., 340, 206-220 (2019) · Zbl 1429.65093 [28] Sidje, R. B., Expokit: a software package for computing matrix exponentials, ACM Trans. Math. Softw., 24, 130-156 (1998) · Zbl 0917.65063 [29] Van Loan, C., A note on the evaluation of matrix polynomials, IEEE Trans. Autom. Control, 24, 320-321 (1979) · Zbl 0401.65027 [30] Westreich, D., Evaluating the matrix polynomial \(I + A + \cdots + A^{N - 1}\), IEEE Trans. Circuits Syst., 36, 162-164 (1989) · Zbl 0669.68025 This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.