A platform for research: civil engineering, architecture and urbanism
Domain decomposition for parallel processing of spatial problems
AbstractSpatial models often are not used to their fullest potential because they have massive computational requirements. Existing workstations and microcomputers often must solve these models in batch mode and, consequently, decision makers are unable to explore and resolve complex spatial problems in an interactive and graphical environment similar to that provided by general purpose business software. Parallel processing can solve spatial models at high speed, however, greatly decreasing turnaround times and enabling decision makers quickly to see the results of revising parameters and criteria. To reap these benefits in a parallel processing environment, researchers must recast modelling procedures from their existing sequentially-oriented form to one in which parallelism can be exploited. This process, referred to as domain decomposition, is a fundamental enterprise in parallel spatial modelling. Domain decomposition for spatial problems can be structured by a set of general principles which are described and illustrated using an example from location-allocation modelling.
Domain decomposition for parallel processing of spatial problems
AbstractSpatial models often are not used to their fullest potential because they have massive computational requirements. Existing workstations and microcomputers often must solve these models in batch mode and, consequently, decision makers are unable to explore and resolve complex spatial problems in an interactive and graphical environment similar to that provided by general purpose business software. Parallel processing can solve spatial models at high speed, however, greatly decreasing turnaround times and enabling decision makers quickly to see the results of revising parameters and criteria. To reap these benefits in a parallel processing environment, researchers must recast modelling procedures from their existing sequentially-oriented form to one in which parallelism can be exploited. This process, referred to as domain decomposition, is a fundamental enterprise in parallel spatial modelling. Domain decomposition for spatial problems can be structured by a set of general principles which are described and illustrated using an example from location-allocation modelling.
Domain decomposition for parallel processing of spatial problems
Armstrong, Marc P. (author) / Densham, Paul J. (author)
Computers, Environments and Urban Systems ; 16 ; 497-513
1992-01-01
17 pages
Article (Journal)
Electronic Resource
English
Parallel Domain Decomposition Algorithms for Solving Plate and Shell Problems
British Library Conference Proceedings | 1994
|Domain Decomposition PCG Methods for Serial and Parallel Processing
British Library Conference Proceedings | 1994
|Solving Large Scale Structural Problems on Parallel Computers Using Domain Decomposition Techniques
British Library Conference Proceedings | 1994
|Parallel Dynamic Relaxation and Domain Decomposition
British Library Conference Proceedings | 1994
|British Library Online Contents | 2010
|