A new sparse-matrix storage method for adaptively solving large systems of reaction-diffusion-transport equations

DOI10.1007/S006070200001MaRDI QIDQ1599495zbMATH OpenOpenAlexFDO

Authors Nicolas Neuss

Publication date 10 June 2002

Published in Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s006070200001

zbMATH Keywords

box methodchemical reactionscompact row-ordered storagecompact storagefinite volume methoditerative methodsmatrix graphmatrix-vector multiplicationmultigridreaction-diffusion-transport equationssparse-matrix storage methodstabilization

Mathematics Subject Classification ID

Reaction-diffusion equations (35K57) Iterative numerical methods for linear systems (65F10) Computational methods for sparse matrices (65F50) Finite difference methods for initial value and initial-boundary value problems involving PDEs (65M06) Stability and convergence of numerical methods for initial value and initial-boundary value problems involving PDEs (65M12) Multigrid methods; domain decomposition for initial value and initial-boundary value problems involving PDEs (65M55) Chemically reacting flows (80A32)

Recommendations

• A sparse matrix scheme for finite elements
• A survey of the advances in the exploitation of the sparsity in the solution of large problems
• An efficient storage format for large sparse matrices
• Sparse matrix storage formats and acceleration of iterative solution of linear algebraic systems with dense matrices
• scientific article; zbMATH DE number 4117735

Describes a project that uses

Uses Software

• UG

This page was built for publication: A new sparse-matrix storage method for adaptively solving large systems of reaction-diffusion-transport equations

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