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 487 records · Page 27
All sourcesNASA NTRSDOE OSTI
DOE OSTI2024

Development of Segregated Thermal-Hydraulics Solvers in MOOSE

The simulation of fluid flows is an essential part of the design and analysis of nuclear systems. Algorithms able to simulate flows at different fidelity levels are available in the Multiphysics Object-Oriented Simulation Environment (MOOSE) and MOOSE-based applications such as Pronghorn \cite{novak2018pronghorn}, Pronghorn-Subchannel, RELAP-7, and SAM. Currently, significant effort is being invested in the development of coarse-mesh Computational Fluid Dynamics (CFD) capabilities within MOOSE and Pronghorn for the simulation of Generation IV nuclear reactors. Traditionally, the solution algorithms in MOOSE have relied on Newton or quasi-Newton methods (such as the preconditioned Jacobian-free Newton-Krylov method) where residuals and Jacobians (or approximations thereof) are constructed. Both Newton and quasi-Newton methods require the solution of a linear system at each nonlinear Newton iteration with the Jacobian as the system matrix. The Jacobian contains blocks originating from all variables in the problem (i.e., for thermal-hydraulics at least pressure, velocities, and temperature). Due to the formulation of the problem in a general multiphysics setting on unstructured mesh, creating a good preconditioner for the linear system can be challenging, thus many fluid applications have utilized direct solver-based methods such as LU factorization. However, with increasing system size and complexity in multi-dimensional problems, the direct solution of linear systems becomes computationally expensive both in execution time and and memory. For this reason, recent effort has focused on adapting segregated solution algorithms for CFD problems in MOOSE. These algorithms use fixed-point iteration between segregated systems whose assembly and preconditioning are easier those of the monolithic system. Initial results show that the segregated solution algorithm outperforms the monolithic approach in terms of memory usage and for large 3D problems in terms of CPU time as well.

42 ENGINEERING↗
DOE OSTI2024

Development of Segregated Thermal-Hydraulics Solvers in MOOSE

The simulation of fluid flows is an essential part of the design and analysis of nuclear systems. Algorithms able to simulate flows at different fidelity levels are available in the Multiphysics Object-Oriented Simulation Environment (MOOSE) and MOOSE-based applications such as Pronghorn \cite{novak2018pronghorn}, Pronghorn-Subchannel, RELAP-7, and SAM. Currently, significant effort is being invested in the development of coarse-mesh Computational Fluid Dynamics (CFD) capabilities within MOOSE and Pronghorn for the simulation of Generation IV nuclear reactors. Traditionally, the solution algorithms in MOOSE have relied on Newton or quasi-Newton methods (such as the preconditioned Jacobian-free Newton-Krylov method) where residuals and Jacobians (or approximations thereof) are constructed. Both Newton and quasi-Newton methods require the solution of a linear system at each nonlinear Newton iteration with the Jacobian as the system matrix. The Jacobian contains blocks originating from all variables in the problem (i.e., for thermal-hydraulics at least pressure, velocities, and temperature). Due to the formulation of the problem in a general multiphysics setting on unstructured mesh, creating a good preconditioner for the linear system can be challenging, thus many fluid applications have utilized direct solver-based methods such as LU factorization. However, with increasing system size and complexity in multi-dimensional problems, the direct solution of linear systems becomes computationally expensive both in execution time and and memory. For this reason, recent effort has focused on adapting segregated solution algorithms for CFD problems in MOOSE. These algorithms use fixed-point iteration between segregated systems whose assembly and preconditioning are easier those of the monolithic system. Initial results show that the segregated solution algorithm outperforms the monolithic approach in terms of memory usage and for large 3D problems in terms of CPU time as well.

42 ENGINEERING↗
DOE OSTI2020

A least-squares finite element method based on the Helmholtz decomposition for hyperbolic balance laws

