Related papers: Windowed least-squares model reduction for dynamic…
We introduce a novel optimization algorithm for image recovery under learned sparse and low-rank constraints, which we parameterize as weighted extensions of the $\ell_p^p$-vector and $\mathcal S_p^p$ Schatten-matrix quasi-norms for…
Common trends in model order reduction of large nonlinear finite-element-discretized systems involve the introduction of a linear mapping into a reduced set of unknowns, followed by Galerkin projection of the governing equations onto a…
In this paper we are concerned with fast algorithms for the systems arising from the plane wave discretizations for two-dimensional Helmholtz equations with large wave numbers. We consider the plane wave weighted least squares (PWLS) method…
3D Gaussian Splatting SLAM has emerged as a widely used technique for high-fidelity mapping in spatial intelligence. However, existing methods often rely on a single representation scheme, which limits their performance in large-scale…
Image smoothing is by reducing pixel-wise gradients to smooth out details. As existing methods always rely on gradients to determine smoothing manners, it is difficult to distinguish structures and details to handle distinctively due to the…
We consider the discretization and subsequent model reduction of a system of partial differential-algebraic equations describing the propagation of pressure waves in a pipeline network. Important properties like conservation of mass,…
An analysis of high-dimensional data can offer a detailed description of a system but is often challenged by the curse of dimensionality. General dimensionality reduction techniques can alleviate such difficulty by extracting a few…
This paper is devoted to a weak Galerkin (WG) finite element method for linear poroelasticity problems where weakly defined divergence and gradient operators over discontinuous functions are introduced. We establish both the continuous and…
Dynamic substructuring (DS) methods encompass a range of techniques to decompose large structural systems into multiple coupled subsystems. This decomposition has the principle benefit of reducing computational time for dynamic simulation…
In this study, we consider the numerical solution of large systems of linear equations obtained from the stochastic Galerkin formulation of stochastic partial differential equations. We propose an iterative algorithm that exploits the…
We develop a novel randomized conjugate gradient least squares (RCGLS) method for solving least-squares problems, in which iterative sketching is employed at each step to reduce the dimension and hence the computational cost. In particular,…
We propose a neural-enhanced weak Galerkin (WG) finite element method for second-order elliptic problems with low-regularity solutions. The method augments the classical WG approximation space with neural network functions constructed via a…
The partial least squares (PLS) is a popular modeling technique commonly used in social sciences. The traditional PLS algorithm deals with variables measured on interval scales while data are often collected on ordinal scales: a…
Dynamical low-rank (DLR) approximation has gained interest in recent years as a viable solution to the curse of dimensionality in the numerical solution of kinetic equations including the Boltzmann and Vlasov equations. These methods…
We propose a Randomised Subspace Gauss-Newton (R-SGN) algorithm for solving nonlinear least-squares optimization problems, that uses a sketched Jacobian of the residual in the variable domain and solves a reduced linear least-squares on…
Nearly all model-reduction techniques project the governing equations onto a linear subspace of the original state space. Such subspaces are typically computed using methods such as balanced truncation, rational interpolation, the…
We study the problem of learning to stabilize (LTS) a linear time-invariant (LTI) system. Policy gradient (PG) methods for control assume access to an initial stabilizing policy. However, designing such a policy for an unknown system is one…
This paper introduces a methodology for improving the accuracy and efficiency of reduced order models (ROMs) constructed using the least-squares Petrov-Galerkin (LSPG) projection method through the introduction of preconditioning. Unlike…
In this paper, we develop regularized discrete least squares collocation and finite volume methods for solving two-dimensional nonlinear time-dependent partial differential equations on irregular domains. The solution is approximated using…
This paper presents novel adaptive reduced-rank filtering algorithms based on joint iterative optimization of adaptive filters. The novel scheme consists of a joint iterative optimization of a bank of full-rank adaptive filters that…