A generalized spectral concentration problem and the varying masks algorithm - Centre Henri Lebesgue
Pré-Publication, Document De Travail Année : 2024

A generalized spectral concentration problem and the varying masks algorithm

Résumé

In this paper we generalize the spectral concentration problem as formulated by Slepian, Pollak and Landau in the 1960s. We show that a generalized version with arbitrary space and Fourier masks is well-posed, and we prove some new results concerning general quadratic domains and gaussian filters. We also propose a more general splitting representation of the spectral concentration operator allowing to construct quasi-modes in some situations. We then study its discretization and we illustrate the fact that standard eigen-algorithms are not robust because of a clustering of eigenvalues. We propose a new alternative algorithm that can be implemented in any dimension and for any domain shape, and that gives very efficient results in practice.
Fichier principal
Vignette du fichier
slepian.pdf (1.42 Mo) Télécharger le fichier
Origine Fichiers produits par l'(les) auteur(s)

Dates et versions

hal-04718024 , version 1 (02-10-2024)

Identifiants

Citer

Erwan Faou, Yoann Le Henaff. A generalized spectral concentration problem and the varying masks algorithm. 2024. ⟨hal-04718024⟩
0 Consultations
0 Téléchargements

Altmetric

Partager

More