Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “implicit methods”

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 163 records · Page 9

An FFT-based approach for Bloch wave analysis: application to polycrystals

A method based on the Fast Fourier Transform is proposed to obtain the dispersion relation of acoustic waves in heterogeneous periodic media with arbitrary microstructures. The microstructure is explicitly considered using a voxelized Representative Volume Element (RVE). The dispersion diagram is obtained solving an eigenvalue problem for Bloch waves in Fourier space. To this aim, two linear operators representing stiffness and mass are defined through the use of differential operators in Fourier space. The smallest eigenvalues are obtained using the implicitly restarted Lanczos and the subspace iteration methods, and the required inverse of the stiffness operator is done using the conjugate gradient with a preconditioner. The method is used to study the propagation of acoustic waves in elastic polycrystals, showing the strong effect of crystal anistropy and polycrystaline texture on the propagation. It is shown that the method combines the simplicity of classical Fourier series analysis with the versatility of Finite Elements to account for complex geometries proving an efficient and general approach which allows the use of large RVEs in 3D.

97 MATHEMATICS AND COMPUTING↗

Considering computational speed vs. accuracy: Choosing appropriate mesoscale RVE boundary conditions

Modeling a material’s microstructure using continuum theories allows for inspection of the relationship between coarse scale and fine scale behaviors. Computational limits generally require selection of a sub-volume from a bulk sample in order to directly model the microstructure. Boundary conditions are applied to the sub-volume to mimic the excluded bulk material. Appropriate selection of boundary conditions helps effectively determine the appropriate spatial scale required of the sub-volume. Applicable boundary conditions include direct displacement, periodic, and uniform traction. While direct displacement and periodic boundary conditions are commonly used, uniform traction boundary conditions have seen limited use due to rigid body stability issues in simulations of compression or shear deformation. A new application of uniform traction boundary conditions was developed through linear constraint equations, similar to approaches employed by direct displacement and periodic boundary conditions, to quench rigid body motions with minimal interference of the relative deformation of the model. These boundary conditions were tested by compressing several synthetically generated periodic microstructures using the finite element method. Evaluating the effective stiffness along the compression axis, the direct displacement boundary condition produced the stiffest response, whereas the uniform traction boundary condition produced the most compliant. Periodic boundary conditions produced the same response for all volumes analyzed and both the direct displacement and uniform traction boundary conditions trended toward the periodic response as the domain volume increased. Computational performance was also evaluated for each boundary condition using implicit and explicit solvers. Direct displacement boundary conditions presented the lowest computational cost of all of the boundary conditions followed by periodic then uniform traction. The computational expense of periodic and uniform traction boundary conditions limited the viable spatial scale and mesh resolutions able to be simulated. Selection of appropriate boundary conditions for specific uses need to be a balance between allowable computational expense and accuracy of the method. Techniques for evaluating which boundary conditions to use are discussed.

42 ENGINEERING↗

Liquid Phase Modeling in Porous Media: Adsorption of Methanol and Ethanol in H-MFI in Condensed Water

Zeolites are used in the chemical and separation industries for their exceptional selectivity, adsorption capacity, regenerability, and stability in gas and liquid phase processing. Here, we developed an explicit solvation method for predicting solvent/condensed phase effects on adsorption free energies in microporous media such as zeolites based on the hybrid quantum mechanical/molecular mechanical free energy perturbation (QM/MM-FEP) technique. Our explicit solvation method for zeolite systems, called eSZS, aims to capture site-specific interactions during the adsorption process at the Brønsted acid sites of H-MFI zeolite while still considering the diverse configuration space of the solvent molecules. This strategy is ideal for chemical reactions or adsorbates that interact with the microporous medium in few distinct adsorbate/transition state configurations, i.e., the harmonic or similar approximations are acceptable for the adsorbate/transition state while such approximations break down for the solvent molecules that require extensive configuration space sampling. In this way, our approach effectively overcomes the limitations of implicit solvation models and classical force field methods for describing solvation effects on chemical reactions within porous materials such as zeolites. Specifically, in this study, we investigated various aspects of our hybrid QM/MM approach, including QM cluster size dependencies in a periodic electrostatically embedded cluster model (PEECM), rules for link atoms at the QM/MM boundary, and functional and basis set considerations for converged and reasonably accurate gas and aqueous phase methanol and ethanol adsorption free energy predictions in H-MFI. For gas phase adsorption of methanol and ethanol in H-MFI at a Brønsted acid site in T12 position, we compute adsorption free energies at 298 K of −0.61 and −0.75 eV, respectively, using a PEECM containing 50 Si and 1 Al atom with ωB97x-D/def2-TZVP level of theory. For solvent effect calculations, we sample the aqueous phase using grand canonical Monte Carlo (GCMC) simulations to (1) obtain a mean field of electrostatic interactions in the reaction system and (2) perform a rigorous free energy perturbation calculation. Similar to the experimentally and computationally observed endergonic solvation effects observed for hydrocarbon adsorption on metal surfaces, we also observe that a condensed aqueous environment destabilizes methanol and ethanol at these acid sites in H-MFI at 298 K. Specifically, the computed solvation free energies of adsorption (ΔΔG solv ) for methanol and ethanol are +0.44 and +0.54 eV, respectively. From this study, it is evident that adsorbates (methanol and ethanol) are competing with water for adsorption space inside the H-MFI zeolite, leading to an endergonic solvation effect. Here, we expect that the endergonic, aqueous solvent effect during adsorption in microporous zeolites is highly tunable by changing the pore size and hydrophobicity of the microporous material as this will affect the water density inside the pore structure.

