scientific article
From MaRDI portal
Publication:3369018
zbMATH Open1150.68538MaRDI QIDQ3369018
Publication date: 10 February 2006
Title of this publication is not available (Why is that?)
parabolic equationparallel algorithminitial-boundary-value problemspeed-upexplicit difference method
Parallel algorithms in computer science (68W10) Finite difference methods for initial value and initial-boundary value problems involving PDEs (65M06) Complexity and performance of numerical algorithms (65Y20)
Related Items (2)
Optimal speeding up of parallel algorithms based upon the divide-and- conquer strategy โฎ Title not available (Why is that?)
Recommendations
- Title not available (Why is that?) ๐ ๐
- Title not available (Why is that?) ๐ ๐
- Title not available (Why is that?) ๐ ๐
- Optimal speeding up of parallel algorithms based upon the divide-and- conquer strategy ๐ ๐
- A complexity theory of efficient parallel algorithms ๐ ๐
- Paradigms for Fast Parallel Approximability ๐ ๐
- Time-work tradeoffs for parallel algorithms ๐ ๐
- Parallel Processing and Applied Mathematics ๐ ๐
- On parallel versus sequential approximation ๐ ๐
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3369018)