State-space truncation methods for parallel model reduction of large-scale systems
Parallel Computing - Special issue: Parallel and distributed scientific and engineering computing
A new projection method for solving large Sylvester equations
Applied Numerical Mathematics
Goal-oriented, model-constrained optimization for reduction of large-scale systems
Journal of Computational Physics
Brief paper: Krylov projection framework for Fourier model reduction
Automatica (Journal of IFAC)
Use of near-breakdowns in the block Arnoldi method for solving large Sylvester equations
Applied Numerical Mathematics
Trail to a Lyapunov equation solver
Computers & Mathematics with Applications
Parallel Implementation of LQG Balanced Truncation for Large-Scale Systems
Large-Scale Scientific Computing
On the ADI method for Sylvester equations
Journal of Computational and Applied Mathematics
Approximation of low rank solutions for linear quadratic control of partial differential equations
Computational Optimization and Applications
Parallel solution of band linear systems in model reduction
PPAM'07 Proceedings of the 7th international conference on Parallel processing and applied mathematics
An invariant subspace method for large-scale algebraic Riccati equation
Applied Numerical Mathematics
On the numerical solution of large-scale sparse discrete-time Riccati equations
Advances in Computational Mathematics
Krylov subspace methods for projected Lyapunov equations
Applied Numerical Mathematics
Lyapunov Equations, Energy Functionals, and Model Order Reduction of Bilinear and Stochastic Systems
SIAM Journal on Control and Optimization
Analysis of the Rational Krylov Subspace and ADI Methods for Solving the Lyapunov Equation
SIAM Journal on Numerical Analysis
Parallel solution of large-scale and sparse generalized algebraic riccati equations
Euro-Par'06 Proceedings of the 12th international conference on Parallel Processing
Parallel order reduction via balanced truncation for optimal cooling of steel profiles
Euro-Par'05 Proceedings of the 11th international Euro-Par conference on Parallel Processing
Parallel algorithms for balanced truncation model reduction of sparse systems
PARA'04 Proceedings of the 7th international conference on Applied Parallel Computing: state of the Art in Scientific Computing
On the ADI method for the Sylvester equation and the optimal-H2 points
Applied Numerical Mathematics
Journal of Computational and Applied Mathematics
| Hi-index | 0.01 |
This paper presents the Cholesky factor--alternating direction implicit (CF--ADI) algorithm, which generates a low rank approximation to the solution X of the Lyapunov equation AX+XAT=-BBT. The coefficient matrix A is assumed to be large, and the rank of the right-hand side -BBT is assumed to be much smaller than the size of A. The CF--ADI algorithm requires only matrix-vector products and matrix-vector solves by shifts of A. Hence, it enables one to take advantage of any sparsity or structure in A.This paper also discusses the approximation of the dominant invariant subspace of the solution X. We characterize a group of spanning sets for the range of X. A connection is made between the approximation of the dominant invariant subspace of X and the generation of various low order Krylov and rational Krylov subspaces. It is shown by numerical examples that the rational Krylov subspace generated by the CF--ADI algorithm, where the shifts are obtained as the solution of a rational minimax problem, often gives the best approximation to the dominant invariant subspace of X.