Spelling suggestions: "subject:"lyapunov equation"" "subject:"yapunov equation""
1 |
Gramian-Based Model Reduction for Data-Sparse SystemsBaur, Ulrike, Benner, Peter 27 November 2007 (has links) (PDF)
Model reduction is a common theme within the simulation, control and
optimization of complex dynamical systems. For instance, in control
problems for partial differential equations, the associated large-scale
systems have to be solved very often. To attack these problems in
reasonable time it is absolutely necessary to reduce the dimension of the
underlying system. We focus on model reduction by balanced truncation
where a system theoretical background provides some desirable properties
of the reduced-order system. The major computational task in
balanced truncation is the solution of large-scale Lyapunov equations,
thus the method is of limited use for really large-scale applications.
We develop an effective implementation of balancing-related model reduction
methods in exploiting the structure of the underlying problem.
This is done by a data-sparse approximation of the large-scale state
matrix A using the hierarchical matrix format. Furthermore, we integrate
the corresponding formatted arithmetic in the sign function method
for computing approximate solution factors of the Lyapunov equations.
This approach is well-suited for a class of practical relevant problems
and allows the application of balanced truncation and related methods
to systems coming from 2D and 3D FEM and BEM discretizations.
|
2 |
Numerical solution of generalized Lyapunov equationsPenzl, T. 30 October 1998 (has links) (PDF)
Two efficient methods for solving generalized Lyapunov equations and their implementations in FORTRAN 77 are presented. The first one is a generalization of the Bartels--Stewart method and the second is an extension of Hammarling's method to generalized Lyapunov equations. Our LAPACK based subroutines are implemented in a quite flexible way. They can handle the transposed equations and provide scaling to avoid overflow in the solution. Moreover, the Bartels--Stewart subroutine offers the optional estimation of the separation and the reciprocal condition number. A brief description of both algorithms is given. The performance of the software is demonstrated by numerical experiments.
|
3 |
Gramian-Based Model Reduction for Data-Sparse SystemsBaur, Ulrike, Benner, Peter 27 November 2007 (has links)
Model reduction is a common theme within the simulation, control and
optimization of complex dynamical systems. For instance, in control
problems for partial differential equations, the associated large-scale
systems have to be solved very often. To attack these problems in
reasonable time it is absolutely necessary to reduce the dimension of the
underlying system. We focus on model reduction by balanced truncation
where a system theoretical background provides some desirable properties
of the reduced-order system. The major computational task in
balanced truncation is the solution of large-scale Lyapunov equations,
thus the method is of limited use for really large-scale applications.
We develop an effective implementation of balancing-related model reduction
methods in exploiting the structure of the underlying problem.
This is done by a data-sparse approximation of the large-scale state
matrix A using the hierarchical matrix format. Furthermore, we integrate
the corresponding formatted arithmetic in the sign function method
for computing approximate solution factors of the Lyapunov equations.
This approach is well-suited for a class of practical relevant problems
and allows the application of balanced truncation and related methods
to systems coming from 2D and 3D FEM and BEM discretizations.
|
4 |
Numerical solution of generalized Lyapunov equationsPenzl, T. 30 October 1998 (has links)
Two efficient methods for solving generalized Lyapunov equations and their implementations in FORTRAN 77 are presented. The first one is a generalization of the Bartels--Stewart method and the second is an extension of Hammarling's method to generalized Lyapunov equations. Our LAPACK based subroutines are implemented in a quite flexible way. They can handle the transposed equations and provide scaling to avoid overflow in the solution. Moreover, the Bartels--Stewart subroutine offers the optional estimation of the separation and the reciprocal condition number. A brief description of both algorithms is given. The performance of the software is demonstrated by numerical experiments.
|
5 |
A cyclic low rank Smith method for large, sparse Lyapunov equations with applications in model reduction and optimal controlPenzl, T. 30 October 1998 (has links) (PDF)
We present a new method for the computation of low rank approximations
to the solution of large, sparse, stable Lyapunov equations. It is based
on a generalization of the classical Smith method and profits by the
usual low rank property of the right hand side matrix.
The requirements of the method are moderate with respect to both
computational cost and memory.
Hence, it provides a possibility to tackle large scale control
problems.
Besides the efficient solution of the matrix equation itself,
a thorough integration of the method into several control
algorithms can improve their performance
to a high degree.
This is demonstrated for algorithms
for model reduction and optimal control.
Furthermore, we propose a heuristic for determining a set of
suboptimal ADI shift parameters. This heuristic, which is based on a
pair of Arnoldi processes, does not require any a priori
knowledge on the spectrum of
the coefficient matrix of the Lyapunov equation.
Numerical experiments show the efficiency of the iterative scheme
combined with the heuristic for the ADI parameters.
|
6 |
A cyclic low rank Smith method for large, sparse Lyapunov equations with applications in model reduction and optimal controlPenzl, T. 30 October 1998 (has links)
We present a new method for the computation of low rank approximations
to the solution of large, sparse, stable Lyapunov equations. It is based
on a generalization of the classical Smith method and profits by the
usual low rank property of the right hand side matrix.
The requirements of the method are moderate with respect to both
computational cost and memory.
Hence, it provides a possibility to tackle large scale control
problems.
Besides the efficient solution of the matrix equation itself,
a thorough integration of the method into several control
algorithms can improve their performance
to a high degree.
This is demonstrated for algorithms
for model reduction and optimal control.
Furthermore, we propose a heuristic for determining a set of
suboptimal ADI shift parameters. This heuristic, which is based on a
pair of Arnoldi processes, does not require any a priori
knowledge on the spectrum of
the coefficient matrix of the Lyapunov equation.
Numerical experiments show the efficiency of the iterative scheme
combined with the heuristic for the ADI parameters.
|
7 |
Méthodes itératives pour la résolution d'équations matricielles / Iterative methods fol solving matrix equationsSadek, El Mostafa 23 May 2015 (has links)
Nous nous intéressons dans cette thèse, à l’étude des méthodes itératives pour la résolutiond’équations matricielles de grande taille : Lyapunov, Sylvester, Riccati et Riccatinon symétrique.L’objectif est de chercher des méthodes itératives plus efficaces et plus rapides pour résoudreles équations matricielles de grande taille. Nous proposons des méthodes itérativesde type projection sur des sous espaces de Krylov par blocs Km(A, V ) = Image{V,AV, . . . ,Am−1V }, ou des sous espaces de Krylov étendus par blocs Kem(A, V ) = Image{V,A−1V,AV,A−2V,A2V, · · · ,Am−1V,A−m+1V } . Ces méthodes sont généralement plus efficaces et rapides pour les problèmes de grande dimension. Nous avons traité d'abord la résolution numérique des équations matricielles linéaires : Lyapunov, Sylvester, Stein. Nous avons proposé une nouvelle méthode itérative basée sur la minimisation de résidu MR et la projection sur des sous espaces de Krylov étendus par blocs Kem(A, V ). L'algorithme d'Arnoldi étendu par blocs permet de donner un problème de minimisation projeté de petite taille. Le problème de minimisation de taille réduit est résolu par différentes méthodes directes ou itératives. Nous avons présenté ainsi la méthode de minimisation de résidu basée sur l'approche global à la place de l'approche bloc. Nous projetons sur des sous espaces de Krylov étendus Global Kem(A, V ) = sev{V,A−1V,AV,A−2V,A2V, · · · ,Am−1V,A−m+1V }. Nous nous sommes intéressés en deuxième lieu à des équations matricielles non linéaires, et tout particulièrement l'équation matricielle de Riccati dans le cas continu et dans le cas non symétrique appliquée dans les problèmes de transport. Nous avons utilisé la méthode de Newtown et l'algorithme MINRES pour résoudre le problème de minimisation projeté. Enfin, nous avons proposé deux nouvelles méthodes itératives pour résoudre les équations de Riccati non symétriques de grande taille : la première basée sur l'algorithme d'Arnoldi étendu par bloc et la condition d'orthogonalité de Galerkin, la deuxième est de type Newton-Krylov, basée sur la méthode de Newton et la résolution d'une équation de Sylvester de grande taille par une méthode de type Krylov par blocs. Pour toutes ces méthodes, les approximations sont données sous la forme factorisée, ce qui nous permet d'économiser la place mémoire en programmation. Nous avons donné des exemples numériques qui montrent bien l'efficacité des méthodes proposées dans le cas de grandes tailles. / In this thesis, we focus in the studying of some iterative methods for solving large matrix equations such as Lyapunov, Sylvester, Riccati and nonsymmetric algebraic Riccati equation. We look for the most efficient and faster iterative methods for solving large matrix equations. We propose iterative methods such as projection on block Krylov subspaces Km(A, V ) = Range{V,AV, . . . ,Am−1V }, or block extended Krylov subspaces Kem(A, V ) = Range{V,A−1V,AV,A−2V,A2V, · · · ,Am−1V,A−m+1V }. These methods are generally most efficient and faster for large problems. We first treat the numerical solution of the following linear matrix equations : Lyapunov, Sylvester and Stein matrix equations. We have proposed a new iterative method based on Minimal Residual MR and projection on block extended Krylov subspaces Kem(A, V ). The extended block Arnoldi algorithm gives a projected minimization problem of small size. The reduced size of the minimization problem is solved by direct or iterative methods. We also introduced the Minimal Residual method based on the global approach instead of the block approach. We projected on the global extended Krylov subspace Kem(A, V ) = Span{V,A−1V,AV,A−2V,A2V, · · · ,Am−1V,A−m+1V }. Secondly, we focus on nonlinear matrix equations, especially the matrix Riccati equation in the continuous case and the nonsymmetric case applied in transportation problems. We used the Newton method and MINRES algorithm to solve the projected minimization problem. Finally, we proposed two new iterative methods for solving large nonsymmetric Riccati equation : the first based on the algorithm of extended block Arnoldi and Galerkin condition, the second type is Newton-Krylov, based on Newton’s method and the resolution of the large matrix Sylvester equation by using block Krylov method. For all these methods, approximations are given in low rank form, wich allow us to save memory space. We have given numerical examples that show the effectiveness of the methods proposed in the case of large sizes.
|
Page generated in 0.0998 seconds