A Sparse Reformulation of the Green's Function Formalism Allows Efficient Simulations of Morphological Neuron Models
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.
Publications related to A Sparse Reformulation of the Green's Function Formalism Allows Efficient Simulations of Morphological Neuron Models | EPFL Graph Search
We propose a local, non -intrusive model order reduction technique to accurately approximate the solution of coupled multi -component parametrized systems governed by partial differential equations. Our approach is based on the approximation of the boundar ...
This article describes a field-based analytical model of single-sided linear induction motors (SLIMs) that explicitly considers the following effects altogether: finite motor length, magnetomotive force mmf space harmonics, slot effect, edge effect, and ta ...
We establish shape holomorphy results for general weakly- and hyper-singular boundary integral operators arising from second-order partial differential equations in unbounded two-dimensional domains with multiple finite-length open arcs. After recasting th ...
The thesis is dedicated to the study of two main partial differential equations (PDEs) in fluid dynamics: the Navier-Stokes equations, which describe the motion of incompressible fluids, and the transport equation with divergence-free velocity fields, whic ...
In this work, we analyze space-time reduced basis methods for the efficient numerical simulation of haemodynamics in arteries. The classical formulation of the reduced basis (RB) method features dimensionality reduction in space, while finite difference sc ...
Despite the widespread empirical success of ResNet, the generalization properties of deep ResNet are rarely explored beyond the lazy training regime. In this work, we investigate scaled ResNet in the limit of infinitely deep and wide neural networks, of wh ...
Spectral algorithms are some of the main tools in optimization and inference problems on graphs. Typically, the graph is encoded as a matrix and eigenvectors and eigenvalues of the matrix are then used to solve the given graph problem. Spectral algorithms ...
We examine the connection of two graph parameters, the size of a minimum feedback arcs set and the acyclic disconnection. A feedback arc set of a directed graph is a subset of arcs such that after deletion the graph becomes acyclic. The acyclic disconnecti ...
The goal of this work is to use anisotropic adaptive finite elements for the numerical simulation of aluminium electrolysis. The anisotropic adaptive criteria are based on a posteriori error estimates derived for simplified problems. First, we consider an ...
We present a combination technique based on mixed differences of both spatial approximations and quadrature formulae for the stochastic variables to solve efficiently a class of optimal control problems (OCPs) constrained by random partial differential equ ...