Adsorption↗

Scalable edge clustering of dynamic graphs via weighted line graphs

Timestamped relational datasets consisting of records (or connections) between pairs of entities are ubiquitous in network science. For applications like peer-to-peer communication, email, various social network interactions, and computer network security, it is useful to organize these records into groups based on how and when they are occurring. Weighted line graphs offer a natural way to model how records are related in such datasets but for large real-world graph topologies, building and utilizing the line graph is prohibitively expensive. Here, we present the framework to cluster the edges of a dynamic graph via the associated line graph that contains two major contributions. The first is a method to work with the line graph implicitly and the second is a distributed scale implementation of an agglomerative hierarchical graph clustering algorithm. We outline a novel hierarchical dynamic graph edge clustering approach that efficiently breaks massive relational datasets into small sets of edges containing events at various timescales. This is in stark contrast to traditional graph clustering algorithms that prioritize highly connected (clique-like) community structures. Our approach relies on constructing a sufficient subgraph of a weighted line graph and applying a hierarchical agglomerative clustering. This approach is related to scalable techniques from spatial clustering, nonlinear-dimension reduction, topological data analysis, and draws particular inspiration from HDBSCAN. As an edge clustering, this method yields an overlapping node clustering. Our algorithm is parallelizable and we demonstrate efficient clustering of a billion-scale, real-world dynamic graph into small edge sets that correlate in topology and time. The entire clustering process for a graph with tens of billions of edges takes just a few minutes of run time on 256 nodes of a distributed compute environment. We argue how the output of the edge clustering is useful for a multitude of data visualization and powerful machine learning tasks, both involving the original massive dynamic graph data and metadata associated with the nodes and edges. Finally, we describe how this approach can be extended to dynamic hypergraphs and dynamic graphs/hypergraphs with unstructured data living on vertices and edges.

Data Analysis↗

A Level Set Model for Structured Mesh Representation of Fibrous Preforms used in Composites Manufacturing

Here, a model for implicit representation of fibrous and woven preforms used for composites manufacturing is described. The method is based on a level set function defined on a structured mesh to implicitly capture the complex fiber and weave geometries. Since most software packages used to model woven preforms are based on unstructured mesh, a numerical model for transforming a discretized surface to a structured mesh representation and vice-a-versa is presented. Specific emphasis is on scalable computation of a level set function for large and complex 3D woven structures from a triangulated surface of the smallest unit (yarn). The model is applied to capture a periodic 3D layered 5-harness satin (5HS) weave geometry on a structured mesh. Geometric transformations needed to efficiently compute the level set function for the 3D structure on a high resolution mesh are described. Effects of mesh resolution on the geometric features such as number of resolved fibers, effective fiber size, and the surface area to volume ratio of the iso-surface are analyzed. Using the distance property of the level set function, an approach to evaluate the structure function resulting from transient evolving topology representing densification due to matrix phase depositions is also presented. The approach captures transition of the geometric characteristic from fiber governed at early stages of densification to yarn governed at the terminal stage.

36 MATERIALS SCIENCE↗

Grain boundary effects in high-temperature liquid-metal dealloying: a multi-phase field study

