相关论文: Approximation Bounds for Model Reduction on Polyno…

Classical model reduction techniques project the governing equations onto linear subspaces of the high-dimensional state-space. For problems with slowly decaying Kolmogorov-n-widths such as certain transport-dominated problems, however,…

We first investigate on the asymptotics of the Kolmogorov metric entropy and nonlinear n-widths of approximation spaces on some function classes on manifolds and quasi-metric measure spaces. Secondly, we develop constructive algorithms to…

Although projection-based reduced-order models (ROMs) for parameterized nonlinear dynamical systems have demonstrated exciting results across a range of applications, their broad adoption has been limited by their intrusivity: implementing…

This paper aims at characterizing the approximability of bounded sets in the range of nonlinear operators in Banach spaces by finite-dimensional linear varieties. In particular, the class of operators we consider includes the endpoint maps…

Designing effective reduced-order models (ROMs) for parametrized transport-dominated problems remains challenging because of the well-known Kolmogorov barrier. Autoencoder-based nonlinear ROMs have been developed to improve the compression…

Model reduction attempts to guarantee a desired "model quality", e.g. given in terms of accuracy requirements, with as small a model size as possible. This article highlights some recent developments concerning this issue for the so called…

Recently, Meta-Auto-Decoder (MAD) was proposed as a novel reduced order model (ROM) for solving parametric partial differential equations (PDEs), and the best possible performance of this method can be quantified by the decoder width. This…

This paper presents a model order reduction (MOR) approach for high dimensional problems in the analysis of financial risk. To understand the financial risks and possible outcomes, we have to perform several thousand simulations of the…

Covering numbers are a powerful tool used in the development of approximation algorithms, randomized dimension reduction methods, smoothed complexity analysis, and others. In this paper we prove upper bounds on the covering number of…

Consider the optimization problem $p_{\min, Q} := \min_{\mathbf{x} \in Q} p(\mathbf{x})$, where $p$ is a degree $m$ multivariate polynomial and $Q := [0, 1]^n$ is the hypercube. We provide explicit degree and error bounds for the sums of…

Traditional linear approximation methods, such as proper orthogonal decomposition and the reduced basis method, are ill-suited for transport-dominated problems due to the slow decay of the Kolmogorov $n$-width, leading to inefficient and…

This paper investigates structure-preserving $H_2$-optimal model order reduction (MOR) for linear systems with quadratic outputs. Within a Petrov-Galerkin projection framework, the $H_2$-optimal MOR problem is first formulated as an…

We develop a novel deep learning technique, termed Deep Orthogonal Decomposition (DOD), for dimensionality reduction and reduced order modeling of parameter dependent partial differential equations. The approach consists in the construction…

A mesh-free numerical method for solving linear elliptic PDE's using the local kernel theory that was developed for manifold learning is proposed. In particular, this novel approach exploits the local kernel theory which allows one to…

Model order reduction has been extensively studied over the last two decades. Projection-based methods such as the Proper Orthogonal Decomposition and the Reduced Basis Method enjoy the important advantages of Galerkin methods in the…

Convex hulls of monomials have been widely studied in the literature, and monomial convexifications are implemented in global optimization software for relaxing polynomials. However, there has been no study of the error in the global…

We consider the problem of minimizing a polynomial function over the integer lattice. Though impossible in general, we use a known sufficient condition for the existence of continuous minimizers to guarantee the existence of integer…

This work develops algorithms for non-parametric confidence regions for samples from a univariate distribution whose support is a discrete mesh bounded on the left. We generalize the theory of Learned-Miller to preorders over the sample…

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…

Deep learning algorithms have been successfully applied to numerically solve linear Kolmogorov partial differential equations~(PDEs). A recent research shows that if the initial functions are bounded, the empirical risk minimization (ERM)…