Search NASA⌕ Search

SEARCH · Search NASA

Results for “COMPUTING PROBLEMS”

Search indexed NASA NTRS and DOE OSTI research on propulsion, heat transfer, battery materials and energy systems. Follow report and document links to the original sources.

Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.

At least 343 records · Page 19

Structure Factors for Hot Neutron Matter from Ab Initio Lattice Simulations with High-Fidelity Chiral Interactions

We present the first ab initio lattice calculations of spin and density correlations in hot neutron matter using high-fidelity interactions at next-to-next-to-next-to-leading order in chiral effective field theory. These correlations have a large impact on neutrino heating and shock revival in core-collapse supernovae and are encapsulated in functions called structure factors. Unfortunately, calculations of structure factors using high-fidelity chiral interactions were well out of reach using existing computational methods. In this Letter, we solve the problem using a computational approach called the rank-one operator (RO) method. The RO method is a general technique with broad applications to simulations of fermionic many-body systems. It solves the problem of exponential scaling of computational effort when using perturbation theory for higher-body operators and higher-order corrections. Using the RO method, we compute the vector and axial static structure factors for hot neutron matter as a function of temperature and density. Here, the ab initio lattice results are in good agreement with virial expansion calculations at low densities but are more reliable at higher densities. Random phase approximation codes used to estimate neutrino opacity in core-collapse supernovae simulations can now be calibrated with ab initio lattice calculations.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

Towards Z-Next: The Integration of Theory, Experiments, and Computational Simulation in a Bayesian Data Assimilation Framework

Making reliable predictions in the presence of uncertainty is critical to high-consequence modeling and simulation activities, such as those encountered at Sandia National Laboratories. Surrogate or reduced-order models are often used to mitigate the expense of performing quality uncertainty analyses with high-fidelity, physics-based codes. However, phenomenological surrogate models do not always adhere to important physics and system properties. This project develops surrogate models that integrate physical theory with experimental data through a maximally-informative framework that accounts for the many uncertainties present in computational modeling problems. Correlations between relevant outputs are preserved through the use of multi-output or co-predictive surrogate models; known physical properties (specifically monotoncity) are also preserved; and unknown physics and phenomena are detected using a causal analysis. By endowing surrogate models with key properties of the physical system being studied, their predictive power is arguably enhanced, allowing for reliable simulations and analyses at a reduced computational cost.

97 MATHEMATICS AND COMPUTING↗

Regularized Finite Element Formulations for Shear Band Instabilities in Metals

In my research I have addressed several fundamental issues of dynamic fracture: 1. established the role of heat conduction as a natural regularizing mechanism in shearband problems (i.e. using the correct physics for this problem), 2. developed a unified model to incorporate fracture through a modified phase field formulation, 3. developed stability analysis tools to determine the onset of localization, 4. developed discretization methods and solvers to solve this problem (on parallel computers) that lead to mesh insensitive results and fast convergence. For such difficult problems, the physics and numerics are strongly coupled. To accurately model the physics, one must develop reliable numerics but reliable numerics depends on correct description of the physics. To this end, we have already made significant progress in the field showing that a fully-coupled implicit solution with heat conduction is the key to obtain reliable results for shear bands (see the next sections for more details). This research fits well within the mission of DOE ASCR program on all aspects: from governing equations to discretization to solvers to parallel computers to applications problems. It also relies on the computational tools developed through the SciDAC institutes FASTMath and SDAV, such as PETSc (and SLEPc), ParaView, Trilinos and Masquite.

97 MATHEMATICS AND COMPUTING↗

A 2-D Test Problem for CFD Modeling Heat Transfer in Spent Fuel Transfer Cask Neutron Shields

