Related papers: Reduced Collocation Methods: Reduced Basis Methods…
A least squares semi-supervised local clustering algorithm based on the idea of compressed sensing is proposed to extract clusters from a graph with known adjacency matrix. The algorithm is based on a two-stage approach similar to the one…
In this paper, for the generalized Darcy problem (an elliptic equation with discontinuous coefficients), we study a special partial Least-Squares (Galerkin-least-squares) method, known as the augmented mixed finite element method, and its…
We introduce a method that uses low-rank approximations of cross-correlation matrices in mixed continuous and categorical Gaussian Process models. This new method -- called Low-Rank Correlation (LRC) -- offers the ability to flexibly adapt…
Complementarity problems and variational inequalities arise in a wide variety of areas, including machine learning, planning, game theory, and physical simulation. In all of these areas, to handle large-scale problem instances, we need fast…
In this paper, we propose a low rank approximation method for efficiently solving stochastic partial differential equations. Specifically, our method utilizes a novel low rank approximation of the stiffness matrices, which can significantly…
A new algorithm for 3D localization in multiplatform radar networks, comprising one transmitter and multiple receivers, is proposed. To take advantage of the monostatic sensor radiation pattern features, ad-hoc constraints are imposed in…
Two comprehensive approaches are considered for constructing projection-based reduced-order computational models for linear dynamical systems. The first one reduces the governing equations written in the descriptor form, using a Galerkin or…
Many science and engineering applications involve solving a linear least-squares system formed from some field measurements. In the distributed cyber-physical systems (CPS), often each sensor node used for measurement only knows partial…
We propose and analyse a reduced-rank method for solving least-squares regression problems with infinite dimensional output. We derive learning bounds for our method, and study under which setting statistical performance is improved in…
This paper presents a reduced order approach for transient modeling of multiple moving objects in nonlinear crossflows. The Proper Orthogonal Decomposition method and the Galerkin projection are used to construct a reduced version of the…
Least-Squares Reverse-Time Migration (LSRTM) is a method that seismologists utilize to compute a high-resolution subsurface image. Nevertheless, LSRTM is a computationally demanding problem. One way to reduce the computational costs of the…
We propose a state redistribution method for high order discontinuous Galerkin methods on curvilinear embedded boundary grids. State redistribution relaxes the overly restrictive CFL condition that results from arbitrarily small cut cells…
This contribution presents a model order reduction strategy for fast parametric modelling of problems with cracks formulated on spline discretizations. In the context of damage detection, parametric reduced order models (ROMs) are well…
We introduce a new framework of numerical multiscale methods for advection-dominated problems motivated by climate sciences. Current numerical multiscale methods (MsFEM) work well on stationary elliptic problems but have difficulties when…
The proper orthogonal decomposition reduced-order models (POD-ROMs) have been widely used as a computationally efficient surrogate models in large-scale numerical simulations of complex systems. However, when it is applied to a Hamiltonian…
This paper introduces a mathematical framework for explicit structural dynamics, employing approximate dual functionals and rowsum mass lumping. We demonstrate that the approach may be interpreted as a Petrov-Galerkin method that utilizes…
In this paper, we propose a model reduction method for solving multiscale elliptic PDEs with random coefficients in the multiquery setting using an optimization approach. The optimization approach enables us to construct a set of localized…
Suitable reduced order models (ROMs) are computationally efficient tools in characterizing key dynamical and statistical features of nature. In this paper, a systematic multiscale stochastic ROM framework is developed for complex systems…
This work proposes a scheme for significantly reducing the computational complexity of discretized problems involving the non-smooth forward propagation of uncertainty by combining the adaptive hierarchical sparse grid stochastic…
The subject of this work is a new stochastic Galerkin method for second-order elliptic partial differential equations with random diffusion coefficients. It combines operator compression in the stochastic variables with tree-based spline…