mftoolbox

The Matrix Function Toolbox is a MATLAB toolbox connected with functions of matrices. It is associated with the book Functions of Matrices: Theory and Computation and contains implementations of many of the algorithms described in the book. The book is the main documentation for the toolbox. The toolbox is intended to facilitate understanding of the algorithms through MATLAB experiments, to be useful for research in the subject, and to provide a basis for the development of more sophisticated implementations. The codes are ”plain vanilla” versions; they contain the core algorithmic aspects with a minimum of inessential code. In particular, the following features should be noted. The codes have little error checking of input arguments. The codes do not print intermediate results or the progress of an iteration. For the iterative algorithms a convergence tolerance is hard-coded (in function mft_tolerance). For greater flexibility this tolerance could be made an input argument. The codes are designed for simplicity and readability rather than maximum efficiency. Algorithmic options such as preprocessing are omitted. The codes are intended for double precision matrices. Those algorithms in which the parameters can be adapted to the precision have not been written to take advantage of single precision inputs.


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

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

1 2 3 ... 22 23 24 next

  1. Abdalla, Mohamed: Special matrix functions: characteristics, achievements and future directions (2020)
  2. Abul-Ez, M.; Abd-Elmageed, H.; Hidan, M.; Abdalla, M.: On the growth order and growth type of entire functions of several complex matrices (2020)
  3. Acebrón, Juan A.: A probabilistic linear solver based on a multilevel Monte Carlo method (2020)
  4. Ackerer, Damien; Filipović, Damir: Linear credit risk models (2020)
  5. Baake, Michael; Sumner, Jeremy: Notes on Markov embedding (2020)
  6. Bao, Sijia; Constales, Denis; De Bie, Hendrik; Mertens, Teppo: Solutions for the Lévy-Leblond or parabolic Dirac equation and its generalizations (2020)
  7. Barbarino, Giovanni; Garoni, Carlo; Serra-Capizzano, Stefano: Block generalized locally Toeplitz sequences: theory and applications in the multidimensional case (2020)
  8. Bertaccini, D.; Durastante, F.: Computing functions of very large matrices with small TT/QTT ranks by quadrature formulas (2020)
  9. Casanellas, Marta; Fernández-Sánchez, Jesús; Roca-Lacostena, Jordi: Embeddability and rate identifiability of Kimura 2-parameter matrices (2020)
  10. Čiegis, Raimondas; Vabishchevich, Petr N.: High order numerical schemes for solving fractional powers of elliptic operators (2020)
  11. Faßbender, Heike; Halwaß, Martin: On the singular value decomposition of (skew-)involutory and (skew-)coninvolutory matrices (2020)
  12. Fika, Paraskevi; Mitrouli, Marilena; Roupa, Paraskevi; Triantafyllou, Dimitrios: The e-MoM approach for approximating matrix functionals (2020)
  13. Guo, Chun-Hua; Lu, Di: A study of Schröder’s method for the matrix (p)th root using power series expansions (2020)
  14. Hached, M.; Jbilou, K.: Numerical methods for differential linear matrix equations via Krylov subspace methods (2020)
  15. Jawecki, Tobias; Auzinger, Winfried; Koch, Othmar: Computable upper error bounds for Krylov approximations to matrix exponentials and associated (\varphi)-functions (2020)
  16. Masetti, G.; Robol, L.: Computing performability measures in Markov chains by means of matrix functions (2020)
  17. Mbekhta, Mostafa: Approximation of the polar factor of an operator acting on a Hilbert space (2020)
  18. Miao, Yun; Qi, Liqun; Wei, Yimin: Generalized tensor function via the tensor singular value decomposition based on the T-product (2020)
  19. Neto, Antônio Francisco: Matrix analysis and omega calculus (2020)
  20. Seo, Sang-Hyup; Seo, Jong-Hyeon: Convergence of relaxed Newton method for order-convex matrix equations (2020)

1 2 3 ... 22 23 24 next