Related papers: Structured backward errors for eigenvalues of line…
This paper investigates the problem of data-driven modeling of port-Hamiltonian systems while preserving their intrinsic Hamiltonian structure and stability properties. We propose a novel neural-network-based port-Hamiltonian modeling…
To understand the solution of a linear, time-invariant differential-algebraic equation, one must analyze a matrix pencil (A,E) with singular E. Even when this pencil is stable (all its finite eigenvalues fall in the left-half plane), the…
This paper offers a review of numerical methods for computation of the eigenvalues of Hermitian matrices and the singular values of general and some classes of structured matrices. The focus is on the main principles behind the methods that…
We introduce a new class of structured matrix polynomials, namely, the class of M_A-structured matrix polynomials, to provide a common framework for many classes of structured matrix polynomials that are important in applications: the…
For each square matrix polynomial $P(\lambda)$ of odd degree, a block-symmetric block-tridiagonal pencil $\mathcal{T}_{P}(\lambda)$ was introduced by Antoniou and Vologiannidis in 2004, and a variation $\mathcal{R}_P(\lambda)$ was…
We consider eigenvalue condition numbers and backward errors for a class of symmetric nonlinear eigenvalue problems with eigenvector nonlinearities. For both of these quantities, we derive explicit and computable expressions that can be…
Port-based network modeling of multi-physics problems leads naturally to a formulation as port-Hamiltonian differential-algebraic system. In this way, the physical properties are directly encoded in the structure of the model. Since the…
We study the backward stability of running a backward stable eigenstructure solver on a pencil $S(\lambda)$ that is a strong linearization of a rational matrix $R(\lambda)$ expressed in the form $R(\lambda)=D(\lambda)+ C(\lambda…
The relationship between port-Hamiltonian and positive real descriptor systems is investigated. It is well-known that port-Hamiltonian systems are positive real, but the converse implication does not always hold. In [K. Cherifi, H.…
We consider a pencil of matrix Sturm-Liouville operators on a finite interval. We study properties of its spectral characteristics and inverse problems that consist in recovering of the pencil by the spectral data: eigenvalues and…
A framework for identifying nonlinear port-Hamiltonian systems using input-state-output data is introduced. The framework utilizes neural networks' universal approximation capacity to effectively represent complex dynamics in a structured…
We consider the distance from a (square or rectangular) matrix pencil to the nearest matrix pencil in 2-norm that has a set of specified eigenvalues. We derive a singular value optimization characterization for this problem and illustrate…
We analyze when an arbitrary matrix pencil is equivalent to a dissipative Hamiltonian pencil and show that this heavily restricts the spectral properties. In order to relax the spectral properties, we introduce matrix pencils with…
We study the structured distance to singularity for a given regular matrix pencil $A+sE$, where $(A,E)\in \mathbb S \subseteq (\mathbb C^{n,n})^2$. This includes Hermitian, skew-Hermitian, $*$-even, $*$-odd, $*$-palindromic, T-palindromic,…
A complete structure-preserving learning scheme for single-input/single-output (SISO) linear port-Hamiltonian systems is proposed. The construction is based on the solution, when possible, of the unique identification problem for these…
Rigorous, non-asymptotic bounds for the Puiseux expansion of the eigenvalue at infinity are given. Error analysis is provided. Further, the expected value of the eigenvector condition number of a randomly perturbed matrix is estimated. The…
We extend the modeling framework of port-Hamiltonian descriptor systems to include under- and over-determined systems and arbitrary differentiable Hamiltonian functions. This structure is associated with a Dirac structure that encloses its…
We consider the eigenvalue problem for the case where the input matrix is symmetric and its entries perturb in some given intervals. We present a characterization of some of the exact boundary points, which allows us to introduce an inner…
One of the most used approaches in simulating materials is the tight-binding approximation. When using this method in a material simulation, it is necessary to compute the eigenvalues and eigenvectors of the Hamiltonian describing the…
We design a fast implicit real QZ algorithm for eigenvalue computation of structured companion pencils arising from linearizations of polynomial rootfinding problems. The modified QZ algorithm computes the generalized eigenvalues of an…