Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
A Gradient Hybrid Parallel Algorithm to One-Parameter Nonlinear Boundary Value Problems
Large-Scale Scientific Computing
Hi-index | 0.00 |
An effective algorithm is presented in this paper to solve boundary value problems describing the deformations of pre-stressed concrete beams The solution presented in this paper aims to deliver a speedup of several magnitudes compared to existing algorithms in order to be able to handle more complex problems inaccessible so far Parallelization problems are investigated and a solution is proposed which allows the running of this algorithm in various environments from desktop computers to clusters and Grids.