In the United States, commercial spent nuclear fuel is typically moved from spent fuel pools to outdoor dry storage pads within a transfer cask system that provides radiation shielding to protect personnel and the surrounding environment. The transfer casks are cylindrical steel enclosures with integral gamma and neutron radiation shields. Since the transfer cask system must be passively cooled, decay heat removal from spent nuclear fuel canister is limited by the rate of heat transfer through the cask components, and natural convection from the transfer cask surface. The primary mode of heat transfer within the transfer cask system is conduction, but some cask designs incorporate a liquid neutron shield tank surrounding the transfer cask structural shell. In these systems, accurate prediction of natural convection within the neutron shield tank is an important part of assessing the overall thermal performance of the transfer cask system. The large-scale geometry of the neutron shield tank, which is typically an annulus approximately 2 meters in diameter but only 5-10 cm in thickness, and the relatively small scale velocities (typically less than 5 cm/s) represent a wide range of spatial and temporal scales that contribute to making this a challenging problem for computational fluid dynamics (CFD) modeling. Relevant experimental data at these scales are not available in the literature, but some recent modeling studies offer insights into numerical issues and solutions; however, the geometries in these studies, and for the experimental data in the literature at smaller scales, all have large annular gaps that are not prototypic of the transfer cask neutron shield. This paper presents results for a simple 2-D problem that is an effective numerical analog for the neutron shield application. Because it is 2-D, solutions can be obtained relatively quickly allowing a comparison and assessment of sensitivity to model parameter changes. Turbulence models are considered as well as the tradeoff between steady state and transient solutions. Solutions are compared for two commercial CFD codes, FLUENT and STAR-CCM+. The results can be used to provide input to the CFD Best Practices for this application. Following study results for the 2-D test problem, a comparison of simulation results is provided for a high Rayleigh number experiment with large annular gap. Because the geometry of this validation is significantly different from the neutron shield, and due to the critical nature of this application, the argument is made for new experiments at representative scales

11 NUCLEAR FUEL CYCLE AND FUEL MATERIALS↗

Collaborative Visualization for Large-Scale Accelerator Electromagnetic Modeling (Final Report)

This report contains the comprehensive summary of the work performed on the SBIR Phase II, Collaborative Visualization for Large-Scale Accelerator Electromagnetic Modeling at Kitware Inc. in collaboration with Stanford Linear Accelerator Center (SLAC). The goal of the work was to develop collaborative visualization tools for large-scale data as illustrated in the figure below. The solutions we proposed address the typical problems faced by geographicallyand organizationally-separated research and engineering teams, who produce large data (either through simulation or experimental measurement) and wish to work together to analyze and understand their data. Because the data is large, we expect that it cannot be easily transported to each team member's work site, and that the visualization server must reside near the data. Further, we also expect that each work site has heterogeneous resources: some with large computing clients, tiled (or large) displays and high bandwidth; others sites as simple as a team member on a laptop computer. Our solution is based on the open-source, widely used ParaView large-data visualization application. We extended this tool to support multiple collaborative clients who may locally visualize data, and then periodically rejoin and synchronize with the group to discuss their findings. Options for managing session control, adding annotation, and defining the visualization pipeline, among others, were incorporated. We also developed and deployed a Web visualization framework based on ParaView that enables the Web browser to act as a participating client in a collaborative session. The ParaView Web Visualization framework leverages various Web technologies including WebGL, JavaScript, Java and Flash to enable interactive 3D visualization over the web using ParaView as the visualization server. We steered the development of this technology by teaming with the SLAC National Accelerator Laboratory. SLAC has a computationally-intensive problem important to the nations scientific progress as described shortly. Further, SLAC researchers routinely generate massive amounts of data, and frequently collaborate with other researchers located around the world. Thus SLAC is an ideal teammate through which to develop, test and deploy this technology. The nature of the datasets generated by simulations performed at SLAC presented unique visualization challenges especially when dealing with higher-order elements that were addressed during this Phase II. During this Phase II, we have developed a strong platform for collaborative visualization based on ParaView. We have developed and deployed a ParaView Web Visualization framework that can be used for effective collaboration over the Web. Collaborating and visualizing over the Web presents the community with unique opportunities for sharing and accessing visualization and HPC resources that hitherto with either inaccessible or difficult to use. The technology we developed in here will alleviate both these issues as it becomes widely deployed and adopted.

43 PARTICLE ACCELERATORS↗

On the convexity of phase-field fracture formulations: Analytical study and comparison of various degradation functions

Efficient and accurate fracture modeling is of great importance in applications where catastrophic outcomes under extreme scenarios are possible. The phase-field (PF) approach to fracture received significant attention over the past decade, due to its capability to capture complicated fracture patterns (e.g., crack merging and branching). Specifically, crack initiation and propagation are modeled via minimization of the total energy functional, which is regularized with the aid of a phase field. Despite the promising results and modeling capabilities of the PF method in many applications, the solution of fracture problems remains computationally challenging mainly due to the non-convexity of the total energy functional with respect to the combined unknown (phase field and displacement) fields. Understanding the effects of their coupling on convexity is crucial in order to address frequently encountered hurdles in fracture modeling (e.g., inefficient solvers and non-physical crack nucleation). In this paper, we develop convexity criteria for a wide class of PF fracture formulations. For this class of formulations, the second variation of the total energy functional is expressed in terms of Hessian matrices (evaluated at individual material points). Depending on the choice of geometric crack functions and degradation functions, we classify the formulations into three categories and analytically study each one separately. To study the sign of the second variation, we derive inequalities which are satisfied at material points when the Hessian matrix is locally positive semi-definite. These inequalities provide objective criteria for comparing degradation functions. Finally, the applicability of the proposed convexity criteria is demonstrated in the context of a one-dimensional problem, solved using a conventional monolithic solver.

