We consider fast solvers for large linear systems arising from the Galerkin approximation based on B-splines of classical ddimensional elliptic problems, d≥1, in the context of isogeometric analysis. Our ultimate goal is to design iterative algorithms with the following two properties. First, their computational cost is optimal, that is linear with respect to the number of degrees of freedom, i.e. the resulting matrix size. Second, they are totally robust, i.e., their convergence speed is substantially independent of all the relevant parameters: in our case, these are the matrix size (related to the fineness parameter), the spline degree (associated to the approximation order), and the dimensionality d of the problem. We review several methods like PCG, multigrid, multi-iterative algorithms, and we show how their numerical behavior (in terms of convergence speed) can be understood through the notion of spectral distribution, i.e. through a compact symbol which describes the global eigenvalue behavior of the considered stiffness matrices. As a final step, we show how we can design an optimal and totally robust multi-iterative method, by taking into account the analytic features of the symbol. A wide variety of numerical experiments, few open problems and perspectives are presented and critically discussed.

Donatelli, M., Garoni, C., Manni, C., Serra-Capizzano, S., Speleers, H. (2015). Robust and optimal multi-iterative techniques for IgA Galerkin linear systems. COMPUTER METHODS IN APPLIED MECHANICS AND ENGINEERING, 284, 230-264 [10.1016/j.cma.2014.06.001].

Robust and optimal multi-iterative techniques for IgA Galerkin linear systems

Garoni, C;Manni, C;Speleers, H
2015-02-01

Abstract

We consider fast solvers for large linear systems arising from the Galerkin approximation based on B-splines of classical ddimensional elliptic problems, d≥1, in the context of isogeometric analysis. Our ultimate goal is to design iterative algorithms with the following two properties. First, their computational cost is optimal, that is linear with respect to the number of degrees of freedom, i.e. the resulting matrix size. Second, they are totally robust, i.e., their convergence speed is substantially independent of all the relevant parameters: in our case, these are the matrix size (related to the fineness parameter), the spline degree (associated to the approximation order), and the dimensionality d of the problem. We review several methods like PCG, multigrid, multi-iterative algorithms, and we show how their numerical behavior (in terms of convergence speed) can be understood through the notion of spectral distribution, i.e. through a compact symbol which describes the global eigenvalue behavior of the considered stiffness matrices. As a final step, we show how we can design an optimal and totally robust multi-iterative method, by taking into account the analytic features of the symbol. A wide variety of numerical experiments, few open problems and perspectives are presented and critically discussed.
Pubblicato
Rilevanza internazionale
Articolo
Esperti anonimi
Settore MAT/08 - Analisi Numerica
English
Con Impact Factor ISI
Isogeometric analysis; B-splines; Galerkin method; Toeplitz matrices; Symbol; PCG, multigrid, and multi-iterative methods
Donatelli, M., Garoni, C., Manni, C., Serra-Capizzano, S., Speleers, H. (2015). Robust and optimal multi-iterative techniques for IgA Galerkin linear systems. COMPUTER METHODS IN APPLIED MECHANICS AND ENGINEERING, 284, 230-264 [10.1016/j.cma.2014.06.001].
Donatelli, M; Garoni, C; Manni, C; Serra-Capizzano, S; Speleers, H
Articolo su rivista
File in questo prodotto:
File Dimensione Formato  
Donatelli_CMAME_2015_galerkin.pdf

non disponibili

Tipologia: Versione Editoriale (PDF)
Licenza: Copyright dell'editore
Dimensione 412.41 kB
Formato Adobe PDF
412.41 kB Adobe PDF   Visualizza/Apri   Richiedi una copia

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/2108/121441
Citazioni
  • ???jsp.display-item.citation.pmc??? ND
  • Scopus 59
  • ???jsp.display-item.citation.isi??? 58
social impact