Greedy energy minimization and the van der Corput sequence (part 3) | Vidéo | Carmin.tv

00:00:00 / 00:00:00

Greedy energy minimization and the van der Corput sequence (part 3)

De Florian Pausinger

Apparaît dans la collection : Jean-Morlet Chair 2020 - Workshop: Discrepancy Theory and Applications - Part 1 / Chaire Jean-Morlet 2020 - Workshop : Théorie de la discrépance et applications - Part 1

In this talk I will report on recent progress on two different problems in discrepancy theory.In the first part I will present a recent extension of the notion of jittered sampling to arbitrary partitions of the unit cube. In this joint work with Markus Kiderlen from Aarhus, we introduce the notion of a uniformly distributed triangular array. Moreover, we show that the expected Lp-discrepancy of a point sample generated from an arbitrary equi volume partition of the unit cube is always strictly smaller than the expected Lp-discrepancy of a set of N uniform random samples for p > 1. The second part of the talk is dedicated to greedy energy minimization. I will give a new characterisation of the classical van der Corput sequence in terms of a minimization problem and will discuss various related open questions.

Informations sur la vidéo

Date de captation 30/11/2020
Date de publication 30/11/2020
Institut CIRM
Licence CC BY NC ND
Langue Anglais
Audience Chercheurs
Réalisateur(s) Guillaume Hennenfent
Format MP4

Données de citation

DOI 10.24350/CIRM.V.19691703
Citer cette vidéo Pausinger, Florian (30/11/2020). Greedy energy minimization and the van der Corput sequence (part 3). CIRM. Audiovisual resource. DOI: 10.24350/CIRM.V.19691703
URL https://dx.doi.org/10.24350/CIRM.V.19691703

Domaine(s)

Bibliographie

KIDERLEN, Markus et PAUSINGER, Florian. Discrepancy of stratified samples from partitions of the unit cube. arXiv preprint arXiv:2008.12026, 2020. - https://arxiv.org/abs/2008.12026
PAUSINGER, Florian. Greedy energy minimization can count in binary: point charges and the van der Corput sequence. arXiv preprint arXiv:1905.09641, 2019. To appear, Ann. Math. Pura. Appl. - https://arxiv.org/abs/1905.09641

Codes MSC

Document(s)

https://www.cirm-math.com/uploads/2/6/6/0/26605521/pausinger_part3.pdf

Dernières questions liées sur MathOverflow

Pour poser une question, votre compte Carmin.tv doit être connecté à mathoverflow

Poser une question sur MathOverflow

Copyright Carmin.tv 2024

Donner son avis