Library

feed icon rss

Your email was sent successfully. Check your inbox.

An error occurred while sending the email. Please try again.

Proceed reservation?

Export
  • 1
    Electronic Resource
    Electronic Resource
    Springer
    The journal of supercomputing 15 (2000), S. 193-206 
    ISSN: 1573-0484
    Keywords: Linear control systems ; stabilizing algorithms ; Lyapunov matrix equations ; invariant subspaces ; matrix sign function ; Newton iteration ; mathematical software
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Notes: Abstract In this paper we present parallel algorithms for stabilizing large linear control systems on multicomputers. Our algorithms first separate the stable part of the linear control system and then compute a stabilizing feedback for the unstable part. Both stages are solved by means of the matrix sign function which presents a high degree of parallelism and scalability. The experimental results on an IBM SP2 platform show the performance of our approach.
    Type of Medium: Electronic Resource
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 2
    Electronic Resource
    Electronic Resource
    Springer
    Numerical algorithms 20 (1999), S. 75-100 
    ISSN: 1572-9265
    Keywords: generalized Lyapunov equations ; mathematical software ; matrix sign function ; Newton iteration ; algebraic Riccati equations ; 65F10 ; 93B40 ; 93B51
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Notes: Abstract We investigate the numerical solution of the stable generalized Lyapunov equation via the sign function method. This approach has already been proposed to solve standard Lyapunov equations in several publications. The extension to the generalized case is straightforward. We consider some modifications and discuss how to solve generalized Lyapunov equations with semidefinite constant term for the Cholesky factor. The basic computational tools of the method are basic linear algebra operations that can be implemented efficiently on modern computer architectures and in particular on parallel computers. Hence, a considerable speed-up as compared to the Bartels–Stewart and Hammarling methods is to be expected. We compare the algorithms by performing a variety of numerical tests.
    Type of Medium: Electronic Resource
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
Close ⊗
This website uses cookies and the analysis tool Matomo. More information can be found here...