Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “interior 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 37 records · Page 2

pnnl/Pathway_Controlled_Optimization

A method for prediction of cell regulation to maximize cell growth rate while maintaining the solvent capacity of the cell. Prediction is formulated as an optimization problem using a thermodynamic framework that can leverage experimental data. We develop a formulation and variable initialization procedure that allows for computing solutions of the optimization with an interior point method

Central, PNNL Developer↗

An approach to learn regulation to maximize growth and entropy production rates in metabolism

Elucidating cell regulation remains a challenging task due to the complexity of metabolism and the difficulty of experimental measurements. Here we present a method for prediction of cell regulation to maximize cell growth rate while maintaining the solvent capacity of the cell. Prediction is formulated as an optimization problem using a thermodynamic framework that can leverage experimental data. We develop a formulation and variable initialization procedure that allows for computing solutions of the optimization with an interior point method. The approach is applied to photoheterotrophic growth of Rhodospirilium rubrum using ethanol as a carbon source, which has applications to biosynthesis of ethylene production. Growth is captured as the rate of synthesis of amino acids into proteins, and synthesis of nucleotide triphoshaptes into RNA and DNA. The method predicts regulation that produces a high rate of protein and RNA synthesis while DNA synthesis is reduced close to zero in agreement with production of DNA being turned off for much of the cell cycle.

59 BASIC BIOLOGICAL SCIENCES↗

Deep Sigma Point Processes-Assisted Chance-Constrained Power System Transient Stability Preventive Control

Here this paper proposes a deep sigma point processes (DSPP)-assisted chance-constrained power system transient stability preventive control method to deal with uncertain renewable energy and loads-induced stability risk. The traditional transient stability-constrained preventive control is reformulated as a chance-constrained optimization problem. To deal with the computational bottleneck of the time-domain simulation-based probabilistic transient stability assessment, the DSPP is developed. DSPP is a parametric Bayesian approach that allows us to predict system transient stability with high computational efficiency while accurately quantifying the confidence intervals of the predictions that can be used to inform system instability risk. To this end, with a given preset confidence probability, we embed DSPP into the primal dual interior point method to help solve the chance-constrained preventive control problem, where the corresponding Jacobian and Hessian matrices are derived. Comparison results with other existing methods show that the proposed method can significantly speed up preventive control while maintaining high accuracy and convergence

97 MATHEMATICS AND COMPUTING↗

Tuning successive linear programming to solve AC optimal power flow problem for large networks

Successive linear programming (SLP) is a practical approach for solving large-scale nonlinear optimization problems. Alternating current optimal power flow (ACOPF) is no exception, particularly the large size of real-world networks. However, in order to achieve tractability, it is essential to tune the SLP algorithm presented in the literature. This paper presents a modified SLP algorithm to solve the ACOPF problem, specified by the U.S. Department of Energy’s (DOE) Grid Optimization (GO) Competition Challenge 1, within strict time limits. The algorithm first finds a near-optimal solution for the relaxed problem (i.e., Stage 1). Then, it finds a feasible solution in the proximity of the near-optimal solution (i.e., Stage 2 and Stage 3). The numerical experiments on test cases ranging from 500-bus to 30,000-bus systems show that the algorithm is tractable. Here the results show that our proposed algorithm is tractable and can solve more than 80% of test cases faster than the well-known Interior Point Method while significantly reduce the number of iterations required to solve ACOPF. The number of iterations is considered an important factor in the examination of tractability which can drastically reduce the computational time required within each iteration.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Data Driven Optimization Framework for Volt-age Regulation in Distribution Systems

This letter proposes a data-driven optimization framework for voltage regulation problems to address the challenge of model inaccuracy and parameter varying. To achieve online voltage optimization, the recursive kernel regression and interior point methods are integrated. The IEEE 123-Bus system and EPRI Ckt5 feeder are selected to validate the effectiveness of the proposed data-driven optimization framework. The proposed method is also compared with a linear function based method.

Hong, Tianqi↗

Optimal Power Flow Derived Sparse Linear Solver Benchmarks

