Balanced Truncation via Tangential Interpolation

Abstract

This paper examines the construction of rth-order truncated balanced realizations via tangential interpolation at r specified interpolation points. It is demonstrated that when the truncated Hankel singular values are negligible-that is, when the discarded states are nearly uncontrollable and unobservable-balanced truncation simplifies to a bi-tangential Hermite interpolation problem at r interpolation points. In such cases, the resulting truncated balanced realization is nearly H2-optimal and thus interpolates the original model at the mirror images of its poles along its residual directions. Like standard H2-optimal model reduction, where the interpolation points and tangential directions that yield a local optimum are not known, in balanced truncation as well, the interpolation points and tangential directions required to produce a truncated balanced realization remain unknown. To address this, we propose an iterative tangential interpolation-based algorithm for balanced truncation. Upon convergence, the algorithm yields a low-rank truncated balanced realization that accurately preserves the r largest Hankel singular values of the original system. An adaptive scheme to automatically select the order r of the reduced model is also proposed. The algorithm is fully automatic, choosing both the interpolation data and the model order without user intervention. Additionally, an adaptive low-rank solver for Lyapunov equations based on tangential interpolation is proposed, automatically selecting both the interpolation data and the rank without user intervention. The performance of the proposed algorithms is evaluated on benchmark models, confirming their efficacy.

0

Turn this paper into a full lesson

ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…