Abstract A multi-phase field model is employed to study the microstructural evolution of an alloy undergoing liquid dealloying, specifically considering the role of grain boundaries. A semi-implicit time-stepping algorithm using spectral methods is implemented, which enables simulating large 2D and 3D domains over long time scales while still maintaining a realistic interfacial thickness. Simulations reveal a mechanism of coupled grain–boundary migration to maintain equilibrium contact angles with the topologically complex solid–liquid interface, which locally accelerates diffusion-coupled growth of a liquid channel into the precursor. This mechanism asymmetrically disrupts the ligament connectivity of the dealloyed structure in qualitative agreement with published experimental observations. The grain boundary migration-assisted corrosion channels form even for precursors with small amounts of the dissolving alloy species, below the parting limit . The activation of this grain boundary dealloying mechanism depends strongly on grain boundary mobility.

36 MATERIALS SCIENCE↗

The Challenges of Safe Troubleshooting Work

Troubleshooting work presents electrical and other workers with a challenging combination of physical hazards, working conditions, and time pressure, which can lead to unwanted outcomes if not carefully managed. Summaries of several incidents in which workers were injured or at risk of injury while performing troubleshooting work are presented, identifying organizational weaknesses and error precursors that contributed to each incident. The primary challenges include: Deranged equipment. Equipment that needs troubleshooting is not in a normal operating condition. Actions that are safe when the equipment is in a normal state may not be safe in the deranged state. Work planning and control. The steps taken in troubleshooting are most often determined by the results of the immediately previous diagnostic test, making effective work planning challenging. Multiple types of hazards. Most equipment will present a troubleshooting worker with several types of hazards, including hazardous energy as defined in 29 CFR 1910.147. Portions of the troubleshooting activity may be infeasible without these hazards present. Time pressure. Restoring operation of failed equipment often involves an explicit or implicit sense of urgency. There are effective methods for addressing each challenge, most of which require a combination of advance preparation and management commitment.

Mertz, David E.↗

A Mixed-Method Design Approach for Empirically Based Selection of Unbiased Data Annotators

Implicit bias embedded in the annotated data is by far the greatest impediment in the effectual use of supervised machine learning models in tasks involving race, ethics, and geopolitical polarization. For societal good and demonstrable positive impact on wider society, it is paramount to carefully select data annotators and rigorously validate the annotation process. Current approaches to selecting annotators are not sufficiently grounded in scientific principles and are limited at the policy-guidance level, thereby rendering them unusable for machine learning practitioners. This work proposes a new approach based on the mixed-methods design that is functional, adaptable, and simpler to implement in selecting unbiased annotators for any machine learning problem. By demonstrating it on a real-world geopolitical problem, we also identified and ranked key inane profile characteristics towards an empirically-based selection of unbiased data annotators.

Thakur, Gautam Malviya↗

Optimal experimental design: Formulations and computations

Questions of ‘how best to acquire data’ are essential to modelling and prediction in the natural and social sciences, engineering applications, and beyond. Optimal experimental design (OED) formalizes these questions and creates computational methods to answer them. This article presents a systematic survey of modern OED, from its foundations in classical design theory to current research involving OED for complex models. We begin by reviewing criteria used to formulate an OED problem and thus to encode the goal of performing an experiment. We emphasize the flexibility of the Bayesian and decision-theoretic approach, which encompasses information-based criteria that are well-suited to nonlinear and non-Gaussian statistical models. We then discuss methods for estimating or bounding the values of these design criteria; this endeavour can be quite challenging due to strong nonlinearities, high parameter dimension, large per-sample costs, or settings where the model is implicit. A complementary set of computational issues involves optimization methods used to find a design; we discuss such methods in the discrete (combinatorial) setting of observation selection and in settings where an exact design can be continuously parametrized. Finally we present emerging methods for sequential OED that build non-myopic design policies, rather than explicit designs; these methods naturally adapt to the outcomes of past experiments in proposing new experiments, while seeking coordination among all experiments to be performed. Throughout, we highlight important open questions and challenges.

97 MATHEMATICS AND COMPUTING↗

A symbolic framework to obtain mid-fidelity models of flexible multibody systems with application to horizontal-axis wind turbines

