arXiv subjects

Ion Victor Gosea

Publications and source records attributed to Ion Victor Gosea.

At least 19 recordsLinked to original sources

arXiv2026

Rational approximation for Zolotarev sign and ratio problems

We study algorithms for Zolotarev (3rd and 4th) problems rational approximation. First, we show that the Loewner framework (LF) is appropriate to rapidly and with no iterations, approximate the Zolotarev problems by compressing the (numerous) interpolation conditions. Second, we compare the approximation properties (e.g. coefficients and poles) of LF with the standard AAA, AAA-sign and its AAA-Lawson variants. We concentrate the study on a canonical example, namely the symmetric two-circles one, for which the optimal solution is well documented. For this case, we highlight the numerical robustness of LF and its ability to recover the structure of the optimal solution. Additional non-trivial geometries are also reported, emphasizing that LF is fast, reliable, and yields accurate approximants with no user intervention.

math.NA↗

arXiv2026

$\mathcal{H}_2$-optimal model reduction of linear quadratic-output systems by multivariate rational interpolation

This paper addresses the $\mathcal{H}_2$-optimal approximation of linear dynamical systems with quadratic-output functions, also known as linear quadratic-output systems. Our major contributions are threefold. First, we derive interpolatory first-order optimality conditions for the linear quadratic-output $\mathcal{H}_2$ minimization problem. These conditions correspond to the mixed-multipoint tangential interpolation of the full-order linear- and quadratic-output transfer functions, and generalize the Meier-Luenberger optimality framework for the $\mathcal{H}_2$-optimal model reduction of linear time-invariant systems. Second, given the optimal interpolation data, we show how to enforce the interpolatory optimality conditions explicitly by Petrov-Galerkin projection of the full-order model. Third, to find the optimal interpolation data, we build on this projection framework and propose a generalization of the iterative rational Krylov algorithm for the $\mathcal{H}_2$-optimal model reduction of linear quadratic-output systems, called LQO-IRKA. Upon convergence, LQO-IRKA produces reduced linear quadratic-output systems that satisfy the interpolatory optimality conditions. The method only requires solving shifted linear systems and matrix-vector products, thus making it suitable for large-scale problems. Numerical examples are included to illustrate the effectiveness of the proposed method.

math.NA↗

arXiv2026

$H_2$ optimal model reduction of linear systems with multiple quadratic outputs

In this work, we consider the $H_2$ optimal model reduction of dynamical systems that are linear in the state equation and up to quadratic nonlinearity in the output equation. As our primary theoretical contributions, we derive gradients of the squared $H_2$ system error with respect to the reduced model quantities and, from the stationary points of these gradients, introduce Gramian-based first-order necessary conditions for the $H_2$ optimal approximation of a linear quadratic output (LQO) system. The resulting $H_2$ optimality framework neatly generalizes the analogous Gramian-based optimality framework for purely linear systems. Computationally, we show how to enforce the necessary optimality conditions using Petrov-Galerkin projection; the corresponding projection matrices are obtained from a pair of Sylvester equations. Based on this result, we propose an iteratively corrected algorithm for the $H_2$ model reduction of LQO systems, which we refer to as LQO-TSIA (linear quadratic output two-sided iteration algorithm). Numerical examples are included to illustrate the effectiveness of the proposed computational method against other existing approaches.

math.NA↗

arXiv2026

Tensor-based multivariate function approximation: methods benchmarking and comparison

We evaluate some methods designed for tensor- (or data-) based multivariate model construction (approximation and compression). To this aim, a collection of multivariate functions and an evaluation methodology are suggested. First, these functions, with varying complexity (e.g., number and degree of the variables) and nature (e.g., rational, irrational, differentiable or not, symmetric, etc.) are used to build $n$-dimensional tensors, each of different dimension and memory size. Second, grounded on this tensor, we evaluate the performances of different methods and implementations leading to different types of surrogate models (e.g., rational functions, networks). The accuracy, the computational time, the parameter tuning impact, etc. are monitored and reported. One objective is to evaluate the different available strategies to guide users on the prospects, advantages, and limits of the various tools. The contributions are twofold: (i) to suggest a comprehensive benchmark collection together with a methodology for tensor approximation with a surrogate model and, in addition, (ii) to provide a digest and additional details of the multivariate Loewner Framework (mLF) approach [Antoulas et al., 2025], as well as detailed examples and code.

