Search arXivSearch

arXiv · 1901.02792

Statistical closure modeling for reduced-order models of stationary systems by the ROMES method

Abstract

This work proposes a technique for constructing a statistical closure model for reduced-order models (ROMs) applied to stationary systems modeled as parameterized systems of algebraic equations. The proposed technique extends the reduced-order-model error surrogates (ROMES) method to closure modeling. The original ROMES method applied Gaussian-process regression to construct a statistical model that maps cheaply computable error indicators (e.g., residual norm, dual-weighted residuals) to a random variable for either (1) the norm of the state error or (2) the error in a scalar-valued quantity of interest. Rather than target these two types of errors, this work proposes to construct a statistical model for the state error itself; it achieves this by constructing statistical models for the generalized coordinates characterizing both the in-plane error (i.e., the error in the trial subspace) and a low-dimensional approximation of the out-of-plane error. The former can be considered a statistical closure model, as it quantifies the error in the ROM generalized coordinates. Because any quantity of interest can be computed as a functional of the state, the proposed approach enables any quantity-of-interest error to be statistically quantified a posteriori, as the state-error model can be propagated through the associated quantity-of-interest functional. Numerical experiments performed on both linear and nonlinear stationary systems illustrate the ability of the technique (1) to improve (expected) ROM prediction accuracy by an order of magnitude, (2) to statistically quantify the error in arbitrary quantities of interest, and (3) to realize a more cost-effective methodology for reducing the error than a ROM-only approach in the case of nonlinear systems.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Stefano Pagani, Andrea Manzoni, Kevin Carlberg. 2019-01-09. Statistical closure modeling for reduced-order models of stationary systems by the ROMES method. https://arxiv.org/abs/1901.02792

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

The Stability of Block Eliminations and Additive Modifications

The block elimination with additive modifications (BEAM) method was recently proposed as a alternative to LU with partial pivoting requiring less communication. Because of the novelty of BEAM, the existing theoretical analysis is lacking. To that end, we analyze both the numerical stability of the underlying block LU factorization and the effects of additive modifications. For the block LU factorization, we are able to improve the previous results of Demmel et al. from being cubic in the element growth to merely quadratic. Furthermore, we propose an alternative measure of element growth that is better aligned with block LU; this new measure of growth allows our analysis to apply to matrices that cannot be factored with pointwise LU. In the second part, we analyzed the modifications produced by BEAM and the effect they have on the condition number and growth factor. Finally, we show that BEAM will not apply any modifications in some cases that regular block LU can safely factor.

math.NA

Efficient Rigorous Continuation via Chebyshev Series Expansion I

We study the global continuation of solution manifolds arising in dynamical systems. We present a rigorous continuation method based on a Chebyshev series expansion of the solution manifold. The branch is first approximated by a high-order Chebyshev interpolation polynomial, and an explicit error bound is then obtained by verifying the contraction of a quasi-Newton operator near this approximation. The contraction is formulated on a weighted $\ell^1$ space, giving a finer control than the typical $C^0$-error bound obtained from the uniform contraction theorem. In fact, the latter follows directly from our contraction operator. Furthermore, we discuss how our strategy applies naturally to pseudo-arclength continuation, where the continuation parameter fails to provide a valid local coordinate, and extends to multi-parameter continuation. Lastly, we detail two applications in which we compute a two-parameter family of steady-states for the Cahn--Hilliard equation, and a one-parameter family of steady-states undergoing saddle-node bifurcations for the Shigesada--Kawasaki--Teramoto system.

math.NA

Efficient iterative techniques for solving tensor problems with the T-product

This paper develops two efficient iterative methods for solving tensor equations under the T-product framework. For T-symmetric positive definite tensor equations of the form $\mathcal{C} \star \mathcal{X} = \mathcal{D}$, we propose a conjugate-gradient-type algorithm that generates orthogonal residual and $\mathcal{C}$-orthogonal direction sequences, ensuring convergence within a finite number of steps. For general consistent tensor equations, we extend the method using a normal-equation transformation, and further adapt it to handle inconsistent systems by solving a least-squares minimization problem. Key advantages include direct tensor-based computations without explicit matrix expansion, rigorous finite-step convergence proofs, and the ability to obtain minimal Frobenius norm solutions. Numerical experiments on synthetic data, benchmark images, and video sequences demonstrate that the proposed algorithms achieve high precision with low computational time, confirming their practicality for large-scale multidimensional problems.

math.NA