Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Iteration method”

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 325 records · Page 18
All sourcesNASA NTRSDOE OSTI
DOE OSTI2022

Impact of cyber attacks on distributed compressive sensing based state estimation in power distribution grids

Modern power distribution grids suffer from multiple vulnerabilities due to the tight integration between the physical system and the cyber infrastructure. Sophisticated and malicious cyber attacks continue to adversely impact the grid operation leading to performance degradation, service interruption, and grid failure. State estimation plays an essential role in grid monitoring and advancing cyber-attack situational awareness. In this regard, this paper first proposes a distributed compressive sensing (CS) state estimation approach for an unobservable distribution grid. Further, the proposed distributed CS approach divides the distribution grid into sub-areas to perform local state estimation. Then an alternating direction method of multipliers (ADMM) based iterative information exchange among neighboring areas is employed to complete the estimation process. In this estimation process, the impact of loss of measurement data, false data injection (FDI), replay, and neighborhood cyber-attacks is analyzed. Extensive simulations are performed on the IEEE 37-bus and IEEE 123-bus standard networks to demonstrate the algorithm’s robustness to the aforementioned cyber-attacks. A quantitative analysis of computational complexity and simulation time of the distributed CS based approach is also presented.

24 POWER TRANSMISSION AND DISTRIBUTION↗
DOE OSTI2025

GenAI4UQ: A software for forward and inverse uncertainty quantification using conditional generative AI

We introduce GenAI4UQ, a software package for forward and inverse uncertainty quantification in model calibration, parameter estimation, and ensemble forecasting. GenAI4UQ leverages a generative AI-based conditional modeling framework to address limitations of traditional inverse modeling techniques, such as Markov Chain Monte Carlo (MCMC) methods. By replacing computationally intensive iterative processes with a direct, learned mapping, GenAI4UQ enables efficient calibration of input parameters and generation of predictions directly from observations. The software supports rapid ensemble forecasting with robust uncertainty quantification while maintaining computational and storage efficiency. Built-in auto-tuning of hyperparameters simplifies model training, ensuring accessibility for users with varying expertise. Its versatile conditional generative framework is applicable across diverse scientific domains. While GenAI4UQ offers significant advantages in flexibility and efficiency, users should interpret its uncertainty estimates with caution in data-sparse scenarios, as the model may overestimate uncertainty—an effect common to all surrogate-based approaches including MCMC with surrogate models. Despite this, GenAI4UQ transforms inverse modeling by providing a fast, reliable, and user-friendly solution. It empowers researchers and practitioners to quickly estimate parameter distributions and generate model predictions for new observations, facilitating efficient decision-making and advancing the state of uncertainty quantification in computational modeling.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2025

Consistent solutions of the radiation diffusion equation in spherical and cylindrical geometries

We have extended the radiation diffusion model of Hammer and Rosen [Phys. Plasmas 10, 1829 (2003)] to diverging spherical and cylindrical geometries. The effect of curvilinear geometry on the supersonic, expanding wavefront increases as the internal radius of a spherical or cylindrical shell approaches zero. Small spherical geometries are important for modeling systems at the size scale of inertial confinement fusion capsules, at these scales existing quasi-analytic models for planar geometry significantly disagree with the results of simulation. With this method, the benefits of rapid iteration can be applied to common spherical systems at much smaller length scales. We present comparisons between numerical diffusion solutions and the analytic model to give ranges of applicability for the model.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗
DOE OSTI2020

Internal Delensing of Cosmic Microwave Background Polarization B -Modes with the POLARBEAR Experiment

Using only cosmic microwave background polarization data from the polarbear experiment, we measure B-mode polarization delensing on subdegree scales at more than 5σ significance. We achieve a 14% B-mode power variance reduction, the highest to date for internal delensing, and improve this result to 22% by applying for the first time an iterative maximum a posteriori delensing method. Our analysis demonstrates the capability of internal delensing as a means of improving constraints on inflationary models, paving the way for the optimal analysis of next-generation primordial B-mode experiments.

79 ASTRONOMY AND ASTROPHYSICS↗
DOE OSTI2020

Optimal Network Topology for Node-Breaker Representations With AC Power Flow Constraints

It has been demonstrated that network topology optimization (NTO) may change the topology of power system networks, and consequently, provide additional flexibility to reduce network congestion and violations. Most NTO problems are formulated based on the bus-branch model in which it is challenging to represent a realistic picture of all substation configurations. In this paper, we explore advantages of substation reconfiguration modeling based on node-breaker representations for NTO problem with full nonlinear alternating current power flow. It also proposes a tailored solution algorithm to solve this nonconvex mixed-integer nonlinear programming through the outer approximation method. The proposed solution approach iterates between a mixed-integer linear programming and a nonlinear subproblem. Additional enhancements to further accelerate the iteration process are illustrated. Numerical case studies demonstrate the relative economic and operational impact of optimal network topology with node-breaker representations.

