SIAM Journal on Numerical Analysis
Analysis and modification of Newton's method for algebraic Riccati equations
Mathematics of Computation
Solution of the matrix equation AX + XB = C [F4]
Communications of the ACM
A sparse H -matrix arithmetic: general complexity estimates
Journal of Computational and Applied Mathematics - Special issue on numerical anaylsis 2000 Vol. VI: Ordinary differential equations and integral equations
Structure preserving model order reduction of heterogeneous 1-D distributed systems
ACC'09 Proceedings of the 2009 conference on American Control Conference
Krylov subspace methods for projected Lyapunov equations
Applied Numerical Mathematics
Journal of Computational and Applied Mathematics
Hi-index | 0.00 |
In previous papers, a class of hierarchical matrices (H-matrices) is introduced which are data-sparse and allow an approximate matrix arithmetic of almost optimal complexity. Here, we investigate a new approach to exploit the H-matrix structure for the solution of large scale Lyapunov and Riccati equations as they typically arise for optimal control problems where the constraint is a partial differential equation of elliptic type. This approach leads to an algorithm of linear-logarithmic complexity in the size of the matrices.