@misc{faouGeneralizedSpectralConcentration2024,
 abstract = {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.},
 archiveprefix = {HAL},
 author = {Faou, Erwan and Le Henaff, Yoann},
 eprint = {hal-04718024},
 langid = {english},
 month = {October},
 number = {hal-04718024},
 publisher = {HAL},
 title = {A Generalized Spectral Concentration Problem and the Varying Masks Algorithm},
 year = {2024}
}