Computational graphs for matrix functions
From MaRDI portal
Publication:6599989
DOI10.1145/3568991MaRDI QIDQ6599989FDOQ6599989
Authors: Elias Jarlebring, Massimiliano Fasi, Emil Ringh
Publication date: 6 September 2024
Published in: ACM Transactions on Mathematical Software (Search for Journal in Brave)
Cites Work
- Julia: a fresh approach to numerical computing
- Functions of Matrices
- Nineteen Dubious Ways to Compute the Exponential of a Matrix
- Title not available (Why is that?)
- Title not available (Why is that?)
- Learning representations by back-propagating errors
- Deep learning
- Title not available (Why is that?)
- MPFR
- Title not available (Why is that?)
- Accuracy and Stability of Numerical Algorithms
- Title not available (Why is that?)
- Computing the action of the matrix exponential, with an application to exponential integrators
- Computing real square roots of a real matrix
- The Scaling and Squaring Method for the Matrix Exponential Revisited
- Efficient computation of the matrix cosine
- Accurate matrix exponential computation to solve coupled differential models in engineering
- On the Number of Nonscalar Multiplications Necessary to Evaluate Polynomials
- Title not available (Why is that?)
- A new scaling and squaring algorithm for the matrix exponential
- Efficient mixed rational and polynomial approximation of matrix functions
- Unconstrained Optimization of Real Functions in Complex Variables
- A recurrence among the elements of functions of triangular matrices
- A Schur method for the square root of a matrix
- The matrix sign function and computations in systems
- New scaling-squaring Taylor algorithms for computing the matrix exponential
- Computing the wave-kernel matrix functions
- Efficient evaluation of matrix polynomials
- The numerical range is a \((1+\sqrt{2})\)-spectral set
- Computing the matrix sine and cosine simultaneously with a reduced number of products
- Boosting the computation of the matrix exponential
- Fast Taylor polynomial evaluation for the computation of the matrix cosine
- An efficient algorithm to compute the exponential of skew-Hermitian matrices for the time integration of the Schrödinger equation
- Optimality of the Paterson-Stockmeyer method for evaluating matrix polynomials and rational matrix functions
- An Arbitrary Precision Scaling and Squaring Algorithm for the Matrix Exponential
- Multiprecision algorithms for computing the matrix logarithm
- Iterative Berechnung der reziproken Matrix.
- Arbitrary precision algorithms for computing the matrix cosine and its Fréchet derivative
- Calculating elements of matrix functions using divided differences
This page was built for publication: Computational graphs for matrix functions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6599989)