Abstract. In this paper we introduce local approximation spaces for component-based static condensation (sc) procedures that are optimal in the sense of Kolmogorov. To facilitate simulations for large structures such as aircraft or ships, it is crucial to decrease the number of degrees of freedom on the interfaces, or "ports," in order to reduce the size of the statically condensed system. To derive optimal port spaces we consider a (compact) transfer operator that acts on the space of harmonic extensions on a two-component system and maps the traces on the ports that lie on the boundary of these components to the trace of the shared port. Solving the eigenproblem for the composition of the transfer operator and its adjoint yields the optimal space. For a related work in the context of the generalized finite element method, we refer the reader to [I. Babuška and R. Lipton, Multiscale Model. Simul., 9 (2011), pp. 373-406]. We further introduce a spectral greedy algorithm to generalize the procedure to the parameter-dependent setting and to construct a quasi-optimal parameter-independent port space. Moreover, it is shown that, given a certain tolerance and an upper bound for the ports in the system, the spectral greedy constructs a port space that yields an sc approximation error on a system of arbitrary configuration which is smaller than this tolerance for all parameters in a rich train set. We present our approach for isotropic linear elasticity, although the idea may be readily applied to any linear coercive problem. Numerical experiments demonstrate the very rapid and exponential convergence both of the eigenvalues and of the sc approximation based on spectral modes for nonseparable and irregular geometries such as an I-beam with an internal crack. 1. Introduction. In the last decades numerical simulations based on partial differential equations (PDEs) have significantly gained importance in engineering applications. However, both the geometric complexity of the considered structures, such as ships, aircraft, and turbines, and the intricacy of the simulated physical phenomena often make a straightforward application of, say, the finite element (FE) method prohibitive. This is particularly true if multiple simulation requests or a real-time simulation response is desired, as in engineering design and optimization.One way to tackle such complex problems is to exploit the natural decomposition of the structures into components and apply static condensation (sc) to obtain a (Schur complement) system of the size of the degrees of freedom (DOFs) on all interfaces or ports in the system. To mitigate the computational costs for the required PDE solvers in the interior of the component, model order reduction procedures may be applied. One popular approach is component mode synthesis (CMS), introduced in [4,21], which uses an approximation based on the eigenmodes of local constrained eigenvalue problems. The static condensation reduced basis element (scRBE) method [22,23]

We propose a randomized a posteriori error estimator for reduced order approximations of parametrized (partial) differential equations. The error estimator has several important properties: the effectivity is close to unity with prescribed lower and upper bounds at specified high probability; the estimator does not require the calculation of stability (coercivity, or inf-sup) constants; the online cost to evaluate the a posteriori error estimator is commensurate with the cost to find the reduced order approximation; the probabilistic bounds extend to many queries with only modest increase in cost. To build this estimator, we first estimate the norm of the error with a Monte-Carlo estimator using Gaussian random vectors whose covariance is chosen according to the desired error measure, e.g. user-defined norms or quantity of interest. Then, we introduce a dual problem with random right-hand side the solution of which allows us to rewrite the error estimator in terms of the residual of the original equation. In order to have a fast-to-evaluate estimator, model order reduction methods can be used to approximate the random dual solutions. Here, we propose a greedy algorithm that is guided by a scalar quantity of interest depending on the error estimator. Numerical experiments on a multi-parametric Helmholtz problem demonstrate that this strategy yields rather low-dimensional reduced dual spaces.Key words. A posteriori error estimation, parametrized equations, projection-based model order reduction, Monte-Carlo estimator, concentration phenomenon, goal-oriented error estimation.

In this paper we propose local approximation spaces for localized model order reduction procedures such as domain decomposition and multiscale methods. Those spaces are constructed from local solutions of the partial differential equation (PDE) with random boundary conditions, yield an approximation that converges provably at a nearly optimal rate, and can be generated at close to optimal computational complexity. In many localized model order reduction approaches like the generalized finite element method, static condensation procedures, and the multiscale finite element method local approximation spaces can be constructed by approximating the range of a suitably defined transfer operator that acts on the space of local solutions of the PDE. Optimal local approximation spaces that yield in general an exponentially convergent approximation are given by the left singular vectors of this transfer operator [I. Babuška and R. Lipton 2011, K. Smetana and A. T. Patera 2016]. However, the direct calculation of these singular vectors is computationally very expensive. In this paper, we propose an adaptive randomized algorithm based on methods from randomized linear algebra [N. Halko et al. 2011], which constructs a local reduced space approximating the range of the transfer operator and thus the optimal local approximation spaces. Moreover, the adaptive algorithm relies on a probabilistic a posteriori error estimator for which we prove that it is both efficient and reliable with high probability. Several numerical experiments confirm the theoretical findings.Key words. localized model order reduction, randomized linear algebra, domain decomposition methods, multiscale methods, a priori error bound, a posteriori error estimation AMS subject classifications. 65N15, 65N12, 65N55, 65N30, 65C20, 65N25

We consider ultraweak variational formulations for (parametrized) linear first order transport equations in time and/or space. Computationally feasible pairs of optimally stable trial and test spaces are presented, starting with a suitable test space and defining an optimal trial space by the application of the adjoint operator. As a result, the inf-sup constant is one in the continuous as well as in the discrete case and the computational realization is therefore easy. In particular, regarding the latter, we avoid a stabilization loop within the greedy algorithm when constructing reduced models within the framework of reduced basis methods. Several numerical experiments demonstrate the good performance of the new method.

No abstract