Abstract. The article presents a symbolic framework (also called computer algebra program) that is used to obtain, in symbolic mathematical form, the linear and nonlinear equations of motion of a mid-fidelity multibody system including rigid and flexible bodies. Our approach is based on Kane's method and a nonlinear shape function representation for flexible bodies. The shape function approach does not represent the state of the art for flexible multibody dynamics but is an effective trade-off to obtain mid-fidelity models with few degrees of freedom, taking advantage of the separation of space and time. The method yields compact symbolic equations of motion with implicit account of the constraints. The general and automatic framework facilitates the creation and manipulation of models with various levels of complexity by adding or removing degrees of freedom. The symbolic treatment allows for analytical gradients and linearized equations of motion. The linear and nonlinear equations can be exported to Python code or dedicated software. There are multiple applications, such as time domain simulation, stability analyses, frequency domain analyses, advanced controller design, state observers, and digital twins. In this article, we describe the method we used to systematically generate the equations of motion of multibody systems and present the implementation of the framework using the Python package SymPy. We apply the framework to generate illustrative land-based and offshore wind turbine models. We compare our results with OpenFAST simulations and discuss the advantages and limitations of the method. The Python implementation is provided as an open-source project.

Branlard, Emmanuel (ORCID:0000000277506128)↗

The Schwarz alternating method for transient solid dynamics

Abstract In our earlier work, we formulated the Schwarz alternating method as a means for concurrent multiscale coupling in finite deformation solid mechanics for quasi‐static problems. Herein, we advance this method for the study of transient dynamic multiscale solid mechanics problems where information is exchanged back and forth between small and large scales. The extension to dynamics relies on the notion of a global time stepper. Within each global time step, the subdomains are coupled by the standard Schwarz iterative process. Remarkably, each subdomain can use its own time step or even its own time integrator to advance its solution in time, provided that they synchronize at each global time step. We study the performance of the Schwarz method on several examples designed for this purpose. Our numerical experiments demonstrate that the method is capable of coupling regions with different mesh resolutions, different element types, and different time integration schemes (e.g., implicit and explicit), all without introducing any artifacts that afflict other coupling methods for transient dynamics. Finally, we apply the dynamic Schwarz alternating method to the simulation of a bolted joint subjected to dynamic loading, as a demonstration of the performance of the method in a realistic scenario.

Mota, Alejandro↗

Sylvester-preconditioned adaptive-rank implicit time integrators for advection-diffusion equations with variable coefficients

Here, we consider the adaptive-rank integration of multi-dimensional time-dependent advection-diffusion partial differential equations (PDEs) with variable coefficients. We employ a standard finite-difference method for spatial discretization coupled with high-order diagonally implicit Runge-Kutta temporal schemes. The discrete equation is a generalized Sylvester equation (GSE), which we solve with a projection-based adaptive-rank algorithm structured around two key strategies: (i) constructing dimension-wise subspaces using a novel atypical extended Krylov strategy, and (ii) efficiently solving the basis coefficient matrix with a preconditioned GMRES solver. The low-rank decomposition is performed in 2D using SVD and with high-order SVD (HOSVD) in 3D to represent the tensor in a compressed Tucker format. For d-dimensional problems (here, d = 2 or 3), the computational complexity and memory storage of the approach are found numerically to scale as and $\mathscr{O}(Nr^2) + \mathscr{O} (r^{d+1})$ and $\mathscr{O}(Nr) + \mathscr{O} (r^{d})$, respectively, with the one-dimensional resolution and the maximal rank during the Krylov iteration (which we find to be largely independent of on our numerical examples). We present numerical examples that illustrate the advertised properties of the algorithm.

97 MATHEMATICS AND COMPUTING↗

Numerical schemes for a multi-species BGK model with velocity-dependent collision frequency

Here, we consider a kinetic description of multi-species gas mixture modeled with Bhatnagar-Gross-Krook (BGK) collision operators, in which the collision frequency varies not only in time and space but also with the microscopic velocity. In this model, the Maxwellians typically used in standard BGK operators are replaced by a generalization of such target functions, which are defined by a variational procedure. In this paper we present a numerical method for simulating this model, which uses an Implicit-Explicit (IMEX) scheme to minimize a certain potential function, mimicking the Lagrange functional that appears in the theoretical derivation. We show that theoretical properties such as conservation of mass, total momentum and total energy as well as positivity of the distribution functions are preserved by the numerical method, and illustrate its usefulness and effectiveness with numerical examples.

97 MATHEMATICS AND COMPUTING↗

A sharp immersed method for 2D flow-body interactions using the vorticity-velocity Navier-Stokes equations