42 ENGINEERING↗
DOE OSTI2020

Iterative X-ray spectroscopic ptychography

Spectroscopic ptychography is a powerful technique to determine the chemical composition of a sample with high spatial resolution. In spectro-ptychography, a sample is rastered through a focused X-ray beam with varying photon energy so that a series of phaseless diffraction data are recorded. Each chemical component in the material under investigation has a characteristic absorption and phase contrast as a function of photon energy. Using a dictionary formed by the set of contrast functions of each energy for each chemical component, it is possible to obtain the chemical composition of the material from high-resolution multi-spectral images. This paper presents SPA (spectroscopic ptychography with alternating direction method of multipliers), a novel algorithm to iteratively solve the spectroscopic blind ptychography problem. First, a nonlinear spectro-ptychography model based on Poisson maximum likelihood is designed, and then the proposed method is constructed on the basis of fast iterative splitting operators. SPA can be used to retrieve spectral contrast when considering either a known or an incomplete (partially known) dictionary of reference spectra. By coupling the redundancy across different spectral measurements, the proposed algorithm can achieve higher reconstruction quality when compared with standard state-of-the-art two-step methods. It is demonstrated how SPA can recover accurate chemical maps from Poisson-noised measurements, and its enhanced robustness when reconstructing reduced-redundancy ptychography data using large scanning step sizes is shown.

47 OTHER INSTRUMENTATION↗
DOE OSTI2021

Evaluation of gamma-ray transmission through rectangular collimator slits for application in nuclear fuel spectrometry

Gamma-ray spectrometry is widely applied in several science fields, and in particular in non-destructive gamma scanning and gamma emission tomography of irradiated nuclear fuel. Usually, a collimator is used in the experimental setup, to selectively interrogate a region of interest in the fuel. For the optimization of instrument design, as well as for planning measurement campaigns, predictive models for the transmitted gamma-ray intensity through the collimator are needed. Commonly, Monte Carlo Radiation Transport tools are used for accurate prediction of gamma-ray transport, however, the long computation time requirements when used in low-efficiency experimental setups present challenges. Here, the full-energy peak intensity transmitted through a rectangular collimator slit was examined. A uniform planar surface source emitting isotropically was considered, and the rate of photons reaching an ideal counter plane on the opposite side of the collimator was evaluated by analytical integration. To find a closed-form primitive function, some idealizations were required, and thereby parametric models were obtained for the optical field of view, dependent on slit dimensions (length, height and width) and source-to-collimator distance. For contributions from outside the optical field of view, where a closed-form expression cannot be found, fast numerical integral methods were instead used. The results were validated using the Monte Carlo code MCNP6 and show an agreement within three percent for the numerical method. For the analytical method, deviations up to tens of percent were obtained, which is deemed to still be sufficient for instrument design and measurement planning, where often the order of magnitude of the count rate is not a priori known. The method is planned for use in iterative optimization routines in the design of Gamma Emission Tomography devices, as well as for the prediction of gamma spectra obtained in the planning of fuel inspections. An application of the proposed method was demonstrated in spectrum prediction for a short cooling-time fuel rod test from the Halden reactor.

22 GENERAL STUDIES OF NUCLEAR REACTORS↗
DOE OSTI2021

Cross Section Generation Capability in Griffin

The Griffin code is a Multiphysics Object-Oriented Simulation Environment (MOOSE) based reactor multiphysics analysis application jointly developed by Idaho National Laboratory and Argonne National Laboratory. The code includes a variety of steady-state solvers for fixed-source, k-eigenvalue, adjoint, and subcritical multiplication, as well as transient solvers for point-kinetics, improved quasi-static, and spatial dynamics. The code reads multigroup cross sections in the ISOXML format generated from external deterministic or Monte Carlo cross section generation codes. The implementation of the cross section generation capability in Griffin was initiated last year by plugging in the cross section application programming interface (CSAPI) and reviewing the methodologies for treating particulate fuels. The focus this year was on improving the CSAPI integration and implementing advanced self-shielding methods for applications to advanced reactor problems with TRISO fuels. First, the process for cross section library generation was updated to accurately and rigorously produce isotopic cross section data. Second, the equivalent Dancoff factor cell method performing slowing down calculations on the fly for the resonance treatment was implemented in CSAPI to improve the accuracy of effective multigroup cross sections in the resonance energy range. Third, the iterative local spatial self-shielding method was implemented under the calculation framework of the equivalent Dancoff factor cell method to accurately deal with the double heterogeneity effect of particulate fuel. The updated CSAPI with the advanced self-shielding methods, together with the cross section libraries generated based on the improved process, were tested for pin-cell, unit-cell, and fuel assembly problems with various resonance self-shielding conditions based on very high temperature reactor, high temperature test reactor, and Empire benchmark cores, indicating that the updated CSAPI in Griffin is able to produce multigroup cross sections accurately and efficiently. We also showed that the methodology worked well for pebble bed fuel from HTR-10, but the capability still needs to be fully integrated into CSAPI. In the future, further benchmark tests will be performed for various thermal reactor core problems, including particulate fuel-based pebble bed reactors.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗
DOE OSTI2020

