Performance comparison of data-reordering algorithms for sparse matrix–vector multiplication in edge-based unstructured grid computations

DOI10.1002/NME.1557MaRDI QIDQ3440463zbMATH OpenOpenAlexFDO

Authors Marcos A. D. Martins, Rubens M. Sydenstricker, Renato N. Elias, Alvaro L. G. A. Coutinho

Publication date 22 May 2007

Published in International Journal for Numerical Methods in Engineering (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1002/nme.1557

zbMATH Keywords

unstructured gridsdata reorderingcache-based machinesedge-based finite elements

Mathematics Subject Classification ID

Computational methods for sparse matrices (65F50) Finite element methods applied to problems in solid mechanics (74S05) Geophysical solid mechanics (74L05)

Recommendations

• EdgePack: A Parallel Vertex and Node Reordering Package for Optimizing Edge-Based Computations in Unstructured Grids
• Cache friendly sparse matrix-vector multiplication
• Comparison between element, edge and compressed storage schemes for iterative solutions in finite element analyses
• scientific article; zbMATH DE number 4074338
• Towards a fast parallel sparse symmetric matrix-vector multiplication

Cited in

(14)

• Методы повышения и оценки производительности алгоритмов моделирования газодинамических течений на неструктурированных сетках
• Stabilized edge‐based finite element computation of gravity currents in lock‐exchange configurations
• Uncertainty quantification in numerical simulation of particle-laden flows
• Minimization of indirect addressing for edge-based field solvers
• A comparative study of multi-material data structures for computational physics applications
• Parallel SOR methods with a parabolic-diffusion acceleration technique for solving an unstructured-grid Poisson equation on 3D arbitrary geometries
• Evaluation of message passing communication patterns in finite element solution of coupled problems
• Analysis of thin-walled structural elements via 3D standard BEM with generic substructuring
• An unstructured CVFEM and moving interface algorithm for non‐Newtonian Hele‐Shaw flows in injection molding
• Performance evaluation of domain decomposition method with sparse matrix storage schemes in modern supercomputer
• EdgePack: A Parallel Vertex and Node Reordering Package for Optimizing Edge-Based Computations in Unstructured Grids
• Edge-based finite element implementation of the residual-based variational multiscale method
• Comparison between element, edge and compressed storage schemes for iterative solutions in finite element analyses
• Some useful strategies for unstructured edge-based solvers on shared memory machines

This page was built for publication: Performance comparison of data-reordering algorithms for sparse matrix–vector multiplication in edge-based unstructured grid computations

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