Immersed methods discretize boundary conditions for complex geometries on background Cartesian grids. Here, this makes such methods especially suitable for two-way coupled flow-body problems, where the body mechanics are partially driven by hydrodynamic forces. However, for the vorticity-velocity form of the Navier-Stokes equations, existing immersed geometry discretizations for two-way coupled problems only achieve first order spatial accuracy near solid boundaries. Here we introduce a sharp-interface approach based on the immersed interface method to handle the one- and two-way coupling between an incompressible flow and one or more rigid bodies using the 2D vorticity-velocity Navier-Stokes equations. Our main contributions are three-fold. First, we develop and analyze a moving boundary treatment for sharp immersed methods that can be applied to PDEs with implicitly defined boundary conditions, such as those commonly imposed on the vorticity field. Second, we develop a two-way coupling methodology for the vorticity-velocity Navier-Stokes equations based on control-volume momentum balance that does not require the pressure field. Third, we show through extensive testing and validation that our resulting flow-body solver reaches second-order accuracy for most practical scenarios, and provides significant efficiency benefits compared to a representative first-order approach.

42 ENGINEERING↗

A Hybrid Lagrangian/Eulerian Collocated Velocity Advection and Projection Method for Fluid Simulation

Abstract We present a hybrid particle/grid approach for simulating incompressible fluids on collocated velocity grids. Our approach supports both particle‐based Lagrangian advection in very detailed regions of the flow and efficient Eulerian grid‐based advection in other regions of the flow. A novel Backward Semi‐Lagrangian method is derived to improve accuracy of grid based advection. Our approach utilizes the implicit formula associated with solutions of the inviscid Burgers’ equation. We solve this equation using Newton's method enabled by C 1 continuous grid interpolation. We enforce incompressibility over collocated, rather than staggered grids. Our projection technique is variational and designed for B‐spline interpolation over regular grids where multiquadratic interpolation is used for velocity and multilinear interpolation for pressure. Despite our use of regular grids, we extend the variational technique to allow for cut‐cell definition of irregular flow domains for both Dirichlet and free surface boundary conditions.

Gagniere, S.↗

Stage-local partitioned two-step runge-kutta methods for large systems of ordinary differential equations

We introduce stage-local partitioned two-step Runge-Kutta methods are an extension of standard two-step Runge-Kutta methods, which are an alternative to the standard additive two-step Runge-Kutta methods currently existing in the literature. Furthermore, these new schemes are designed with an eye towards truly N-partitioned systems and leverage local stage approximations to make several computationally interesting approximations viable. Specifically, the focus on local stage approximations makes possible the construction of truly asynchronous schemes, in the parallel sense, possible. In addition, we show that an implicit-explicit approach to these schemes can lead to methods that require the inversion of only local nonlinear systems.

Applied Dynamical Systems↗

thornado+FLASH-X: A Hybrid Discontinuous Galerkin–Implicit-explicit and Finite-volume Framework for Neutrino-radiation Hydrodynamics in Core-collapse Supernovae

We present neutrino-transport algorithms implemented in the toolkit for high-order neutrino-radiation hydrodynamics (thornado) and their coupling to self-gravitating hydrodynamics within the adaptive mesh refinement–based multiphysics simulation framework FLASH-X. thornado, developed primarily for simulations of core-collapse supernovae (CCSNe), employs a spectral, six-species two-moment formulation with algebraic closure and special-relativistic observer corrections accurate to $\mathcal{O}(v/c)$, and uses discontinuous Galerkin (DG) methods for phase-space discretization combined with implicit-explicit time stepping. A key development is a nonlinear neutrino–matter coupling algorithm based on nested fixed-point iteration with Anderson acceleration, enabling fully implicit treatment of collisional processes, including energy-coupling interactions such as neutrino–electron scattering and pair production. Coupling to finite-volume (FV) hydrodynamics is achieved through a hybrid DG-FV representation of the fluid variables and operator-split evolution within FLASH-X. The implementation is verified using basic transport tests with idealized opacities and relaxation and deleptonization problems with tabulated microphysics. Spherically symmetric CCSN simulations demonstrate accuracy and robustness of the coupled scheme, including close agreement with the CCSN simulation code Chimera. An axisymmetric CCSN simulation further demonstrates the viability of DG-based neutrino transport for multidimensional supernova modeling within FLASH-X. thornado’s neutrino-transport solver is GPU-enabled using OpenMP offloading or OpenACC, and all CCSN applications included in this work use the GPU implementation. Together, these results establish a foundation for future enhancements in physics fidelity, numerical algorithms, and computational performance, for increasingly realistic large-scale CCSN simulations.

Endeve, Eirik [Oak Ridge National Laboratory (ORNL↗