A linearity preserving nodal variation limiting algorithm for continuous Galerkin discretization of ideal MHD equations

A stabilized continuous Galerkin (CG) method for magnetohydrodynamics (MHD) is presented herein. Ideal, compressible inviscid MHD equations are discretized in space on unstructured meshes using piecewise linear or bilinear finite element bases to get a semi-discrete scheme. Stabilization is then introduced to the semi-discrete method in a strategy that follows the algebraic flux correction paradigm. This involves adding some artificial diffusion to the high order, semi-discrete method and mass lumping in the time derivative term. The result is a low order method that provides local extremum diminishing properties for hyperbolic systems. The difference between the low order method and the high order method is scaled element-wise using a limiter and added to the low order scheme. The limiter is solution dependent and computed via an iterative linearity preserving nodal variation limiting strategy. The stabilization also involves an optional consistent background high order dissipation that reduces phase errors. The resulting stabilized scheme is a semi-discrete method that can be applied to inviscid shock MHD problems and may be even extended to resistive and viscous MHD problems. To satisfy the divergence free constraint of the MHD equations, we add parabolic divergence cleaning to the system. Various time integration methods can be used to discretize the scheme in time. We demonstrate the robustness of the scheme by solving several shock MHD problems.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2022

Numerical algorithms for water waves with background flow over obstacles and topography

Abstract We present two accurate and efficient algorithms for solving the incompressible, irrotational Euler equations with a free surface in two dimensions with background flow over a periodic, multiply connected fluid domain that includes stationary obstacles and variable bottom topography. One approach is formulated in terms of the surface velocity potential while the other evolves the vortex sheet strength. Both methods employ layer potentials in the form of periodized Cauchy integrals to compute the normal velocity of the free surface, are compatible with arbitrary parameterizations of the free surface and boundaries, and allow for circulation around each obstacle, which leads to multiple-valued velocity potentials but single-valued stream functions. We prove that the resulting second-kind Fredholm integral equations are invertible, possibly after a physically motivated finite-rank correction. In an angle-arclength setting, we show how to avoid curve reconstruction errors that are incompatible with spatial periodicity. We use the proposed methods to study gravity-capillary waves generated by flow around several elliptical obstacles above a flat or variable bottom boundary. In each case, the free surface eventually self-intersects in a splash singularity or collides with a boundary. We also show how to evaluate the velocity and pressure with spectral accuracy throughout the fluid, including near the free surface and solid boundaries. To assess the accuracy of the time evolution, we monitor energy conservation and the decay of Fourier modes and compare the numerical results of the two methods to each other. We implement several solvers for the discretized linear systems and compare their performance. The fastest approach employs a graphics processing unit (GPU) to construct the matrices and carry out iterations of the generalized minimal residual method (GMRES).

Ambrose, David M.↗
DOE OSTI2020

Multi-stage preconditioners for thermal–compositional–reactive flow in porous media

We present a family of multi-stage preconditioners for coupled thermal-compositional-reactive reservoir simulation problems. The most common preconditioner used in industrial practice, the Constrained Pressure Residual (CPR) method, was designed for isothermal models and does not offer a specific strategy for the energy equation. For thermal simulations, inadequate treatment of the temperature unknown can cause severe conver-gence degradation. When strong thermal diffusion is present, the energy equation exhibits significant elliptic behavior that cannot be accurately corrected by CPR's second stage. In this work, we use Schur-complement decompositions to extract a temperature subsystem and apply an Algebraic MultiGrid (AMG) approximation as an additional preconditioning stage to improve the treatment of the energy equation. We present results for several two-dimensional hot air injection problems using an extra heavy oil, including challenging reactive In-Situ Combustion (ISC) cases. We show improved performance and robustness across different thermal regimes, from advection dominated (high Péclet number) to diffusion dominated (low Péclet number). The number of linear iterations is reduced by 40–85% compared to standard CPR for both homogeneous and heterogeneous media, and the new methods exhibit almost no sensitivity to the thermal regime.

