اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديد$mathcal{H}_2$-gap model reduction for stabilizable and detectable systems
119
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
We formulate here an approach to model reduction that is well-suited for linear time-invariant control systems that are stabilizable and detectable but may otherwise be unstable. We introduce a modified $mathcal{H}_2$-error metric, the $mathcal{H}_2$-gap, that provides an effective measure of model fidelity in this setting. While the direct evaluation of the $mathcal{H}_2$-gap requires the solutions of a pair of algebraic Riccati equations associated with related closed-loop systems, we are able to work entirely within an interpolatory framework, developing algorithms and supporting analysis that do not reference full-order closed-loop Gramians. This leads to a computationally effective strategy yielding reduced models designed so that the corresponding reduced closed-loop systems will interpolate the full-order closed-loop system at specially adapted interpolation points, without requiring evaluation of the full-order closed-loop system nor even computation of the feedback law that determines it. The analytical framework and computational algorithm presented here provides an effective new approach toward constructing reduced-order models for unstable systems. Numerical examples for an unstable convection diffusion equation and a linearized incompressible Navier-Stokes equation illustrate the effectiveness of this approach.
قيم البحث
اقرأ أيضاً
In this paper, we present an interpolation framework for structure-preserving model order reduction of parametric bilinear dynamical systems. We introduce a general setting, covering a broad variety of different structures for parametric bilinear sys
tems, and then provide conditions on projection spaces for the interpolation of structured subsystem transfer functions such that the system structure and parameter dependencies are preserved in the reduced-order model. Two benchmark examples with different parameter dependencies are used to demonstrate the theoretical analysis.
The usual approach to model reduction for parametric partial differential equations (PDEs) is to construct a linear space $V_n$ which approximates well the solution manifold $mathcal{M}$ consisting of all solutions $u(y)$ with $y$ the vector of param
eters. This linear reduced model $V_n$ is then used for various tasks such as building an online forward solver for the PDE or estimating parameters from data observations. It is well understood in other problems of numerical computation that nonlinear methods such as adaptive approximation, $n$-term approximation, and certain tree-based methods may provide improved numerical efficiency. For model reduction, a nonlinear method would replace the linear space $V_n$ by a nonlinear space $Sigma_n$. This idea has already been suggested in recent papers on model reduction where the parameter domain is decomposed into a finite number of cells and a linear space of low dimension is assigned to each cell. Up to this point, little is known in terms of performance guarantees for such a nonlinear strategy. Moreover, most numerical experiments for nonlinear model reduction use a parameter dimension of only one or two. In this work, a step is made towards a more cohesive theory for nonlinear model reduction. Framing these methods in the general setting of library approximation allows us to give a first comparison of their performance with those of standard linear approximation for any general compact set. We then turn to the study these methods for solution manifolds of parametrized elliptic PDEs. We study a very specific example of library approximation where the parameter domain is split into a finite number $N$ of rectangular cells and where different reduced affine spaces of dimension $m$ are assigned to each cell. The performance of this nonlinear procedure is analyzed from the viewpoint of accuracy of approximation versus $m$ and $N$.
We propose a general --- i.e., independent of the underlying equation --- registration method for parameterized Model Order Reduction. Given the spatial domain $Omega subset mathbb{R}^d$ and a set of snapshots ${ u^k }_{k=1}^{n_{rm train}}$ over $Ome
ga$ associated with $n_{rm train}$ values of the model parameters $mu^1,ldots, mu^{n_{rm train}} in mathcal{P}$, the algorithm returns a parameter-dependent bijective mapping $boldsymbol{Phi}: Omega times mathcal{P} to mathbb{R}^d$: the mapping is designed to make the mapped manifold ${ u_{mu} circ boldsymbol{Phi}_{mu}: , mu in mathcal{P} }$ more suited for linear compression methods. We apply the registration procedure, in combination with a linear compression method, to devise low-dimensional representations of solution manifolds with slowly-decaying Kolmogorov $N$-widths; we also consider the application to problems in parameterized geometries. We present a theoretical result to show the mathematical rigor of the registration procedure. We further present numerical results for several two-dimensional problems, to empirically demonstrate the effectivity of our proposal.
In an iterative approach for solving linear systems with ill-conditioned, symmetric positive definite (SPD) kernel matrices, both fast matrix-vector products and fast preconditioning operations are required. Fast (linear-scaling) matrix-vector produc
ts are available by expressing the kernel matrix in an $mathcal{H}^2$ representation or an equivalent fast multipole method representation. Preconditioning such matrices, however, requires a structured matrix approximation that is more regular than the $mathcal{H}^2$ representation, such as the hierarchically semiseparable (HSS) matrix representation, which provides fast solve operations. Previously, an algorithm was presented to construct an HSS approximation to an SPD kernel matrix that is guaranteed to be SPD. However, this algorithm has quadratic cost and was only designed for recursive binary partitionings of the points defining the kernel matrix. This paper presents a general algorithm for constructing an SPD HSS approximation. Importantly, the algorithm uses the $mathcal{H}^2$ representation of the SPD matrix to reduce its computational complexity from quadratic to quasilinear. Numerical experiments illustrate how this SPD HSS approximation performs as a preconditioner for solving linear systems arising from a range of kernel functions.
We propose a projection-based monolithic model order reduction (MOR) procedure for a class of problems in nonlinear mechanics with internal variables. The work is is motivated by applications to thermo-hydro-mechanical (THM) systems for radioactive w
aste disposal. THM equations model the behaviour of temperature, pore water pressure and solid displacement in the neighborhood of geological repositories, which contain radioactive waste and are responsible for a significant thermal flux towards the Earths surface. We develop an adaptive sampling strategy based on the POD-Greedy method, and we develop an element-wise empirical quadrature hyper-reduction procedure to reduce assembling costs. We present numerical results for a two-dimensional THM system to illustrate and validate the proposed methodology.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