math.NA↗

arXiv2025

Barycentric rational approximation for learning the index of a dynamical system from limited data

We consider the task of data-driven identification of dynamical systems, specifically for systems whose behavior at large frequencies is non-standard, as encoded by a non-trivial relative degree of the transfer function or, alternatively, a non-trivial index of a corresponding realization as a descriptor system. We develop novel surrogate modeling strategies that allow state-of-the-art rational approximation algorithms (e.g., AAA and vector fitting) to better handle data coming from such systems with non-trivial relative degree. Our contribution is twofold. On one hand, we describe a strategy to build rational surrogate models with prescribed relative degree, with the objective of mirroring the high-frequency behavior of the high-fidelity problem, when known. The surrogate model's desired degree is achieved through constraints on its barycentric coefficients, rather than through ad-hoc modifications of the rational form. On the other hand, we present a degree-identification routine that allows one to estimate the unknown relative degree of a system from low-frequency data. By identifying the degree of the system that generated the data, we can build a surrogate model that, in addition to matching the data well (at low frequencies), has enhanced extrapolation capabilities (at high frequencies). We showcase the effectiveness and robustness of the newly proposed method through a suite of numerical tests.

math.NA↗

arXiv2025

Data-driven balanced truncation for linear systems with quadratic outputs

We develop the framework for a non-intrusive, quadrature-based method for approximate balanced truncation (QuadBT) of linear systems with quadratic outputs, thus extending the applicability of QuadBT, which was originally designed for data-driven balanced truncation of standard linear systems with linear outputs only. The new approach makes use of the time-domain and frequency-domain quadrature-based representation of the system's infinite Gramians, only implicitly. We show that by sampling solely the extended impulse responses of the original system and their derivatives (or the corresponding transfer functions), we construct a reduced-order model that mimics the approximation quality of the intrusive (projection-based) balanced truncation. We validate the proposed framework on a numerical example.

math.NA↗

arXiv2025

Generalizations of data-driven balancing: What to sample for different balancing-based reduced models

The quadrature-based balanced truncation (QuadBT) framework of arXiv:2104.01006 is a non-intrusive reformulation of balanced truncation (BT), a classical projection-based model-order reduction technique for linear systems. QuadBT is non-intrusive in the sense that it builds approximate balanced truncation reduced-order models entirely from system response data, e.g., transfer function measurements, without the need to reference an explicit state-space realization of the underlying full-order model. In this work, we generalize the QuadBT framework to other types of balanced truncation model reduction. Namely, we show what transfer function data are required to compute data-driven reduced models by balanced stochastic truncation, positive-real balanced truncation, and bounded-real balanced truncation. In each case, these data are evaluations of particular spectral factors associated with the system of interest. These results lay the theoretical foundation for data-driven reformulations of the aforementioned BT variants. Although it is not yet clear how to compute or obtain these spectral factor data in a practical real-world setting, examples using synthetic (numerically evaluated) transfer function data are included to validate the data-based reduced models.

math.NA↗

arXiv2025

Second-order AAA algorithms for structured data-driven modeling

The data-driven modeling of dynamical systems has become an essential tool for the construction of accurate computational models from real-world data. In this process, the inherent differential structures underlying the considered physical phenomena are often neglected making the reinterpretation of the learned models in a physically meaningful sense very challenging. In this work, we present three data-driven modeling approaches for the construction of dynamical systems with second-order differential structure directly from frequency domain data. Based on the second-order structured barycentric form, we extend the well-known Adaptive Antoulas-Anderson algorithm to the case of second-order systems. Depending on the available computational resources, we propose variations of the proposed method that prioritize either higher computation speed or greater modeling accuracy, and we present a theoretical analysis for the expected accuracy and performance of the proposed methods. Three numerical examples demonstrate the effectiveness of our new structured approaches in comparison to classical unstructured data-driven modeling.

math.NA↗

arXiv2025

On the Loewner framework, the Kolmogorov superposition theorem, and the curse of dimensionality

