We present a Calderón preconditioning scheme for the symmetric formulation of the forward electroencephalographic (EEG) problem that cures both the dense-discretization and the high-contrast breakdown. Unlike existing Calderón schemes presented for the EEG problem, it is refinement-free, that is, the electrostatic integral operators are not discretized with basis functions defined on the barycentrically-refined dual mesh. In fact, in the preconditioner, we reuse the original system matrix thus reducing computational burden. Moreover, the proposed formulation gives rise to a symmetric, positive-definite system of linear equations, which allows the application of the conjugate gradient method, an iterative method that exhibits a smaller computational cost compared to other Krylov subspace methods applicable to non-symmetric problems. Numerical results corroborate the theoretical analysis and attest of the efficacy of the proposed preconditioning technique on both canonical and realistic scenarios.
On a Calderón preconditioner for the symmetric formulation of the electroencephalography forward problem without barycentric refinements / Giunzioni, Viviana; Ortiz G., John E.; Merlini, Adrien; Adrian, Simon B.; Andriulli, Francesco P.. - In: JOURNAL OF COMPUTATIONAL PHYSICS. - ISSN 0021-9991. - STAMPA. - 491:(2023). [10.1016/j.jcp.2023.112374]
On a Calderón preconditioner for the symmetric formulation of the electroencephalography forward problem without barycentric refinements
Giunzioni, Viviana;Merlini, Adrien;Adrian, Simon B.;Andriulli, Francesco P.
2023
Abstract
We present a Calderón preconditioning scheme for the symmetric formulation of the forward electroencephalographic (EEG) problem that cures both the dense-discretization and the high-contrast breakdown. Unlike existing Calderón schemes presented for the EEG problem, it is refinement-free, that is, the electrostatic integral operators are not discretized with basis functions defined on the barycentrically-refined dual mesh. In fact, in the preconditioner, we reuse the original system matrix thus reducing computational burden. Moreover, the proposed formulation gives rise to a symmetric, positive-definite system of linear equations, which allows the application of the conjugate gradient method, an iterative method that exhibits a smaller computational cost compared to other Krylov subspace methods applicable to non-symmetric problems. Numerical results corroborate the theoretical analysis and attest of the efficacy of the proposed preconditioning technique on both canonical and realistic scenarios.File | Dimensione | Formato | |
---|---|---|---|
Andriulli-OnaCladeron.pdf
accesso aperto
Tipologia:
2a Post-print versione editoriale / Version of Record
Licenza:
Creative commons
Dimensione
1.48 MB
Formato
Adobe PDF
|
1.48 MB | Adobe PDF | Visualizza/Apri |
Pubblicazioni consigliate
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
https://hdl.handle.net/11583/2980684