Elias Jarlebring

Elias Jarlebring

Auto-generated profile, based on publicly available information

Elias Jarlebring

SCI/Mathematics, KTH - Royal Institute of Technology, Stockholm, Sweden, 10044

Research Focus & Metrics

Academic Career Length

22Years (2005-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
26 August 2010 in IEEE Transactions on Automatic Control
Verified
Journal Article
Closed access
EJElias Jarlebring
Elias Jarlebring
JVJoris Vanbiervliet
Joris Vanbiervliet
WMWim Michiels
Wim Michiels
It is widely known that the solutions of Lyapunov equations can be used to compute the H2 norm of linear time-invariant (LTI) dynamical systems. In this paper, we show how this theory extends to dynamical systems with delays. The first result is that the H2 norm can be computed from the solution of a generalization of the Lyapunov equation, which is known as the delay Lyapunov equation. From the relation with the delay Lyapunov equation we can prove an explicit formula for the H2 norm if the system has commensurate delays, here meaning that the delays are all integer multiples of a basic delay. The formula is explicit and contains only elementary linear algebra operations applied to matrices of finite dimension. The delay Lyapunov equations are matrix boundary value problems. We show how to apply a spectral discretization scheme to these equations for the general, not necessarily commensurate, case. The convergence of spectral methods typically depends on the smoothness of the solution. To this end we describe the smoothness of the solution to the delay Lyapunov equations, for the commensurate as well as for the non-commensurate case. The smoothness properties allow us to completely predict the convergence order of the spectral method.

14 March 2012 in Numerische Mathematik
Verified
Journal Article
Closed access
PDF file
EJElias Jarlebring
Elias Jarlebring
WMWim Michiels
Wim Michiels
KMKarl Meerbergen
Karl Meerbergen

1 January 2014 in SIAM Journal on Scientific Computing
Verified
Journal Article
Closed access
EJElias Jarlebring
Elias Jarlebring
SKSimen Kvaal
Simen Kvaal
WMWim Michiels
Wim Michiels
Consider a symmetric matrix $A(v)\in\mathbb{R}^{n\times n}$ depending on a vector $v\in\mathbb{R}^n$ and satisfying the property $A(\alpha v)=A(v)$ for any $\alpha\in\mathbb{R}\backslash\{0\}$. We will here study the problem of finding $(\lambda,v)\in\mathbb{R}\times \mathbb{R}^n\backslash\{0\}$ such that $(\lambda,v)$ is an eigenpair of the matrix $A(v)$ and we propose a generalization of inverse iteration for eigenvalue problems with this type of eigenvector nonlinearity. The convergence of the proposed method is studied and several convergence properties are shown to be analogous to inverse iteration for standard eigenvalue problems, including local convergence properties. The algorithm is also shown to be equivalent to a particular discretization of an associated ordinary differential equation, if the shift is chosen in a particular way. The algorithm is adapted to a variant of the Schrödinger equation known as the Gross--Pitaevskii equation. We use numerical simulations to illustrate the convergence properties, as well as the efficiency of the algorithm and the adaption.

1 January 2010 in SIAM Journal on Scientific Computing
Verified
Journal Article
Closed access
EJElias Jarlebring
Elias Jarlebring
KMKarl Meerbergen
Karl Meerbergen
WMWim Michiels
Wim Michiels
The Arnoldi method is currently a very popular algorithm to solve large-scale eigenvalue problems. The main goal of this paper is to generalize the Arnoldi method to the characteristic equation of a delay-differential equation (DDE), here called a delay eigenvalue problem (DEP). The DDE can equivalently be expressed with a linear infinite-dimensional operator whose eigenvalues are the solutions to the DEP. We derive a new method by applying the Arnoldi method to the generalized eigenvalue problem associated with a spectral discretization of the operator and by exploiting the structure. The result is a scheme where we expand a subspace not only in the traditional way done in the Arnoldi method. The subspace vectors are also expanded with one block of rows in each iteration. More important, the structure is such that if the Arnoldi method is started in an appropriate way, it has the (somewhat remarkable) property that it is in a sense independent of the number of discretization points. It is mathematically equivalent to an Arnoldi method with an infinite matrix, corresponding to the limit where we have an infinite number of discretization points. We also show an equivalence with the Arnoldi method in an operator setting. It turns out that with an appropriately defined operator over a space equipped with scalar product with respect to which Chebyshev polynomials are orthonormal, the vectors in the Arnoldi iteration can be interpreted as the coefficients in a Chebyshev expansion of a function. The presented method yields the same Hessenberg matrix as the Arnoldi method applied to the operator.

1 October 2011 in SIAM Journal on Matrix Analysis and Applications
Verified
Journal Article
Closed access
WMWim Michiels
Wim Michiels
EJElias Jarlebring
Elias Jarlebring
KMKarl Meerbergen
Karl Meerbergen
We present a model order reduction method which allows the construction of a reduced, delay-free model of a given dimension for linear time-delay systems, whose characteristic matrix is nonlinear due to the presence of exponential functions. The method builds on the equivalent representation of the time-delay system as an infinite-dimensional linear problem. It combines ideas from a finite-dimensional approximation via a spectral discretization, on the one hand, and a Krylov–Padé model reduction approach, on the other hand. The method exhibits a good spectral approximation of the original model, in the sense that the smallest characteristic roots are well approximated and the nonconverged eigenvalues of the reduced model have a favorable location, and it preserves moments at zero and at infinity. The spectral approximation is due to an underlying Arnoldi process that relies on building an appropriate Krylov space for the linear infinite-dimensional problem. The preservation of moments is guaranteed, because the chosen finite-dimensional approximation preserves moments and, in addition, the space on which one projects is constructed in such a way that the preservation of moments carries over to the reduced model. The implementation of the method is dynamic, since the number of grid points in the spectral discretization does not need to be chosen beforehand and the accuracy of the reduced model can always be improved by doing more iterations. It relies on a reformulation of the problem involving a companion-like system matrix and a highly structured input matrix, whose structure are fully exploited.

1 December 2007 in Automatica
Verified
Journal Article
Closed access
EJElias Jarlebring
Elias Jarlebring
TDTobias Damm
Tobias Damm