Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “solving”

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 1,099 records · Page 61

Stochastic Unit Commitment: Model Reduction via Learning

As weather-dependent renewable generation increases its share in the generation mix of most electric energy systems, a stochastic unit commitment becomes the natural day-ahead scheduling tool. However, such a tool is generally computationally intractable if a detailed uncertainty description is considered. Taking this into account, we proposed a learning method to make the stochastic unit commitment problem tractable. Here, recent advances in statistical learning and machine learning to address optimization problems can be advantageously applied to the rather intractable stochastic unit commitment problem. Considering these advances, we explore simple learning techniques to drastically reduce the size of a stochastic unit commitment problem without significantly altering its optimal solution. The considered stochastic unit commitment problem is formulated as a two-stage stochastic programming problem. The first stage represents commitment decisions, while the second one represents the operation conditions under different scenarios. Taking into account historical solved instances (or proxies for them), we reduce the size (measured by numbers of constraints and variables) of the stochastic unit commitment problem by (i) fixing unchanged binary variables and by (ii) eliminating inactive inequality constraints. Our numerical results show that the reduced problem generally requires significantly less time to solve while obtaining high-quality solutions, which are very close to or indistinguishable from the one obtained by solving the original problem. We use an Illinois 200-bus system to illustrate and characterize the performance of the proposed problem-reduction method.

42 ENGINEERING↗

Causality-respecting adaptive refinement for PINNs: enabling precise interface evolution in phase field modeling

Physics-informed neural networks (PINNs) have emerged as a powerful tool for solving physical systems described by partial differential equations (PDEs). However, their accuracy in dynamical systems, particularly those involving sharp moving boundaries with complex initial morphologies, remains a challenge. Here, this study introduces an approach combining residual-based adaptive refinement (RBAR) with causality-informed training to enhance the performance of PINNs in solving spatio-temporal PDEs. Our method employs a three-step iterative process: initial causality-based training, RBAR-guided domain refinement, and subsequent causality training on the refined mesh. Applied to the Allen-Cahn equation, a widely-used model in phase field simulations, our approach demonstrates significant improvements in solution accuracy and computational efficiency over traditional PINNs. Notably, we observe an ‘overshoot and relocate’ phenomenon in dynamic cases with complex morphologies, showcasing the method’s adaptive error correction capabilities. This synergistic interaction between RBAR and causality training enables accurate capture of interface evolution, even in challenging scenarios where traditional PINNs fail. Our framework not only resolves the limitations of uniform refinement strategies but also provides a generalizable methodology for solving a broad range of spatio-temporal PDEs. The enhanced performance of the RBAR–causality combined framework demonstrates its strong potential for advancing PINN-based modeling of physical systems characterized by complex, evolving interfaces.

Allen-Cahn equations↗

Chapter Nine - Automated Optimal Control in Energy Systems: The Reinforcement Learning Approach

With the development of smart grid technologies an increasing number of new devices and participants have joined modern energy systems and are inevitably making them more complicated and interdependent than ever. Optimally controlling such a complex energy system and maintaining its operation in a high-efficient, secure, and resilient manner are challenging tasks to the system operators. Fortunately, the revolution in deep learning and artificial intelligence (AI), both from hardware and algorithms perspectives, has provided new ideas and solutions to many previously intractable problems. As a result, this advance in computer science also sparked great research interests in utilizing AI in solving engineering problems related to the modern energy systems. Among many AI techniques, deep reinforcement learning (DRL) has demonstrated great potential for solving sequential optimization problems, which are very common in the engineering domains. Its ability to handle nonlinearity and stochasticity in controlled systems has out-competed many traditional optimal control algorithms. Therefore in this chapter, we focus on the state-of-the-art of DRL concepts and related algorithms, compare their pros and cons with traditional optimal control approaches and discuss the typical workflow for leveraging RL in solving complex problems in modern energy systems.

artificial intelligence↗

An efficient, high-order probabilistic collocation method on sparse grids for three-dimensional flow and solute transport in randomly heterogeneous porous media

