SEARCH · Engineering Papers

Results for “solution regularity”

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.

SourceResearch connectionFrom yearThrough year

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

At least 37 records · Page 2

All sources NASA NTRS DOE OSTI

DOE OSTI2024

Quantification of Dynamic Scattering Effects in Molecular Crystals using Large Angle Rocking Beam Electron Diffraction

Electron crystallography provides a pathway to solve structure of small crystals (< 1um) in size, and thus overcomes difficult synthesis constraints involved in growing large crystals. Generally, electron diffraction data is collected in the form of integrated intensity using continuous rotation or by precession. The measured intensities in 3D are utilized for structure solution. Using this approach, structure solution of difficult crystals, such as small crystals of zeolites, metal-organic frameworks, molecular crystals, and proteins , can be solved by electron diffraction. However, electron structure solutions are regularly reported with higher Rvalues than x-ray or neutron diffraction. While similar structures are found despite the high R-values, the differences in the measure intensity and theory calculated intensity limit information that can be extracted by electron diffraction. Previous work demonstrated that including multiple-scattering effects significantly reduce the R-values . Thus, it is critical to be able to quantify the dynamical diffraction effects in molecular crystals.

Crystallography↗

DOE OSTI2022

PolyODENet: Deriving mass-action rate equations from incomplete transient kinetics data

Kinetics of a reaction network that follows mass-action rate laws can be described with a system of ordinary differential equations (ODEs) with polynomial right-hand side. However, it is challenging to derive such kinetic differential equations from transient kinetic data without knowing the reaction network, especially when the data are incomplete due to experimental limitations. We introduce a program, PolyODENet, toward this goal. Based on the machine-learning method Neural ODE, PolyODENet defines a generative model and predicts concentrations at arbitrary time. As such, it is possible to include unmeasurable intermediate species in the kinetic equations. Importantly, we have implemented various measures to apply physical constraints and chemical knowledge in the training to regularize the solution space. Here, using simple catalytic reaction models, we demonstrate that PolyODENet can predict reaction profiles of unknown species and doing so even reveal hidden parts of reaction mechanisms.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

DOE OSTI2021

Solution Irregularity Remediation for Spatial Discretization Error Estimation for S N Transport Solutions

The discrete ordinates linear Boltzmann transport equation is typically solved in its spatially discretized form, incurring spatial discretization error. Quantification of this error for purposes such as adaptive mesh refinement or error analysis requires an a posteriori estimator, which utilizes the numerical solution to the spatially discretized equation to compute an estimate. Because the quality of the numerical solution informs the error estimate, irregularities, present in the true solution for any realistic problem configuration, tend to cause the largest deviation in the error estimate vis-a-vis the true error. In this paper, an analytical partial singular characteristic tracking (pSCT) procedure for reducing the estimator’s error is implemented within our novel residual source estimator for a zeroth-order discontinuous Galerkin scheme, at the additional cost of a single inner iteration. Here, a metric-based evaluation of the pSCT scheme versus the standard residual source estimator is performed over the parameter range of a Method of Manufactured Solutions test suite. The pSCT scheme generates near-ideal accuracy in the estimate in problems where the dominant source of the estimator’s error is the solution irregularity, namely, problems where the true solution is discontinuous and problems where the true solution’s first derivative is discontinuous and the scattering ratio is low. In problems where the scattering ratio is high and the true solution is discontinuous in the first derivative, the error in the scattering source, which is not converged by the pSCT scheme, is greater than the error incurred due to the irregularity. Ultimately, a pSCT scheme is judged to be useful for error estimation in problems where the computational cost of the scheme is justified. In the presence of many irregularities, such a scheme may be intractable for general use, but in benchmarks, as an analytical tool, or in problems that have nondissipative discontinuities, the scheme may prove invaluable.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

DOE OSTI2022

PolyODENet

