Related papers: An FFT-based method for computing the effective cr…

For simulating incompressible flows by projection methods. it is generally accepted that the pressure-correction stage is the most time-consuming part of the flow solver. The objective of the present work is to develop a fast hybrid…

In this article, we address the solution of advection-dominated flow problems by stabilised methods, by means of least-squares computed stabilised coefficients. As main methodological tool, we introduce a data-driven off-line/on-line…

In this work, we present an upscaled model for mixed dimensional coupled flow problem in fractured porous media. We consider both embedded and discrete fracture models (EFM and DFM) as fine scale models which contain coupled system of…

This paper introduces a novel distributed optimization framework for large-scale AC Optimal Power Flow (OPF) problems, offering both theoretical convergence guarantees and rapid convergence in practice. By integrating smoothing techniques…

Statistical properties of a local fluctuational fluxes measured at the plasma edge are investigated in the work. It's shown that the amplitudes increments of the local fluctuational fluxes decrease by power law. For approximation of…

We discuss an effective field theory (EFT) approach to the computation of fluctuation-induced interactions between particles bound to a thermally fluctuating fluid surface controlled by surface tension. By describing particles as points,…

With the proliferation of distributed generation into distribution networks, the need to consider fault currents in the dispatch problem becomes increasingly relevant. This paper introduces a method for adding fault current constraints into…

Density functional theory (DFT) is an efficient instrument for describing a wide range of nanoscale phenomena: wetting transition, capillary condensation, adsorption, etc. In this paper, we suggest a method for obtaining the equilibrium…

In this paper, we present decomposition techniques for solving large-scale instances of the security-constrained optimal power flow (SCOPF) problem with primary response. Specifically, under each contingency state, we require that the nodal…

We propose a novel end-to-end trainable framework for the graph decomposition problem. The minimum cost multicut problem is first converted to an unconstrained binary cubic formulation where cycle consistency constraints are incorporated…

Block Floating Point (BFP) arithmetic is currently seeing a resurgence in interest because it requires less power, less chip area, and is less complicated to implement in hardware than standard floating point arithmetic. This paper explores…

Using Domain Decomposition (DD) algorithm on non--overlapping domains, we compare couplings of different discretisation models, such as Finite Element (FEM) and Reduced Order (ROM) models for separate subcomponents. In particular, we…

We present a paradigm for developing arbitrarily high order, linear, unconditionally energy stable numerical algorithms for gradient flow models. We apply the energy quadratization (EQ) technique to reformulate the general gradient flow…

This paper introduces an Algebraic MultiScale method for simulation of flow in heterogeneous porous media with embedded discrete Fractures (F-AMS). First, multiscale coarse grids are independently constructed for both porous matrix and…

This paper proposes an anti-interference affine frequency division multiplexing (AFDM) system to ensure reliability and resource efficiency under malicious high-power interference originating from adversarial devices in high-mobility…

With more energy networks being interconnected to form integrated energy systems (IESs), the optimal energy flow (OEF) problem has drawn increasing attention. Extant studies on OEF models mostly utilize the finite difference method (FDM) to…

We propose numerical schemes for the approximate solution of problems defined on the edges of a one-dimensional graph. In particular, we consider linear transport and a drift-diffusion equations, and discretize them by extending Finite…

We study the problem of computing a minimum cut in a simple, undirected graph and give a deterministic $O(m \log^2 n \log\log^2 n)$ time algorithm. This improves both on the best previously known deterministic running time of $O(m \log^{12}…

Compute-and-forward (CF) is a relaying strategy which allows the relay to decode a linear combination of the transmitted messages. This work studies the optimal power allocation problem for the CF scheme in fast fading channels for…

This paper proposes a new computational method for solving structured least squares problems that arise in the process of identification of coherent structures in fluid flows. It is deployed in combination with dynamic mode decomposition…