Expokit provides a set of routines aimed at computing matrix exponentials. More precisely, it computes either a small matrix exponential in full, the action of a large sparse matrix exponential on an operand vector, or the solution of a system of linear ordinary differential equations with constant inhomogeneity. The backbone of the sparse routines consists of matrix-free Krylov subspace projection methods (Arnoldi and Lanczos processes), and that is why the toolkit is capable of coping with sparse matrices of large dimension. The software handles real and complex matrices and provides specific routines for symmetric and Hermitian matrices. The computation of matrix exponentials is a numerical issue of critical importance in the area of Markov chains and furthermore, the computed solution is subject to probabilistic constraints. In addition to addressing general matrix exponentials, a distinct attention is assigned to the computation of transient states of Markov chains.

References in zbMATH (referenced in 185 articles , 1 standard article )

Showing results 1 to 20 of 185.
Sorted by year (citations)

1 2 3 ... 8 9 10 next

  1. Botchev, M. A.: An accurate restarting for shift-and-invert Krylov subspaces computing matrix exponential actions of nonsymmetric matrices (2021)
  2. Chow, Kevin; Ruuth, Steven J.: Linearly stabilized schemes for the time integration of stiff nonlinear PDEs (2021)
  3. Du, Qiang; Ju, Lili; Li, Xiao; Qiao, Zhonghua: Maximum bound principles for a class of semilinear parabolic equations and exponential time-differencing schemes (2021)
  4. Li, Dongping; Zhang, Xiuying; Liu, Renyun: Exponential integrators for large-scale stiff Riccati differential equations (2021)
  5. Narayanamurthi, Mahesh; Sandu, Adrian: Partitioned exponential methods for coupled multiphysics systems (2021)
  6. Patané, Giuseppe: Spectrum-free and meshless solvers of parabolic PDEs (2021)
  7. Seydaoğlu, Muaz; Bader, Philipp; Blanes, Sergio; Casas, Fernando: Computing the matrix sine and cosine simultaneously with a reduced number of products (2021)
  8. Ackerer, Damien; Filipović, Damir: Linear credit risk models (2020)
  9. Bertaccini, D.; Durastante, F.: Computing functions of very large matrices with small TT/QTT ranks by quadrature formulas (2020)
  10. Botchev, M. A.; Knizhnerman, L. A.: ART: adaptive residual-time restarting for Krylov subspace matrix exponential evaluations (2020)
  11. Calandrini, Sara; Pieper, Konstantin; Gunzburger, Max D.: Exponential time differencing for the tracer equations appearing in primitive equation ocean models (2020)
  12. Ferreira, Orizon P.; Louzeiro, Mauricio S.; Prudente, Leandro F.: Iteration-complexity and asymptotic analysis of steepest descent method for multiobjective optimization on Riemannian manifolds (2020)
  13. Gao, Huadong; Ju, Lili; Duddu, Ravindra; Li, Hongwei: An efficient second-order linear scheme for the phase field model of corrosive dissolution (2020)
  14. Gao, Huadong; Ju, Lili; Li, Xiao; Duddu, Ravindra: A space-time adaptive finite element method with exponential time integrator for the phase field model of pitting corrosion (2020)
  15. Hoang, Thi-Thao-Phuong; Ju, Lili; Wang, Zhu: Nonoverlapping localized exponential time differencing methods for diffusion problems (2020)
  16. Jawecki, Tobias; Auzinger, Winfried; Koch, Othmar: Computable upper error bounds for Krylov approximations to matrix exponentials and associated (\varphi)-functions (2020)
  17. Jimenez, J. C.; de la Cruz, H.; De Maio, P. A.: Efficient computation of phi-functions in exponential integrators (2020)
  18. Narayanamurthi, Mahesh; Sandu, Adrian: Efficient implementation of partitioned stiff exponential Runge-Kutta methods (2020)
  19. Zeilmann, Alexander; Savarino, Fabrizio; Petra, Stefania; Schnörr, Christoph: Geometric numerical integration of the assignment flow (2020)
  20. Isherwood, Leah; Grant, Zachary J.; Gottlieb, Sigal: Strong stability preserving integrating factor two-step Runge-Kutta methods (2019)

1 2 3 ... 8 9 10 next