On Bernoulli series approximation for the matrix cosine
From MaRDI portal
Publication:6180315
DOI10.1002/mma.7041zbMath1527.65027OpenAlexW3106556896MaRDI QIDQ6180315
Jacinto-Javier Ibáñez, Emilio Defez, Pedro Alonso-Jordá, José M. Alonso
Publication date: 19 December 2023
Published in: Mathematical Methods in the Applied Sciences (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/10251/192123
Parallel algorithms in computer science (68W10) Numerical computation of matrix exponential and similar matrix functions (65F60)
Cites Work
- Unnamed Item
- Bounds for variable degree rational \(L_\infty\) approximations to the matrix cosine
- Computing matrix functions using mixed interpolation methods
- Rational approximations of trigonometric matrices with application to second-order systems of differential equations
- Constructive solution of strongly coupled continuous hyperbolic mixed problems.
- Efficient evaluation of matrix polynomials
- Two algorithms for computing the matrix cosine function
- An efficient and accurate algorithm for computing the matrix cosine based on new Hermite approximations
- Network bipartivity and the transportation efficiency of European passenger airlines
- Determination of a matrix function using the divided difference method of Newton and the interpolation technique of Hermite
- Fast Taylor polynomial evaluation for the computation of the matrix cosine
- FORTRAN codes for estimating the one-norm of a real or complex matrix, with applications to condition estimation
- An Algorithm for Computing the Matrix Cosine
- Application of finite difference method of lines on the heat equation
- Accurate and efficient matrix exponential computation
- New Algorithms for Computing the Matrix Sine and Cosine Separately or Simultaneously
- Functions of Matrices
- On the Number of Nonscalar Multiplications Necessary to Evaluate Polynomials
This page was built for publication: On Bernoulli series approximation for the matrix cosine
