A factored variant of the Newton iteration for the solution of algebraic Riccati equations via the matrix sign function
Impacto
Scholar |
Otros documentos de la autoría: Benner, Peter; Ezzatti, Pablo; Quintana-Orti, Enrique S.; Remón Gómez, Alfredo
Metadatos
Mostrar el registro completo del ítemcomunitat-uji-handle:10234/9
comunitat-uji-handle2:10234/7036
comunitat-uji-handle3:10234/8620
comunitat-uji-handle4:
INVESTIGACIONEste recurso está restringido
http://dx.doi.org/ 10.1007/s11075-013-9739-2 |
Metadatos
Título
A factored variant of the Newton iteration for the solution of algebraic Riccati equations via the matrix sign functionFecha de publicación
2013Editor
SpringerISSN
1017-1398; 1572-9265Tipo de documento
info:eu-repo/semantics/articleVersión de la editorial
http://download.springer.com/static/pdf/621/art%253A10.1007%252Fs11075-013-9739- ...Palabras clave / Materias
Resumen
In this paper we introduce a variant of the Newton iteration for the matrix sign function that results in an efficient numerical solver for a certain class of algebraic Riccati equations (AREs). In particular, when ... [+]
In this paper we introduce a variant of the Newton iteration for the matrix sign function that results in an efficient numerical solver for a certain class of algebraic Riccati equations (AREs). In particular, when the Hamiltonian matrix associated with the ARE can be composed as [ACTCBBT−AT] , with B and CT having a much larger number of rows than columns, the new algorithm exploits the special structure of the off-diagonal blocks to yield an alternative factored Newton iteration which reduces the cost per iteration by a factor of up to 8 (16 in case A is symmetric negative definite) w.r.t. the conventional iterative scheme. Experiments with a large collection of benchmark examples show that the factored iteration attains numerical accuracy similar to that of the conventional Newton iteration as well as the structure-preserving doubling algorithm. High-performance implementations of these methods, making heavy use of LAPACK linked to a multi-threaded implementation of BLAS, demonstrate the clear advantage of the new iteration on a 48-core AMD-based platform. [-]
Publicado en
Numerical Algorithms, 2013, JulyDerechos de acceso
© Springer Science+Business Media New York 2013. "The final publication is available at link. Springer.com"
http://rightsstatements.org/vocab/InC/1.0/
info:eu-repo/semantics/restrictedAccess
http://rightsstatements.org/vocab/InC/1.0/
info:eu-repo/semantics/restrictedAccess
Aparece en las colecciones
- ICC_Articles [430]