A model for comparing memory strategies for large scale matrix in linear equation and one experimental case

Suppose there is the linear equation Ax=b, where A is a large scale sparse matrix. In this article, we set up a model for testing efficiency of different memory strategies. And as an example, we compare several matrix storing methods in applying PCG methods to linear equations generated by "Num...

Full description

Saved in:
Bibliographic Details
Main Authors: Yang Zhenxiao, Zhou Haichang, Ba Zhixin
Format: Conference Proceeding
Language:English
Subjects:
Character generation
Computer science
Differential equations
High performance computing
Large-scale systems
Numerical simulation
Sparse matrices
Symmetric matrices
Testing
Vectors
Online Access:Request full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:Suppose there is the linear equation Ax=b, where A is a large scale sparse matrix. In this article, we set up a model for testing efficiency of different memory strategies. And as an example, we compare several matrix storing methods in applying PCG methods to linear equations generated by "Numerical Simulation for Bridgman Method".
DOI:10.1109/HPC.2000.843598