Related papers: Restarting the Numerical Flow Iteration through lo…
We introduce novel dynamical low-rank methods for solving large-scale matrix differential equations, motivated by algorithms from randomized numerical linear algebra. In terms of performance (cost and accuracy), our methods overperform…
We present a specialized network simplex algorithm for the budget-constrained minimum cost flow problem, which is an extension of the traditional minimum cost flow problem by a second kind of costs associated with each edge, whose total…
A fully implicit high-order preconditioned flux reconstruction/correction procedure via reconstruction (FR/CPR) method is developed to solve the compressible Navier-Stokes equations at low Mach numbers. A dual-time stepping approach with…
Simulating turbulence is critical for many societally important applications in aerospace engineering, environmental science, the energy industry, and biomedicine. Large eddy simulation (LES) has been widely used as an alternative to direct…
This paper extends a low-rank tensor decomposition (LRTD) reduced order model (ROM) methodology to simulate viscous flows and in particular to predict a smooth branch of solutions for the incompressible Navier-Stokes equations.…
The present work focuses on the numerical approximation of the weak solutions of the shallow water model over a non-flat topography. In particular, we pay close attention to steady solutions with nonzero velocity. The goal of this work is…
Likelihood-based deep generative models have been widely investigated for Image Anomaly Detection (IAD), particularly Normalizing Flows, yet their strict architectural invertibility needs often constrain scalability, particularly in…
The watershed algorithm belongs to classical algorithms in mathematical morphology. Lotufo et al. published a principle of the watershed computation by means of an Image Foresting Transform (IFT), which computes a shortest path forest from…
Decomposing a flow on a Directed Acyclic Graph (DAG) into a weighted sum of a small number of paths is an essential task in operations research and bioinformatics. This problem, referred to as Sparse Flow Decomposition (SFD), has gained…
Flow-based generative models have emerged as powerful priors for solving inverse problems. One option is to directly optimize the initial latent code (noise), such that the flow output solves the inverse problem. However, this requires…
In this paper, we propose a numerical method for solving weakly compressible fluid flow based on a dynamical low-rank projector splitting. The low-rank splitting scheme is applied to the Boltzmann equation with BGK collision term, which…
In this paper, we address the minimum-cost node-capacitated multiflow problem in an undirected network. For this problem, Babenko and Karzanov (2012) showed strongly polynomial-time solvability via the ellipsoid method. Our result is the…
We propose a data-driven algorithm for reconstructing the irregular, chaotic flow dynamics around two side-by-side square cylinders from sparse, time-resolved, velocity measurements in the wake. We use Proper Orthogonal Decomposition (POD)…
In this text I present a couple of new principles and thereon based iterative methods for numerical solution of sequences of systems of linear equations with fixed system matrix and changing right-hand-sides. The use of the new methods is…
The fast growing scale and heterogeneity of current communication networks necessitate the design of distributed cross-layer optimization algorithms. So far, the standard approach of distributed cross-layer design is based on dual…
Low-rank matrix approximation is extremely useful in the analysis of data that arises in scientific computing, engineering applications, and data science. However, as data sizes grow, traditional low-rank matrix approximation methods, such…
We consider the problem of reconstructing one-dimensional point sources from their Fourier measurements in a bounded interval $[-\Omega, \Omega]$. This problem is known to be challenging in the regime where the spacing of the sources is…
We propose a non-intrusive reduced-order modeling framework for parametrized visco-plastic free-surface flows governed by a shallow-water formulation of Herschel--Bulkley fluids. These flows exhibit strong nonlinearities, non-smooth…
We present a new, simple and computationally efficient iterative method for low rank matrix completion. Our method is inspired by the class of factorization-type iterative algorithms, but substantially differs from them in the way the…
This work develops a robust diffusion recursive least squares algorithm to mitigate the performance degradation often experienced in networks of agents in the presence of impulsive noise. This algorithm minimizes an exponentially weighted…