The Loewner framework is an interpolatory approach for the approximation of linear and nonlinear systems. The purpose here is to extend this framework to linear parametric systems with an arbitrary number n of parameters. To achieve this, a new generalized multivariate rational function realization is proposed. Then, we introduce the n-dimensional multivariate Loewner matrices and show that they can be computed by solving a set of coupled Sylvester equations. The null space of these Loewner matrices allows the construction of the multivariate barycentric rational function. The principal result of this work is to show how the null space of the n-dimensional Loewner matrix can be computed using a sequence of 1-dimensional Loewner matrices, leading to a drastic reduction of the computational burden. Equally importantly, this burden is alleviated by avoiding the explicit construction of large-scale n-dimensional Loewner matrices of size $N \times N$. Instead, the proposed methodology achieves decoupling of variables, leading to (i) a complexity reduction from $O(N^3)$ to below $O(N^{1.5})$ when $n > 5$ and (ii) to memory storage bounded by the largest variable dimension rather than their product, thus taming the curse of dimensionality and making the solution scalable to very large data sets. This decoupling of the variables leads to a result similar to the Kolmogorov superposition theorem for rational functions. Thus, making use of barycentric representations, every multivariate rational function can be computed using the composition and superposition of single-variable functions. Finally, we suggest two algorithms (one direct and one iterative) to construct, directly from data, multivariate (or parametric) realizations ensuring (approximate) interpolation. Numerical examples highlight the effectiveness and scalability of the method.

math.NA↗

arXiv2024

Loewner functions for bilinear systems

This work brings together the moment matching approach based on Loewner functions and the classical Loewner framework based on the Loewner pencil in the case of bilinear systems. New Loewner functions are defined based on the bilinear Loewner framework, and a Loewner equivalent model is produced using these functions. This model is composed of infinite series that needs to be truncated in order to be implemented in practice. In this context, a new notion of approximate Loewner equivalence is introduced. In the end, it is shown that the moment matching procedure based on the proposed Loewner functions and the classical interpolatory bilinear Loewner framework both result in $κ$-Loewner equivalent models, the main difference being that the latter preserves bilinearity at the expense of a higher order.

math.CA↗

arXiv2024

Learning reduced-order Quadratic-Linear models in Process Engineering using Operator Inference

In this work, we address the challenge of efficiently modeling dynamical systems in process engineering. We use reduced-order model learning, specifically operator inference. This is a non-intrusive, data-driven method for learning dynamical systems from time-domain data. The application in our study is carbon dioxide methanation, an important reaction within the Power-to-X framework, to demonstrate its potential. The numerical results show the ability of the reduced-order models constructed with operator inference to provide a reduced yet accurate surrogate solution. This represents an important milestone towards the implementation of fast and reliable digital twin architectures.

math.NA↗

arXiv2024

A non-intrusive data-based reformulation of a hybrid projection-based model reduction method

We present a novel data-driven reformulation of the iterative SVD-rational Krylov algorithm (ISRK), in its original formulation a Petrov-Galerkin (two-sided) projection-based iterative method for model reduction combining rational Krylov subspaces (on one side) with Gramian/SVD based subspaces (on the other side). We show that in each step of ISRK, we do not necessarily require access to the original system matrices, but only to input/output data in the form of the system's transfer function, evaluated at particular values (frequencies). Numerical examples illustrate the efficiency of the new data-driven formulation.

math.NA↗

arXiv2024

Snapshot-driven Rational Interpolation of Parametric Systems

Parametric data-driven modeling is relevant for many applications in which the model depends on parameters that can potentially vary in both space and time. In this paper, we present a method to obtain a global parametric model based on snapshots of the parameter space. The parameter snapshots are interpolated using the classical univariate Loewner framework and the global bivariate transfer function is extracted using a linear fractional transformation (LFT). Rank bounds for the minimal order of the global realization are also derived. The results are supported by various numerical examples.

math.DS↗

arXiv2024

A modified AAA algorithm for learning stable reduced-order models from data

