We give several different formulations for the discrete-time linear-quadratic control problem in terms of structured eigenvalue problems, and discuss the relationships among the associated structured objects: symplectic matrices and pencils, BVD-pencils and polynomials, and the recently introduced classes of palindromic pencils and matrix polynomials. We show how these structured objects can be transformed into each other, and also how their eigenvalues, eigenvectors and invariant/deflating subspaces are related
Working title was “Numerical Computation of Deflating Subspaces of Embedded Hamiltonian and Symplect...
The classical approach to investigating polynomial eigenvalue problems is linearization, where the u...
This paper derives conditions for the stability of discrete-time systems that can be modeled by a ve...
We give several different formulations for the discrete-time linear-quadratic control problem in ter...
We present structure-preserving numerical methods for the eigenvalue problem of complex palindromic ...
Abstract. We present structure-preserving numerical methods for the eigenvalue problem of complex pa...
AbstractThis paper presents an algorithm for computing the eigenvalues of a symplectic pencil that a...
AbstractWe study two matrix pencils that arise, respectively, in discrete-time and continuous-time o...
In this master’s thesis we adapt recent results on optimal control of continuous-time linear differe...
Abstract. Palindromic polynomial eigenvalue problems and related classes of structured eigenvalue pr...
This technical note introduces a new approach to the solution of a very general class of finite-hori...
In this paper we develop an analytic approach to the solution of a very general class of discrete fi...
AbstractIn this paper, we propose the palindromic doubling algorithm (PDA) for the palindromic gener...
We discuss the numerical solution of structured generalized eigenvalue problems that arise from line...
We introduce a numerical method for the numerical solution of the Lur'e equations, a system of matri...
Working title was “Numerical Computation of Deflating Subspaces of Embedded Hamiltonian and Symplect...
The classical approach to investigating polynomial eigenvalue problems is linearization, where the u...
This paper derives conditions for the stability of discrete-time systems that can be modeled by a ve...
We give several different formulations for the discrete-time linear-quadratic control problem in ter...
We present structure-preserving numerical methods for the eigenvalue problem of complex palindromic ...
Abstract. We present structure-preserving numerical methods for the eigenvalue problem of complex pa...
AbstractThis paper presents an algorithm for computing the eigenvalues of a symplectic pencil that a...
AbstractWe study two matrix pencils that arise, respectively, in discrete-time and continuous-time o...
In this master’s thesis we adapt recent results on optimal control of continuous-time linear differe...
Abstract. Palindromic polynomial eigenvalue problems and related classes of structured eigenvalue pr...
This technical note introduces a new approach to the solution of a very general class of finite-hori...
In this paper we develop an analytic approach to the solution of a very general class of discrete fi...
AbstractIn this paper, we propose the palindromic doubling algorithm (PDA) for the palindromic gener...
We discuss the numerical solution of structured generalized eigenvalue problems that arise from line...
We introduce a numerical method for the numerical solution of the Lur'e equations, a system of matri...
Working title was “Numerical Computation of Deflating Subspaces of Embedded Hamiltonian and Symplect...
The classical approach to investigating polynomial eigenvalue problems is linearization, where the u...
This paper derives conditions for the stability of discrete-time systems that can be modeled by a ve...