Due to the changing nature of the power grid, it is increasingly important to be able to solve a high-fidelity optimal power-flow models on large power networks. This high-fidelity problem, called AC Optimal Power Flow (ACOPF), is a nonlinear, nonconvex optimization problem. One of the few reliable ways of solving such a problem is interior point methods. These methods result in sparse linear systems where the coefficient matrix is symmetric, indefinite and nearly always ill-conditioned. As such, they are particularly challenging for sparse linear solvers and represent a considerable computational bottleneck in solving the ACOPF problem. In this paper, we introduce a repository of linear systems captured from ACOPF problems when solved by the open-source optimizer IPOPT. These matrices are meant to be used as a test suite for sparse linear solver development.

97 MATHEMATICS AND COMPUTING↗

Riemannian Optimization Applied to AC Optimal Power Flow

The nonlinear, nonconvex AC optimal power flow problem is of growing importance as the nature of the power grid evolves. This problem can be difficult to solve for interior point methods. However, the advent of optimization algorithms over smooth Riemannian manifolds presents an alternative approach. The nonlinear, nonconvex constraints in the AC power flow problem form an embedded submanifold of Euclidean space. In this paper, the authors explore the performance of Riemannian optimization algorithms for the ACOPF problem where the optimization is performed directly on the AC power flow manifold. This is done by using the Julia programming language and the Julia packages PowerModels.jl and Manopt.jl.

AC optimal power flow↗

Advancing Building Air Leakage Measurement and Modeling: Measurement of Interior Air Leaks, Experimental Comparison to Conventional Methods, and Building Modeling Characteristics

This report, Advancing Building Air Leakage Measurement and Modeling: Measurement of Interior Air Leaks, Experimental Comparison to Conventional Methods, and Building Modeling Characteristics, developed two new building air leakage measurement methods, experimentally evaluated the performance in comparison to conventional methods, experimentally evaluated the behavior of leaks for specific crack structures, and identified testing constraints and model implications.

32 ENERGY CONSERVATION, CONSUMPTION, AND UTILIZATI↗

Direct Discontinuous Galerkin methods for the reacting multi-component flow equations

The Direct Discontinuous Galerkin (DDG (Liu and Yan, 2008)) method and a counterpart with Interface Correction (DDGIC (Danis and Yan, 2022)) are extended to compute diffusion terms that arise when solving the compressible multi-component flow equations in thermochemical nonequilibrium. Thermodynamic properties, transport properties, chemical reaction rates, and energy exchange terms are computed using Mutation++ (Scoggins et al., 2020). The DG method is applied on unstructured grids, where the accuracy and convergence rates can be sensitive to the numerical method chosen for parabolic terms. A method for determining the homogeneity tensor of the flow equations required for DDGIC is shown. The convergence properties of the DDG methods are studied and compared to the Interior Penalty (IP) method. A number of numerical experiments are conducted to assess the accuracy and performance of the method. The numerical results and convergence studies indicate that DDG and DDGIC provide accurate solutions and perform well for general flows in thermochemical nonequilibrium.

Diffusion↗

A family of independent Variable Eddington Factor methods with efficient preconditioned iterative solvers

We present a family of discretizations for the Variable Eddington Factor (VEF) equations that have high-order accuracy on curved meshes and efficient preconditioned iterative solvers. The VEF discretizations are combined with the Discontinuous Galerkin transport discretization from to form effective high-order, linear transport methods. The VEF discretizations are derived by extending the unified analysis of Discontinuous Galerkin methods for elliptic problems presented by Arnold et al. to the VEF equations. This framework is used to define analogs of the interior penalty, second method of Bassi and Rebay, minimal dissipation local Discontinuous Galerkin, and continuous finite element methods. The analysis of subspace correction preconditioners, which use a continuous operator to iteratively precondition the discontinuous discretization, is extended to the case of the non-symmetric VEF system. Numerical results demonstrate that the VEF discretizations have arbitrary-order accuracy on curved meshes, preserve the thick diffusion limit, and are effective on a proxy problem from thermal radiative transfer in both outer transport iterations and inner preconditioned linear solver iterations. We demonstrate that the VEF solution converges to the S N transport solution as the mesh is refined on both problems with smooth and non-smooth behavior in angle. Parallel performance studies show that the interior penalty VEF discretization's linear solve weak scales out to 1024 processors and strong scales well on a single node. Particular attention is paid to the parallel performance of the VEF algorithm when used in combination with a parallel block Jacobi transport sweep.

97 MATHEMATICS AND COMPUTING↗

Consistent Second Moment Methods with Scalable Linear Solvers for Radiation Transport

