2011
DOI: 10.1016/j.micromeso.2010.08.016
|View full text |Cite
|
Sign up to set email alerts
|

In-silico simulation of porous media: Conception and development of a greedy algorithm

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1

Citation Types

0
2
0

Year Published

2015
2015
2021
2021

Publication Types

Select...
5

Relationship

0
5

Authors

Journals

citations
Cited by 11 publications
(2 citation statements)
references
References 7 publications
0
2
0
Order By: Relevance
“…Models for porous materials can also be created using computer simulations. A representative part of a porous medium could be grown in silico, using algorithms that emulate synthesis steps, like agglomeration, simulated bond breakage and formation steps in pyrolysis, simulated annealing and quenching [307,314,317,[363][364][365][366]. Already proposed by MacElroy [367], Gubbins and co-workers [314] in the 1990s, this method is likely to become more important, thanks to increased access to fast, parallel computing, better understanding of elementary synthesis steps, as well as high-resolution imaging of materials to compare the models with.…”
Section: Synthesis Mimicking Atomistic or Coarse-grained Modelsmentioning
confidence: 99%
“…Models for porous materials can also be created using computer simulations. A representative part of a porous medium could be grown in silico, using algorithms that emulate synthesis steps, like agglomeration, simulated bond breakage and formation steps in pyrolysis, simulated annealing and quenching [307,314,317,[363][364][365][366]. Already proposed by MacElroy [367], Gubbins and co-workers [314] in the 1990s, this method is likely to become more important, thanks to increased access to fast, parallel computing, better understanding of elementary synthesis steps, as well as high-resolution imaging of materials to compare the models with.…”
Section: Synthesis Mimicking Atomistic or Coarse-grained Modelsmentioning
confidence: 99%
“…The approach previously described is a sequential method and for the construction of relatively small pore networks with a high overlap (L S = 64, ∼ 1) it takes a total processing time of the order of days, in a lone PC processor. Recently, a greedy sequential algorithm [12] was implemented to decrease the construction time of pore networks. In this method, several valid (i.e.…”
Section: In Silico Simulation Of Pore Networkmentioning
confidence: 99%