4.3 Article

Fast Solvers for Systems of Linear Equations with Block-Band Matrices

Journal

EAST ASIAN JOURNAL ON APPLIED MATHEMATICS
Volume 13, Issue 1, Pages 47-58

Publisher

GLOBAL SCIENCE PRESS
DOI: 10.4208/eajam.300921.210522

Keywords

High performance computing; parallel computing; iterative algorithm; sparse matrix; system of linear algebraic equations

Ask authors/readers for more resources

This article discusses parallel iterative algorithms for linear systems with block-band matrices, which can be applied to mathematical modeling problems involving finite difference and finite element methods. The solvers are adapted to the problem and computing systems with the use of special precompilers. The article describes the applications of these algorithms to the ACELAN-COMPOS software package for new material modeling and the utilization of parallel programming techniques and processor memory hierarchy optimization to achieve high performance. Numerical experiments confirm the efficiency of the methods and algorithms.
This article deals with parallel iterative algorithms for linear systems with block-band matrices. The algorithms can be used in mathematical modeling of the problems involving finite difference and finite element methods. The solvers are adjusted to the problem and to the computing systems, which use special precompilers. Applications of the algorithms to the ACELAN-COMPOS software package focused on the new material modeling, is described. To achieve a high performance, both parallel programming techniques and the optimization of the processor memory hierarchy are used. The results of numerical experiments confirm the efficiency of the methods and algorithms.

Authors

I am an author on this paper
Click your name to claim this paper and add it to your profile.

Reviews

Primary Rating

4.3
Not enough ratings

Secondary Ratings

Novelty
-
Significance
-
Scientific rigor
-
Rate this paper

Recommended

No Data Available
No Data Available