Publications associées à Computable function

Optimizing Dynamic Aperture Studies with Active Learning

Davide Di Croce, Tatiana Pieloni, Ekaterina Krymova, Massimo Giovannozzi

Dynamic aperture is an important concept for the study of non-linear beam dynamics in circular accelerators. It describes the extent of the phase-space region where a particle's motion remains bounded over a given number of turns. Understanding the feature ...

2024

Error estimates for SUPG-stabilised Dynamical Low Rank Approximations

Fabio Nobile, Thomas Simon Spencer Trigo Trindade

We perform an error analysis of a fully discretised Streamline Upwind Petrov Galerkin Dynamical Low Rank (SUPG-DLR) method for random time-dependent advection-dominated problems. The time integration scheme has a splitting-like nature, allowing for potenti ...

2024

SPEEDING UP KRYLOV SUBSPACE METHODS FOR COMPUTING f(A)b VIA RANDOMIZATION

Daniel Kressner, Alice Cortinovis

This work is concerned with the computation of the action of a matrix function f(A), such as the matrix exponential or the matrix square root, on a vector b. For a general matrix A, this can be done by computing the compression of A onto a suitable Krylov ...

Siam Publications2024

Implementation of a tracking system in the eM+ lab panorama

Alexandra Lagutova, Paul Marie Michel Madelénat

This bachelor project, conducted at the Experimental Museology Laboratory (eM+) at EPFL, focusing on immersive technologies and visualization systems. The project aimed to enhance the Panorama+, a 360-degree stereoscopic interactive visualization system, b ...

2024

An Efficient Sampling Algorithm for Non-smooth Composite Potentials

Nicolas Henri Bernard Flammarion

We consider the problem of sampling from a density of the form p(x) ? exp(-f (x) - g(x)), where f : Rd-+ R is a smooth function and g : R-d-+ R is a convex and Lipschitz function. We propose a new algorithm based on the Metropolis-Hastings framework. Under ...

MICROTOME PUBL2022

Efficient Sequential and Parallel Algorithms for Multistage Stochastic Integer Programming Using Proximity

Friedrich Eisenbrand, Moritz Andreas Venzin, Jana Tabea Cslovjecsek

We consider the problem of solving integer programs of the form min {c^⊺ x : Ax = b, x ∈ ℤ_{⩾ 0}}, where A is a multistage stochastic matrix in the following sense: the primal treedepth of A is bounded by a parameter d, which means that the columns of A ca ...

Schloss Dagstuhl - Leibniz-Zentrum für Informatik2021

Computation of Al-Salam Carlitz and Askey-Wilson moments using Motzkin paths

Gaspard Ohlmann

In this paper we study the moments of polynomials from the Askey scheme, and we focus on Askey-Wilson polynomials. More precisely, we give a combinatorial proof for the case where d = 0. Their values have already been computed by Kim and Stanton in 2015, h ...

ELECTRONIC JOURNAL OF COMBINATORICS2021

Genetic-optimised aperiodic code for distributed optical fibre sensors

Luc Thévenaz, Marcelo Alfonso Soto Hernandez, Zhisheng Yang, Simon Adrien Zaslawski, Sheng Wang, Jian Wu

Distributed optical fibre sensors deliver a map of a physical quantity along an optical fibre, providing a unique solution for health monitoring of targeted structures. Considerable developments over recent years have pushed conventional distributed sensor ...

2020

Chattez avec Graph Search

Posez n’importe quelle question sur les cours, conférences, exercices, recherches, actualités, etc. de l’EPFL ou essayez les exemples de questions ci-dessous.

AVERTISSEMENT : Le chatbot Graph n'est pas programmé pour fournir des réponses explicites ou catégoriques à vos questions. Il transforme plutôt vos questions en demandes API qui sont distribuées aux différents services informatiques officiellement administrés par l'EPFL. Son but est uniquement de collecter et de recommander des références pertinentes à des contenus que vous pouvez explorer pour vous aider à répondre à vos questions.

Computable function

Optimizing Dynamic Aperture Studies with Active Learning

Error estimates for SUPG-stabilised Dynamical Low Rank Approximations

SPEEDING UP KRYLOV SUBSPACE METHODS FOR COMPUTING f(A)b VIA RANDOMIZATION

Implementation of a tracking system in the eM+ lab panorama

An Efficient Sampling Algorithm for Non-smooth Composite Potentials

Efficient Sequential and Parallel Algorithms for Multistage Stochastic Integer Programming Using Proximity

On Proving and Disproving Equivalence of Functional Programming Assignments

Computation of Al-Salam Carlitz and Askey-Wilson moments using Motzkin paths

Common workflows for computing material properties using different quantum engines

Genetic-optimised aperiodic code for distributed optical fibre sensors

Graph Chatbot

Chattez avec Graph Search

SPEEDING UP KRYLOV SUBSPACE METHODS FOR COMPUTING f(A)b VIA RANDOMIZATION

Efficient Sequential and Parallel Algorithms for Multistage Stochastic Integer Programming Using Proximity

Computation of Al-Salam Carlitz and Askey-Wilson moments using Motzkin paths

Error estimates for SUPG-stabilised Dynamical Low Rank Approximations

An Efficient Sampling Algorithm for Non-smooth Composite Potentials

On Proving and Disproving Equivalence of Functional Programming Assignments

Genetic-optimised aperiodic code for distributed optical fibre sensors

Implementation of a tracking system in the eM+ lab panorama

Optimizing Dynamic Aperture Studies with Active Learning

Common workflows for computing material properties using different quantum engines