AbstractIn this report, a new procedure is presented for solving the Lyapunov matrix equation. First, the system is reduced to tridiagonal form with Gaussian similarity transformations. Then the resulting system is solved with Alternating-Direction-Implicit (ADI) iteration. A matrix commutation property essential for “model problem” convergence of ADI iteration applied to elliptic difference equations is not needed for this application. All stable Lyapunov matrix equations are model ADI problems
The low-rank alternating direction implicit (LR-ADI) iteration is an effective method for solving la...
Balanced truncation is an attractive method for reducing the dimension of medium-scale dynamical sys...
It is well-known that the stability of a first-order autonomous system can be determined by testing ...
AbstractIn this report, a new procedure is presented for solving the Lyapunov matrix equation. First...
AbstractThe Lyapunov matrix equation AX+XA⊤=B is N-stable when all eigenvalues of the real n×n matri...
AbstractIterative solution of the Lyapunov matrix equation AX + XB = C using ADI theory described in...
A new version of the alternating directions implicit (ADI) iteration for the solution of large-scale...
The low-rank alternating directions implicit (LR-ADI) iteration is a frequently employed method for ...
Two approaches for approximating the solution of large-scale Lyapunov equations are considered: the ...
One of the most computationally expensive steps of the low-rank ADI method for large-scale Lyapunov ...
An algorithm is presented for constructing an approximate numerical solution to a large scale Lyapun...
An algorithm is presented for constructing an approximate numerical solution to a large scale Lyapun...
This article is concerned with the efficient numerical solution of the Lyapunov equation A(T) X + XA...
AbstractThis paper is concerned with the numerical solution of large scale Sylvester equations AX−XB...
Abstract. This paper presents the Cholesky factor–alternating direction implicit (CF–ADI) algorithm,...
The low-rank alternating direction implicit (LR-ADI) iteration is an effective method for solving la...
Balanced truncation is an attractive method for reducing the dimension of medium-scale dynamical sys...
It is well-known that the stability of a first-order autonomous system can be determined by testing ...
AbstractIn this report, a new procedure is presented for solving the Lyapunov matrix equation. First...
AbstractThe Lyapunov matrix equation AX+XA⊤=B is N-stable when all eigenvalues of the real n×n matri...
AbstractIterative solution of the Lyapunov matrix equation AX + XB = C using ADI theory described in...
A new version of the alternating directions implicit (ADI) iteration for the solution of large-scale...
The low-rank alternating directions implicit (LR-ADI) iteration is a frequently employed method for ...
Two approaches for approximating the solution of large-scale Lyapunov equations are considered: the ...
One of the most computationally expensive steps of the low-rank ADI method for large-scale Lyapunov ...
An algorithm is presented for constructing an approximate numerical solution to a large scale Lyapun...
An algorithm is presented for constructing an approximate numerical solution to a large scale Lyapun...
This article is concerned with the efficient numerical solution of the Lyapunov equation A(T) X + XA...
AbstractThis paper is concerned with the numerical solution of large scale Sylvester equations AX−XB...
Abstract. This paper presents the Cholesky factor–alternating direction implicit (CF–ADI) algorithm,...
The low-rank alternating direction implicit (LR-ADI) iteration is an effective method for solving la...
Balanced truncation is an attractive method for reducing the dimension of medium-scale dynamical sys...
It is well-known that the stability of a first-order autonomous system can be determined by testing ...