Concept

Nombre réel calculable

Publications associées (32)

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

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

Fourier non-uniqueness sets from totally real number fields

Martin Peter Stoller

Let K be a totally real number field of degree n >= 2. The inverse different of K gives rise to a lattice in Rn. We prove that the space of Schwartz Fourier eigenfunctions on R-n which vanish on the "component-wise square root" of this lattice, is infinite ...

EUROPEAN MATHEMATICAL SOC-EMS2022

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

Accelerating materials discovery for solid state electrolytes

Matthieu Gilles Mottet

The development of new solid-state electrolytes is a key step in improving the performance and safety of battery technology. Although the use of first-principle methods has proved invaluable in better understanding the process at play in these materials, ...

EPFL2020

Anytime Heuristic for Weighted Matching Through Altruism-Inspired Behavior

Boi Faltings, Aris Filos Ratsikas, Panayiotis Danassis

We present a novel anytime heuristic (ALMA), inspired by the human principle of altruism, for solving the assignment problem. ALMA is decentralized, completely uncoupled, and requires no communication between the participants. We prove an upper bound on th ...

2019

Importance of Taking Into Account the Soil Stratification in Reproducing the Late-Time Features of Distant Fields Radiated by Lightning

Marcos Rubinstein, Antonio Sunjerga, Qi Li, Mi Zhou

In this paper, we present an analysis of the propagation effect along a lossy ground on the characteristics of lightning-generated electric fields, using simultaneous observations of lightning currents and radiated fields measured at nine different distanc ...

2019

Penalization and Bayesian numerical methods for multiscale inverse problems

Andrea Di Blasio

In this thesis we consider inverse problems involving multiscale elliptic partial differential equations. The name multiscale indicates that these models are characterized by the presence of parameters which vary on different spatial scales (macroscopic, m ...

EPFL2019

Optimal Path Planning and Coverage Control for Multi-Robot Persistent Coverage in Environments with Obstacles

Alcherio Martinoli, Zeynab Talebpour, José Manuel Palacios Gasos

Persistent coverage aims to maintain a certain coverage level over time in an environment where such level deteriorates. This level can be associated to temperature, dust or sensor information. We propose an algorithmic solution in which each robot locally ...

2017

Dynamic Graffiti Stylisation with Stochastic Optimal Control

Sylvain Calinon

We present a method for the interactive generation of stylised letters, curves and motion paths that are similar to the ones that can be observed in art forms such as graffiti and calligraphy. We define various stylisations of a letter form over a common g ...

ACM2017

A Decision Procedure for Regular Membership and Length Constraints over Unbounded Strings

Andrew Joseph Reynolds

We prove that the quantifier-free fragment of the theory of character strings with regular language membership constraints and linear integer constraints over string lengths is decidable. We do that by describing a sound, complete and terminating tableaux ...

Springer-Verlag Berlin2015

Graph Chatbot

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.

Connectez-vous pour utiliser Chat avec Graph Search