scientific article; zbMATH DE number 1431705

zbMATH Open0941.65032MaRDI QIDQ4948637FDOQ4948637

Authors: M. Yu. Balandin, E. P. Shurina 

Publication date: 13 April 2000

Title of this publication is not available (Why is that?)

Recommendations

• Krylov Subspace Methods on Supercomputers
• Parallelism and fast solution of linear systems
• A Krylov multisplitting algorithm for solving linear systems of equations
• Problems of parallel solution of large systems of linear algebraic equations
• Experiments with Krylov subspace methods on a massively parallel computer

zbMATH Keywords

numerical experimentsKrylov subspace methodGMRES methodparallel computationsnumerical complexityshared-memory multiprocessorABR1ORT methoddense ill-conditioned systemslarge-scale non-symmetric linear systems with sparse matrices

Mathematics Subject Classification ID

Computational methods for sparse matrices (65F50) Parallel numerical computation (65Y05) Complexity and performance of numerical algorithms (65Y20) Iterative numerical methods for linear systems (65F10)

Cited In (2)

• Title not available (Why is that?)
• A hybrid GMRES/LS-Arnoldi method to accelerate the parallel solution of linear systems

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4948637)