Artigo Revisado por pares

An approximate inverse matrix technique for arrowhead matrices

1998; Taylor & Francis; Volume: 70; Issue: 1 Linguagem: Inglês

10.1080/00207169808804734

ISSN

1029-0265

Autores

George A. Gravvanis,

Tópico(s)

Statistical and numerical algorithms

Resumo

Abstract A new class of approximate inverse matrix techniques based on the concept of sparse LU-type factorization procedures is introduced for computing explicitly inverses of arrowhead matrices without inverting the decomposition factors. Explicit preconditioned iterative schemes in conjunction with AIM techniques are presented for the efficient solution of linear systems. Applications of the method on a linear system are discussed and numerical results are given. Keywords: Arrowhead matrixbordered diagonal matrixapproximate factorization proceduresapproximate inverse matrix techniquespreconditioningC.R. Categories:: G.1.0G.1.3AMS(MOS):: 65F1065F1565F50 ∗Also: Technical University of Crete, Department of Electronic and Computer Engineering, GR 73100 Chania, Crete, Greece. gravanis@ced.tuc.gr. ∗Also: Technical University of Crete, Department of Electronic and Computer Engineering, GR 73100 Chania, Crete, Greece. gravanis@ced.tuc.gr. Notes ∗Also: Technical University of Crete, Department of Electronic and Computer Engineering, GR 73100 Chania, Crete, Greece. gravanis@ced.tuc.gr.

Referência(s)