In this paper we consider the problem of approximating the solution of infinite linear systems, finitely expressed by a sparse coefficient matrix. We analyze various algorithms based on Krylov subspace methods embedded in an adaptive enlargement scheme. The management of these algorithms is not trivial due to the irregular convergence behaviour frequently displayed by Krylov subspace methods for nonsymmetric systems. Numerical experiments, carried out on several test problems, indicate that the more robust methods, like GMRES and QMR, together with the adaptive enlargement scheme exhibit good performances.

Adaptive Solution of Infinite Linear Systems by Krylov Subspace Methods

MENCHI, ORNELLA;ROMANI, FRANCESCO
2007

Abstract

In this paper we consider the problem of approximating the solution of infinite linear systems, finitely expressed by a sparse coefficient matrix. We analyze various algorithms based on Krylov subspace methods embedded in an adaptive enlargement scheme. The management of these algorithms is not trivial due to the irregular convergence behaviour frequently displayed by Krylov subspace methods for nonsymmetric systems. Numerical experiments, carried out on several test problems, indicate that the more robust methods, like GMRES and QMR, together with the adaptive enlargement scheme exhibit good performances.
P., Favati; Lotti, G; Menchi, Ornella; Romani, Francesco
File in questo prodotto:
Non ci sono file associati a questo prodotto.

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: http://hdl.handle.net/11568/206302
 Attenzione

Attenzione! I dati visualizzati non sono stati sottoposti a validazione da parte dell'ateneo

Citazioni
  • ???jsp.display-item.citation.pmc??? ND
  • Scopus 0
  • ???jsp.display-item.citation.isi??? 0
social impact