97 MATHEMATICS AND COMPUTING↗

Surface Remeshing with Robust High-Order Reconstruction

Remeshing is an important problem in variety of applications, such as finite element methods and geometry processing. Surface remeshing poses some unique challenges, as it must deliver not only good mesh quality but also good geometric accuracy. For applications such as finite elements with high-order elements (quadratic or cubic elements), the geometry must be preserved to high-order (third-order or higher) accuracy, since low-order accuracy may undermine the convergence of numerical computations. The problem is particularly challenging if the CAD model is not available for the underlying geometry, and is even more so if the surface meshes contain some inverted elements. We describe remeshing strategies that can simultaneously produce high-quality triangular meshes, untangling mildly folded triangles and preserve the geometry to high-order of accuracy. Our approach extends our earlier works on high-order surface reconstruction and mesh optimization by enhancing its robustness with a geometric limiter for under-resolved geometries. We also integrate high-order surface reconstruction with surface mesh adaptation techniques, which alter the number of triangles and nodes. We demonstrate the utilization of our method to meshes for high-order finite elements, biomedical image-based surface meshes, and complex interface meshes in fluid simulations.

Ray, Navamita↗

Quantifying uncertainty for deep learning based forecasting and flow-reconstruction using neural architecture search ensembles

Classical problems in computational physics such as data-driven forecasting and signal reconstruction from sparse sensors have recently seen an explosion in deep neural network (DNN) based algorithmic approaches. However, most DNN models do not provide uncertainty estimates, which are crucial for establishing the trustworthiness of these techniques in downstream decision making tasks and scenarios. In recent years, ensemble-based methods have achieved significant success for the uncertainty quantification in DNNs on a number of benchmark problems. However, their performance on real-world applications remains under-explored. In this work, we present an automated approach to DNN discovery and demonstrate how this may also be utilized for ensemble-based uncertainty quantification. Specifically, we propose the use of a scalable neural and hyperparameter architecture search for discovering an ensemble of DNN models for complex dynamical systems. We highlight how the proposed method not only discovers high-performing neural network ensembles for our tasks, but also quantifies uncertainty seamlessly. This is achieved by using genetic algorithms and Bayesian optimization for sampling the search space of neural network architectures and hyperparameters. Subsequently, a model selection approach is used to identify candidate models for an ensemble set construction. Afterwards, a variance decomposition approach is used to estimate the uncertainty of the predictions from the ensemble. We demonstrate the feasibility of this framework for two tasks — forecasting from historical data and flow reconstruction from sparse sensors for the sea-surface temperature. In conclusion, we demonstrate superior performance from the ensemble in contrast with individual high-performing models and other benchmarks.

Deep ensembles↗

Machine-learning error models for approximate solutions to parameterized systems of nonlinear equations

Here, this work proposes a machine-learning framework for constructing statistical models of errors incurred by approximate solutions to parameterized systems of nonlinear equations. These approximate solutions may arise from early termination of an iterative method, a lower-fidelity model, or a projection-based reduced-order model, for example. The proposed statistical model comprises the sum of a deterministic regression-function model and a stochastic noise model. The method constructs the regression-function model by applying regression techniques from machine learning (e.g., support vector regression, artificial neural networks) to map features (i.e., error indicators such as sampled elements of the residual) to a prediction of the approximate-solution error. The method constructs the noise model as a mean-zero Gaussian random variable whose variance is computed as the sample variance of the approximate-solution error on a test set; this variance can be interpreted as the epistemic uncertainty introduced by the approximate solution. This work considers a wide range of feature-engineering methods, data-set-construction techniques, and regression techniques that aim to ensure that (1) the features are cheaply computable, (2) the noise model exhibits low variance (i.e., low epistemic uncertainty introduced), and (3) the regression model generalizes to independent test data. Finally, numerical experiments performed on several computational-mechanics problems and types of approximate solutions demonstrate the ability of the method to generate statistical models of the error that satisfy these criteria and significantly outperform more commonly adopted approaches for error modeling.

