- About
-
The Global ETD Search service is a free service for researchers
to find electronic theses and dissertations. This service is
provided by the
Networked Digital Library of Theses and Dissertations.
Our metadata is collected from universities around the world. If you manage a university/consortium/country archive and want to be added, details can be found on the NDLTD website.
Search results
Showing 1 to 2 of 2 (0.129 seconds)Spelling suggestions: "subject:"smith iteration"" "subject:"amith iteration""
| 1 |
On the numerical solution of large-scale sparse discrete-time Riccati equationsBenner, Peter, Faßbender, Heike 04 March 2010 (has links) (PDF)
The numerical solution of Stein (aka discrete Lyapunov) equations is the primary step in Newton's method for the solution of discrete-time algebraic Riccati equations (DARE). Here we present a low-rank Smith method as well as a low-rank alternating-direction-implicit-iteration to compute low-rank approximations to solutions of Stein equations arising in this context. Numerical results are given to verify the efficiency and accuracy of the proposed algorithms.
|
| 2 |
On the numerical solution of large-scale sparse discrete-time Riccati equationsBenner, Peter, Faßbender, Heike 04 March 2010 (has links)
The numerical solution of Stein (aka discrete Lyapunov) equations is the primary step in Newton's method for the solution of discrete-time algebraic Riccati equations (DARE). Here we present a low-rank Smith method as well as a low-rank alternating-direction-implicit-iteration to compute low-rank approximations to solutions of Stein equations arising in this context. Numerical results are given to verify the efficiency and accuracy of the proposed algorithms.
|
Page generated in 0.1331 seconds