Efficient approximate solution of sparse linear systems
type: Item
instance of: scholarly article
title: Efficient approximate solution of sparse linear systems
zbMATH Open document ID: 0934.65033
DOI: 10.1016/S0898-1221(98)00191-6
author: J. Reif
publication date: 2000-04-25T00:00:00Z
Mathematics Subject Classification ID: 65F10
Mathematics Subject Classification ID: 65F35
Mathematics Subject Classification ID: 65F50
zbMATH DE Number: 1371504
zbMATH Keywords: sparse matrices
zbMATH Keywords: approximate solution
zbMATH Keywords: condition number
zbMATH Keywords: preconditioners
zbMATH Keywords: iterations
zbMATH Keywords: diagonally dominant linear systems
zbMATH Keywords: stochastic systems
MaRDI profile type: Publication
cites work: Matrix multiplication via arithmetic progressions
cites work: Q3359644
cites work: Q5661059
cites work: Q3852212
cites work: Generalized Nested Dissection
cites work: The analysis of a nested dissection algorithm
cites work: Bounds of Eigenvalues of Preconditioned Matrices
cites work: On the rate of convergence of the preconditioned conjugate gradient method
cites work: Algebraic multilevel preconditioning methods. I
cites work: Q5203615
cites work: Efficient Implementation of a Class of Preconditioned Conjugate Gradient Methods
cites work: The effect of ordering on preconditioned conjugate gradients
cites work: High Performance Preconditioning
cites work: A parallel preconditioned conjugate gradient package for solving sparse linear systems on a Cray Y-MP
cites work: Multi-Level Adaptive Solutions to Boundary-Value Problems
cites work: Algebraic multigrid (AMG): Experiences and comparisons
cites work: A New Convergence Proof for the Multigrid Method Including the V-Cycle
cites work: Q3809173
cites work: Q5342712
cites work: Q5604166
cites work: Q3677390
cites work: Q3909906
cites work: Iterative solution of large sparse systems of equations. Transl. from the German
cites work: Q3994364
cites work: Q3134821
cites work: Q5750331
cites work: Methods of conjugate gradients for solving linear systems
cites work: Some History of the Conjugate Gradient and Lanczos Algorithms: 1948–1976
cites work: Q3706275
cites work: A randomized linear-time algorithm for finding minimum spanning trees (extended abstract)
cites work: A Separator Theorem for Planar Graphs
cites work: Stopping Criteria for Iterative Solvers
cites work: Q3128906
cites work: Q4038722
published in: Computers & Mathematics with Applications
description: scientific article; zbMATH DE number 1371504