Toward memory-efficient linear solvers

Allison Baker, John Dennis, Elizabeth R. Jessup

Research output: Chapter in Book/Report/Conference proceedingChapterpeer-review

3 Scopus citations

Abstract

We describe a new technique for solving a sparse linear system Ax = b as a block system AX = B, where multiple starting vectors and right-hand sides are chosen so as to accelerate convergence. Efficiency is gained by reusing the matrix A in block operations with X and B. Techniques for reducing the cost of the extra matrix-vector operations are presented.

Original languageEnglish
Title of host publicationLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
EditorsJose M. L. M. Palma, A. Augusto Sousa, Jack Dongarra, Vicente Hernandez
PublisherSpringer Verlag
Pages315-327
Number of pages13
ISBN (Print)3540008527, 9783540008521
DOIs
StatePublished - 2003

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume2565
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Fingerprint

Dive into the research topics of 'Toward memory-efficient linear solvers'. Together they form a unique fingerprint.

Cite this