In this study, a probabilistic collocation method (PCM) on sparse grids was used to solve stochastic equations describing flow and transport in three-dimensional in saturated, randomly heterogeneous porous media. Karhunen-Lo\`{e}ve (KL) decomposition was used to represent the three-dimensional log hydraulic conductivity $Y=\ln K_s$. The hydraulic head $h$ and average pore-velocity $\bf v$ were obtained by solving the three-dimensional continuity equation coupled with Darcy's law with random hydraulic conductivity field. The concentration was computed by solving a three-dimensional stochastic advection-dispersion equation with stochastic average pore-velocity $\bf v$ computed from Darcy's law. PCM is an extension of the generalized polynomial chaos (gPC) that couples gPC with probabilistic collocation. By using the sparse grid points, PCM can handle a random process with large number of random dimensions, with relatively lower computational cost, compared to full tensor products. Monte Carlo (MC) simulations have also been conducted to verify accuracy of the PCM. By comparing the MC and PCM results for mean and standard deviation of concentration, it is evident that the PCM approach is computational more efficient than Monte Carlo simulations. Unlike the conventional moment-equation approach, there is no limitation on the amplitude of random perturbation in PCM. Furthermore, PCM on sparse grids can efficiently simulate solute transport in randomly heterogeneous porous media with large variances.

54 ENVIRONMENTAL SCIENCES↗

Neutronics Modeling of the High Flux Isotope Reactor using COMSOL

The High Flux Isotope Reactor located at the Oak Ridge National Laboratory is a versatile 85 MWth research reactor with cold and thermal neutron scattering, materials irradiation, isotope production, and neutron activation analysis capabilities. HFIR staff members are currently in the process of updating the thermal hydraulic and reactor transient modeling methodologies. COMSOL Multiphysics has been adopted for the thermal hydraulic analyses and has proven to be a powerful finite-element-based simulation tool for solving multiple physics-based systems of partial and ordinary differential equations. Modeling reactor transients is a challenging task because of the coupling of neutronics, heat transfer, and hydrodynamics. This paper presents a preliminary COMSOL-based neutronics study performed by creating a two-dimensional, two-group, diffusion neutronics model of HFIR to study the spatially-dependent, beginning-of-cycle fast and thermal neutron fluxes. The 238-group ENDF/B-VII neutron cross section library and NEWT, a two-dimensional, discrete-ordinates neutron transport code within the SCALE 6 code package, were used to calculate the two-group neutron cross sections required to solve the diffusion equations. The two-group diffusion equations were implemented in the COMSOL coefficient form PDE application mode and were solved via eigenvalue analysis using a direct (PARDISO) linear system solver. A COMSOL-provided adaptive mesh refinement algorithm was used to increase the number of elements in areas of largest numerical error to increase the accuracy of the solution. The flux distributions calculated by means of COMSOL/SCALE compare well with those calculated with benchmarked three-dimensional MCNP and KENO models, a necessary first step along the path to implementing two- and three-dimensional models of HFIR in COMSOL for the purpose of studying the spatial dependence of transient-induced behavior in the reactor core.

21 SPECIFIC NUCLEAR REACTORS AND ASSOCIATED PLANTS↗

Non-Gaussian wave packet dynamics in anharmonic potential: Cumulant expansion treatment

This manuscript utilizes cumulant expansion as an alternative algebraic approach to evaluating integrals and solving a system of nonlinear differential equations for probing anharmonic dynamics in condensed phase systems using Morse oscillator. These integrals and differential equations become harder to solve as the anharmonicity of the system goes beyond that of Morse oscillator description. This algebraic approach becomes critically important in case of Morse oscillator as it tends to exhibit divergent dynamics and numerical uncertainties at low temperatures. The autocorrelation function is calculated algebraically and compared to the exact one for they match perfectly. It is also compared to the approximate autocorrelation function using the differential equations technique reported in Toutounji (2014) for weak and strong electron–phonon coupling cases. It is found that the present cumulant method is more efficient, and easier to use, than the exact expression. Deviation between the approximate autocorrelation function and the exact autocorrelation function starts to arise as the electron–phonon coupling strength increases. The autocorrelation function obtained using cumulants identically matches the exact autocorrelation function, thereby surpassing the approach presented in Toutounji (2014). The advantage of the present methodology is its applicability to various types of electron–phonon coupling cases. Additionally, the herein approach only uses algebraic techniques, thereby avoiding both the divergence integral and solving a set of linear first- and second-order partial differential equations as was done in previous work. Model calculations are presented to demonstrate the accuracy of the herein work.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Energy levels of one-dimensional systems satisfying the minimal length uncertainty relation

The standard approach to calculating the energy levels for quantum systems satisfying the minimal length uncertainty relation is to solve an eigenvalue problem involving a fourth- or higher-order differential equation in quasiposition space. It is shown that the problem can be reformulated so that the energy levels of these systems can be obtained by solving only a second-order quasiposition eigenvalue equation. Through this formulation the energy levels are calculated for the following potentials: particle in a box, harmonic oscillator, Pöschl–Teller well, Gaussian well, and double-Gaussian well. For the particle in a box, the second-order quasiposition eigenvalue equation is a second-order differential equation with constant coefficients. For the harmonic oscillator, Pöschl–Teller well, Gaussian well, and double-Gaussian well, a method that involves using Wronskians has been used to solve the second-order quasiposition eigenvalue equation. It is observed for all of these quantum systems that the introduction of a nonzero minimal length uncertainty induces a positive shift in the energy levels. It is shown that the calculation of energy levels in systems satisfying the minimal length uncertainty relation is not limited to a small number of problems like particle in a box and the harmonic oscillator but can be extended to a wider class of problems involving potentials such as the Pöschl–Teller and Gaussian wells.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

An example of interplay between Physics and Mathematics: Exact resolution of a new class of Riccati Equations

A novel recipe for exactly solving in finite terms a class of special differential Riccati equations is reported. Our procedure is entirely based on a successful resolution strategy quite recently applied to quantum dynamical time-dependent SU(2) problems. The general integral of exemplary differential Riccati equations, not previously considered in the specialized literature, is explicitly determined to illustrate both mathematical usefulness and easiness of applicability of our proposed treatment. The possibility of exploiting the general integral of a given differential Riccati equation to solve an SU(2) quantum dynamical problem, is succinctly pointed out. - Highlights: • A resolutive strategy for Liouville SU(2) dynamical problems is used to solve DREs. • A new class of exactly solvable Riccati equations is reported. • Many examples illustrate our method and provide explicit solutions of selected DREs.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Crystal structure analysis of a hypothetical protein (MJ0366) from Methanocaldococcus jannaschii revealed a novel topological arrangement of the knot fold

The crystal structure of a hypothetical protein MJ0366, derived from Methanocaldococcus jannaschii was solved at 1.9 Å resolution using synchrotron radiation. MJ0366 was crystallized as a monomer and has knot structural arrangement. Intriguingly, the solved structure consists of novel ‘KNOT’ fold conformation. The 3{sub 1} trefoil knot was observed in the structure. The N-terminal and C-terminal ends did not participate in knot formation. - Highlights: • Crystal structure of a hypothetical protein from Methanocaldococcus jannaschii was determined. • The protein adopts novel knot fold conformation. • Structure of the first smallest knot protein was solved.

60 APPLIED LIFE SCIENCES↗

Crystal structure of Mdm12 and combinatorial reconstitution of Mdm12/Mmm1 ERMES complexes for structural studies

Membrane contact sites between organelles serve as molecular hubs for the exchange of metabolites and signals. In yeast, the Endoplasmic Reticulum – Mitochondrion Encounter Structure (ERMES) tethers these two organelles likely to facilitate the non-vesicular exchange of essential phospholipids. Present in Fungi and Amoebas but not in Metazoans, ERMES is composed of five distinct subunits; among those, Mdm12, Mmm1 and Mdm34 each contain an SMP domain functioning as a lipid transfer module. We previously showed that the SMP domains of Mdm12 and Mmm1 form a hetero-tetramer. Here we describe our strategy to diversify the number of Mdm12/Mmm1 complexes suited for structural studies. We use sequence analysis of orthologues combined to protein engineering of disordered regions to guide the design of protein constructs and expand the repertoire of Mdm12/Mmm1 complexes more likely to crystallize. Using this combinatorial approach we report crystals of Mdm12/Mmm1 ERMES complexes currently diffracting to 4.5 Å resolution and a new structure of Mdm12 solved at 4.1 Å resolution. Our structure reveals a monomeric form of Mdm12 with a conformationally dynamic N-terminal β-strand; it differs from a previously reported homodimeric structure where the N-terminal β strands where swapped to promote dimerization. Based on our electron microscopy data, we propose a refined pseudo-atomic model of the Mdm12/Mmm1 complex that agrees with our crystallographic and small-angle X-ray scattering (SAXS) solution data. - Highlights: • We solved a 4.1 Å resolution crystal structure of Mdm12, the soluble subunit of ERMES. • The two Mdm12 apo monomers differ in the conformation of their N-terminal β-strands. • We reconstituted and crystallized two distinct Mdm12/Mmm1 complexes. • SAXS analysis of the complexes agrees with our previous electron microscopy data. • The structure suggests a head-to-tail association in the Mdm12/Mmm1 complex.

60 APPLIED LIFE SCIENCES↗

The crystal structure of P450-TT heme-domain provides the first structural insights into the versatile class VII P450s

Highlights: • The crystal structure of CYP116B45 (P450-TT) from T. thermophilus has been solved. • P450-TT crystal structure is the first example of a class VII P450 structure. • P450-TT adopts the typical P450-fold. • Structural deviation of regions involved in substrate recognition is observed. • Analysis of 96 class VII sequences revealed conservation of active site residues. The first crystal structure of a class VII P450, CYP116B46 from Tepidiphilus thermophilus, has been solved at 1.9 Å resolution. The structure reveals overall conservation of the P450-fold and a water conduit around the I-helix. Active site residues have been identified and sequence comparisons have been made with other class VII enzymes. A structure similarity search demonstrated that the P450-TT structure is similar to enzymes capable of oxy-functionalization of fatty acids, terpenes, macrolides, steroids and statins. The insight gained from solving this structure will provide a guideline for future engineering and modelling studies on this catalytically promiscuous class of enzymes.

60 APPLIED LIFE SCIENCES↗

TOUGH-UDEC: A simulator for coupled multiphase fluid flows, heat transfers and discontinuous deformations in fractured porous media

A numerical simulator entitled TOUGH-UDEC is presented for the assessment of coupled thermal-hydraulic-mechanical processes in fractured porous media. Two existing well-established codes, TOUGH2 and UDEC, are coupled to model multiphase fluid flows, heat transfers, and discontinuous deformations in fractured porous media by means of discrete fracture representation. TOUGH2 is widely used for the modeling of heat transfers and multiphase multicomponent fluid flows, and UDEC is a well-known distinct element code for rock mechanics. The two codes are solved sequentially, with coupling parameters passed to each equation at specific intervals. After solving thermal-hydraulic equations within the TOUGH2 code, pressure and temperature information is imported into the UDEC model. Upon solving the mechanical equation within the UDEC code the calculated fracture apertures are converted to the equivalent permeability and porosity values for a TOUGH2 flow analysis. The solution is calculated by iteratively following an explicit sequence for numerical efficiency. Verifications are presented to demonstrate the capabilities of the coupled TOUGH-UDEC simulator. Three application examples of (1) shear dilation due to increased pore pressure, (2) thermal stress and (3) CO 2 injection, show that the new simulator can be an effective tool for geoengineering applications involving shear activation of fractures and faults.

54 ENVIRONMENTAL SCIENCES↗

Stability of multirate explicit coupling of geomechanics with flow in a poroelastic medium

We consider single rate and multirate explicit schemes for the Biot system modeling coupled flow and geomechanics in a poro-elastic medium. These schemes are widely used in practice that follows a sequential procedure in which the flow and mechanics problems are fully decoupled. In such a scheme, the flow problem is solved first with time-lagging the displacement term followed by the mechanics solve. The multirate explicit coupling scheme exploits the different time scales for the mechanics and flow problems by taking multiple finer time steps for flow within one coarse mechanics time step. We provide fully discrete schemes for both the single and multirate approaches that use Backward Euler time discretization and mixed spaces for flow and conformal Galerkin for mechanics. We perform a rigorous stability analysis and derive the conditions on reservoir parameters and the number of finer flow solves to ensure stability for both schemes. Furthermore, we investigate the computational time savings for explicit coupling schemes against iterative coupling schemes.

97 MATHEMATICS AND COMPUTING↗

Enabling fast, stable and accurate peridynamic computations using multi-time-step integration

Peridynamics is a nonlocal extension of classical continuum mechanics that is well-suited for solving problems with discontinuities such as cracks. This paper extends the peridynamic formulation to decompose a problem domain into a number of smaller overlapping subdomains and to enable the use of different time steps in different subdomains. This approach allows regions of interest to be isolated and solved at a small time step for increased accuracy while the rest of the problem domain can be solved at a larger time step for greater computational efficiency. Lastly, performance of the proposed method in terms of stability, accuracy, and computational cost is examined and several numerical examples are presented to corroborate the findings.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

The value of continuity: Refined isogeometric analysis and fast direct solvers

Here, we propose the use of highly continuous finite element spaces interconnected with low continuity hyperplanes to maximize the performance of direct solvers. Starting from a highly continuous Isogeometric Analysis (IGA) discretization, we introduce C0-separators to reduce the interconnection between degrees of freedom in the mesh. By doing so, both the solution time and best approximation errors are simultaneously improved. We call the resulting method “refined Isogeometric Analysis (rIGA)”. To illustrate the impact of the continuity reduction, we analyze the number of Floating Point Operations (FLOPs), computational times, and memory required to solve the linear system obtained by discretizing the Laplace problem with structured meshes and uniform polynomial orders. Theoretical estimates demonstrate that an optimal continuity reduction may decrease the total computational time by a factor between p 2 and p 3 , with pp being the polynomial order of the discretization. Numerical results indicate that our proposed refined isogeometric analysis delivers a speed-up factor proportional to p 2 . In a 2D mesh with four million elements and p=5, the linear system resulting from rIGA is solved 22 times faster than the one from highly continuous IGA. In a 3D mesh with one million elements and p=3, the linear system is solved 15 times faster for the refined than the maximum continuity isogeometric analysis.

97 MATHEMATICS AND COMPUTING↗

A new numerically stable sequential algorithm for coupled finite-strain elastoplastic geomechanics and flow

In this work, we propose a new numerically stable sequential implicit method for coupled flow and finite-strain multiplicative elastoplastic geomechanics. We find from stability analysis that the sequential method that solves the flow problem first by fixing the first Piola-Kirchhoff total stress, solving the geomechanics (solid deformation) problem at the next step, is unconditionally stable (contractive and B-stable). In this sense, this method named the fixed first Piola-Kirchhoff stress method is an extension of the fixed stress method in coupled flow and infinitesimal geomechanics. We also study the fixed second Piola-Kirchhoff stress method, comparing it with the fixed first Piola-Kirchhoff stress method, because the constitutive relations are formulated by the second Piola-Kirchhoff total stress, although fixing the second Piola-Kirchhoff total stress field does not provide theoretical unconditional stability. In space discretization, we use the finite element method for the geomechanics problem with the total Lagrangian approach, while employing the finite volume method for the flow problem. Geometrical nonlinearity from the total Lagrangian approach results in full-tensor permeability even if the initial permeability is isotropic. To consider the full-tensor permeability accurately, we employ the multipoint flux approximation in solving the flow problem. In time discretization, the backward Euler method is used. Then, we perform numerical experiments of the two fixed-stress sequential methods with various scenarios, and find superiority of their numerical stability. Specifically, the two fixed-stress sequential methods provide almost identical results for elasticity. For J2 plasticity, the two sequential methods yield slightly different numerical results although the trends of the results are similar. For the Drucker-Prager plasticity, we find that the results from the two methods are almost identical. For all the test cases, the two sequential methods are numerically stable.

58 GEOSCIENCES↗

A low-rank solver for the stochastic unsteady Navier–Stokes problem

Here we study a low-rank iterative solver for the unsteady Navier–Stokes equations for incompressible flows with a stochastic viscosity. The equations are discretized using the stochastic Galerkin method, and we consider an all-at-once formulation where the algebraic systems at all the time steps are collected and solved simultaneously. The problem is linearized with Picard’s method. To efficiently solve the linear systems at each step, we use low-rank tensor representations within the Krylov subspace method, which leads to significant reductions in storage requirements and computational costs. Combined with effective mean-based preconditioners and the idea of inexact solve, we show that only a small number of linear iterations are needed at each Picard step. The proposed algorithm is tested with a model of flow in a two-dimensional symmetric step domain with different settings to demonstrate the computational efficiency.

97 MATHEMATICS AND COMPUTING↗

GMRES with embedded ensemble propagation for the efficient solution of parametric linear systems in uncertainty quantification of computational models

In a previous work, embedded ensemble propagation was proposed to improve the efficiency of sampling-based uncertainty quantification methods of computational models on emerging computational architectures. It consists of simultaneously evaluating the model for a subset of samples together, instead of evaluating them individually. A first approach introduced to solve parametric linear systems with ensemble propagation is ensemble reduction. In Krylov methods for example, this reduction consists in coupling the samples together using an inner product that sums the sample contributions. Ensemble reduction has the advantages of being able to use optimized implementations of BLAS functions and having a stopping criterion which involves only one scalar. However, the reduction potentially decreases the rate of convergence due to the gathering of the spectra of the samples. In this paper, we investigate a second approach: ensemble propagation without ensemble reduction in the case of GMRES. This second approach solves each sample simultaneously but independently to improve the convergence compared to ensemble reduction. This raises two new issues which are solved in this paper: the fact that optimized implementations of BLAS functions cannot be used anymore and that ensemble divergence, whereby individual samples within an ensemble must follow different code execution paths, can occur. We tackle those issues by implementing a high-performing ensemble GEMV and by using masks. The proposed ensemble GEMV leads to a similar cost per GMRES iteration for both approaches, i.e. with and without reduction. For illustration, we study the performances of the new linear solver in the context of a mesh tying problem. Furthermore, this example demonstrates improved ensemble propagation speed-up without reduction.

BLAS↗