We consider the efficient solution of sequences of linear systems arising in the numerical solution of a branched transport model whose long time solution for specific parameter settings is equivalent to the solution of the Monge–Kantorovich equations of optimal transport. Galerkin Finite Element discretization combined with explicit Euler time stepping yield a linear system to be solved at each time step, characterized by a large sparse very ill conditioned symmetric positive definite (SPD) matrix . Extreme cases even prevent the convergence of Preconditioned Conjugate Gradient (PCG) with standard preconditioners such as an Incomplete Cholesky (IC) factorization of , which cannot always be computed. We investigate several preconditioning strategies that incorporate partial approximated spectral information. We present numerical evidence that the proposed techniques are efficient in reducing the condition number of the preconditioned systems, thus decreasing the number of PCG iterations and the overall CPU time.

Spectral preconditioners for the efficient numerical solution of a continuous branched transport model

Martínez, Á.
;
2019-01-01

Abstract

We consider the efficient solution of sequences of linear systems arising in the numerical solution of a branched transport model whose long time solution for specific parameter settings is equivalent to the solution of the Monge–Kantorovich equations of optimal transport. Galerkin Finite Element discretization combined with explicit Euler time stepping yield a linear system to be solved at each time step, characterized by a large sparse very ill conditioned symmetric positive definite (SPD) matrix . Extreme cases even prevent the convergence of Preconditioned Conjugate Gradient (PCG) with standard preconditioners such as an Incomplete Cholesky (IC) factorization of , which cannot always be computed. We investigate several preconditioning strategies that incorporate partial approximated spectral information. We present numerical evidence that the proposed techniques are efficient in reducing the condition number of the preconditioned systems, thus decreasing the number of PCG iterations and the overall CPU time.
2019
Pubblicato
https://www.sciencedirect.com/science/article/pii/S0377042718300517
File in questo prodotto:
File Dimensione Formato  
bergamaschi2018.pdf

Accesso chiuso

Tipologia: Documento in Versione Editoriale
Licenza: Copyright Editore
Dimensione 1.4 MB
Formato Adobe PDF
1.4 MB Adobe PDF   Visualizza/Apri   Richiedi una copia
2955072_bergamaschi2018-PostPrint.pdf

accesso aperto

Descrizione: Post Print VQR3
Tipologia: Bozza finale post-referaggio (post-print)
Licenza: Creative commons
Dimensione 1.88 MB
Formato Adobe PDF
1.88 MB Adobe PDF Visualizza/Apri
Pubblicazioni consigliate

I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.

Utilizza questo identificativo per citare o creare un link a questo documento: https://hdl.handle.net/11368/2955072
Citazioni
  • ???jsp.display-item.citation.pmc??? ND
  • Scopus 11
  • ???jsp.display-item.citation.isi??? 9
social impact