42 ENGINEERING↗
DOE OSTI2024

Gradient Coding With Iterative Block Leverage Score Sampling

Gradient coding is a method for mitigating straggling servers in a centralized computing network that uses erasure-coding techniques to distributively carry out first-order optimization methods. Randomized numerical linear algebra uses randomization to develop improved algorithms for large-scale linear algebra computations. In this study, we propose a method for distributed optimization that combines gradient coding and randomized numerical linear algebra. The proposed method uses a randomized ℓ 2 -subspace embedding and a gradient coding technique to distribute blocks of data to the computational nodes of a centralized network, and at each iteration the central server only requires a small number of computations to obtain the steepest descent update. The novelty of our approach is that the data is replicated according to importance scores, called block leverage scores, in contrast to most gradient coding approaches that uniformly replicate the data blocks. Furthermore, we do not require a decoding step at each iteration, avoiding a bottleneck in previous gradient coding schemes. We show that our approach results in a valid ℓ 2 -subspace embedding, and that our resulting approximation converges to the optimal solution.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2021

Fast multiscale contrast independent preconditioners for linear elastic topology optimization problems

The goal of this work is to present a fast and viable approach for the numerical solution of the high-contrast state problems arising in topology optimization. The optimization process is iterative, and the gradients are obtained by an adjoint analysis, which requires the numerical solution of large high-contrast linear elastic problems with features spanning several length scales. The size of the discretized problems forces the utilization of iterative linear solvers with solution time dependent on the quality of the preconditioner. The lack of clear separation between the scales, as well as the high-contrast, imposes severe challenges on the standard preconditioning techniques. Thus, here we propose new methods for the high-contrast elasticity equation with performance independent of the high-contrast and the multi-scale structure of the elasticity problem. The solvers are based on two-levels domain decomposition techniques with a carefully constructed coarse level to deal with the high-contrast and multi-scale nature of the problem. The construction utilizes spectral equivalence between scalar diffusion and each displacement block of the elasticity problems and, in contrast to previous solutions proposed in the literature, is able to select the appropriate dimension of the coarse space automatically. The new methods inherit the advantages of domain decomposition techniques, such as easy parallelization and scalability. Finally, the presented numerical experiments demonstrate the excellent performance of the proposed methods.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2024

EHR-BERT: A BERT-based model for effective anomaly detection in electronic health records

Objective: Physicians and clinicians rely on data contained in electronic health records (EHRs), as recorded by health information technology (HIT), to make informed decisions about their patients. The reliability of HIT systems in this regard is critical to patient safety. Consequently, better tools are needed to monitor the performance of HIT systems for potential hazards that could compromise the collected EHRs, which in turn could affect patient safety. In this paper, we propose a new framework for detecting anomalies in EHRs using sequence of clinical events. This new framework, EHR-Bidirectional Encoder Representations from Transformers (BERT), is motivated by the gaps in the existing deep-learning related methods, including high false negatives, sub-optimal accuracy, higher computational cost, and the risk of information loss. EHR-BERT is an innovative framework rooted in the BERT architecture, meticulously tailored to navigate the hurdles in the contemporary BERT method; thus, enhancing anomaly detection in EHRs for healthcare applications.Methods: The EHR-BERT framework was designed using the Sequential Masked Token Prediction (SMTP) method. This approach treats EHRs as natural language sentences and iteratively masks input tokens during both training and prediction stages. This method facilitates the learning of EHR sequence patterns in both directions for each event and identifies anomalies based on deviations from the normal execution models trained on EHR sequences.Results: Extensive experiments on large EHR datasets across various medical domains demonstrate that EHR-BERT markedly improves upon existing models. It significantly reduces the number of false positives and enhances the detection rate, thus bolstering the reliability of anomaly detection in electronic health records. This improvement is attributed to the model’s ability to minimize information loss and maximize data utilization effectively.Conclusion: EHR-BERT showcases immense potential in decreasing medical errors related to anomalous clinical events, positioning itself as an indispensable asset for enhancing patient safety and the overall standard of healthcare services. The framework effectively overcomes the drawbacks of earlier models, making it a promising solution for healthcare professionals to ensure the reliability and quality of health data.

96 KNOWLEDGE MANAGEMENT AND PRESERVATION↗
DOE OSTI2020

New method for fitting coefficients in standard model effective theory

