In the present paper, we consider large-scale continuous-time differential matrix Riccati equations. To the authors' knowledge, the two main approaches proposed in the litterature are based on a splitting scheme or on a Rosenbrock / Backward Differentiation Formula (BDF) methods. The approach we propose is based on the reduction of the problem dimension prior to integration. We project the initial problem onto an extended block Krylov subspace and obtain a low-dimensional differential matrix Riccati equation. The latter matrix differential problem is then solved by a Backward Differentiation Formula (BDF) method and the obtained solution is used to reconstruct an approximate solution of the original problem. This process is repeated, increasing the dimension of the projection subspace until achieving a chosen accuracy. We give some theoretical results and a simple expression of the residual allowing the implementation of a stop test in order to limit the dimension of the projection space. Some numerical experiments will be given.
Abstract. In the present paper, we consider large-scale differential Lyapunov matrix equations having a low rank constant term. We present two new approaches for the numerical resolution of such differential matrix equations. The first approach is based on the integral expression of the exact solution and an approximation method for the computation of the exponential of a matrix times a block of vectors. In the second approach, we first project the initial problem onto a block (or extended block) Krylov subspace and get a low-dimensional differential Lyapunov matrix equation. The latter differential matrix problem is then solved by the Backward Differentiation Formula method (BDF) and the obtained solution is used to build the low rank approximate solution of the original problem. The process being repeated until some prescribed accuracy is achieved. We give some new theoretical results and present some numerical experiments.
Abstract:In recent years, a great interest has been shown towards Krylov subspace techniques applied to model order reduction of large-scale dynamical systems. A special interest has been devoted to single-input single-output (SISO) systems by using moment matching techniques based on Arnoldi or Lanczos algorithms. In this paper, we consider multiple-input multiple-output (MIMO) dynamical systems and introduce the rational block Arnoldi process to design low order dynamical systems that are close in some sense to the original MIMO dynamical system. Rational Krylov subspace methods are based on the choice of suitable shifts that are selected a priori or adaptively. In this paper, we propose an adaptive selection of those shifts and show the efficiency of this approach in our numerical tests. We also give some new block Arnoldi-like relations that are used to propose an upper bound for the norm of the error on the transfer function.
In this paper, we propose a block Arnoldi method for solving the continuous low-rank Sylvester matrix equation AX C XB D EF T . We consider the case where both A and B are large and sparse real matrices, and E and F are real matrices with small rank. We first apply an alternating directional implicit preconditioner to our equation, turning it into a Stein matrix equation. We then apply a block Krylov method to the Stein equation to extract low-rank approximate solutions. We give some theoretical results and report numerical experiments to show the efficiency of this method.where the unknown matrix X 2 R n s , the coefficient matrices A 2 R n n , B 2 R s s and E 2 R n r , F 2 R s r are full rank with r n, s. Sylvester equations arise in numerous applied areas such as control and communication theory and model reduction problems [1][2][3]. The matrix Equation (1) appears also in the numerical solution of matrix differential Riccati equations, in decoupling techniques for ordinary and partial differential equations, and in filtering and image restoration (see, e.g., [4][5][6] and also the references [7,8]).The matrix Equation (1) can be reformulated as the ns ns linear system .
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.
hi@scite.ai
10624 S. Eastern Ave., Ste. A-614
Henderson, NV 89052, USA
Copyright © 2024 scite LLC. All rights reserved.
Made with 💙 for researchers
Part of the Research Solutions Family.