Lightning-fast Method of Fundamental Solutions - Département d'informatique Accéder directement au contenu
Article Dans Une Revue ACM Transactions on Graphics Année : 2024

Lightning-fast Method of Fundamental Solutions

Résumé

The method of fundamental solutions (MFS) and its associated boundary element method (BEM) have gained popularity in computer graphics due to the reduced dimensionality they offer: for three-dimensional linear problems, they only require variables on the domain boundary to solve and evaluate the solution throughout space, making them a valuable tool in a wide variety of applications. However, MFS and BEM have poor computational scalability and huge memory requirements for large-scale problems, limiting their applicability and efficiency in practice. By leveraging connections with Gaussian Processes and exploiting the sparse structure of the inverses of boundary integral matrices, we introduce a variational preconditioner that can be computed via a sparse inverse-Cholesky factorization in a massively parallel manner. We show that applying our preconditioner to the Preconditioned Conjugate Gradient algorithm greatly improves the efficiency of MFS or BEM solves, up to four orders of magnitude in our series of tests.
Fichier principal
Vignette du fichier
CSD24.pdf (12.84 Mo) Télécharger le fichier
Origine Fichiers produits par l'(les) auteur(s)

Dates et versions

hal-04589038 , version 1 (27-05-2024)

Identifiants

Citer

Jiong Chen, Florian T. Schäfer, Mathieu Desbrun. Lightning-fast Method of Fundamental Solutions. ACM Transactions on Graphics, In press, 43 (4), pp.77. ⟨10.1145/3658199⟩. ⟨hal-04589038⟩
28 Consultations
47 Téléchargements

Altmetric

Partager

Gmail Mastodon Facebook X LinkedIn More