Computational Krylov‐based methods for ...
Document type :
Compte-rendu et recension critique d'ouvrage
DOI :
Title :
Computational Krylov‐based methods for large‐scale differential Sylvester matrix problems
Author(s) :
Hached, Mustapha [Auteur]
Université de Lille
Laboratoire Paul Painlevé - UMR 8524 [LPP]
Jbilou, Khalide [Auteur]
Laboratoire de Mathématiques Pures et Appliquées Joseph Liouville [LMPA]
Université de Lille
Laboratoire Paul Painlevé - UMR 8524 [LPP]
Jbilou, Khalide [Auteur]
Laboratoire de Mathématiques Pures et Appliquées Joseph Liouville [LMPA]
Journal title :
Numerical Linear Algebra with Applications
Pages :
1-14 / e2187
Publisher :
Wiley
Publication date :
2018-10
ISSN :
1070-5325
English keyword(s) :
Extended block Krylov
Krylov subspaces
Low rank
Differential Sylvester equations
Krylov subspaces
Low rank
Differential Sylvester equations
HAL domain(s) :
Mathématiques [math]
English abstract : [en]
Summary In the present paper, we propose Krylov‐based methods for solving large‐scale differential Sylvester matrix equations having a low‐rank constant term. We present two new approaches for solving such differential ...
Show more >Summary In the present paper, we propose Krylov‐based methods for solving large‐scale differential Sylvester matrix equations having a low‐rank constant term. We present two new approaches for solving such differential matrix equations. The first approach is based on the integral expression of the exact solution and a Krylov 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 Sylvester matrix equation. The latter problem is then solved by some integration numerical methods such as the backward differentiation formula or Rosenbrock method, and the obtained solution is used to build the low‐rank approximate solution of the original problem. We give some new theoretical results such as a simple expression of the residual norm and upper bounds for the norm of the error. Some numerical experiments are given in order to compare the two approaches.Show less >
Show more >Summary In the present paper, we propose Krylov‐based methods for solving large‐scale differential Sylvester matrix equations having a low‐rank constant term. We present two new approaches for solving such differential matrix equations. The first approach is based on the integral expression of the exact solution and a Krylov 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 Sylvester matrix equation. The latter problem is then solved by some integration numerical methods such as the backward differentiation formula or Rosenbrock method, and the obtained solution is used to build the low‐rank approximate solution of the original problem. We give some new theoretical results such as a simple expression of the residual norm and upper bounds for the norm of the error. Some numerical experiments are given in order to compare the two approaches.Show less >
Language :
Anglais
Popular science :
Non
Collections :
Source :
Files
- document
- Open access
- Access the document
- Diff_Sylv_HAL.pdf
- Open access
- Access the document
- 1707.02078
- Open access
- Access the document
- 1707.02078
- Open access
- Access the document