Pré-Publication, Document De Travail Année : 2024

Butterfly factorization with error guarantees

Résumé

In this paper, we investigate the butterfly factorization problem, i.e., the problem of approximating a matrix by a product of sparse and structured factors. We propose a new formal mathematical description of such factors, that encompasses many different variations of butterfly factorization with different choices of the prescribed sparsity patterns. Among these supports, we identify those that ensure that the factorization problem admits an optimum, thanks to a new property called ``chainability". For those supports we propose a new butterfly algorithm that yields an approximate solution to the butterfly factorization problem and that is supported by stronger theoretical guarantees than existing factorization methods. Specifically, we show that the ratio of the approximation error by the minimum value is bounded by a constant, independent of the target matrix.

Fichier principal
Vignette du fichier
current_version.pdf (1.18 Mo) Télécharger le fichier
Origine Fichiers produits par l'(les) auteur(s)
Licence

Dates et versions

hal-04763712 , version 1 (06-11-2024)
hal-04763712 , version 2 (26-03-2025)

Licence

Identifiants

  • HAL Id : hal-04763712 , version 1

Citer

Quoc-Tung Le, Léon Zheng, Elisa Riccietti, Rémi Gribonval. Butterfly factorization with error guarantees. 2024. ⟨hal-04763712v1⟩
789 Consultations
962 Téléchargements

Partager

  • More