DeepAI AI Chat
Log In Sign Up

Computation of the nearest structured matrix triplet with common null space

by   Nicola Guglielmi, et al.
Berlin Institute of Technology (Technische Universität Berlin)

We study computational methods for computing the distance to singularity, the distance to the nearest high index problem, and the distance to instability for linear differential-algebraic systems (DAEs) with dissipative Hamiltonian structure. While for general unstructured DAEs the characterization of these distances is very difficult, and partially open, it has been recently shown that for dissipative Hamiltonian systems and related matrix pencils there exist explicit characterizations. We will use these characterizations for the development of computational methods to compute these distances via methods that follow the flow of a differential equation converging to the smallest perturbation that destroys the property of regularity, index one or stability.


page 1

page 2

page 3

page 4


Distance problems for dissipative Hamiltonian systems and related matrix polynomials

We study the characterization of several distance problems for linear di...

Solving matrix nearness problems via Hamiltonian systems, matrix factorization, and optimization

In these lectures notes, we review our recent works addressing various p...

Structure-preserving Interpolatory Model Reduction for Port-Hamiltonian Differential-Algebraic Systems

We examine interpolatory model reduction methods that are well-suited fo...

A passivation algorithm for linear time-invariant systems

We propose and study an algorithm for computing a nearest passive system...

Local and global canonical forms for differential-algebraic equations with symmetries

Linear time-varying differential-algebraic equations with symmetries are...

Bridging the gap: symplecticity and low regularity on the example of the KdV equation

Recent years have seen an increasing amount of research devoted to the d...