Second moment methods (SMMs) are developed that are consistent with the discontinuous Galerkin spatial discretization of the discrete ordinates (or S\(_N\)) transport equations. The low-order (LO) diffusion system of equations is discretized with fully consistent P\(_1\), local discontinuous Galerkin (LDG), and interior penalty (IP) methods. A discrete residual approach is used to derive SMM correction terms that make each of the LO systems consistent with the high-order discretization. We show that the consistent methods are more accurate and have better solution quality than independently discretized LO systems, that they preserve the diffusion limit, and that the LDG and IP consistent SMMs can be scalably solved in parallel on a challenging, multimaterial benchmark problem.

97 MATHEMATICS AND COMPUTING↗

Convective shells in the interior of Cepheid variable stars: Overshooting models based on hydrodynamic simulations

Context. Because Cepheid variable stars have long been used as a cosmic benchmark for scaling distances in our Galaxy and beyond, the accuracy of stellar evolution models for Cepheids have wide-reaching effects. However, our understanding of the dynamics in the interiors of these physically complex stars is limited. Aims. Our goal is to provide a detailed multi-dimensional picture of hydrodynamic convection and convective boundary mixing in the interior of Cepheids. Methods. Using the Modules for Experiments in Stellar Astrophysics (MESA), we studied the structure of intermediate-mass stars that cross the instability strip. Then, we performed two-dimensional hydrodynamic simulations of six stars with the fully compressible Multidimensional Stellar Implicit Code (MUSIC). Our simulations did not model the radial pulsations but focused on the interior structure of this family of stars. We developed and applied a new statistical analysis to examine convection and convective boundary mixing in the interior of these stellar simulations. Results. Based on a grid of MESA models, we demonstrated that a common structure for intermediate mass Cepheids includes an interior convective shell as well as a thin outer convective envelope. Using the extreme value theory approach to analyze our MUSIC simulation data, we found that overshooting above the convective shell fills the space between these convectively unstable layers. We developed a new statistical analysis that provides a clearer picture of how overshooting fills this layer; it also allowed us to formulate a detailed comparison between overshooting above and below the convective shell. Our analysis effectively decomposes the overshooting layer into two layers: a weak overshooting layer and a strong overshooting layer. Statistically, this is accomplished by decomposing the strongly non-Gaussian probability density function into a mixture of gamma distributions. Using our mixture model, we showed that the ratio of overshooting lengths above and below the convective shell depends directly on the radial extent of the convective shell as well as its depth in the star. We proposed a new form for the diffusion coefficient that addresses the need for overlapping overshooting layers between convective shells. We introduced the idea of a “super-mixing layer” where overshooting from both the convective shell and the convective envelope results in efficient mixing and could be viewed as merging the two adjacent convective zones.

79 ASTRONOMY AND ASTROPHYSICS↗

Design of a symmetry‐broken tetrahedral protein cage by a method of internal steric occlusion

Abstract Methods in protein design have made it possible to create large and complex, self‐assembling protein cages with diverse applications. These have largely been based on highly symmetric forms exemplified by the Platonic solids. Prospective applications of protein cages would be expanded by strategies for breaking the designed symmetry, for example, so that only one or a few (instead of many) copies of an exterior domain or motif might be displayed on their surfaces. Here we demonstrate a straightforward design approach for creating symmetry‐broken protein cages able to display singular copies of outward‐facing domains. We modify the subunit of an otherwise symmetric protein cage through fusion to a small inward‐facing domain, only one copy of which can be accommodated in the cage interior. Using biochemical methods and native mass spectrometry, we show that co‐expression of the original subunit and the modified subunit, which is further fused to an outward‐facing anti‐GFP DARPin domain, leads to self‐assembly of a protein cage presenting just one copy of the DARPin protein on its exterior. This strategy of designed occlusion provides a facile route for creating new types of protein cages with unique properties.

Gladkov, Nika↗

Optimization of Molecular Methods for Detecting Duckweed-Associated Bacteria

