Javascript must be enabled to continue!
Accelerating Heterogeneous Multiscale Simulations of Advanced Materials Properties with Graph‐Based Clustering
View through CrossRef
AbstractHeterogeneous multiscale methods (HMM) capable of simulating asynchronously multiple scales concurrently are now tractable with the advent of exascale supercomputers. However, naive implementations display a large number of redundancies and are very costly. The macroscale model typically requires computations of a large number of very similar microscale simulations. In hierarchical methods, this is barely an issue as phenomenological constitutive models are inexpensive. However, when microscale simulations require, for example, high‐dimensional molecular dynamics (MD) or finite element (FE) simulations, redundancy must be avoided. A clustering algorithm suited for HMM workflows is proposed that automatically sorts and eliminates redundant microscale simulations. The algorithm features a combination of splines to render a low‐dimension representation of the parameter configurations of microscale simulations and a graph network representation based on their similarity. The algorithm enables the clustering of similar parameter configurations into a single one in order to reduce to a minimum the number of microscale simulations required. An implementation of the algorithm in the context of an HMM application coupling FE and MD to predict the chemically specific mechanical behavior of polymer‐graphene nanocomposites. The algorithm furnishes a threefold reduction of the computational effort with limited loss of accuracy.
Title: Accelerating Heterogeneous Multiscale Simulations of Advanced Materials Properties with Graph‐Based Clustering
Description:
AbstractHeterogeneous multiscale methods (HMM) capable of simulating asynchronously multiple scales concurrently are now tractable with the advent of exascale supercomputers.
However, naive implementations display a large number of redundancies and are very costly.
The macroscale model typically requires computations of a large number of very similar microscale simulations.
In hierarchical methods, this is barely an issue as phenomenological constitutive models are inexpensive.
However, when microscale simulations require, for example, high‐dimensional molecular dynamics (MD) or finite element (FE) simulations, redundancy must be avoided.
A clustering algorithm suited for HMM workflows is proposed that automatically sorts and eliminates redundant microscale simulations.
The algorithm features a combination of splines to render a low‐dimension representation of the parameter configurations of microscale simulations and a graph network representation based on their similarity.
The algorithm enables the clustering of similar parameter configurations into a single one in order to reduce to a minimum the number of microscale simulations required.
An implementation of the algorithm in the context of an HMM application coupling FE and MD to predict the chemically specific mechanical behavior of polymer‐graphene nanocomposites.
The algorithm furnishes a threefold reduction of the computational effort with limited loss of accuracy.
Related Results
The Kernel Rough K-Means Algorithm
The Kernel Rough K-Means Algorithm
Background:
Clustering is one of the most important data mining methods. The k-means
(c-means ) and its derivative methods are the hotspot in the field of clustering research in re...
Data Analytics on Graphs Part I: Graphs and Spectra on Graphs
Data Analytics on Graphs Part I: Graphs and Spectra on Graphs
The area of Data Analytics on graphs promises a paradigm shift, as we approach information processing of new classes of data which are typically acquired on irregular but structure...
Adaptive Graph Convolution Using Heat Kernel for Attributed Graph Clustering
Adaptive Graph Convolution Using Heat Kernel for Attributed Graph Clustering
Attributed graphs contain a lot of node features and structural relationships, and how to utilize their inherent information sufficiently to improve graph clustering performance ha...
Image clustering using exponential discriminant analysis
Image clustering using exponential discriminant analysis
Local learning based image clustering models are usually employed to deal with images sampled from the non‐linear manifold. Recently, linear discriminant analysis (LDA) based vario...
Abstract 902: Explainable AI: Graph machine learning for response prediction and biomarker discovery
Abstract 902: Explainable AI: Graph machine learning for response prediction and biomarker discovery
Abstract
Accurately predicting drug sensitivity and understanding what is driving it are major challenges in drug discovery. Graphs are a natural framework for captu...
GRACE: A General Graph Convolution Framework for Attributed Graph Clustering
GRACE: A General Graph Convolution Framework for Attributed Graph Clustering
Attributed graph clustering (AGC) is an important problem in graph mining as more and more complex data in real-world have been represented in graphs with attributed nodes. While i...
Domination of Polynomial with Application
Domination of Polynomial with Application
In this paper, .We .initiate the study of domination. polynomial , consider G=(V,E) be a simple, finite, and directed graph without. isolated. vertex .We present a study of the Ira...
E-Cordial Labeling of Some Families of Graphs
E-Cordial Labeling of Some Families of Graphs
An E-cordial labeling σ: E →{0,1} induces σ∗: V →{0,1} on graph G=(V,E), where (σ(v)=(∑_(u∈V)▒〖σ(uv)〗) mod 2 is taken over all edges uv∈E, and the labelling satisfies the condition...