We present an alternative method for carrying out a principal-component analysis of Wilson coefficients in standard model effective field theory (SMEFT). The method is based on singular-value decomposition (SVD). The SVD method provides information about the sensitivity of experimental observables to physics beyond the standard model that is not accessible in the Fisher-information method. In principle, the SVD method can also have computational advantages over diagonalization of the Fisher information matrix. We demonstrate the SVD method by applying it to the dimension-6 coefficients for the process of top-quark decay to a b quark and a W boson and use this example to illustrate some pitfalls in widely used fitting procedures. We also outline an iterative procedure for applying the SVD method to dimension-8 SMEFT coefficients.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗
DOE OSTI2020

Predicting mesoscale spectral thermal conductivity using advanced deterministic phonon transport techniques

We present a review, demonstration and simulation of phonon transport for the purposes of predicting materials performance at the mesoscale. We focus primarily on the development and implementation of a unified methodology to enable predictive heat transport. We report on the current state of the art as it pertains to deterministic phonon transport methodologies, discussing various topics concerning phonons. In application, we focus on the Self-Adjoint Angular Flux (SAAF) formulation of the Boltzmann transport equation for phonons, and develop the spatial, angular, and material property discretization required to accurately simulate the predictive physics of heat transport in dielectrics. We discuss thermal interfacial resistance and present our formulation of the diffuse mismatch model for simulating phonon interactions at internal boundaries. We have recently developed a deterministic, spectral phonon transport method for predicting effective thermal conductivity ($\kappa_{\textrm{eff}}$), using Bose-Einstein source terms coupled through an average material temperature. In this method, we introduce a closure term to the phonon transport system which acts as a redistribution function for the total energy of the system, and serves as a guide for the amount of non-equilibrium behavior occurring in the system. This method predicts thermal conductivity and equilibrium temperature distributions in homogeneous and heterogeneous materials using data generated by ab initio density functional theory methods. We employ polarization, density of states and full dispersion spectra to resolve thermal conductivity with numerous angular and spatial discretizations. Our implementation utilizes a Richardson iteration on a modified version of the phonon scattering source. The equations associated with this method are solved via a modification of traditional source iteration. We compare the performance of source iteration applied to an existing uncoupled, traditional SAAF method to our new method and comment on the iterative performance of each. We observe ballistic and diffusive phonon scattering as acoustic thickness of the domain changes, and are able to make comparisons between the accuracy and efficiency of both methods.

36 MATERIALS SCIENCE↗
DOE OSTI2025

Serpent - Bison - THM Preliminary Multiphysics Modeling of a Nuclear Thermal Propulsion System Fuel Assembly

This work demonstrates the Monte Carlo neutronic and Thermo-Hydraulic coupling scheme using the Serpent code and MOOSE application Bison and Thermo Hydraulic Module. The coupling scheme is then applied to the reference BWX Technologies Nuclear Ther- mal Propulsion system at he fuel assembly level where it’s used to perform an analysis of the isothermal material coefficients and potential material reactivity worth. A method is developed to isolate which feedback effects should be considered for proceeding with reduced order deterministic neutronic modeling where branch off analysis must be con- ducted. The convergence behavior of the coupling scheme is demonstrated where it fol- lows the standard Picard iteration approach. Verification studies for the method of deduc- ing relevant feedback effects is also demonstrated.

22 - GENERAL STUDIES OF NUCLEAR REACTORS↗
DOE OSTI2025

Block Lanczos algorithm for lattice QCD spectroscopy and matrix elements

Recent work introduced a new framework for analyzing correlation functions with improved convergence and signal-to-noise properties, as well as rigorous quantification of excited-state effects, based on the Lanczos algorithm and spurious eigenvalue filtering with the Cullum-Willoughby test. Here, we extend this framework to the analysis of correlation-function matrices built from multiple interpolating operators in lattice quantum chromodynamics (QCD) by constructing an oblique generalization of the block Lanczos algorithm, as well as a new physically motivated reformulation of the Cullum-Willoughby test that generalizes to block Lanczos straightforwardly. The resulting block Lanczos method directly extends generalized eigenvalue problem (GEVP) methods, which can be viewed as applying a single iteration of block Lanczos. Block Lanczos provides qualitative and quantitative advantages over GEVP methods analogous to the benefits of Lanczos over the standard effective mass, including faster convergence to ground- and excited-state energies, explicitly computable two-sided error bounds, straightforward extraction of matrix elements of external currents, and asymptotically constant signal-to-noise. No fits or statistical inference are required. Proof-of-principle calculations are performed for noiseless mock-data examples as well as two-by-two proton correlation-function matrices in lattice QCD.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