Verified computation of matrix gamma function

01/18/2020
by   Shinya Miyajima, et al.
0

Two numerical algorithms are proposed for computing an interval matrix containing the matrix gamma function. In 2014, the author presented algorithms for enclosing all the eigenvalues and basis of invariant subspaces of A ∈C^n × n. As byproducts of these algorithms, we can obtain interval matrices containing small matrices whose spectrums are included in that of A. In this paper, we interpret the interval matrices containing the basis and small matrices as a result of verified block diagonalization (VBD), and establish a new framework for enclosing matrix functions using the VBD. To achieve enclosure for the gamma function of the small matrices, we derive computable perturbation bounds. We can apply these bounds if input matrices satisfy conditions. We incorporate matrix argument reductions (ARs) to force the input matrices to satisfy the conditions, and develop theories for accelerating the ARs. The first algorithm uses the VBD based on a numerical spectral decomposition, and involves only cubic complexity under an assumption. The second algorithm adopts the VBD based on a numerical Jordan decomposition, and is applicable even for defective matrices. Numerical results show efficiency and robustness of the algorithms.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
12/11/2019

Computing the spectral decomposition of interval matrices and a study on interval matrix power

We present an algorithm for computing a spectral decomposition of an int...
research
07/13/2021

Gamma-matrices: a new class of simultaneously diagonalizable matrices

In order to precondition Toeplitz systems, we present a new class of sim...
research
03/17/2021

On Some Bounds on the Perturbation of Invariant Subspaces of Normal Matrices with Application to a Graph Connection Problem

We provide upper bounds on the perturbation of invariant subspaces of no...
research
02/24/2016

Differentiation of the Cholesky decomposition

We review strategies for differentiating matrix-based computations, and ...
research
10/03/2021

A QLP Decomposition via Randomization

This paper is concerned with full matrix decomposition of matrices, prim...
research
03/21/2020

A Preconditioning Technique for Computing Functions of Triangular Matrices

We propose a simple preconditioning technique that, if incorporated into...
research
06/09/2021

Computing Markov functions of Toeplitz matrices

We investigate the problem of approximating the matrix function f(A) by ...

Please sign up or login with your details

Forgot password? Click here to reset