97 MATHEMATICS AND COMPUTING↗

Beyond Hosting Capacity: Using Shortest-Path Methods to Minimize Upgrade Cost Pathways

This paper presents a graph-based forward looking algorithm applied to distribution planning in the context of distributed photovoltaic penetration. We study the target hosting capacity problem where the objective is to find the least-cost sequence of system upgrades to reach a predefined hosting capacity target value. We show that commonly used short-term cost minimization approaches often lead to suboptimal long-term solutions. By comparing our method against such myopic techniques on real distribution systems, we show that our algorithm is able to reduce the overall integration costs by looking at future decisions. Because hosting capacity is hard to compute, this problem requires efficient methods to search the space. We demonstrate that heuristics using domain-specific knowledge can be efficiently used to improve the algorithm performance, such that real distribution systems can be studied.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Individual Wave Detection and Tracking within a Rotating Detonation Engine through Computer Vision Object Detection applied to High-Speed Images

Known for their simplistic design and continuous detonation, rotating detonation engines (RDEs) constitute a majority of current pressure gain combustion (PGC) research efforts. Experimental RDE operation times have been continuously extended through the use of rig cooling techniques. As the window of observable behavior is expanded, and as the technology matures toward eventual integration within gas turbines, monitoring techniques must evolve to better match industrial diagnostics. High-speed image analysis techniques prove useful to capture and evaluate the unsteady detonation behavior within the RDE. Traditional image analysis techniques, however, require extensive processing times which prohibit simultaneous monitoring. To better address this problem, a computer vision object detection methodology is proposed to quickly detect individual detonation waves within a single down-axis image. Detonation waves are detected in individual images by the implemented computer vision method You Only Look Once (YOLO) object detection network. In order to detect detonation waves, the network must first be trained using RDE images of interest, for which each required phase of network development is outlined. Detection of waves is improved through proper treatment of the collected image set, variation of Intersection over Union (IoU) and confidence thresholding, and through a parametric study of annotation dimensions. Each detected wave is described by its location and rotational direction, and locations are tracked to calculate wave velocity across each frame, leading to a timestep resolution of 20 µs. Wave velocities are also calculated through a series of frames, leading to a suitable average velocity estimation using as few as 10 frames. Uncertainty analysis accounting for variation in camera framerate, pixel width and annotation centroid locations estimates a total uncertainty of ±4.3% for velocity calculations, using the smallest annotation boxes. This method offers great reductions in processing times, as a step toward real-time monitoring of detonation waves within an RDE. Improving on previous studies, this technique is impartial to wave modes not included in the original training set and calculates wave velocities independent of high-speed pressure data. The ability to isolate waves within predicted bounding boxes will likely facilitate analysis of pixel intensity variation as an estimation of wave strength in future work.

Johnson, Kristyn↗

Beyond Hosting Capacity: Using Shortest Path Methods to Minimize Upgrade Cost Pathways: Preprint

We present in this paper a graph based forwardlooking algorithm applied to distribution planning in the context of distributed PV penetration. We study the target hosting capacity (THC) problem where the objective is to find the cheapest sequence of system upgrades to reach a predefined hosting capacity target value. We show in this paper that commonly used short-term cost minimization approaches lead most of the time to suboptimal solutions. By comparing our method against such myopic techniques on real distribution systems, we show that our algorithm is able to reduce the overall integration costs by looking at future decisions. Because hosting capacity is hard to compute, this problem requires efficient methods to search the space. We demonstrate here that heuristics using domain specific knowledge can be efficiently used to improve the algorithm performance such that real distribution systems can be studied.

14 SOLAR ENERGY↗

Individual Wave Detection and Tracking within a Rotating Detonation Engine through Computer Vision Object Detection applied to High-Speed Images

