Publications associées à Nombre réel calculable

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, Farhad Rachidi-Haeri, 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

Lonely Runner Polyhedra

Matthias Schymura

We study the Lonely Runner Conjecture, conceived by Jörg M. Wills in the 1960's: Given positive integers n_1, n_2, ... , n_k, there exists a positive real number t such that for all 1 \le j \le k the distance of t n_j to the nearest integer is at least 1 / ...

2019

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

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

Mechanism of the Cassie-Wenzel transition via the atomistic and continuum string methods

Simone Meloni

The string method is a general and flexible strategy to compute the most probable transition path for an activated process (rare event). We apply here the atomistic string method in the density field to the Cassie-Wenzel transition, a central problem in th ...

Amer Inst Physics2015

A Multi Level Monte Carlo Method with Control Variate for elliptic PDEs with log-normal coefficients

Fabio Nobile, Francesco Tesei

We consider the numerical approximation of the stochastic Darcy problem with log-normal permeability field and propose a novel Multi Level Monte Carlo (MLMC) approach with a control variate variance reduction technique on each level. We model the log-perme ...

2015

Local discontinuous Galerkin methods for fractional ordinary differential equations

Jan Sickmann Hesthaven

This paper discusses the upwinded local discontinuous Galerkin methods for the one-term/multi-term fractional ordinary differential equations (FODEs). The natural upwind choice of the numerical fluxes for the initial value problem for FODEs ensures stabili ...

2015

PBCOV: a property-based coverage criterion

Hamza Harkous, Kassem Fawaz

Coverage criteria aim at satisfying test requirements and compute metrics values that quantify the adequacy of test suites at revealing defects in programs. Typically, a test requirement is a structural program element, and the coverage metric value repres ...

Springer2015

Computing in social networks

Rachid Guerraoui, Anne-Marie Kermarrec, Kévin Clément Huguenin, Andrei Giurgiu

This paper defines the problem of Scalable Secure computing in a Social network: we call it the S-3 problem. In short, nodes, directly reflecting on associated users, need to compute a symmetric function f : V-n -> U of their inputs in a set of constant si ...

Elsevier2014

In Silico Design of Three-Dimensional Porous Covalent Organic Frameworks via Known Synthesis Routes and Commercially Available Species

Berend Smit, Cory Matthew Simon

Covalent organic frameworks (COFs) are a class of advanced nanoporous polymeric materials which combine the crystallinity of metalorganic frameworks (MOFs) with the stability and potentially low-cost organic chemistry of porous polymer networks (PPNs). Lik ...

Amer Chemical Soc2014

Upper bounds for the Euclidean minima of abelian fields of odd prime power conductor

Eva Bayer Fluckiger, Piotr Aleksander Maciak

The aim of this paper is to give upper bounds for the Euclidean minima of abelian fields of odd prime power conductor. In particular, these bounds imply Minkowski's conjecture for totally real number fields of conductor p(r), where p is an odd prime number ...

Springer Verlag2013

Adaptive reduced basis finite element heterogeneous multiscale method

Assyr Abdulle, Yun Bai

An adaptive reduced basis finite element heterogeneous multiscale method (RB-FE-HMM) is proposed for elliptic problems with multiple scales. The multiscale method is based on the RB-FE-HMM introduced in [A. Abdulle, Y. Bai, Reduced basis finite element het ...

Elsevier2013

Fixed Point Property For Universal Lattice On Schatten Classes

Masato Mimura

The special linear group G = SLn(Z[x(1), ... , x(k)]) (n at least 3 and k finite) is called the universal lattice. Let n be at least 4, and p be any real number in (1, infinity). The main result is the following: any finite index subgroup of G has the fixe ...

Amer Mathematical Soc2013

A Distributed Algorithm for Computing the Node Search Number in Trees

Florian Huc

We present a distributed algorithm to compute the node search number in trees. This algorithm extends the centralized algorithm proposed by Ellis et al. (Inf. Comput. 113(1):50-79, 1994). It can be executed in an asynchronous environment, requires an overa ...

2012