Iterative methods for Stokes/Darcy coupling

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.

We consider the problem of finding a saddle point for the convex-concave objective

\min_x \max_y f(x) + \langle Ax, y\rangle - g^*(y)

, where

f

is a convex function with locally Lipschitz gradient and

g

is convex and possibly non-smooth. We propose an ...

We are interested in a reduced order method for the efficient simulation of blood flow in arteries. The blood dynamics is modeled by means of the incompressible Navier–Stokes equations. Our algorithm is based on an approximated domain-decomposition of the ...

This article studies a class of nonsmooth decentralized multiagent optimization problems where the agents aim at minimizing a sum of local strongly-convex smooth components plus a common nonsmooth term. We propose a general primal-dual algorithmic framewor ...

Motivated by the recent successes of neural networks that have the ability to fit the data perfectly \emph{and} generalize well, we study the noiseless model in the fundamental least-squares setup. We assume that an optimum predictor fits perfectly inputs ...

Decentralized training of deep learning models is a key element for enabling data privacy and on-device learning over networks. In realistic learning scenarios, the presence of heterogeneity across different clients' local datasets poses an optimization ch ...

Two-level domain decomposition methods are very powerful techniques for the efficient numerical solution of partial differential equations (PDEs). A two-level domain decomposition method requires two main components: a one-level preconditioner (or its corr ...

The Dirichlet-Neumann (DN) method has been extensively studied for linear partial differential equations, while little attention has been devoted to the nonlinear case. In this paper, we analyze the DN method both as a nonlinear iterative method and as a p ...

Eigendecomposition of symmetric matrices is at the heart of many computer vision algorithms. However, the derivatives of the eigenvectors tend to be numerically unstable, whether using the SVD to compute them analytically or using the Power Iteration (PI) ...

Inverse reconstruction from images is a central problem in many scientific and engineering disciplines. Recent progress on differentiable rendering has led to methods that can efficiently differentiate the full process of image formation with respect to mi ...

The flexible boundary condition method (FBCM) is a well-established method for the efficient study of complex non-linear atomistic defects while avoiding finite-size effects. The method uses lattice Green's functions (LGFs) to effectively embed an atomisti ...

The research community has been making significant progress in hardware implementation, numerical computing and algorithm development for optimization-based control. However, there are two key challenges that still have to be overcome for optimization-base ...

Iterative methods for Stokes/Darcy coupling

Chat with Graph Search

A first-order primal-dual method with adaptivity to local smoothness

Model order reduction of flow based on a modular geometrical approximation of blood vessels

Decentralized Proximal Gradient Algorithms With Linear Convergence Rates

Last iterate convergence of SGD for Least-Squares in the Interpolation regime

Quasi-Global Momentum: Accelerating Decentralized Deep Learning on Heterogeneous Data

Substructured Two-grid and Multi-grid Domain Decomposition Methods

On the nonlinear Dirichlet-Neumann method and preconditioner for Newton's method

Robust Differentiable SVD

Large Steps in Inverse Rendering of Geometry

Analysis of the flexible boundary condition method

Optimization Methods for Control: From Embedded Programmable Hardware to Data-Driven Process Optimization