Related papers: An FFT-based method for computing the effective cr…
In this paper, we present a multiscale method for simulations of the multicontinua unsaturated flow problems in heterogeneous fractured porous media. The mathematical model is described by the system of Richards equations for each continuum…
We propose a new discrete FFT-based method for computational homogenization of micromechanics on a regular grid that is simple, fast and robust. The discretization scheme is based on a tetrahedral stencil that displays three crucial…
We present an accurate, efficient and massively parallel finite-element code, DFT-FE, for large-scale ab-initio calculations (reaching $\sim 100,000$ electrons) using Kohn-Sham density functional theory (DFT). DFT-FE is based on a local…
In fluid flow simulation, the multi-continuum model is a useful strategy. When the heterogeneity and contrast of coefficients are high, the system becomes multiscale, and some kinds of reduced-order methods are demanded. Combining these…
The present work deals with the numerical resolution of coupled 3D-2D problems arising from the simulation of fluid flow in fractured porous media modeled via the Discrete Fracture and Matrix (DFM) model. According to the DFM model,…
We present an efficient computational approach to perform real-space electronic structure calculations using an adaptive higher-order finite-element discretization of Kohn-Sham density-functional theory (DFT). To this end, we develop an…
We introduce a family of hybrid discretisations for the numerical approximation of optimal control problems governed by the equations of immiscible displacement in porous media. The proposed schemes are based on mixed and discontinuous…
A min-cut that seperates vertices s and t in a network is an edge set of minimum weight whose removal will disconnect s and t. This problem is the dual of the well known s-t max-flow problem. Several algorithms for the min-cut problem are…
This paper introduces a novel theoretical framework and a suite of highly efficient, parallelizable algorithms for solving the large-scale multicommodity flow (MCF) feasibility problem. We reframe the classical constraint-satisfaction…
In this paper, we develop a multiscale finite element method for solving flows in fractured media. Our approach is based on Generalized Multiscale Finite Element Method (GMsFEM), where we represent the fracture effects on a coarse grid via…
Currently existing energy-stable parametric finite element methods for surface diffusion flow and other flows are usually limited to first-order accuracy in time. Designing a high-order algorithm for geometric flows that can also be…
We consider high dimensional variants of the maximum flow and minimum cut problems in the setting of simplicial complexes and provide both algorithmic and hardness results. By viewing flows and cuts topologically in terms of the simplicial…
We present a novel energy-based numerical analysis of semilinear diffusion-reaction boundary value problems. Based on a suitable variational setting, the proposed computational scheme can be seen as an energy minimisation approach. More…
In this paper we develop adaptive numerical schemes for certain nonlinear variational problems. The discretization of the variational problems is done by representing the solution as a suitable frame decomposition, i.e., a complete, stable,…
Minimum flow decomposition (MFD) is the NP-hard problem of finding a smallest decomposition of a network flow/circulation $X$ on a directed graph $G$ into weighted source-to-sink paths whose superposition equals $X$. We show that, for…
Fractures are normally present in the underground and are, for some physical processes, of paramount importance. Their accurate description is fundamental to obtain reliable numerical outcomes useful, e.g., for energy management. Depending…
In this work, we consider the distributed optimization problem in which each node has its own convex cost function and can communicate directly only with its neighbors, as determined by a directed communication topology (directed graph or…
The solution to an optimal power flow (OPF) problem provides a minimum cost operating point for an electric power system. The performance of OPF solution techniques strongly depends on the problem's feasible space. This paper presents an…
Developing high-performance and energy-efficient algorithms for maximum matchings is becoming increasingly important in social network analysis, computational sciences, scheduling, and others. In this work, we propose the first maximum…
We consider the approximation of minimal geodesics between two closed sets in $\mathbb{R}^D$ endowed with a smooth Riemannian metric. The continuous problem is formulated as the minimization of the energy functional over piecewise smooth…