
doi: 10.1002/nla.2381
AbstractWe consider the numerical solution of large scale singular (continuous‐time) Lyapunov equations of the formAX + XA⊤ + BB⊤ = 0, whereAis semistable, that is, its spectrum is contained in the left half plane, with the exception of a few semisimple eigenvalues at zero. We also consider the case of a few semisimple eigenvalues on the imaginary axis. We assume that we know these few eigenvalues (zero or imaginary), and that we have or can compute the corresponding invariant subspaces. We use this information to build an appropriate newly proposed subspace on which to project the Lyapunov equations, and then compute a low‐rank approximation to the least squares solution. Selected illustrative numerical examples are provided.
singular equation, Sylvester equation, projection method, Numerical methods for matrix equations, Matrix equations and identities, Numerical methods for low-rank matrix approximation; matrix compression, Stein equation, Lyapunov equation, Krylov subspace, least-squares solution
singular equation, Sylvester equation, projection method, Numerical methods for matrix equations, Matrix equations and identities, Numerical methods for low-rank matrix approximation; matrix compression, Stein equation, Lyapunov equation, Krylov subspace, least-squares solution
| selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | 3 | |
| popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network. | Average | |
| influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | Average | |
| impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network. | Average |