The bacterial colonization dynamics of plants can differ between phylogenetically similar bacterial strains and in the context of complex bacterial communities. Quantitative methods that can resolve closely related bacteria within complex communities can lead to a better understanding of plant–microbe interactions. However, current methods often lack the specificity to differentiate phylogenetically similar bacterial strains. In this study, we describe molecular strategies to study duckweed–associated bacteria. We first systematically optimized a bead-beating protocol to co-isolate nucleic acids simultaneously from duckweed and bacteria. We then developed a generic fingerprinting assay to detect bacteria present in duckweed samples. To detect specific duckweed–bacterium associations, we developed a genomics-based computational pipeline to generate bacterial strain-specific primers. These strain-specific primers differentiated bacterial strains from the same genus and enabled the detection of specific duckweed–bacterium associations present in a community context. Moreover, we used these strain-specific primers to quantify the bacterial colonization of duckweed by normalization to a plant reference gene and revealed differences in colonization levels between strains from the same genus. Lastly, confocal microscopy of inoculated duckweed further supported our PCR results and showed bacterial colonization of the duckweed root–frond interface and root interior. The molecular methods introduced in this work should enable the tracking and quantification of specific plant-microbe associations within plant-microbial communities.

59 BASIC BIOLOGICAL SCIENCES↗

A robust interface finite element formulation for modeling brittle material failure problems

Abstract Failure of many brittle materials and structures can be modeled using interface‐oriented finite elements combined with intrinsic cohesive zone models. The discontinuous Galerkin (DG) finite element method provides an innovative framework for modeling brittle crack propagation with zero‐thickness interface elements, which can accommodate extrinsic cohesive laws to avoid the artificial compliance required in intrinsic cohesive models. However, robust formulations and implementations of DG methods are critical in alleviating the well‐known convergence issues for both crack nucleation and propagation with reduced instability. This paper presents a robust interface element formulation by modifying the incomplete interior penalty Galerkin (IIPG) method, which successfully avoids the initial element interface penetration across elements that occurs prior to crack nucleation, and thereby greatly reduces the instability issue as cracks open. We further verified and validated our implementation by using a bar tension test and a beam fracturing benchmark. The robustness of our proposed interface element method was demonstrated by a micromechanics fiber/matrix debonding problem with 64 fibers embedded in a bulk matrix.

Liu, Ruijie↗

An IIPG-based finite element framework in MOOSE for modeling fiber reinforced composite failure governed by extrinsic cohesive laws

Fiber reinforced composites (FRC) are widely applied to many important engineering structures such as silicon carbide ceramic matrix composite (SiC CMC) of nuclear fuel claddings. Many material and structure failures are initiated at the interface between two distinctive materials, such as the debonding of interfaces of matrix/fiber of composites or bulk matrix/inclusion in metals at micro-scales. Accurate and robust modeling of these interface failures is critical to the development of novel material and structure with improved functionality. This paper presents a discontinuous Galerkin (DG) finite element method based on the Incomplete Interior Penalty scheme and its implementation in MOOSE for modeling material interface behaviors. The proposed method naturally accommodates important extrinsic cohesive zone material models and is capable of modeling the failures of material interfaces across which material properties are highly distinctive. We demonstrate a good performance of the proposed method using single fiber and multiple fiber debonding problems.

22 GENERAL STUDIES OF NUCLEAR REACTORS↗

Gradient-Informed Design Optimization of Select Nuclear Systems

In this work, we present a gradient-informed design optimization of nuclear reactor core components based on neutronics objectives with both continuous and discrete materials. The main argument in favor of using gradient-informed design optimization is that it scales well with increasing dimensionality of the design space. First, a challenge problem with 121 free parameters is solved with a gradient-informed method and then with a genetic algorithm. Then, a challenge problem to optimize the flux profile of a simplified assembly with eight axial zones is solved. Both challenge problems are solved using directly calculated derivatives from Tools for Sensitivity and Uncertainty Analysis Methodology Implementation (TSUNAMI) in the SCALE package. Furthermore, we demonstrate how a discrete optimization problem—selection of materials for 121 voxels—can be lifted into a continuous problem with mixed materials. In the continuous space, adjoint-based gradients are well-defined, and gradient descent is applicable. Then, a forcing function is introduced that with the selection of an appropriately sized hyperparameter can be used to guide the optimized continuous solution back into a discrete solution. This paper presents an account of the challenges that were faced when applying a gradient-informed optimization algorithm using a Monte Carlo calculation to estimate the gradient information and compares a gradient descent optimization method to a genetic algorithm optimization of the same geometry. Overall, this work demonstrates the potential use of adjoint-based gradient calculations in design optimization of nuclear systems.

22 GENERAL STUDIES OF NUCLEAR REACTORS↗