scientific article; zbMATH DE number 5005293

MaRDI QIDQ3369018zbMATH OpenFDO

Authors Pavol Purcz

Publication date 10 February 2006

zbMATH Keywords

explicit difference methodinitial-boundary-value problemparabolic equationparallel algorithmspeed-up

Mathematics Subject Classification ID

Finite difference methods for initial value and initial-boundary value problems involving PDEs (65M06) Complexity and performance of numerical algorithms (65Y20) Parallel algorithms in computer science (68W10)

Recommendations

• Optimal speeding up of parallel algorithms based upon the divide-and- conquer strategy
• Parallel Processing and Applied Mathematics
• Paradigms for Fast Parallel Approximability
• scientific article; zbMATH DE number 4092771
• A complexity theory of efficient parallel algorithms
• scientific article; zbMATH DE number 4074482
• Time-work tradeoffs for parallel algorithms
• On the speedup of parallel iterative numerical methods
• On parallel versus sequential approximation

Cited in

(4)

• Special Issue: New parallel algorithm and its speed-up for the explicit difference method
• Parallel Processing and Applied Mathematics
• scientific article; zbMATH DE number 4187099 (Why is no real title available?)
• Optimal speeding up of parallel algorithms based upon the divide-and- conquer strategy

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)