Wu, Qin [Brookhaven National Lab. (BNL), Upton, NY↗

DOE OSTI2021

Evidence for a 5d F-theorem

Renormalization group flows are studied between 5d SCFTs engineered by (p, q) 5-brane webs with large numbers of external 5-branes. A general expression for the free energy on S5 in terms of single-valued trilogarithm functions is derived from their supergravity duals, which are characterized by the 5-brane charges and additional geometric parameters. The additional geometric parameters are fixed by regularity conditions, and we show that the solutions to the regularity conditions extremize a trial free energy. These results are used to survey a large sample of O(10 5 ) renormalization group flows between different 5d SCFTs, including Higgs branch flows and flows that preserve the SU(2) R- symmetry. In all cases the free energy changes monotonically towards the infrared, in line with a 5d F -theorem.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

DOE OSTI2024

TNet: A Model-Constrained Tikhonov Network Approach for Inverse Problems

Deep learning (DL), in particular deep neural networks, by default is purely data-driven and in general does not require physics. This is the strength of DL but also one of its key limitations when applied to science and engineering problems in which underlying physical properties—such as stability, conservation, and positivity—and accuracy are required. DL methods in their original forms are often not capable of respecting the underlying mathematical models or achieving desired accuracy even in big-data regimes. On the other hand, many data-driven science and engineering problems, such as inverse problems, typically have limited experimental or observational data, and DL would overfit the data in this case. Leveraging information encoded in the underlying mathematical models, we argue, not only compensates for missing information in low data regimes but also provides opportunities to equip DL methods with the underlying physics, hence promoting better generalization. This paper develops a model-constrained DL approach and its variant TNet—a Tikhonov neural network—which are capable of learning not only information hidden in the training data but also in the underlying mathematical models to solve inverse problems governed by partial differential equations in low data regimes. We provide the constructions and some theoretical results for the proposed approaches for both linear and nonlinear inverse problems. Since TNet is designed to learn inverse solutions with Tikhonov regularization, it is interpretable: in fact it recovers Tikhonov solutions for linear cases while potentially approximating Tikhonov solutions for nonlinear inverse problems. We also prove that data randomization can enhance not only the smoothness of the networks but also their generalizations. Comprehensive numerical results confirm the theoretical findings and show that with even as little as 1 training data sample for one-dimensional (1D) deconvolution, 5 for an inverse 2D heat conductivity problem, 100 for inverse initial conditions for a time-dependent 2D Burgers’s equation, and 50 for inverse initial conditions for 2D Navier–Stokes equations, TNet solutions can be as accurate as Tikhonov solutions while being several orders of magnitude faster. Furthermore, this is possible owing to the model-constrained term, replications, and randomization.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2024

Arbitrary Order Virtual Element Methods for High‐Order Phase‐Field Modeling of Dynamic Fracture

ABSTRACT Accurate modeling of fracture nucleation and propagation in brittle and ductile materials subjected to dynamic loading is important in predicting material damage and failure under extreme conditions. Phase‐field fracture models have garnered a lot of attention in recent years due to their success in representing damage and fracture processes in a wide class of materials and under a variety of loading conditions. Second‐order phase‐field fracture models are by far the most popular among researchers (and increasingly, among practitioners), but fourth‐order models have started to gain broader acceptance since their more recent introduction. The exact solution corresponding to these high‐order phase‐field fracture models has higher regularity. Thus, numerical solutions of the model equations can achieve improved accuracy and higher spatial convergence rates. In this work, we develop a virtual element framework for the high‐order phase‐field model of dynamic fracture. The virtual element method (VEM) can be regarded as a generalization of the classical finite element method. In addition to many other desirable characteristics, the VEM allows computing on polytopal meshes. Here, we use ‐conforming virtual elements and the generalized‐ time integration method for the momentum balance equation, and adopt ‐conforming virtual elements for the high‐order phase‐field equation. We verify our virtual element framework using classical quasi‐static benchmark problems and demonstrate its capabilities with the aid of numerical simulations of dynamic fracture in brittle materials.

42 ENGINEERING↗

DOE OSTI2021

Joint ptycho-tomography with deep generative priors

Abstract Joint ptycho-tomography is a powerful computational imaging framework to recover the refractive properties of a 3D object while relaxing the requirements for probe overlap that is common in conventional phase retrieval. We use an augmented Lagrangian scheme for formulating the constrained optimization problem and employ an alternating direction method of multipliers (ADMM) for the joint solution. ADMM allows the problem to be split into smaller and computationally more efficient subproblems: ptychographic phase retrieval, tomographic reconstruction, and regularization of the solution. We extend our ADMM framework with plug-and-play (PnP) denoisers by replacing the regularization subproblem with a general denoising operator based on machine learning. While the PnP framework enables integrating such learned priors as denoising operators, tuning of the denoiser prior remains challenging. To overcome this challenge, we propose a denoiser parameter to control the effect of the denoiser and to accelerate the solution. In our simulations, we demonstrate that our proposed framework with parameter tuning and learned priors generates high-quality reconstructions under limited and noisy measurement data.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2020

Affine Approximation of Parametrized Kernels and Model Order Reduction for Nonlocal and Fractional Laplace Models

In this work, we consider parametrized problems driven by spatially nonlocal integral operators with parameter-dependent kernels. In particular, kernels with varying nonlocal interaction radius $\delta > 0$ and fractional Laplace kernels, parametrized by the fractional power $s\in(0,1)$, are studied. Furthermore, in order to provide an efficient and reliable approximation of the solution for different values of the parameters, we develop the reduced basis method as a parametric model order reduction approach. Major difficulties arise since the kernels are not affine in the parameters, singular, and discontinuous. Moreover, the spatial regularity of the solutions depends on the varying fractional power $s$. To address this, we derive regularity and differentiability results with respect to $\delta$ and $s$, which are of independent interest for other applications such as optimization and parameter identification. We then use these results to construct affine approximations of the kernels by local polynomials. Finally, we certify the method by providing reliable a posteriori error estimators, which account for all approximation errors, and support the theoretical findings by numerical experiments.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2023

Multilevel-in-width training for deep neural network regression

A common challenge in regression is that for many problems, the degrees of freedom required for a high-quality solution also allows for overfitting. Regularization is a class of strategies that seek to restrict the range of possible solutions so as to discourage overfitting while still enabling good solutions, and different regularization strategies impose different types of restrictions. In this paper, we present a multilevel regularization strategy that constructs and trains a hierarchy of neural networks, each of which has layers that are wider versions of the previous network's layers. Here, we draw intuition and techniques from the field of Algebraic Multigrid (AMG), traditionally used for solving linear and nonlinear systems of equations, and specifically adapt the Full Approximation Scheme (FAS) for nonlinear systems of equations to the problem of deep learning. Training through V-cycles then encourage the neural networks to build a hierarchical understanding of the problem. We refer to this approach as multilevel-in-width to distinguish from prior multilevel works which hierarchically alter the depth of neural networks. The resulting approach is a highly flexible framework that can be applied to a variety of layer types, which we demonstrate with both fully connected and convolutional layers. We experimentally show with PDE regression problems that our multilevel training approach is an effective regularizer, improving the generalize performance of the neural networks studied.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2023

A map of single-phase high-entropy alloys

High-entropy alloys have exhibited unusual materials properties. The stability of equimolar single-phase solid solution of five or more elements is supposedly rare and identifying the existence of such alloys has been challenging because of the vast chemical space of possible combinations. Herein, based on high-throughput density-functional theory calculations, we construct a chemical map of single-phase equimolar high-entropy alloys by investigating over 658,000 equimolar quinary alloys through a binary regular solid-solution model. We identify 30,201 potential single-phase equimolar alloys (5% of the possible combinations) forming mainly in body-centered cubic structures. We unveil the chemistries that are likely to form high-entropy alloys, and identify the complex interplay among mixing enthalpy, intermetallics formation, and melting point that drives the formation of these solid solutions. We demonstrate the power of our method by predicting the existence of two new high-entropy alloys, i.e. the body-centered cubic AlCoMnNiV and the face-centered cubic CoFeMnNiZn, which are successfully synthesized.

36 MATERIALS SCIENCE↗

DOE OSTI2023

Trinification from E 6 symmetry breaking

In the context of E 6 Grand Unified Theories (GUTs), an intriguing possibility for symmetry breaking to the Standard Model (SM) group involves an intermediate stage characterized by either SU(3) × SU(3) × SU(3) (trinification) or SU(6) × SU(2). The more common choices of SU(5) and SO(10) GUT symmetry groups do not offer such breaking chains. We argue that the presence of a real (rank 2 tensor) representation 650 of E 6 in the scalar sector is the minimal and likely only reasonable possibility to obtain one of the novel intermediate stages. We analyze the renormalizable scalar potential of a single copy of the 650 and find vacuum solutions that support regularly embedded subgroups SU(3) × SU(3) × SU(3), SU(6) × SU(2), and SO(10) × U(1), as well as specially embedded subgroups F 4 and SU(3) × G 2 that do not contain the SM gauge symmetry. We show that for a suitable choice of parameters, each of the regular cases can be obtained as the lowest among the analyzed minima in the potential.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

DOE OSTI2025

Ice storage model-predictive control in an office building with PV: scenario, error and sensitivity analysis

Thermal energy storage (TES) can enable more building-sited renewable electricity generation and lower utility bill costs for buildings owners and occupants, especially when there are high demand and variable time-of-use (TOU) charges. A model predictive control (MPC) strategy can offer additional savings over a schedule-based control with added complexity and reliance on forecasts. Here, this study examines savings for medium office buildings with chiller plants in three locations with building-installed solar photovoltaics (PV) to understand the impact of MPC. Control setpoints are fixed by a schedule-based control or optimized by nonlinear MPC. These control setpoints are actuated within EnergyPlus building models to simulate the utility cost of the chiller plant. NLP solutions can be unstable or unrealistic, but our results show that by regularizing the NLP, the solutions can be reasonably followed by the building model. MPC models make simplifications that lead to errors once the controller is participating in and changing the operation of the building. These errors average 9 % across the cases, showing that the most important parts of the system are represented. The no-thermal load costs are computed to show that the optimization can in some cases achieve both the minimum TOU and minimum monthly demand costs by demand management while reducing TOU energy costs by energy arbitrage. The MPC saves 35–66 % in the annual chiller plant operating costs, which is an additional savings above the schedule by 1–33 %. PV and TES are complementary and mostly independent, but a load with PV often results in better performance for the schedule. Our case study and sensitivity analysis show the importance of modeling and optimization for complex rates, but also the circumstances wherein a simpler strategy achieves the same performance with less potential for error.

14 SOLAR ENERGY↗

DOE OSTI2022

A fourth-order phase-field fracture model: Formulation and numerical solution using a continuous/discontinuous Galerkin method

Modeling crack initiation and propagation in brittle materials is of great importance to be able to predict sudden loss of load-carrying capacity and prevent catastrophic failure under severe dynamic loading conditions. Second-order phase-field fracture models have gained wide adoption given their ability to capture the formation of complex fracture patterns, e.g. via crack merging and branching, and their suitability for implementation within the context of the conventional finite element method. Higher-order phase-field models have also been proposed to increase the regularity of the exact solution and thus increase the spatial convergence rate of its numerical approximation. However, they require special numerical techniques to enforce the necessary continuity of the phase field solution. In this paper, we derive a fourth-order phase-field model of fracture in two independent ways; namely, from Hamilton’s principle and from a higher-order micromechanics-based approach. The latter approach is novel, and provides a physical interpretation of the higher-order terms in the model. In addition, we propose a continuous/discontinuous Galerkin (C/DG) method for use in computing the approximate phase-field solution. This method employs Lagrange polynomial shape functions to guarantee -continuity of the solution at inter-element boundaries, and enforces the required regularity with the aid of additional variational and interior penalty terms in the weak form. Finally, the phase-field equation is coupled with the momentum balance equation to model dynamic fracture problems in hyper-elastic materials. Two benchmark problems are presented to compare the numerical behavior of the C/DG method with mixed finite element methods.

42 ENGINEERING↗

DOE OSTI2020

Solving gyrokinetic systems with higher-order time dependence

We discuss theoretical and numerical aspects of gyrokinetics as a Lagrangian field theory when the field perturbation is introduced into the symplectic part. A consequence is that the field equations and particle equations of motion in general depend on the time derivatives of the field. The most well-known example is when the parallel vector potential is introduced as a perturbation, where a time derivative of the field arises only in the equations of motion, so an explicit equation for the fields may still be written. We will consider the conceptually more problematic case where the time-dependent fields appear in both the field equations and equations of motion, but where the additional term in the field equations is formally small. The conceptual issues were described by Burby (J. Plasma Phys., vol. 82 (3), 2016, 905820304): these terms lead to apparent additional degrees of freedom to the problem, so that the electric field now requires an initial condition, which is not required in low-frequency (Darwin) Vlasov–Maxwell equations. Also, the small terms in the Euler–Lagrange equations are a singular perturbation, and these two issues are interlinked. For well-behaved problems the apparent additional degrees of freedom are spurious, and the physically relevant solution may be directly identified. Because we needed to assume that the system is well behaved for small perturbations when deriving gyrokinetic theory, we must continue to assume that when solving it, and the physical solutions are thus the regular ones. The spurious nature of the singular degrees of freedom may also be seen by changing coordinate systems so the varying field appears only in the Hamiltonian. We then describe how methods appropriate for singular perturbation theory may be used to solve these asymptotic equations numerically. We then describe a proof-of-principle implementation of these methods for an electrostatic strong-flow gyrokinetic system; two basic test cases are presented to illustrate code functionality.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

DOE OSTI2021

An Investigation of the Effects of Volume Fraction on Drag Coefficient of Non-Spherical Particles Using PR-DNS

Prediction of the drag coefficient is required in gas-particle multiphase flow modeling and simulation. Experimental data and correlations on the fixed-bed system of spherical particles with high volume fractions for various possible arrangements are available in the literature. However, the effect of volume fraction on the drag coefficient of non-spherical particles is not well studied. In solving the momentum equation, the volume fraction plays a vital role in determining the flow resistances. In this paper, we study the impact of volume fraction in the range of 0.069 to 0.65 on the drag coefficient using the computational fluid dynamics (CFD) simulation of air for Reynold number in the range of 10 to 10000 using particle resolved direct numerical solution (PR-DNS). Regular non-spherical particles such as a cube, tetrahedron, and spheroids are used in this study since their single particle’s drag coefficient data are available in the literature for comparison. For this work, the simulations are carried out in the Ansys Fluent using polyhedral mesh, which consumes significantly less computational time and power. The study showed the sphericity and volume fraction have significant impact on the bed pressure drop and average drag coefficient of the particles in the bed especially in high Reynolds number regime. The bed of the spheroid experiences the lowest drag being the most streamlined particle, and the particles with the edges result in a large drag coefficient due to flow separation at the discontinuity. The vector plots verify this behavior where large wake regions are observed behind the tetrahedron particle.

Mahyawansi, Pratik↗

DOE OSTI2026

PDE-constrained high-order mesh optimization

Here, we present a novel framework for PDE-constrained r-adaptivity of high-order meshes. The proposed method formulates mesh movement as an optimization problem, with an objective function defined as a convex combination of a mesh quality metric and a measure of the accuracy of the PDE solution obtained via finite element discretization. The proposed formulation achieves optimized, well-defined high-order meshes by integrating mesh quality control, PDE solution accuracy, and robust gradient regularization. We adopt the Target-Matrix Optimization Paradigm to control geometric properties across the mesh, independent of the PDE of interest. To incorporate the accuracy of the PDE solution, we introduce error measures that control the finite element discretization error. The implicit dependence of these error measures on the mesh nodal positions is accurately captured by adjoint sensitivity analysis. Additionally, a convolution-based gradient regularization strategy is used to ensure stable and effective adaptation of high-order meshes. We demonstrate that the proposed framework can improve mesh quality and reduce the error by up to 10 times for the solution of Poisson and linear elasto-static problems. The approach is general with respect to the dimensionality, the order of the mesh, the types of mesh elements, and can be applied to any PDE that admits well-defined adjoint operators.

Computer science↗

DOE OSTI2020

A Real-Time Optimization with Warm-Start of Multiperiod AC Optimal Power Flows

We present a real-time optimization strategy based on warm-start for solving a moving horizon of multi period AC optimal power flow (ACOPF) problems. In each horizon, ACOPFs are temporally interlinked via generator ramp constraints, and we assume that each horizon needs to be solved every few seconds or minutes. We introduce two approximate tracking schemes that closely follow a solution path consisting of strongly regular points. We present theoretical results bounding the tracking error by the square of the parameter changes between time periods. Experimental results for networks of sizes up to 9K buses show a fast computation time while maintaining a good solution quality, thus making our approach well suited for real-time circumstances.

moving horizon↗