PERFORMANCE EVALUATION OF DOMAIN DECOMPOSITION METHOD WITH SPARSE MATRIX STORAGE SCHEMES IN MODERN SUPERCOMPUTER

DOI10.1142/S0219876213440076zbMath1359.65067OpenAlexW2090233096MaRDI QIDQ2971874

Masao Ogino, Abul Mukid Mohammad Mukaddes, Ryuji Shioya

Publication date: 7 April 2017

Published in: International Journal of Computational Methods (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s0219876213440076

zbMATH Keywords

domain decomposition methodmatrix-vector productcompressed sparse rowskyline storage

Mathematics Subject Classification ID

Computational methods for sparse matrices (65F50) Multigrid methods; domain decomposition for boundary value problems involving PDEs (65N55) Parallel numerical computation (65Y05) Numerical algorithms for specific classes of architectures (65Y10)

Related Items (2)

Fuzzy Optimal Search Plan for N-Dimensional Randomly Moving Target ⋮ Finite Element-Based Analysis of Bio-Heat Transfer in Human Skin Burns and Afterwards

Cites Work

• Unnamed Item
• Unnamed Item

This page was built for publication: PERFORMANCE EVALUATION OF DOMAIN DECOMPOSITION METHOD WITH SPARSE MATRIX STORAGE SCHEMES IN MODERN SUPERCOMPUTER