Some special classes of tridiagonal matrices A are considered, and the complexity of solving a linear system Ax = f is investigated, when rational preconditioning on A is allowed. Non-trivial lower bounds are found, and in all cases the number of necessary multiplicative operations, apart from preconditioning, is shown to be greater than the number of indeterminates defining A.

Complexity bounds for solving some tridiagonal systems with preconditioning

BOZZO, Enrico;
1993-01-01

Abstract

Some special classes of tridiagonal matrices A are considered, and the complexity of solving a linear system Ax = f is investigated, when rational preconditioning on A is allowed. Non-trivial lower bounds are found, and in all cases the number of necessary multiplicative operations, apart from preconditioning, is shown to be greater than the number of indeterminates defining A.
File in questo prodotto:
File Dimensione Formato  
complexbound.pdf

non disponibili

Tipologia: Altro materiale allegato
Licenza: Non pubblico
Dimensione 596.39 kB
Formato Adobe PDF
596.39 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/11390/669246
 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??? ND
social impact