Toward Eliminating the “Curse of Dimensionality” in Large-Scale Groundwater Modeling
نویسندگان
چکیده
In this paper, we present a nature-inspired, hierarchical patch dynamics paradigm for modeling complex groundwater systems across multiple scales – one that has the potential to substantially alleviate the infamous “curse of dimensionality” and the associated computational bottlenecks. The new modeling paradigm is inspired by the observations on how biological systems have been doing a great job coping with complexity, especially on their ability to process far more information than their limited bandwidths allow. Specifically, the new paradigm takes advantage of hierarchy theory, mimics how biological systems effectively “divide and conquer” complexities, and decouples scale-dependent dynamics hierarchically. The result is a systematic framework that enables modeling complex groundwater systems in high resolution without having to solve large, ill-posed matrix systems. We illustrate the effectiveness of the new hierarchical paradigm and its potential for large-scale groundwater modeling using an example.
منابع مشابه
Modeling Complex Groundwater Systems Across Multiple Scales: Part 1 - A Hierarchical Patch Dynamic Paradigm
In this paper, we present a hierarchical patch dynamic paradigm for modeling complex groundwater systems across multiple scales – one that has the potential to substantially alleviate the infamous “curse of dimensionality” and the associated computational bottlenecks in large-scale groundwater modeling. The new modeling paradigm is inspired by the observations on how biological systems have bee...
متن کاملAn object-oriented hierarchical patch dynamics paradigm (HPDP) for modeling complex groundwater systems across multiple-scales
In this paper, we present an object-oriented hierarchical patch dynamics paradigm (HPDP) for modeling complex groundwater systems across multiple-scales e one that has the potential to significantly alleviate the infamous ‘‘curse-of-dimensionality’’ and the associated computational bottlenecks. The HPDP takes advantage of hierarchy theory, divides and conquers complexities, and decouples scale-...
متن کاملContinuous-time MAXQ Algorithm for Web Service Composition
Web services composition present a technology to compose complex service applications from individual (atomic) services, that is, through web services composition, distributed applications and enterprise business processes can be integrated by individual service components developed independently. In this paper, we concentrate on the optimization problems of dynamic web service composition, and...
متن کاملDesign and Experimentation of a Large Scale Distributed Stochastic Control Algorithm Applied to Energy Management Problems
The Stochastic Dynamic Programming method often used to solve some stochastic optimization problems is only usable in low dimension, being plagued by the curse of dimensionality. In this article, we explain how to postpone this limit by using High Performance Computing: parallel and distributed algorithms design, optimized implementations and usage of large scale distributed architectures (PC c...
متن کاملLarge-scale games in large-scale systems
Many real-world problems modeled by stochastic games have huge state and/or action spaces, leading to the well-known curse of dimensionality. The complexity of the analysis of large-scale systems is dramatically reduced by exploiting mean field limit and dynamical system viewpoints. Under regularity assumptions and specific time-scaling techniques, the evolution of the mean field limit can be e...
متن کامل