Port-Hamiltonian Descriptor Systems
- Port-Hamiltonian descriptor systems are differential-algebraic frameworks that merge energy storage, interconnection, and dissipation into one unified representation.
- They leverage algebraic constraints to maintain power balance and passivity, facilitating structure-preserving stability analysis and feedback design.
- They find applications in electrical circuits, fluid networks, and PDEs, with numerical techniques emphasizing preservation of their intrinsic energy properties.
Port-Hamiltonian descriptor systems are differential-algebraic systems that combine the energy-based modeling paradigm of port-Hamiltonian systems with the algebraic constraints of descriptor systems. In linear time-invariant form they are typically written as
or, in a simplified variant, , with structure matrices satisfying skew-symmetry, semidefinite dissipation, and the compatibility condition . The framework encodes interconnection, energy storage, dissipation, and ports in a single descriptor representation, and it is designed to retain power-balance and passivity under constraints, transformations, and interconnections (Beattie et al., 2017, Gernandt et al., 2021, Mehrmann et al., 2022).
1. Algebraic definition and power balance
A linear time-invariant descriptor system has the form
with regular if for at least one (Chu et al., 2024, Cherifi et al., 2022). In the port-Hamiltonian descriptor setting, the coefficients are factorized as
subject to
with , 0, 1, 2 (Cherifi et al., 2022, Chu et al., 2024). A commonly used homogeneous specialization is
3
and when 4 this is called a dissipative-Hamiltonian descriptor system (Gernandt et al., 2021).
The Hamiltonian is the quadratic stored-energy functional
5
or, in the complex notation used in some sources,
6
and 7 ensures nonnegativity (Chu et al., 2 Sep 2025, Cherifi et al., 2022). Along sufficiently regular trajectories, the power balance reads
8
while in the simplified form it reduces to
9
or, with 0,
1
(Chu et al., 2 Sep 2025, Chu et al., 2024, Beattie et al., 2017). This identity is the central reason pH descriptor systems are naturally passive and Lyapunov stable in the zero-input case (Mehrmann et al., 2019, Mehrmann et al., 2022).
The descriptor matrix 2 may be singular. This is not an accessory feature but part of the modeling framework: pHDAEs extend port-Hamiltonian ODEs to constrained systems and to high-index descriptor formulations while preserving the energetic interpretation (Beattie et al., 2017, Mehrmann et al., 2022).
2. Geometric structure, invariance, and equivalent representations
The descriptor formulation has a geometric counterpart in terms of Dirac, Lagrange, and maximal resistive structures. In the geometric picture, a trajectory is specified by storage variables, efforts, resistive variables, and external ports satisfying
3
and the Dirac orthogonality together with the resistive inequality yields
4
(Gernandt et al., 2023). A one-to-one correspondence between this geometric formulation and the descriptor realization by pHDAEs is established by explicit constructions in both directions (Gernandt et al., 2023).
The pHDAE class is invariant under congruence and basis changes. For time-varying invertible 5 and 6, the transformed coefficients
7
again define a pHDAE, and the transformed Hamiltonian satisfies 8 (Beattie et al., 2017). The same invariance principle appears in nonlinear pHDAEs under diffeomorphic coordinate changes, where 9 and the transformed system preserves the pH form (Mehrmann et al., 2019).
Power-conserving interconnection is equally intrinsic. Two subsystems
0
can be interconnected by static power-preserving relations such as 1, and the aggregate system remains port-Hamiltonian with total Hamiltonian 2 (Mehrmann et al., 2022, Mehrmann et al., 2019). This invariance under interconnection is one reason the framework is described as ideal for automated network-based modeling (Mehrmann et al., 2022).
The same structural ideas extend beyond finite-dimensional ODE/DAE settings. For PDEs, Schöberl and Siuka formulate infinite-dimensional pH systems directly from the power-balance relation, allowing the Hamiltonian density 3 to depend on derivative variables. In the non-differential-operator case one recovers
4
while in the differential-operator case one writes
5
and the energy balance acquires boundary-port terms from integration by parts (Schöberl et al., 2012). For 1D distributed systems, explicit descriptor formulations and implicit Stokes-Lagrange subspace representations are linked by bijective transformations that commute with flow-constraint projections (Bendimerad-Hohl et al., 2024).
3. Regularity, index, system space, and stability
Regularity and differentiation index are basic analytical notions for pH descriptor systems. The pencil 6 is regular if 7 for some 8; equivalently it has exactly 9 finite eigenvalues (Chu et al., 2 Sep 2025). In Weierstraß or strict Kronecker form, the nilpotent blocks at infinity determine the differentiation index. In port-Hamiltonian DAEs one always has 0, but index two is troublesome because solutions may not exist for arbitrary inputs and impulses or non-smooth phenomena may appear (Chu et al., 2 Sep 2025, Chu et al., 2024).
The system space
1
is the natural invariant space on which descriptor trajectories evolve (Gernandt et al., 2021). In quasi-Kronecker coordinates, it is obtained by deleting components associated with inconsistent or purely algebraic blocks (Gernandt et al., 2021). This viewpoint is essential in stability theory because a singular descriptor pair need not define dynamics on the whole ambient space.
A generalized Lyapunov inequality characterizes behavioral stability. For a homogeneous DAE 2, stability is equivalent to regularity of 3, spectral inclusion 4 with semisimple imaginary-axis eigenvalues, and the existence of a symmetric matrix 5 satisfying
6
on the system space 7 (Gernandt et al., 2021). If such an 8 exists, then on 9 the DAE can be rewritten as a dissipative-Hamiltonian descriptor system via
0
with 1, 2, and 3 on 4 (Gernandt et al., 2021). This gives a converse-to-structure statement: every behaviorally stable DAE admits a dH representation on its system space.
For homogeneous pH DAEs 5, sufficient and necessary conditions for stability are available under 6. In that case, when 7 is invertible,
8
(Gernandt et al., 2021). A related geometric criterion states that, for dH systems with 9, regularity and stability are implied by
0
under the same nondegeneracy assumption (Gernandt et al., 2021).
A common misconception is that passivity alone implies asymptotic stability. The 2024 state-feedback results explicitly distinguish these notions: pH descriptor systems are known to be stable and passive, but they may not be asymptotically stable or strictly passive (Chu et al., 2024). This distinction drives much of the later feedback theory.
4. Regularization and stabilization by feedback
A central control problem for pH descriptor systems is to make a possibly non-regular or index-two closed loop regular, index at most one, asymptotically stable, and still port-Hamiltonian. For output feedback, the general proportional-derivative law is
1
which leads to the closed-loop system
2
(Chu et al., 2 Sep 2025). Three special cases are pure proportional feedback, pure derivative feedback, and mixed feedback (Chu et al., 2 Sep 2025).
For proportional feedback, there exists 3 such that 4 is regular, 5, and the loop remains pH if and only if
6
where 7 is any basis of the right nullspace of 8 (Chu et al., 2 Sep 2025). For derivative feedback, there exists 9 such that 0 is regular, 1, 2 is maximal among matrices of the form 3, and the closed loop is pH if and only if
4
equivalently 5 (Chu et al., 2 Sep 2025). Under complete observability and additional rank data, mixed proportional-derivative feedback allows prescribed rank 6 together with regularity, index reduction, and pH preservation (Chu et al., 2 Sep 2025).
The 2024 stabilization results treat the standard form
7
obtained after a standard reformulation so that 8 and 9 (Chu et al., 2024). With static output feedback
0
the closed-loop matrices are
1
where 2 and 3 with 4, 5 (Chu et al., 2024). Necessary and sufficient conditions are given for regularization, index reduction to 6, and asymptotic stabilization. In particular, proportional feedback achieves regularity and index 7 exactly when
8
and asymptotic stabilization further requires
9
(Chu et al., 2024). Combined proportional and derivative feedback can enforce 0, 1, regularity, index 2, and asymptotic stability under the corresponding rank conditions (Chu et al., 2024).
State-feedback results provide the analogous structure-preserving picture. For
3
the proportional state feedback 4 yields
5
so the closed loop remains pH (Chu et al., 2024). There exists 6 such that 7 is regular, of index 8, and all finite eigenvalues lie in 9 if and only if
00
and
01
(Chu et al., 2024). Strict passivity is characterized separately by 02 and an explicit positivity condition involving 03 and 04 (Chu et al., 2024).
The 2025 paper on regularization isolates the rank conditions for output-feedback regularization without requiring full asymptotic stabilization, and emphasizes that all constructions proceed through condensed forms computed using orthogonal transformations, so the resulting algorithms are numerically reliable (Chu et al., 2 Sep 2025). The 2025 output-feedback stabilization paper extends the unknown-05 case and states that, under its two rank conditions, any positive definite feedback matrix 06 achieves a regular, impulse-free, asymptotically stable, structure-preserving closed loop (Shi et al., 29 Dec 2025). A plausible implication is that the pH structure makes a classically difficult descriptor feedback problem much more tractable than in the unstructured setting; that contrast is stated explicitly in the stabilization papers (Chu et al., 2024, Shi et al., 29 Dec 2025).
5. Passivity, positive realness, controllability, and realizations
The relation among port-Hamiltonian, passive, positive-real, and KYP-based system classes is highly structured but not fully reversible without additional hypotheses. For any regular descriptor system 07,
08
(Cherifi et al., 2022). Here positive realness means that
09
is analytic for 10 and satisfies 11 there (Chu et al., 2024, Cherifi et al., 2022). The generalized KYP inequality is
12
The converses require hypotheses. If in the KYP inequality the solution 13 is invertible, then one can reconstruct a pH representation explicitly (Cherifi et al., 2022). If 14 is observable, then any KYP solution 15 is invertible; if 16, then KYP implies pH (Cherifi et al., 2022). Passivity implies pH under behavioral observability and 17 (Cherifi et al., 2022). Positive realness implies passivity under behavioral controllability (Cherifi et al., 2022).
The converse from positive real to port-Hamiltonian becomes exact for minimal descriptor realizations. If 18 is regular, completely controllable, completely observable, and positive real, then it is already a pH descriptor system if and only if
19
(Chu et al., 2024). If 20 fails to be nonnegative, an equivalent pH realization can still be constructed for descriptor systems by a feedthrough shift: find 21 such that
22
then define
23
The new system 24 is port-Hamiltonian and has the same transfer function (Chu et al., 2024). In the standard case 25, by contrast, 26 is invariant under similarity, so such feedthrough shifting is not available (Chu et al., 2024).
Controllability and stabilizability also admit structural dimension criteria in the pH descriptor class. For systems
27
with 28, five pH controllability concepts are relative generic in 29, 30, and 31 precisely under explicit inequalities in 32 (Ilchmann et al., 2023). In particular, freely initializable and impulse-controllable are relative generic iff 33; behavioral-controllable iff 34; and completely- and strongly-controllable iff 35 (Ilchmann et al., 2023). The stabilizability criteria have the same dimension pattern, with a non-generic boundary case at 36 (Ilchmann et al., 2023).
These results clarify a frequent source of confusion: passivity, positive realness, and port-Hamiltonian structure are closely related, but they are not identical notions. The descriptor setting makes the differences particularly visible because the feedthrough term, algebraic constraints, and index can obstruct converse implications (Cherifi et al., 2022, Chu et al., 2024).
6. Numerical linear algebra, discretization, model reduction, and extensions
Port-Hamiltonian descriptor systems are unusually well aligned with structure-preserving numerical linear algebra. Condensed forms under orthogonal transformations are a recurring tool for regularity tests, index analysis, stabilization, and realization algorithms (Mehrmann et al., 2022, Chu et al., 2 Sep 2025). In the 2025 regularization paper, the reduction of 37 uses simultaneous left/right orthogonal transforms 38 so that 39 acquire a staircase form with nonsingular diagonal subblocks, followed by further orthogonal transformations that isolate the infinite-eigenvalue part into a 40 block and a final real Schur decomposition (Chu et al., 2 Sep 2025). The full feedback computation uses only QR, CS-decomposition, SVD, and real-Schur steps, so the algorithm is numerically reliable (Chu et al., 2 Sep 2025).
The same emphasis on structure appears in eigenvalue computations. For the pencil
41
the relation
42
implies the spectral symmetry 43 (Mehrmann et al., 2020). Structured backward-error analysis shows that if a computed spectrum has the correct symmetry, then there exists a nearby pH descriptor system with exactly that eigenstructure, and the corresponding bounds depend on a conditioning constant related to the stability radius 44 (Mehrmann et al., 2020). A large stability radius means that imposing the pH structure causes only small growth in backward error, whereas near-singular or marginally stable systems are more ill-conditioned (Mehrmann et al., 2020).
Time discretization can be carried out in a structure-preserving manner. For nonlinear pHDAEs
45
collocation and discrete-gradient methods preserve a discrete power balance (Mehrmann et al., 2019). In particular, Gauss-type collocation yields
46
and the midpoint rule reproduces the continuous one-step dissipation law exactly in the quadratic case (Mehrmann et al., 2019). There is also a discrete-time dissipative pH descriptor formulation for completely causal scattering-passive systems,
47
with discrete-time KYP characterizations and equivalence to scattering passivity and bounded realness under the stated assumptions (Cherifi et al., 2023).
Model reduction has been developed in a structure-preserving way. LQG balanced truncation for pH descriptor systems uses two generalized algebraic Riccati equations, one of them modified by the addition of 48, and preserves the pH structure of the reduced model (Breiten et al., 2021). The reduced-order error is bounded through normalized right coprime factorizations: 49 and the choice of Hamiltonian can be improved by replacing 50 with an extremal solution of a generalized KYP inequality (Breiten et al., 2021). The paper reports that this can significantly improve reduced-order accuracy while retaining passivity and pH form (Breiten et al., 2021).
Applications span electrical circuits, multi-body systems, fluid and gas networks, wave networks, damped beam models, seepage, and nanorods (Beattie et al., 2017, Mehrmann et al., 2022, Bendimerad-Hohl et al., 2024). The 2017 foundational pHDAE paper emphasizes high-index examples such as RLC networks, gas-pipeline wave networks, and constrained multibody systems, and shows how hidden constraints can be exposed while preserving the pH structure (Beattie et al., 2017). The 2022 survey describes the same framework as adequate for simulation, control, and model reduction, and closes with open problems and research topics deserving further attention (Mehrmann et al., 2022).
A plausible synthesis is that pH descriptor systems are not merely a special representation of DAEs, but a structural class in which regularization, stability analysis, feedback design, discretization, and reduction can all be posed in a way that preserves the same energy and passivity identities from modeling through computation (Beattie et al., 2017, Mehrmann et al., 2022, Chu et al., 2 Sep 2025).