Fast verified computation for stabilizing solutions of discrete-time algebraic Riccati equations

Fast iterative algorithms for computing interval matrices containing solutions of discrete-time algebraic Riccati equations are proposed. These algorithms involve only cubic complexity per iteration. The stabilizability and uniqueness of the contained solution can moreover be verified by these algorithms. Numerical results show the properties of the algorithms.