• Documents
  • Authors
  • Tables
  • Other Seers ▼
    RefSeer AckSeer CollabSeer SeerSeer
  • Log in
  • Sign up
  • MetaCart

CiteSeerX logo

Advanced Search Include Citations
Advanced Search Include Citations | Disambiguate

CAREX – a collection of benchmark examples for continuoustime algebraic Riccati equations (version 2.0). SLICOT Working Note 1999-14 (1999)

by J Abels, P Benner
Add To MetaCart

Tools

Sorted by:
Results 1 - 10 of 12
Next 10 →

Fortran 77 subroutines for computing the eigenvalues of Hamiltonian matrices II

by Peter Benner, Daniel Kressner , 2004
"... This article describes Fortran 77 subroutines for computing eigenvalues and invariant subspaces of Hamiltonian and skew-Hamiltonian matrices. The implemented algorithms are based on orthogonal symplectic decompositions, implying numerical backward stability as well as symmetry preservation for the c ..."
Abstract - Cited by 6 (2 self) - Add to MetaCart
This article describes Fortran 77 subroutines for computing eigenvalues and invariant subspaces of Hamiltonian and skew-Hamiltonian matrices. The implemented algorithms are based on orthogonal symplectic decompositions, implying numerical backward stability as well as symmetry preservation for the computed eigenvalues. These algorithms are supplemented with balancing and block algorithms, which can lead to considerable accuracy and performance improvements. As a by-product, an efficient implementation for computing symplectic QR decompositions is provided. We demonstrate the usefulness of the subroutines for several, practically relevant examples.

Balancing Sparse Hamiltonian Eigenproblems

by Peter Benner, Daniel Kressner , 2003
"... Balancing a matrix by a simple and accurate similarity transformation can improve the performance of numerical methods for computing eigenvalues. We describe balancing strategies for a large and sparse Hamiltonian matrix H . It is first shown how to permute H to irreducible form while retaining i ..."
Abstract - Cited by 3 (3 self) - Add to MetaCart
Balancing a matrix by a simple and accurate similarity transformation can improve the performance of numerical methods for computing eigenvalues. We describe balancing strategies for a large and sparse Hamiltonian matrix H . It is first shown how to permute H to irreducible form while retaining its structure. This form can be used to decompose the Hamiltonian eigenproblem into smaller-sized problems. Next, we discuss the computation of a symplectic scaling matrix D so that the norm of D -1 HD is reduced. The considered scaling algorithm is solely based on matrix-vector products and thus particularly suitable if the elements of H are not explicitly given. The merits of balancing for eigenvalue computations are illustrated by several practically relevant examples.

Solving algebraic Riccati equations with SLICOT

by Peter Benner, Vasile Sima - in CD-ROM Proc. of The 11th Mediterranean Conference on Control and Automation MED’03, June 18–20 2003, Rhodes, Greece, 2003, invited session IV01, Paper IV01-01
"... Abstract — The numerical solution of algebraic Riccati equations is a central issue in computer-aided control systems design. It is the key step in many computational methods for model reduction, filtering, and controller design for linear control systems. We discuss recent advances in the solvers f ..."
Abstract - Cited by 3 (1 self) - Add to MetaCart
Abstract — The numerical solution of algebraic Riccati equations is a central issue in computer-aided control systems design. It is the key step in many computational methods for model reduction, filtering, and controller design for linear control systems. We discuss recent advances in the solvers for continuous-time and discrete-time algebraic Riccati equations available in the SLICOT Library (Subroutine Library In COntrol Theory) and compare their performance with the corresponding solvers in the Matlab toolboxes.

Semi-Automatic Generation of Web-Based Computing Environments for Software Libraries

