AbstractWe propose an Arnoldi-based numerical method for solving a Sylvester-type equation arising in the construction of the Luenberger observer. Given an N×N matrix A and an N×m matrix G, the method simultaneously constructs an m×m Hessenberg matrix H with a preassigned spectrum and an N×m orthonormal matrix X such that AX−XH=G. We consider the case when A is large and sparse, so that the standard techniques such as the well-known Hessenberg-Schur method for solving a Sylvester equation cannot be easily applied. As a byproduct, we propose an algorithm for the partial pole-assignment problem for large matrices
AbstractFor given matrices A∈Fm×m, B∈Fn×n, and C∈Fm×n over an arbitrary field F, the matrix equation...
Abstract. We present a new algorithm for solving the Sylvester observer equation arising in the cont...
AbstractComputing the eigenvalues and eigenvectors of a large sparse nonsymmetric matrix arises in m...
AbstractWe propose an Arnoldi-based numerical method for solving a Sylvester-type equation arising i...
AbstractIn this paper we show how to improve the approximate solution of the large Sylvester equatio...
This paper describes a new block method for solving multi-input Sylvester-observer equations that ar...
This paper describes a new block method for solving multi-input Sylvester-observer equations that ar...
AbstractIn this paper we show how to improve the approximate solution of the large Sylvester equatio...
Includes bibliographical references (pages 100-103).This dissertation deals with numerical solutions...
AbstractThe design and analysis of time-invariant linear control systems give rise to a variety of i...
A new block algorithm for computing a full rank solution of the Sylvester-observer equation arising ...
A new block algorithm for computing a full rank solution of the Sylvester-observer equation arising ...
A new block algorithm for computing a full rank solution of the Sylvester-observer equation arising ...
AbstractWe describe Galerkin and minimal residual algorithms for the solution of Sylvester's equatio...
AbstractThe design and analysis of time-invariant linear control systems give rise to a variety of i...
AbstractFor given matrices A∈Fm×m, B∈Fn×n, and C∈Fm×n over an arbitrary field F, the matrix equation...
Abstract. We present a new algorithm for solving the Sylvester observer equation arising in the cont...
AbstractComputing the eigenvalues and eigenvectors of a large sparse nonsymmetric matrix arises in m...
AbstractWe propose an Arnoldi-based numerical method for solving a Sylvester-type equation arising i...
AbstractIn this paper we show how to improve the approximate solution of the large Sylvester equatio...
This paper describes a new block method for solving multi-input Sylvester-observer equations that ar...
This paper describes a new block method for solving multi-input Sylvester-observer equations that ar...
AbstractIn this paper we show how to improve the approximate solution of the large Sylvester equatio...
Includes bibliographical references (pages 100-103).This dissertation deals with numerical solutions...
AbstractThe design and analysis of time-invariant linear control systems give rise to a variety of i...
A new block algorithm for computing a full rank solution of the Sylvester-observer equation arising ...
A new block algorithm for computing a full rank solution of the Sylvester-observer equation arising ...
A new block algorithm for computing a full rank solution of the Sylvester-observer equation arising ...
AbstractWe describe Galerkin and minimal residual algorithms for the solution of Sylvester's equatio...
AbstractThe design and analysis of time-invariant linear control systems give rise to a variety of i...
AbstractFor given matrices A∈Fm×m, B∈Fn×n, and C∈Fm×n over an arbitrary field F, the matrix equation...
Abstract. We present a new algorithm for solving the Sylvester observer equation arising in the cont...
AbstractComputing the eigenvalues and eigenvectors of a large sparse nonsymmetric matrix arises in m...