Abstract
Two numerical algorithms based on verified block diagonalization (VBD) are proposed to compute interval matrices containing the matrix real powers. The first algorithm uses VBD based on numerical spectral decomposition involving cubic complexity if the power exponent’s absolute value is not too large. In contrast, the second algorithm adopts VBD based on numerical Jordan decomposition involving quartic complexity, which is applicable even for defective matrices. Numerical results show the effectiveness of the algorithms.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Paper version not known
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
