Determination of Stripe Structures for Finite Element Matrices

DOI10.1137/0724091MaRDI QIDQ3785816zbMATH OpenOpenAlexFDO

Authors Rami Melhem

Publication date 1987

Published in SIAM Journal on Numerical Analysis (Search for Journal in Brave)

Full work available at URL https://semanticscholar.org/paper/783aabc6f7429cf945716c315370d9e69e993750

zbMATH Keywords

computational networksefficient parallel manipulationsfinite elementslarge sparse matricesmulticolor numberingstiffness matricesstripe structures

Mathematics Subject Classification ID

Iterative numerical methods for linear systems (65F10) Computational methods for sparse matrices (65F50) Finite element, Rayleigh-Ritz and Galerkin methods for boundary value problems involving PDEs (65N30) Parallel numerical computation (65Y05)

Recommendations

• Parallel solution of linear systems with striped sparse matrices
• scientific article; zbMATH DE number 4074338
• Processor-efficient sparse matrix-vector multiplication
• scientific article; zbMATH DE number 4184971
• scientific article; zbMATH DE number 934528

Cited in

(5)

• Parallel solution of linear systems with striped sparse matrices
• Processor-efficient sparse matrix-vector multiplication
• Diagonally-striped matrices and approximate inverse preconditioners
• Block SSOR preconditionings for high order 3D FE systems
• FPGA architecture and implementation of sparse matrix-vector multiplication for the finite element method

This page was built for publication: Determination of Stripe Structures for Finite Element Matrices

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