Mediaspace scheduled maintenance: Aug 25, 2026 07:00 - 12:00 AM. During this time, videos will be temporarily unavailable. Check status updates.

Concept

Méthode de dichotomie

Publications associées (23)

Variational methods for finding periodic orbits in the incompressible Navier Stokes equations

Tobias Schneider, Jeremy Peter Parker

Unstable periodic orbits are believed to underpin the dynamics of turbulence, but by their nature are hard to find computationally. We present a family of methods to converge such unstable periodic orbits for the incompressible Navier-Stokes equations, bas ...

Cambridge University Press2022

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

Volkan Cevher, Maria-Luiza Vladarean

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 ...

2021

Adaptive Gradient Descent without Descent

We present a strikingly simple proof that two rules are sufficient to automate gradient descent: 1) don’t increase the stepsize too fast and 2) don’t overstep the local curvature. No need for functional values, no line search, no information about the func ...

2020

Design of Approximate Circuits by Fabrication of False Timing Paths: The Carry Cut-Back Adder

Christian Enz, Vincent Frédéric Camus, Jérémy Lucien Maurice Schlachter, Mattia Cacciotti

This paper introduces a novel method for designing approximate circuits by fabricating and exploiting false timing paths, i.e. critical paths that cannot be logically activated. This allows to strongly relax timing constraints while guaranteeing minimal an ...

2018

Variational Methods for Human Modeling

Timur Bagautdinov

A large part of computer vision research is devoted to building models and algorithms aimed at understanding human appearance and behaviour from images and videos. Ultimately, we want to build automated systems that are at least as capable as people when i ...

EPFL2018

A semi-Lagrangian splitting method for the numerical simulation of sediment transport with free surface flows

Marco Picasso, Alexandre Caboussat, Gilles Steiner, Arwa Mrad

We present a numerical model for the simulation of 3D poly-dispersed sediment transport in a Newtonian flow with free surfaces. The physical model is based on a mixture model for multiphase flows. The Navier-Stokes equations are coupled with the transport ...

PERGAMON-ELSEVIER SCIENCE LTD2018

Back to the Source: an Online Approach for Sensor Placement and Source Localization

Patrick Thiran, Brunella Marta Spinelli, Laura Elisa Celis

Source localization, the act of finding the originator of a disease or rumor in a network, has become an important problem in sociology and epidemiology. The localization is done using the infection state and time of infection of a few designated sensor no ...

2017

The equivalent pier method for energy pile groups

Lyesse Laloui, Alessandro Francesco Rotta Loria

This study presents a method for estimating the average vertical displacement of energy pile groups subjected to thermal loads. The method consists of replacing any regular energy pile group with a single equivalent pier of the same length and an equivalen ...

2017

The equivalent pier method for energy pile groups

Lyesse Laloui, Alessandro Francesco Rotta Loria

2017

Learning Multimodal Temporal Representation for Dubbing Detection in Broadcast Media

Jean-Marc Odobez

Person discovery in the absence of prior identity knowledge requires accurate association of visual and auditory cues. In broadcast data, multimodal analysis faces additional challenges due to narrated voices over muted scenes or dubbing in different langu ...

ACM2016

Automated Reconstruction of Evolving Curvilinear Tree Structures

Przemyslaw Rafal Glowacki

Curvilinear networks are prevalent in nature and span many different scales, ranging from micron-scale neural structures in the brain to petameter-scale dark-matter arbors binding massive galaxy clusters. Reliably reconstructing them in an automated fashio ...

EPFL2016

Large-scale extraction of brain connectivity from the neuroscientific literature

Jean-Cédric Chappelier, Sean Lewis Hill, Renaud Luc Richardet

In neuroscience, as in many other scientific domains, the primary form of knowledge dissemination is through published articles. One challenge for modern neuroinformatics is finding methods to make the knowledge from the tremendous backlog of publications ...

Oxford University Press2015

Analysis and Computation of Hyperbolic PDEs with Random Data

Fabio Nobile

Hyperbolic partial differential equations (PDEs) are mathematical models of wave phenomena, with applications in a wide range of scientific and engineering fields such as electromagnetic radiation, geosciences, fluid and solid mechanics, aeroacoustics, and ...

2015

Subspace Methods For Computing The Pseudospectral Abscissa And The Stability Radius

Daniel Kressner

The pseudospectral abscissa and the stability radius are well-established tools for quantifying the stability of a matrix under unstructured perturbations. Based on first-order eigenvalue expansions, Guglielmi and Overton [SIAM J. Matrix Anal. Appl., 32 (2 ...

Siam Publications2014

An Augmented Lagrangian Coordination-Decomposition Algorithm for Solving Distributed Non-Convex Programs

Colin Neil Jones, Jean-Hubert Hours

A novel augmented Lagrangian method for solving non-convex programs with nonlinear cost and constraint couplings in a distributed framework is presented. The proposed decomposition algorithm is made of two layers: The outer level is a standard multiplier m ...

2014

A preconditioned low-rank CG method for parameter-dependent Lyapunov matrix equations

Daniel Kressner, Christine Tobler

This paper is concerned with the numerical solution of symmetric large-scale Lyapunov equations with low-rank right-hand sides and coefficient matrices depending on a parameter. Specifically, we consider the situation when the parameter dependence is suffi ...

Wiley-Blackwell2013

Quotient-method Algorithms for Input-affine Single-input Nonlinear Systems

Willson Sudarsandhari Shibani

Many real-world systems are intrinsically nonlinear. This thesis proposes various algorithms for designing control laws for input-affine single-input nonlinear systems. These algorithms, which are based on the concept of quotients used in nonlinear control ...

EPFL2012

Particle Manifold Method (PMM) for Multiscale Continuous-Discontinuous Analysis

Liang Sun

It is important to consider the microstructure of a material when studying the macroscopic mechanical properties. Although special equipments have been used for micromechanics study through experimental tests, it is limited by instruments and reproducibili ...

EPFL2012

Interior penalty continuous and discontinuous finite element approximations of hyperbolic equations

Alfio Quarteroni, Erik Burman, Benjamin Stamm

In this paper we present the continuous and discontinuous Galerkin methods in a unified setting for the numerical approximation of the transport dominated advection-reaction equation. Both methods are stabilized by the interior penalty method, more precise ...

2010

A stopping criterion for the conjugate gradient algorithm in the framework of anisotropic adaptive finite elements

Marco Picasso

We propose a simple stopping criterion for the conjugate gradient (CG) algorithm in the framework of anisotropic, adaptive finite elements for elliptic problems. The goal of the adaptive algorithm is to find a triangulation such that the estimated relative ...

2009

Publications associées (23)

Variational methods for finding periodic orbits in the incompressible Navier Stokes equations

Tobias Schneider, Jeremy Peter Parker

Cambridge University Press2022

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

Volkan Cevher, Maria-Luiza Vladarean

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 ...

2021