In recent years, the Adaptive Antoulas-Anderson AAA algorithm has established itself as the method of choice for solving rational approximation problems. Data-driven Model Order Reduction (MOR) of large-scale Linear Time-Invariant (LTI) systems represents one of the many applications in which this algorithm has proven to be successful since it typically generates reduced-order models (ROMs) efficiently and in an automated way. Despite its effectiveness and numerical reliability, the classical AAA algorithm is not guaranteed to return a ROM that retains the same structural features of the underlying dynamical system, such as the stability of the dynamics. In this paper, we propose a novel algebraic characterization for the stability of ROMs with transfer function obeying the AAA barycentric structure. We use this characterization to formulate a set of convex constraints on the free coefficients of the AAA model that, whenever verified, guarantee by construction the asymptotic stability of the resulting ROM. We suggest how to embed such constraints within the AAA optimization routine, and we validate experimentally the effectiveness of the resulting algorithm, named stabAAA, over a set of relevant MOR applications.

math.NA↗

arXiv2023

Implicit and explicit matching of non-proper transfer functions in the Loewner framework

The reduced-order modeling of a system from data (also known as system identification) is a classical task in system and control theory and well understood for standard linear systems with the so-called Loewner framework as one of many established approaches. In the case of descriptor systems for which the transfer function is not proper anymore, recent research efforts have addressed strategies to deal with the non-proper parts more or less explicitly. In this work, we propose a variant of a Loewner matrix-based interpolation algorithm that implicitly addresses possibly non-proper components of the system response. We evaluate the performance of the suggested approach by comparing against recently-developed explicit algorithms for which we propose a linearized Navier-Stokes model with a significant non-proper behavior as a benchmark example.

math.DS↗

arXiv2023

Structured barycentric forms for interpolation-based data-driven reduced modeling of second-order systems

An essential tool in data-driven modeling of dynamical systems from frequency response measurements is the barycentric form of the underlying rational transfer function. In this work, we propose structured barycentric forms for modeling dynamical systems with second-order time derivatives using their frequency domain input-output data. By imposing a set of interpolation conditions, the systems' transfer functions are rewritten in different barycentric forms using different parametrizations. Loewner-like algorithms are developed for the explicit computation of second-order systems from data based on the developed barycentric forms. Numerical experiments show the performance of these new structured data driven modeling methods compared to other interpolation-based data-driven modeling techniques from the literature.

math.NA↗

arXiv2023

Data-driven and low-rank implementations of Balanced Singular Perturbation Approximation

Balanced Singular Perturbation Approximation (SPA) is a model order reduction method for linear time-invariant systems that guarantees asymptotic stability and for which there exists an a priori error bound. In that respect, it is similar to Balanced Truncation (BT). However, the reduced models obtained by SPA generally introduce better approximation in the lower frequency range and near steady-states, whereas BT is better suited for the higher frequency range. Even so, independently of the frequency range of interest, BT and its variants are more often applied in practice, since there exist more efficient algorithmic realizations thereof. In this paper, we aim at closing this practically-relevant gap for SPA. We propose two novel and efficient algorithms that are adapted for different settings. Firstly, we derive a low-rank implementation of SPA that is applicable in the large-scale setting. Secondly, a data-driven reinterpretation of the method is proposed that only requires input-output data, and thus, is realization-free. A main tool for our derivations is the reciprocal transformation, which induces a distinct view on implementing the method. While the reciprocal transformation and the characterization of SPA is not new, its significance for the practical algorithmic realization has been overlooked in the literature. Our proposed algorithms have well-established counterparts for BT, and as such, also a comparable computational complexity. The numerical performance of the two novel implementations is tested for several numerical benchmarks, and comparisons to their counterparts for BT as well as the existing implementations of SPA are made.

math.NA↗

arXiv2023

Practical challenges in data-driven interpolation: dealing with noise, enforcing stability, and computing realizations

In this contribution, we propose a detailed study of interpolation-based data-driven methods that are of relevance in the model reduction and also in the systems and control communities. The data are given by samples of the transfer function of the underlying (unknown) model, i.e., we analyze frequency-response data. We also propose novel approaches that combine some of the main attributes of the established methods, for addressing particular issues. This includes placing poles and hence, enforcing stability of reduced-order models, robustness to noisy or perturbed data, and switching from different rational function representations. We mention here the classical state-space format and also various barycentric representations of the fitted rational interpolants. We show that the newly-developed approaches yield, in some cases, superior numerical results, when comparing to the established methods. The numerical results include a thorough analysis of various aspects related to approximation errors, choice of interpolation points, or placing dominant poles, which are tested on some benchmark models and data-sets.

math.NA↗