In this paper, a least-squares finite element method for scalar nonlinear hyperbolic balance laws is proposed and studied. The approach is based on a formulation that utilizes an appropriate Helmholtz decomposition of the flux vector and is related to the standard notion of a weak solution. This relationship, together with a corresponding connection to negative-norm least-squares, is described in detail. As a consequence, an important numerical conservation theorem is obtained, similar to the famous Lax–Wendroff theorem. The numerical conservation properties of the method in this paper do not fall precisely in the framework introduced by Lax and Wendroff, but they are similar in spirit as they guarantee that when L 2 convergence holds, the resulting approximations approach a weak solution to the hyperbolic problem. The least-squares functional is continuous and coercive in an H -1 -type norm, but not L 2 -coercive. Nevertheless, the L 2 convergence properties of the method are discussed. Convergence can be obtained either by an explicit regularization of the functional, that provides control of the L 2 norm, or by properly choosing the finite element spaces, providing implicit control of the L 2 norm. Numerical results for the inviscid Burgers equation with discontinuous source terms are shown, demonstrating the L 2 convergence of the obtained approximations to the physically admissible solution. The numerical method utilizes a least-squares functional, minimized on finite element spaces, and a Gauss–Newton technique with nested iteration. Finally, we believe that the linear systems encountered with this formulation are amenable to multigrid techniques and combining the method with adaptive mesh refinement would make this approach an efficient tool for solving balance laws (this is the focus of a future study).

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2024

Pressure-stabilized fixed-stress iterative solutions of compositional poromechanics

We consider the numerical behavior of the fixed-stress splitting method for coupled poromechanics as undrained regimes are approached. We explain that pressure stability is related to the splitting error of the scheme, not the fact that the discrete saddle point matrix never appears in the fixed-stress approach. This observation reconciles previous results regarding the pressure stability of the splitting method. Using examples of compositional poromechanics with application to geological CO sequestration, we see that solutions obtained using the fixed-stress scheme with a low order finite element-finite volume discretization which is not inherently inf-sup stable can exhibit the same pressure oscillations obtained with the corresponding fully implicit scheme. Moreover, pressure jump stabilization can effectively remove these spurious oscillations in the fixed-stress setting, while also improving the efficiency of the scheme in terms of the number of iterations required at every time step to reach convergence.

42 ENGINEERING↗
DOE OSTI2022

Deblurring galaxy images with Tikhonov regularization on magnitude domain

Abstract We propose a regularization-based deblurring method that works efficiently for galaxy images. The spatial resolution of a ground-based telescope is generally limited by seeing conditions and is much worse than space-based telescopes. This circumstance has generated considerable research interest in the restoration of spatial resolution. Since image deblurring is a typical inverse problem and often ill-posed, solutions tend to be unstable. To obtain a stable solution, much research has adopted regularization-based methods for image deblurring, but the regularization term is not necessarily appropriate for galaxy images. Although galaxies have an exponential or Sérsic profile, the conventional regularization assumes the image profiles to behave linearly in space. The significant deviation between the assumption and real situations leads to blurring of the images and smoothing out the detailed structures. Clearly, regularization on logarithmic domain, i.e., magnitude domain, should provide a more appropriate assumption, which we explore in this study. We formulate a problem of deblurring galaxy images by an objective function with a Tikhonov regularization term on a magnitude domain. We introduce an iterative algorithm minimizing the objective function with a primal–dual splitting method. We investigate the feasibility of the proposed method using simulation and observation images. In the simulation, we blur galaxy images with a realistic point spread function and add both Gaussian and Poisson noise. For the evaluation with the observed images, we use galaxy images taken by the Subaru HSC-SSP. Both of these evaluations show that our method successfully recovers the spatial resolution of the deblurred images and significantly outperforms the conventional methods. The code is publicly available from the GitHub 〈https://github.com/kzmurata-astro/PSFdeconv_amag〉.

Murata, Kazumi↗
DOE OSTI2025

SYCL for Performance Portability: Application Experience with Coupled Cluster Formalism in Quantum Chemistry on Exascale Systems

