This paper presents, a preconditioned version of global FOM and GMRES methods for solving Lyapunov matrix equations AX +XAT = −BTB. These preconditioned methods are based on the global full orthogo-nalization and generalized minimal residual methods. For constructing effective preconditioners, we will use ADI spiliting of above lyapunov matrix equations. Numerical experiments show that the solution of Lyapunov matrix equation can be obtained with high accuracy by us-ing the preconditioned version of global FOM and GMRES algorithms and this version are more robust and more efficient than those without preconditioning
We investigate the numerical solution of the stable generalized Lyapunov equation via the sign funct...
In the present work, we propose a new projection method for solving the matrix equation AXB = F. For...
International audienceKrylov methods such as GMRES are efficient iterative methods to solve large sp...
AbstractIn the present paper, we propose preconditioned Krylov methods for solving large Lyapunov ma...
We look at solving large nonsymmetric systems of linear equations using polynomial preconditioned Kr...
In the present paper, we propose a preconditioned global approach as a new strategy to solve linear ...
We consider solving a large-scale Lyapunov equation for a multi-agent system. As is well known, the ...
AbstractIn the present paper, we propose the global full orthogonalization method (Gl-FOM) and globa...
The GMRES(m) method is often used to compute Krylov subspace solutions of large sparse linear system...
This paper is concerned with the numerical solution of symmetric large-scale Lyapunov equations with...
This paper considers the solution of large-scale generalized continuous-time Lyapunov matrix equatio...
Two efficient methods for solving generalized Lyapunov equations and their implementations in FORTRA...
This work is concerned with the numerical solution of large-scale linear matrix equations A1XB1T++AK...
We investigate the numerical solution of the stable generalized Lyapunov equation via the sign funct...
Two efficient methods for solving generalized Lyapunov equations and their implementations in FORTRA...
We investigate the numerical solution of the stable generalized Lyapunov equation via the sign funct...
In the present work, we propose a new projection method for solving the matrix equation AXB = F. For...
International audienceKrylov methods such as GMRES are efficient iterative methods to solve large sp...
AbstractIn the present paper, we propose preconditioned Krylov methods for solving large Lyapunov ma...
We look at solving large nonsymmetric systems of linear equations using polynomial preconditioned Kr...
In the present paper, we propose a preconditioned global approach as a new strategy to solve linear ...
We consider solving a large-scale Lyapunov equation for a multi-agent system. As is well known, the ...
AbstractIn the present paper, we propose the global full orthogonalization method (Gl-FOM) and globa...
The GMRES(m) method is often used to compute Krylov subspace solutions of large sparse linear system...
This paper is concerned with the numerical solution of symmetric large-scale Lyapunov equations with...
This paper considers the solution of large-scale generalized continuous-time Lyapunov matrix equatio...
Two efficient methods for solving generalized Lyapunov equations and their implementations in FORTRA...
This work is concerned with the numerical solution of large-scale linear matrix equations A1XB1T++AK...
We investigate the numerical solution of the stable generalized Lyapunov equation via the sign funct...
Two efficient methods for solving generalized Lyapunov equations and their implementations in FORTRA...
We investigate the numerical solution of the stable generalized Lyapunov equation via the sign funct...
In the present work, we propose a new projection method for solving the matrix equation AXB = F. For...
International audienceKrylov methods such as GMRES are efficient iterative methods to solve large sp...