A two-level time step technique for the partitioned solution of one-dimensional arterial networks
Graph Chatbot
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 propose an algorithm for solving the maximum weighted stable set problem on claw-free graphs that runs in O(n^3)-time, drastically improving the previous best known complexity bound. This algorithm is based on a novel decomposition theorem for claw-free ...
In this paper we propose a reduced basis hybrid method (RBHM) for the approximation of partial differential equations in domains represented by complex networks where topological features are recurrent. The RBHM is applied to Stokes equations in domains wh ...
This paper investigates the decomposition of three clayey structures (kaolinite, illite and montmorillonite) when thermally treated at 600 degrees C and 800 degrees C and the effect of this treatment on their pozzolanic activity in cementitious materials. ...
The purpose of this thesis is to investigate methods for the solution of multiscale problems both from the mathematical and numerical point of view, with a particular concern on applications to flows through heterogeneous porous media. After an overview of ...
Rationalization and construction-aware design dominate the issue of realizability of freeform architecture. The former means the decomposition of an intended shape into parts which are sufficiently simple and efficient to manufacture; the latter refers to ...
We consider unconstrained minimax problem where the objective function is the maximum of a finite number of smooth convex functions. We present an iterative method to compute the optimal solution for the unconstrained convex finite minimax problem. The alg ...
The QR decomposition is an important, but often underestimated prerequisite for pseudo- or non-linear detection methods such as successive interference cancellation or sphere decoding for multiple-input multiple-output (MIMO) systems. The ability of concur ...
Ieee Service Center, 445 Hoes Lane, Po Box 1331, Piscataway, Nj 08855-1331 Usa2007
We propose a domain decomposition method for advection-diffusion- reaction equations based on Nitsche's transmission conditions. The advection-dominated case is stabilized using a continuous interior penalty approach based on the jumps in the gradient over ...
This paper investigates the particular problem of matrices appearing during the modeling of Integrated Circuits with Finite Integration Technique (FIT) method. We present the key points of FIT approach followed by an illustration of the structure and the p ...
