Related papers: Greedy recursion parameter selection for one-way s…
Finding efficient tensor contraction paths is essential for a wide range of problems, including model counting, quantum circuits, graph problems, and language models. There exist several approaches to find efficient paths, such as the…
Markov decision processes (MDPs) are known to be sensitive to parameter specification. Distributionally robust MDPs alleviate this issue by allowing for \emph{ambiguity sets} which give a set of possible distributions over parameter sets.…
Penalty methods relax the incompressibility condition and uncouple velocity and pressure. Experience with them indicates that the velocity error is sensitive to the choice of penalty parameter $\epsilon$. So far, there is no effective \'a…
In this work we propose a novel Hybrid High-Order method for the incompressible Navier--Stokes equations based on a formulation of the convective term including Temam's device for stability. The proposed method has several advantageous…
A greedy algorithm is proposed for sparse-sensor selection in reduced-order sensing that contains correlated noise in measurement. The sensor selection is carried out by maximizing the determinant of the Fisher information matrix in a…
In this paper, we propose and analyze first-order time-stepping pressure-correction projection scheme for the Navier-Stokes-Planck-Nernst-Poisson equations. By introducing a governing equation for the auxiliary variable through the ionic…
In a recent paper [WW23] we studied the transport of oscillations in solutions to linear and some semilinear second-order hyperbolic boundary problems along rays that graze a convex obstacle to any order. We showed that high frequency exact…
We address the solution of the distributed control problem for the steady, incompressible Navier--Stokes equations. We propose an inexact Newton linearization of the optimality conditions. Upon discretization by a finite element scheme, we…
The high-order gas-kinetic scheme (HGKS) features good robustness, high efficiency and satisfactory accuracy,the performaence of which can be further improved combined with WENO-AO (WENO with adaptive order) scheme for reconstruction. To…
Greedy algorithms for minimizing L0-norm of sparse decomposition have profound application impact on many signal processing problems. In the sparse coding setup, given the observations $\mathrm{y}$ and the redundant dictionary…
In this paper, a new algorithm based on differential geometry viewpoint to solve the 3D rotating Navier-Stokes equations with complex Boundary is proposed, which is called Bi-parallel algorithm. For xample, it can be applied to passage flow…
In this paper, we propose the greedy and random Broyden's method for solving nonlinear equations. Specifically, the greedy method greedily selects the direction to maximize a certain measure of progress for approximating the current…
We consider a node-monitor pair, where the node's state varies with time. The monitor needs to track the node's state at all times; however, there is a fixed cost for each state query. So the monitor may instead predict the state using…
Unions of subspaces provide a powerful generalization to linear subspace models for collections of high-dimensional data. To learn a union of subspaces from a collection of data, sets of signals in the collection that belong to the same…
In this article we propose a scalable shape optimization algorithm which is tailored for large scale problems and geometries represented by hierarchically refined meshes. Weak scalability and grid independent convergence is achieved via a…
First-order operator splitting methods are ubiquitous among many fields through science and engineering, such as inverse problems, signal/image processing, statistics, data science and machine learning, to name a few. In this paper, we…
Optimal experimental design (OED) concerns itself with identifying ideal methods of data collection, e.g.~via sensor placement. The \emph{greedy algorithm}, that is, placing one sensor at a time, in an iteratively optimal manner, stands as…
Greedy algorithms for feature selection are widely used for recovering sparse high-dimensional vectors in linear models. In classical procedures, the main emphasis was put on the sample complexity, with little or no consideration of the…
Topology optimization of natural convection problems is computationally expensive, due to the large number of degrees of freedom (DOFs) in the model and its two-way coupled nature. Herein, a method is presented to reduce the computational…
In this work, we develop a high-order pressure-robust method for the rotation form of the stationary incompressible Navier-Stokes equations. The original idea is to change the velocity test functions in the discretization of trilinear and…