Known for their simplistic design and continuous detonation, rotating detonation engines (RDEs) constitute a majority of current pressure gain combustion (PGC) research efforts. Experimental RDE operation times have been continuously extended through the use of rig cooling techniques. As the window of observable behavior is expanded, and as the technology matures toward eventual integration within gas turbines, monitoring techniques must evolve to better match industrial diagnostics. High-speed image analysis techniques prove useful to capture and evaluate the unsteady detonation behavior within the RDE. Traditional image analysis techniques, however, require extensive processing times which prohibit simultaneous monitoring. To better address this problem, a computer vision object detection methodology is proposed to quickly detect individual detonation waves within a single down-axis image. Detonation waves are detected in individual images by the implemented computer vision method You Only Look Once (YOLO) object detection network. In order to detect detonation waves, the network must first be trained using RDE images of interest, for which each required phase of network development is outlined. Detection of waves is improved through proper treatment of the collected image set, variation of Intersection over Union (IoU) and confidence thresholding, and through a parametric study of annotation dimensions. Each detected wave is described by its location and rotational direction, and locations are tracked to calculate wave velocity across each frame, leading to a timestep resolution of 20 µs. Wave velocities are also calculated through a series of frames, leading to a suitable average velocity estimation using as few as 10 frames. Uncertainty analysis accounting for variation in camera framerate, pixel width and annotation centroid locations estimates a total uncertainty of ±4.3% for velocity calculations, using the smallest annotation boxes. This method offers great reductions in processing times, as a step toward real-time monitoring of detonation waves within an RDE. Improving on previous studies, this technique is impartial to wave modes not included in the original training set and calculates wave velocities independent of high-speed pressure data. The ability to isolate waves within predicted bounding boxes will likely facilitate analysis of pixel intensity variation as an estimation of wave strength in future work.

Johnson, Kristyn↗

Performance Efficiency and Effectivness of Supercomputers

Our first purpose here is to offer to a general technical and policy audience a perspective on whether the supercomputing community should focus on improving the efficiency of supercomputing systems and their use rather than on building larger and ostensibly more capable systems that are used at low efficiency. After first summarizing our content and defining some necessary terms, we give a concise answer to this question. We then set this in context by characterizing performance of current supercomputing systems on a variety of benchmark problems and actual problems drawn from workloads in the national security, industrial, and scientific context. Along the way we answer some related questions, identify some important technological trends, and offer a perspective on the significance of these trends. Our second purpose is to give a reasonably broad and transparent overview of the related issue space and thereby to better equip the reader to evaluate commentary and controversy concerning supercomputing performance. For example, questions repeatedly arise concerning the Linpack benchmark and its predictive power, so we consider this in moderate depth as an example. We also characterize benchmark and application performance for scientific and engineering use of supercomputers and offer some guidance on how to think about these. Examples here are drawn from traditional scientific computing. Other problem domains, for example, data analytics, have different performance characteristics that are better captured by different benchmark problems or applications, but the story in those domains is similar in character and leads to similar conclusions with regard to the motivating question.

32 ENERGY CONSERVATION, CONSUMPTION, AND UTILIZATI↗

Disconnected Diagrams in Lattice QCD

In this work, we present state-of-the-art numerical methods and their applications for computing a particular class of observables using lattice quantum chromodynamics (Lattice QCD), a discretized version of the fundamental theory of quarks and gluons. These observables require calculating so called \disconnected diagrams" and are important for understanding many aspects of hadron structure, such as the strange content of the proton. We begin by introducing the reader to the key concepts of Lattice QCD and rigorously define the meaning of disconnected diagrams through an example of the Wick contractions of the nucleon. Subsequently, the calculation of observables requiring disconnected diagrams is posed as the computationally challenging problem of finding the trace of the inverse of an incredibly large, sparse matrix. This is followed by a brief primer of numerical sparse matrix techniques that overviews broadly used methods in Lattice QCD and builds the background for the novel algorithm presented in this work. We then introduce singular value deflation as a method to improve convergence of trace estimation and analyze its effects on matrices from a variety of fields, including chemical transport modeling, magnetohydrodynamics, and QCD. Finally, we apply this method to compute observables such as the strange axial charge of the proton and strange sigma terms in light nuclei. The work in this thesis is innovative for four reasons. First, we analyze the effects of deflation with a model that makes qualitative predictions about its effectiveness, taking only the singular value spectrum as input, and compare deflated variance with different types of trace estimator noise. Second, the synergy between probing methods and deflation is investigated both experimentally and theoretically. Third, we use the synergistic combination of deflation and a graph coloring algorithm known as hierarchical probing to conduct a lattice calculation of light disconnected matrix elements of the nucleon at two different values of the lattice spacing. Finally, we employ these algorithms to do a high-precision study of strange sigma terms in light nuclei; to our knowledge this is the first calculation of its kind from Lattice QCD.

Gambhir, Arjun↗

Modified semi-classical methods for nonlinear quantum oscillations problems