The exascale computing has brought unprecedented heterogeneity in node architectures, with systems such as Frontier and Aurora featuring diverse GPU accelerators, network connectivity among others. Ensuring performance portability across these platforms is a key challenge. To address this, we employ the SYCL programming model to develop portable, high-performance quantum chemistry workloads. As a representative application, we focus on the non-iterative Triples component of the coupled-cluster CCSD(T) method, a key driver in quantum chemistry. In this work, we report on our experience deploying SYCL-based implementations using both DPC++ and AdaptiveCPP across two flagship exascale platforms: OLCF Frontier with AMD MI250X GPUs and ALCF Aurora with Intel GPUs. Our results demonstrate that SYCL enables efficient, single-source implementations that scale to thousands of nodes, delivering performance on par with vendor-optimized HIP solutions. We highlight key insights into runtime behavior, kernel portability, and scaling characteristics, showing that SYCL offers a viable path for performance-portable computing.

Bagusetty, Abhishek [Argonne National Laboratory (↗
DOE OSTI2023

Understanding the Uncertainty in the Technical Performance Level Assessment for Wave Energy

In recent years, the design and development of wave energy converters (WECs) has been explored with intense interest, with highly varying design concepts emerging globally across both research enterprises and industry. The design space for WECs is vast - many concepts ranging in functionality, control systems, power development systems, materials, and scale have been ideated and prototyped, but WEC technology has yet to converge. One critical element of the technology trajectory that governs the speed of adoption is the performance of a WEC concept. In analogous but more-established industries (such as aerospace, and environmentally sustainable electronics design), performance assessment is a quantitative method, based on historical data, that is used as an iterative tool to improve the design of these systems early on in the design process. Though more nascent than these approaches, in wave energy R&D, WEC performance has been assessed using the Technology Performance Level (TPL) assessment, which provides designers with a quantitative score, situating a grid-scale WEC concept on a scale from 1-9 (1 being the lowest performance, and 9 being the highest, trending with the oft-used Technology Readiness Level, or TRL). The TPL assessment is designed to be used during design iteration, when a WEC concept is fully ideated, to enable designers to consider potential means of improving the downstream performance of the concept. One concern that may be slowing the adoption of TPL among WEC developers is the inherent uncertainty in the assessment, and how uncertainty in the individual questions asked as part of the assessment may contribute to perceived inaccuracies in the final score. In this work, we explore the uncertainty present in the assessment and quantify this uncertainty using both traditional mathematical operations and a Monte Carlo simulation. Results imply areas of improvement of the TPL assessment, where reducing uncertainty will be most helpful to end users, enabling both TPL practitioners and users to understand with more accuracy those design elements that can be improved to impact device performance most substantively.

techno-economic analysis↗
DOE OSTI2024

Scalable measurement error mitigation via iterative bayesian unfolding

Measurement errors are a significant obstacle to achieving scalable quantum computation. To counteract systematic readout errors, researchers have developed postprocessing techniques known as measurement error mitigation methods. However, these methods face a tradeoff between scalability and returning nonnegative probabilities. In this paper, we present a solution to overcome this challenge. Our approach focuses on iterative Bayesian unfolding, a standard mitigation technique used in high-energy physics experiments, and implements it in a scalable way. We demonstrate our method on experimental Greenberger-Horne-Zeilinger state preparation on up to 127 qubits and on the Bernstein-Vazirani algorithm on up to 26 qubits. Compared to state-of-the-art methods (such as M3), our implementation guarantees valid probability distributions, returns comparable or better-mitigated results, and does so without a noticeable time and memory overhead. Published by the American Physical Society 2024

Pokharel, Bibek (ORCID:0000000342841353)↗
DOE OSTI2023

Efficient Multigrid Reduction-in-Time for Method-of-Lines Discretizations of Linear Advection

Parallel-in-time methods for partial differential equations (PDEs) have been the subject of intense development over recent decades, particularly for diffusion-dominated problems. It has been widely reported in the literature, however, that many of these methods perform quite poorly for advection-dominated problems. In this report we analyze the particular iterative parallel-in-time algorithm of multigrid reduction-in-time (MGRIT) for discretizations of constant-wave-speed linear advection problems. We focus on common method-of-lines discretizations that employ upwind finite differences in space and Runge-Kutta methods in time. Using a convergence framework we developed in previous work, we prove for a subclass of these discretizations that, if using the standard approach of rediscretizing the fine-grid problem on the coarse grid, robust MGRIT convergence with respect to CFL number and coarsening factor is not possible. This poor convergence and non-robustness is caused, at least in part, by an inadequate coarse-grid correction for smooth Fourier modes in space-time known as characteristic components. We propose an alternative coarse-grid operator that provides a better correction of these modes. This coarse-grid operator is related to previous work and uses a semi-Lagrangian discretization combined with an implicitly treated truncation error correction. Theory and numerical experiments show the proposed coarse-grid operator yields fast MGRIT convergence for many of the method-of-lines discretizations considered, including for both implicit and explicit discretizations of high order. Parallel results demonstrate speed-up over sequential time-stepping.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2022

Online data-enabled predictive control

We develop an online data-enabled predictive (ODeePC) control method for optimal control of unknown systems, building on the recently proposed DeePC (Coulson et al., 2019). Our proposed ODeePC method leverages a primal-dual algorithm with real-time measurement feedback to iteratively compute the corresponding real-time optimal control policy as system conditions change. The proposed ODeePC conceptual-wise resembles standard adaptive system identification and model predictive control (MPC), but it provides a new alternative for the standard methods. ODeePC is enabled by computationally efficient methods that exploit the special structure of the Hankel matrices in the context of DeePC with Fast Fourier Transform (FFT) and primal-dual algorithm We provide theoretical guarantees regarding the asymptotic behavior of ODeePC, and we demonstrate its performance through numerical examples.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2024

Non-disruptive error field measurement in DIII-D low safety factor plasmas and projection to ITER

Previous experiments in DIII-D (Paz-Soldan et al 2022 Nucl. Fusion 62 126007) introduced a method to identify intrinsic error fields (EFs) in tokamaks with minimal disruption risk by promptly healing driven magnetic islands during the conventional 'compass scan'. This paper presents recent experimental and numerical advancements in extending this approach to low q 95 plasmas, and projects its applicability to ITER. Non-disruptive EF measurement is achieved at q 95 = 4.5 and 3.9 without any initial EF correction (EFC) by reducing the time between the occurrence of the locked mode (LM) and control action to 10 ms and increasing the density 50%–100%. However, 50% correction of the intrinsic EF is required to achieve island healing at q 95 = 3.2 with 10 ms delay for the control action. Nonlinear two-fluid modeling with the TM1 code reproduces the DIII-D experimental observations, indicating that promptly turning off the 3D coil current reduces both magnetic island width and electromagnetic force, while raising the density increases plasma viscosity, facilitating magnetic island healing. The simulations show that for scenarios with q 95 = 3.2, lowering the control action time to 5 ms will lead to island healing without EFC. TM1 simulations are extended to future ITER scenarios with 5 MA and 7.5 MA plasma currents, predicting the dependence of required density rise on action time and EF amplitude. These simulations indicate that, benefiting from the much longer resistive time, island healing can be successfully achieved in ITER when taking control action 100–500 ms after a LM occurrence.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗
DOE OSTI2020

Diffusion Synthetic Acceleration for Heterogeneous Domains, Compatible with Voids

A standard approach to solving the S N transport equations is to use source iteration with diffusion synthetic acceleration (DSA). Although this approach is widely used and effective on many problems, there remain some practical issues with DSA preconditioning, particularly on highly heterogeneous domains. For large-scale parallel simulation, it is critical that both (a) preconditioned source iteration converges rapidly and (b) the action of the DSA preconditioner can be applied using fast, scalable solvers, such as algebraic multigrid (AMG). For heterogeneous domains, these two interests can be at odds. In particular, there exist DSA diffusion discretizations that can be solved rapidly using AMG, but they do not always yield robust/fast convergence of the larger source iteration. Conversely, there exist robust DSA discretizations where source iteration converges rapidly on difficult heterogeneous problems, but fast parallel solvers like AMG tend to struggle applying the action of such operators. Moreover, very few current methods for the solution of deterministic transport are compatible with voids. This paper develops a new heterogeneous DSA preconditioner based on only preconditioning the optically thick subdomains. The resulting method proves robust on a variety of heterogeneous transport problems, including a linearized hohlraum mesh related to inertial confinement fusion. Moreover, the action of the preconditioner is easily computed using O(1) AMG iterations, convergence of the transport iteration typically requires 2 to 5× fewer iterations than current state-of-the-art “full” DSA, and the proposed method is trivially compatible with voids. On the hohlraum problem, rapid convergence is obtained by preconditioning less than 3% of the mesh elements with five to ten AMG iterations.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗
DOE OSTI2022

Fast nonlinear iterative solver for an implicit, energy-conserving, asymptotic-preserving charged-particle orbit integrator

Here recently, an asymptotic-preserving (AP) particle orbit integrator has been proposed with remarkable properties including exact energy conservation, the ability to capture of all first-order drifts (including the ∇B-drift), the ability to capture trapped-passing boundaries with parallel velocity extremely close to the critical velocity, and the ability to transition from strongly to weakly magnetized spatial regions. The new AP orbit integrator is implicit, employing a Crank-Nicolson (CN) temporal discretization to ensure exact energy conservation. This, in turn, requires a local nonlinear iteration involving particle velocities and positions, and the local electromagnetic fields, to obtain the new-time solution. Ref. [1] did not attempt to provide an efficient solver for this system, and employed a brute-force GMRES-driven Jacobian-free Newton-Krylov (JFNK) solver to invert the particle orbit equations at every timestep for expediency. While JFNK is robust and reliable, it is also expensive and very intrusive for practical implementations of the method (it requires having the JFNK machinery available and solving a 6 x 6 Jacobian system iteratively once per iteration per particle).

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2020

Efficient 3-D velocity model building using joint inline and crossline plane-wave wave-equation migration velocity analyses

SUMMARY Wave-equation migration velocity analysis (WEMVA) is an image-domain inversion method for velocity model building. Automatic plane-wave WEMVA (PWEMVA) calculates the moveouts of plane-wave common-image gathers (CIGs) by searching a best-fitting parabola with semblance analysis and backprojects residual CIG moveouts into wavefield wave paths with a reflection tomographic kernel. However, 3-D PWEMVA is very computationally expensive because 3-D reflection tomographic inversion requires at least five 3-D reverse-time migrations per iteration and stores two types of source wavefields at model boundaries. We develop a joint inline and crossline PWEMVA method for efficient 3-D velocity model building. We alternatively implement the inline and crossline PWEMVAs with a constraint for each other, in which we iteratively construct the 3-D velocity model update through 1-D spline interpolation of 2-D gradients. The inline and crossline joint inversion is practical since PWEMVA only inverts for low-wavenumber velocity perturbations along wave paths, and the method can take less than 1 per cent of the computational cost of full 3-D PWEMVA. To construct unaliased plane waves for our joint inline and crossline PWEMVA, we develop a 3-D data interpolation method in the frequency–wavenumber (FK) domain to recover regularly and randomly missing traces. The method minimizes the misfit on sufficiently localized data subsets with iterative optimal step lengths and a gradient preconditioner that iteratively selects dominant dips along different azimuths. In numerical experiments, we use a 3-D synthetic seismic data set and a land 3-D field seismic data set acquired at the Farnsworth CO2-EOR (enhanced oil recovery) field to demonstrate the efficacy of our velocity model building and data interpolation methods.

Liu, Xuejian↗
DOE OSTI2022

Early arrival waveform inversion using data uncertainties and matching filters with application to near-surface seismic refraction data

We develop an early arrival waveform inversion (EAWI) technique for high-resolution near-surface velocity estimation by iteratively updating the P-wave velocity model to minimize the difference between the observed and calculated seismic refraction data. Traditional EAWI uses a least-squares penalty function and an acoustic forward-modeling engine. Conventional least-squares error is sensitive to data with low signal-to-noise ratio (S/N) and iterations of EAWI stop at a local-minimum data misfit or at the preassigned maximum number of iterations. These stopping criteria can result in overfitting the data. In addition, fitting the elastic field data with an acoustic modeling engine can introduce artifacts in velocity estimation, especially in land data with significant elastic effects. To overcome these challenges, we develop a robust EAWI (REAWI) method by (1) incorporating the data uncertainties into the penalty function and (2) mitigating the elastic effects using a matching filter workflow. The data uncertainties are estimated from waveform reciprocal errors. When full-waveform reciprocity is not available, trace interpolation is applied. The proposed method prevents closely fitting data with low S/N, avoids overall overfitting by stopping the iterations when a normalized chi-square ([Formula: see text]) waveform misfit of one is achieved, and is less affected by elastic effects. Numerical examples and application to near-surface refraction data at a groundwater contamination site suggest that the final REAWI models are more accurate than the corresponding EAWI models, at the same level of misfit. This is the first known application of a matching filter workflow to real land data. The final REAWI models satisfy an appropriate misfit between the real data and predicted elastic P-wave data, making this approach in this respect equivalent to elastic waveform inversion. We also develop a method to analyze model constraint by examining the energy of the wavefield Fréchet derivative thereby avoiding the influence of the data residuals in traditional Fréchet kernels.

Geochemistry & Geophysics↗
DOE OSTI2023

Deep learning workflow for the inverse design of molecules with specific optoelectronic properties

The inverse design of novel molecules with a desirable optoelectronic property requires consideration of the vast chemical spaces associated with varying chemical composition and molecular size. First principles-based property predictions have become increasingly helpful for assisting the selection of promising candidate chemical species for subsequent experimental validation. However, a brute-force computational screening of the entire chemical space is decidedly impossible. To alleviate the computational burden and accelerate rational molecular design, we here present an iterative deep learning workflow that combines (i) the density-functional tight-binding method for dynamic generation of property training data, (ii) a graph convolutional neural network surrogate model for rapid and reliable predictions of chemical and physical properties, and (iii) a masked language model. As proof of principle, we employ our workflow in the iterative generation of novel molecules with a target energy gap between the highest occupied molecular orbital (HOMO) and the lowest unoccupied molecular orbital (LUMO).

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2025

Stable Simulation of the Community Atmosphere Model Using Machine‐Learning Physical Parameterization Trained With Experience Replay

In recent years, machine learning (ML) models have been used to improve physical parameterizations of general circulation models (GCMs). A significant challenge of integrating ML models into GCMs is the online instability when they are coupled for long‐term simulation. We present a new strategy that demonstrates robust online stability when the physical parameterization package of an atmospheric GCM is replaced by a deep ML model. The method uses experience replay with a multistep training scheme of the ML model in which the model's own output at the previous time step is used in the training. Predicted physics tendencies in the replay buffer with the most recent errors in the training iterations are reused, making the ML model learn from its own errors. The training method reduces the gap between the offline and online environments of the ML model. The method is used to train the ML model as the physical parameterization of the Community Atmosphere Model (CAM5) with training data from the Multi‐scale Modeling Framework high resolution simulations. Three 6‐year online simulations of the CAM5 are carried out by using the ML physics package. The simulated spatial distributions of precipitation, surface temperature and zonally averaged atmospheric fields demonstrate overall better accuracy than that of the standard CAM5 and benchmark model even without the use of additional physical constraints or tuning. This work is the first to demonstrate a solution to address the online instability problem in climate modeling with ML physics by using experience replay.

54 ENVIRONMENTAL SCIENCES↗
DOE OSTI2020

Nonoverlapping Localized Exponential Time Differencing Methods for Diffusion Problems

In this paper, we propose nonoverlapping localized exponential time differencing (ETD) methods for diffusion problems. The model time-dependent diffusion equation is first reformulated on subdomains based on the nonoverlapping domain decomposition, in which Neumann boundary conditions are imposed on the interfaces for the subdomain problems and Dirichlet type conditions are enforced to form a space-time interface problem. After spatial discretization by standard central finite differences and temporal integration with the first or second order ETD methods, the fully discrete interface problem is obtained. Such an interface problem is then solved iteratively either at each time step or over the whole time interval: the former involves the solution of stationary problems in each subdomain at each iteration while the latter involves the solution of time-dependent subdomain problems at each iteration. For both approaches, we prove that localized ETD solutions conserve mass exactly and converge in time to the exact space semidiscrete solution. Numerical experiments in two dimensions are also presented to illustrate the performance of the proposed methods.

Mass conservation↗