by Pedher Johansson, Daniel Kressner - In Proceedings of The 2002 International Conference on Computational Science (ICCS2002 , 2002
"... A set of utilities for generating web computing environments related to mathematical and engineering library software is presented. ..."
Abstract - Cited by 1 (0 self) - Add to MetaCart
A set of utilities for generating web computing environments related to mathematical and engineering library software is presented.

E.: Parallel solution of large-scale algebraic Bernoulli equations via the matrix sign function method

by Sergio Barrachina, Peter Benner, Enrique S. Quintana-ortí - Proc. 2005 Intl. Conf. Parallel Processing Workshops
"... We investigate the numerical solution of algebraic Bernoulli equations via the Newton iteration for the matrix sign function. Bernoulli equations are nonlinear matrix equations arising in control and systems theory in the context of stabilization of linear systems, coprime factorization of rational ..."
Abstract - Cited by 1 (1 self) - Add to MetaCart
We investigate the numerical solution of algebraic Bernoulli equations via the Newton iteration for the matrix sign function. Bernoulli equations are nonlinear matrix equations arising in control and systems theory in the context of stabilization of linear systems, coprime factorization of rational matrix-valued functions, as well as model reduction. The algorithm proposed here is easily parallelizable and thus provides an efficient tool to solve large-scale problems. We report the parallel performance and scalability of our parallel implementations on a cluster of Intel Xeon processors. Key words. Bernoulli equation; linear and nonlinear matrix equations; matrix sign function; control and systems theory; parallel computers.

Efficient algorithms for generalized algebraic Bernoulli equations based on the matrix sign function

by Sergio Barrachina, Peter Benner, Enrique S. Quintana-Ortí - Numer. Algor. , 2007
"... ..."
Abstract - Cited by 1 (1 self) - Add to MetaCart
Abstract not found

Numerical Solution of Differential Riccati Equations Arising in Optimal Control for Parabolic PDEs

by Hermann Mena, Peter Benner, Tu Chemnitz , 2007
"... The numerical treatment of linear-quadratic regulator problems on finite time horizons for parabolic partial differential equations requires the solution of large-scale differential Riccati equations (DREs). Typically the coefficient matrices of the resulting DRE have a given structure (e.g. sparse, ..."
Abstract - Cited by 1 (0 self) - Add to MetaCart
The numerical treatment of linear-quadratic regulator problems on finite time horizons for parabolic partial differential equations requires the solution of large-scale differential Riccati equations (DREs). Typically the coefficient matrices of the resulting DRE have a given structure (e.g. sparse, symmetric or low rank). Here we discuss numerical methods for solving DREs capable of exploiting this structure. These methods are based on a matrix-valued implementation of the BDF methods. The crucial question of suitable stepsize and order selection strategies is also addressed. 1

A Hamiltonian Krylov-Schur-type method based on the symplectic . . .

by Peter Benner, Heike Faßbender, Martin Stoll , 2009
"... ..."
Abstract - Cited by 1 (0 self) - Add to MetaCart
Abstract not found

A STRUCTURE-PRESERVING METHOD FOR GENERALIZED ALGEBRAIC RICCATI EQUATIONS BASED ON PENCIL ARITHMETIC

by R. Byers, P. Benner
"... This paper describes a numerical method for extracting the stable right deflating subspace of a matrix pencil Z − λY using a spectral projection method. It has several advantages compared to other spectral projection methods like the sign function method. In particular it avoids the rounding error i ..."
Abstract - Add to MetaCart
This paper describes a numerical method for extracting the stable right deflating subspace of a matrix pencil Z − λY using a spectral projection method. It has several advantages compared to other spectral projection methods like the sign function method. In particular it avoids the rounding error induced loss of accuracy associated with matrix inversions. The new algorithm is particularly well adapted to solving continuous-time algebraic Riccati equations. In numerical examples, it solves Riccati equations to high accuracy. 1

The SLICOT Toolboxes – a Survey

by Peter Benner, Daniel Kressner, Vasile Sima
"... SLICOT is a comprehensive numerical software package for control systems analysis and design. While based on highly performant Fortran routines, Matlab and Scilab interfaces provide convenient access for users. In this survey, we summarize the functionality contained in the three SLICOT toolboxes fo ..."
Abstract - Add to MetaCart
SLICOT is a comprehensive numerical software package for control systems analysis and design. While based on highly performant Fortran routines, Matlab and Scilab interfaces provide convenient access for users. In this survey, we summarize the functionality contained in the three SLICOT toolboxes for (i) basic tasks in systems and control, (ii) system identification, and (iii) model reduction. Several examples illustrate the use of these toolboxes for addressing frequent computational tasks.
The National Science Foundation
  • About CiteSeerX
  • Submit Documents
  • Privacy Policy
  • Help
  • Data
  • Source
  • Contact Us

Developed at and hosted by The College of Information Sciences and Technology

© 2007-2010 The Pennsylvania State University