We develop a modified semi-classical approach to the approximate solution of Schroedinger's equation for certain nonlinear quantum oscillations problems. In our approach, at lowest order, the Hamilton-Jacobi equation of the conventional semi-classical formalism is replaced by an inverted-potential-vanishing-energy variant thereof. With suitable smoothness, convexity and coercivity properties imposed on its potential energy function, we prove, using methods drawn from the calculus of variations together with the (Banach space) implicit function theorem, the existence of a global, smooth 'fundamental solution' to this equation. Higher order quantum corrections thereto, for both ground and excited states, can then be computed through the integration of associated systems of linear transport equations, derived from Schroedinger's equation, and formal expansions for the corresponding energy eigenvalues obtained therefrom by imposing the natural demand for smoothness on the (successively computed) quantum corrections to the eigenfunctions. For the special case of linear oscillators our expansions naturally truncate, reproducing the well-known exact solutions for the energy eigenfunctions and eigenvalues. As an explicit application of our methods to computable nonlinear problems, we calculate a number of terms in the corresponding expansions for the one-dimensional anharmonic oscillators of quartic, sectic, octic, and dectic types and compare the results obtained with those of conventional Rayleigh/Schroedinger perturbation theory. To the orders considered (and, conjecturally, to all orders) our eigenvalue expansions agree with those of Rayleigh/Schroedinger theory whereas our wave functions more accurately capture the more-rapid-than-gaussian decay known to hold for the exact solutions to these problems. For the quartic oscillator in particular our results strongly suggest that both the ground state energy eigenvalue expansion and its associated wave function expansion are Borel summable to yield natural candidates for the actual exact ground state solution and its energy. Our techniques for proving the existence of the crucial 'fundamental solution' to the relevant (inverted-potential-vanishing-energy) Hamilton-Jacobi equation have the important property of admitting interesting infinite dimensional generalizations. In a project paralleling the present one we shall show how this basic construction can be carried out for the Yang-Mills equations in Minkowski spacetime.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Quantum many-body calculations using body-centered cubic lattices

It is often computationally advantageous to model space as a discrete set of points forming a lattice grid. This technique is particularly useful for computationally difficult problems such as quantum many-body systems. For reasons of simplicity and familiarity, nearly all quantum many-body calculations have been performed on simple cubic lattices. Since the removal of lattice artifacts is often an important concern, it would be useful to perform calculations using more than one lattice geometry. In this paper we show how to perform quantum many-body calculations using auxiliary-field Monte Carlo simulations on a three-dimensional body-centered cubic (BCC) lattice. As a benchmark test we compute the ground state energy of 33 spin-up and 33 spin-down neutrons in the unitary limit, which is an idealized limit where the interaction range is zero and scattering length is infinite. As a fraction of the free Fermi gas energy E FG , we find that the ground state energy is E 0 /E FG =0.369(2),0.371(2), using two different definitions of the finite-system energy ratio. This is in excellent agreement with recent results obtained on a cubic lattice [He et al., Phys. Rev. A 101, 063615 (2020)]. We find that the computational effort and performance on a BCC lattice is approximately the same as that for a cubic lattice with the same number of lattice points. We discuss how the lattice simulations with different geometries can be used to constrain the size of lattice artifacts in simulations of continuum quantum many-body systems.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

A sub-pore model for multi-scale reaction–diffusion problems in porous media

Applications of reaction–diffusion systems in porous media pose a challenging problem for computational modeling approaches due to their multi-physics and multi-scale nature. The length scales usually span 3–4 orders of magnitude while physical phenomena involved include heat and mass transfer processes, and surface reactions. In this paper, a novel methodology that accounts for all the length scales and physical phenomena involved in a single framework is described. A length scale based dual approach is proposed – the larger pore channels (macro-pores) are resolved using conventional numerical techniques and a novel ‘sub-pore’ model is used to account for the unresolved pore channels (sub-pores) and the important physics therein. The porous network in the sub-pore system is composed of a fractal-like hierarchical system of straight cylindrical pores. Simplified governing equations for mass and energy transport are solved within the sub-pore system along with a reaction kinetics model to account for surface adsorption. An implicit coupling strategy is used to couple the macro-pore and the sub-pore systems so as to ensure conservation. The developed methodology is then applied to a few test cases and it is established that the proposed framework is necessary for problems where the adsorption time scale is much smaller than (diffusion-limited) or comparable to the diffusion time scale. Furthermore, it is also demonstrated that the framework can be potentially used to model the network of porous channels in its entirety thus significantly reducing computational costs.

36 MATERIALS SCIENCE↗