Search NASA⌕ Search

SEARCH · Search NASA

Results for “Numerical algorithm”

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

A Decision-Making Machine Learning Approach in Hermite Spectral Approximations of Partial Differential Equations

The accuracy and effectiveness of Hermite spectral methods for the numerical discretization of partial differential equations on unbounded domains are strongly affected by the amplitude of the Gaussian weight function employed to describe the approximation space. This is particularly true if the problem is under-resolved, i.e., there are no enough degrees of freedom. The issue becomes even more crucial when the equation under study is time-dependent, forcing in this way the choice of Hermite functions where the corresponding weight depends on time. In order to adapt dynamically the approximation space, it is here proposed an automatic decision-making process that relies on machine learning techniques, such as deep neural networks and support vector machines. The algorithm is numerically tested with success on a simple 1D problem, but the main goal is its exportability in the context of more serious applications. Here we also show at the end an application in the framework of plasma physics.

97 MATHEMATICS AND COMPUTING↗

Extended Barton–Bandis model for rock joints under cyclic loading: Formulation and implicit algorithm

In this paper, the Barton–Bandis model for rock joints is extended to cyclic loading conditions, without any new material parameter. Also developed herein is an implicit solution algorithm for the extended Barton–Bandis model, which can also be used for the original Barton–Bandis model for which an implicit algorithm has been unavailable. To this end, we first cast the Barton–Bandis model into an incremental elasto-plastic framework, deriving an expression for the elastic shear stiffness being consistent with the original model formulation. We then extend the model formulation to cyclic loading conditions, incorporating the dependence of shear stress and dilation on the joint position and the shearing direction. The extension is achieved by introducing a few state-dependent variables which can be calculated with the existing material parameters. For robust and accurate utilization of the model, we also develop an implicit algorithm based on return mapping, which is unconditionally stable and guarantees the satisfaction of the strength criterion. We verify that the proposed model formulation and algorithm produce virtually the same results as the original Barton–Bandis model under monotonic shearing conditions. Here, we then validate the extended Barton–Bandis model against experimental data on natural rock joints under cycling loading conditions. The present work thus enables the Barton–Bandis model, which has been exceptionally popular in research and practice, to be applicable to a wider range of problems in rock mechanics and rock engineering.

58 GEOSCIENCES↗

Parameter Estimation and Model Validation of Nonlinear Dynamical Networks

In the performance period of this work under a DOE contract, the co-PIs, Philip Gill and Henry Abarbanel, developed new methods for statistical data assimilation for problems of DOE interest, including geophysical and biological problems. This included numerical optimization algorithms for variational principles, new parallel processing Monte Carlo routines for performing the path integrals of statistical data assimilation. These results have been summarized in the monograph: “Predicting the Future: Completing Models of Observed Complex Systems” by Henry Abarbanel, published by Spring-Verlag in June 2013. Additional results and details have appeared in the peer reviewed literature.

42 ENGINEERING↗

Modeling of intragranular misorientation and grain fragmentation in polycrystalline materials using the viscoplastic self-consistent formulation

In this paper, the recently established methodology to use known algorithmic expressions of the second moments of the stress field in the grains of a polycrystalline aggregate for calculating average fluctuations of lattice rotation rates and the associated average intragranular misorientation distributions using the mean-field viscoplastic self-consistent (VPSC) formulation is extended to solve the coupled problem of considering the effect of intragranular misorientations on stress and rotation rate fluctuations. In turn, these coupled expressions are used to formulate and implement a grain fragmentation (GF) model in VPSC. Case studies, including tension and plane-strain compression of face-centered cubic polycrystals are used to illustrate the capabilities of the new model. GF-VPSC predictions of intragranular misorientation distributions and texture evolution are compared with experiments and full-field numerical simulations, showing good agreement. In particular, the inclusion of misorientation spreads reduced the intensity of the deformed texture and thus improved the texture predictions. Finally and moreover, considering that intragranular misorientations act as driving forces for recrystallization, the new GF-VPSC formulation is shown to enable modeling of microstructure evolution during deformation and recrystallization, in a computationally efficient manner.

36 MATERIALS SCIENCE↗

Marker ReDistancing/Level Set Method for High-Fidelity Implicit Interface Tracking

A hybrid of the Front-Tracking (FT) and the Level-Set (LS) methods is introduced, combining advantages and removing drawbacks of both methods. The kinematics of the interface is treated in a Lagrangian (FT) manner, by tracking markers placed at the interface. The markers are not connected – instead, the interface topology is resolved in an Eulerian (LS) framework, by wrapping a signed distance function around Lagrangian markers each time the markers move. For accuracy and efficiency, we have developed a high-order “anchoring” algorithm and an implicit PDE-based re-distancing. We have demonstrated that the method is 3rd-order accurate in space, near the markers, and therefore 1st-order convergent in curvature; in contrast to traditional PDE-based re-initialization algorithms, which tend to slightly relocate the zero Level Set and can be shown to be non-convergent in curvature. The implicit pseudo-time discretization of the re-distancing equation is implemented within the Jacobian-Free Newton Krylov (JFNK) framework combined with ILU(k) preconditioning. We have demonstrated that the steady-state solutions in pseudo-time can be achieved very efficiently, with iterations (CFL ), in contrast to the explicit re-distancing which requires 100s of iterations with CFL . The most cost-effective algorithm is found to be a hybrid of explicit and implicit discretizations, in which we apply first 10-15 iterations with explicit discretization (to bring the initial guess to the ball of convergence for the Newton’s method) and then finishing with 2-3 implicit steps, bringing the re-distancing equation to a complete steady-state. The eigenscopy of the JFNK-ILU(k) demonstrates the efficiency of the ILU(k) preconditioner, which effectively cluster eigenvalues of the otherwise extremely ill-conditioned Jacobian matrices, thereby enabling the Krylov (GMRES) method to converge with iterations, with only a few levels of ILU fill-ins. Importantly, due to the Level Set localization, the bandwidth of the Jacobian matrix is nearly constant, and the ILU preconditioning scales as , which implies efficiency and good scalability of the overall algorithm. The numerical examples include the well-established tests for interface kinematics under translational, rotational and tearing/stretching motion. We have shown that the mass conservation is not an issue anymore, as demonstrated using the Rider&Kothe’s time-reversed tests with extreme deformation. We are able to stretch interface structures to the under-resolved/subgrid (on the chosen Eulerian mesh) scales, and recover them back without any change in shape/loss of mass.

99 GENERAL AND MISCELLANEOUS↗

An improved back projection algorithm of ultrasound tomography

Binary logic back projection algorithm is improved in this work for the development of fast ultrasound tomography system with a better effect of image reconstruction. The new algorithm is characterized by an extra logical value ‘2’ and dual-threshold processing of collected raw data. To compare with the original algorithm, a numerical simulation was conducted by the verification of COMSOL simulations formerly, and then a set of ultrasonic tomography system is established to perform the experiments of one, two and three cylindrical objects. The object images are reconstructed through the inversion of signals matrix acquired by the transducer array after a preconditioning, while the corresponding spatial imaging errors can obviously indicate that the improved back projection method can achieve modified inversion effect.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Preliminary Design of the TEX-MOX Criticality Experimental Program using Optimization Algorithms Implemented in the IRSN PROMETHEE Tool

In the frame of its missions, IRSN is widely involved in design, evaluation and analyses of critical experiments in order to contribute to computer codes and nuclear data validation. The work described in this paper was carried out in the framework of the PRINCESS IRSN research project and is part of the IRSN/LLNL collaboration on the TEX program in the frame of the NCSP. The need for epithermal and intermediate energy range critical benchmarks is an established international criticality safety data need, underpinned by the subsequent use of data assimilation methods like GLLSM to reduce Nuclear Data uncertainties. The goal of the TEX program is to address this need by executing experiments with NCSP fissile assets, which can be used to create critical assemblies that span a wide range of fission energy spectra, from the thermal energy range (below 0.625 eV), through the intermediate energy range (0.625 eV to 100 keV), to the fast one (above 100 keV). The TEX program involves different materials of interest, such as TEX-Ta experiments using plutonium ZPPR plates proposed by LLNL. This paper presents an overview of the studies performed at IRSN using numerical optimization algorithms for the design of critical experiments involving Mixed U and Pu fuel plates, referred to as TEX-MOX program. This program ultimately aims to perform critical experiments to validate the MOX fuel configurations encountered in the MOX fuel fabrication process. (authors)

11 NUCLEAR FUEL CYCLE AND FUEL MATERIALS↗

Sparse matrix‐vector and matrix‐multivector products for the truncated SVD on graphics processors

Summary Many practical algorithms for numerical rank computations implement an iterative procedure that involves repeated multiplications of a vector, or a collection of vectors, with both a sparse matrix and its transpose. Unfortunately, the realization of these sparse products on current high performance libraries often deliver much lower arithmetic throughput when the matrix involved in the product is transposed. In this work, we propose a hybrid sparse matrix layout, named CSRC, that combines the flexibility of some well‐known sparse formats to offer a number of appealing properties: (1) CSRC can be obtained at low cost from the popular CSR (compressed sparse row) format; (2) CSRC has similar storage requirements as CSR; and especially, (3) the implementation of the sparse product kernels delivers high performance for both the direct product and its transposed variant on modern graphics accelerators thanks to a significant reduction of atomic operations compared to a conventional implementation based on CSR. This solution thus renders considerably higher performance when integrated into an iterative algorithm for the truncated singular value decomposition (SVD), such as the randomized SVD or, as demonstrated in the experimental results, the block Golub–Kahan–Lanczos algorithm.

Aliaga, José I.↗

FDEM v.1.0

Algorithm FOEM numerically solves a system of six, coupled, first-order, linear, inhomogeneous partial differential equations (called the "EH-system") with an explicit, time-domain, finite-difference (FD) The six dependent variables three electric field vector components and three magnetic field FOEM vector components) are stored on staggered spatial and temporal grids. Discrete FO operators approximating the partial derivatives possess 2nd-order accuracy in time and Nth-order accuracy in space. The 3D spatial grid is rectangular, and grid intervals are uniform in each coordinate direction. FD formulae for updating the wavefield variables are appropriately non-dimensionalized and normalized so that single-precision arithmetic calculations yield adequate accuracy. This software will be used to generate electromagnetic responses for typical geological/geophysical models of interest in the petroleum, mining, geotechnical, geothermal, hydrological, environmental assessment, and underground storage industries. Additionally, US government agencies (including the military) involved in monitoring of explosions (chemical or nuclear) or remote surveillance of underground facilities may be interested in using algorithm FOEM. Finally, this software may be of use to organizations involved in fundamental research and applications development in the area of electromagnetic wave propagation (e.g. national laboratories, academic departments. industry).

Source record↗

Investigation of a breathing surrogate prediction algorithm for prospective pulmonary gating

Purpose: A major challenge of four dimensional computed tomography (4DCT) in treatment planning and delivery has been the lack of respiration amplitude and phase reproducibility during image acquisition. The implementation of a prospective gating algorithm would ensure that images would be acquired only during user-specified breathing phases. This study describes the development and testing of an autoregressive moving average (ARMA) model for human respiratory phase prediction under quiet respiration conditions. Methods: A total of 47 4DCT patient datasets and synchronized respiration records was utilized in this study. Three datasets were used in model development and were removed from further evaluation of the ARMA model. The remaining 44 patient datasets were evaluated with the ARMA model for prediction time steps from 50 to 1000 ms in increments of 50 and 100 ms. Thirty-five of these datasets were further used to provide a comparison between the proposed ARMA model and a commercial algorithm with a prediction time step of 240 ms. Results: The optimal number of parameters for the ARMA model was based on three datasets reserved for model development. Prediction error was found to increase as the prediction time step increased. The minimum prediction time step required for prospective gating was selected to be half of the gantry rotation period. The maximum prediction time step with a conservative 95% confidence criterion was found to be 0.3 s. The ARMA model predicted peak inhalation and peak exhalation phases significantly better than the commercial algorithm. Furthermore, the commercial algorithm had numerous instances of missed breath cycles and falsely predicted breath cycles, while the proposed model did not have these errors. Conclusions: An ARMA model has been successfully applied to predict human respiratory phase occurrence. For a typical CT scanner gantry rotation period of 0.4 s (0.2 s prediction time step), the absolute error was relatively small, 0.06{+-}0.02 s at peak inhalation and 0.05{+-}0.04 s at peak exhalation. The application of the ARMA model for prospective pulmonary gating has been demonstrated.

62 RADIOLOGY AND NUCLEAR MEDICINE↗

Determining the Ensemble N -Representability of Reduced Density Matrices

The N-representability problem for reduced density matrices remains a fundamental challenge in electronic structure theory. Following our previous work that employs a unitary-evolution algorithm based on an adaptive derivative-assembled pseudo-Trotter variational quantum algorithm to probe pure-state N-representability of reduced density matrices [J. Chem. Theory Comput. 2024, 20, 9968], in this work we propose a practical framework for determining the ensemble N-representability of a p-body matrix. This is accomplished using a purification strategy that embeds an ensemble state into a pure state defined on an extended Hilbert space, such that the reduced density matrices of the purified state reproduce those of the original ensemble. By iteratively applying variational unitaries to an initial purified state, the proposed algorithm minimizes the Hilbert-Schmidt distance between its p-body reduced density matrix and a specified target p-body matrix, which serves as a measure of the N-representability of the target. This methodology facilitates both error correction of defective ensemble reduced density matrices and quantum-state reconstruction on a quantum computer, offering a route for density-matrix refinement. We validate the algorithm with numerical simulations on systems of two, three, and four electrons in both simple models as well as molecular systems at finite temperature, demonstrating its robustness.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Quantum phase diagram of fermion mixtures with population imbalance in one-dimensional optical lattices

With a recently developed time-evolving block decimation algorithm, we numerically study the ground-state quantum phase diagram of Fermi mixtures with attractive interspecies interactions loaded in one-dimensional optical lattices. For our study, we adopt a general asymmetric Hubbard model with species-dependent tunneling rates to incorporate the possibility of mass imbalance in the mixtures. We find clear signatures for the existence of a Fulde-Ferrell-Larkin-Ovchinnikov (FFLO) phase in this model in the presence of population imbalance. Our simulation also reveals that in the presence of mass imbalance, the parameter space for FFLO states shrinks or even completely vanishes depending on the strength of the attractive interaction and the degree of mass imbalance.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗

Identification of crystal plasticity model parameters by multi-objective optimization integrating microstructural evolution and mechanical data

Crystal plasticity models evolve a polycrystalline yield surface using meso-scale descriptions of deformation mechanisms. The activation of deformation mechanisms is governed by crystallography and a set of model parameters, which are typically calibrated through the fitting of mechanical data such as stress–strain curves and elastic lattice strains. Microstructural data such as phase fractions and texture evolution are used for verifying crystal plasticity parameters. In this study, we use a multi-objective genetic algorithm to identify hardening parameters from flow stress curves with an option to incorporate texture into the optimization approach. Robust, generalized objective functions are developed and used to identify sets of parameters pertaining to dislocation density-based hardening laws in visco-plastic and elasto-plastic self-consistent (VPSC and EPSC) homogenization models. First, the parameters are identified for pure Nb directly from texture using an objective function based on generalized spherical harmonics. Since texture evolution is driven by the relative contribution of active slip systems, the parameters governing the evolution of slip resistance ratios can be recovered from fitting discrete textures at a series of strains. Next, a comprehensive set of load reversal data for dual phase (DP) 780 steel is used to fit a hardening law and a back-stress law in EPSC. Finally, parameters pertaining to a complex hardening law for the evolution of slip and twinning in pure α-Ti are identified. Remarkably, using texture as an objective in combination with stress–strain objectives constrains the model of Ti to fully reproduce not only stress–strain and texture evolution but also hierarchical twinning measurements as a function of initial grain size and texture. Furthermore, given an appropriate model fit to representative experimental texture evolution, underlying twin volume fractions contributing to texture evolution can be predicted.

42 ENGINEERING↗

OPTIMIZED MULTI-FREQUENCY SPECTRA FOR APPLICATIONS IN RADIATIVE FEEDBACK AND COSMOLOGICAL REIONIZATION

The recent implementation of radiative transfer algorithms in numerous hydrodynamics codes has led to a dramatic improvement in studies of feedback in various astrophysical environments. However, because of methodological limitations and computational expense, the spectra of radiation sources are generally sampled at only a few evenly spaced discrete emission frequencies. Using one-dimensional radiative transfer calculations, we investigate the discrepancies in gas properties surrounding model stars and accreting black holes that arise solely due to spectral discretization. We find that even in the idealized case of a static and uniform density field, commonly used discretization schemes induce errors in the neutral fraction and temperature by factors of two to three on average, and by over an order of magnitude in certain column density regimes. The consequences are most severe for radiative feedback operating on large scales, dense clumps of gas, and media consisting of multiple chemical species. We have developed a method for optimally constructing discrete spectra, and show that for two test cases of interest, carefully chosen four-bin spectra can eliminate errors associated with frequency resolution to high precision. Applying these findings to a fully three-dimensional radiation-hydrodynamic simulation of the early universe, we find that the H II region around a primordial star is substantially altered in both size and morphology, corroborating the one-dimensional prediction that discrete spectral energy distributions can lead to sizable inaccuracies in the physical properties of a medium, and as a result, the subsequent evolution and observable signatures of objects embedded within it.

79 ASTRONOMY AND ASTROPHYSICS↗

Turbomole

Turbomole is a highly optimized software package for large‐scale quantum chemical simulations of molecules, clusters, and periodic solids. Turbomole uses G aussian basis sets and specializes on predictive electronic structure methods with excellent cost to performance characteristics, such as (time‐dependent) density functional theory ( TDDFT ), second‐order M øller– P lesset theory, and explicitly correlated coupled cluster ( CC ) methods. These methods are combined with ultraefficient and numerically stable algorithms such as integral‐direct and Laplace transform methods, resolution‐of‐the‐identity, pair natural orbitals, fast multipole, and low‐order scaling techniques. Apart from energies and structures, a variety of optical, electric, and magnetic properties are accessible from analytical energy derivatives for electronic ground and excited states. Recent additions include post‐ K ohn– S ham calculations within the random phase approximation, periodic calculations, spin–orbit couplings, explicitly correlated CC singles doubles and perturbative triples methods, CC singles doubles excitation energies, and nonadiabatic molecular dynamics simulations using TDDFT . A dedicated graphical user interface and a user support network are also available. This article is categorized under: Software > Quantum Chemistry

Furche, Filipp↗

Function Maximization with Dynamic Quantum Search

Finding the maximum value of a function in a dynamic model plays an important role in many application settings, including discrete optimization in the presence of hard constraints. We present an iterative quantum algorithm for finding the maximum value of a function in which prior search results update the acceptable response. Our approach is based on quantum search and utilizes a dynamic oracle function to mark items in a specified input set. As a realization of function optimization, we verify the correctness of the algorithm using numerical simulations of quantum circuits for the Knapsack problem. In conclusion, our simulations make use of an explicit oracle function based on arithmetic operations and a comparator subroutine, and we verify these implementations using numerical simulations up to 30 qubits.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Adaptive Sampling-Based Bi-Fidelity Stochastic Trust Region Method for Stochastic Derivative-Free Optimization

Bi-fidelity stochastic optimization has gained increasing attention as an efficient approach to reduce computational costs by leveraging a low-fidelity (LF) model to optimize an expensive high-fidelity (HF) objective. In this paper, we propose ASTRO-BFDF, an adaptive sampling trust-region method specifically designed for unconstrained bi-fidelity stochastic derivative-free optimization problems. In ASTRO-BFDF, the LF function serves two purposes: (i) to identify better iterates for the HF function when the optimization process indicates a high correlation between them and (ii) to reduce the variance of the HF function estimates using bi-fidelity Monte Carlo (BFMC). The algorithm dynamically determines sample sizes while adaptively choosing between crude Monte Carlo and BFMC to balance the trade-off between optimization and sampling errors. We prove that the iterates generated by ASTRO-BFDF converge to a first-order stationary point almost surely. Additionally, we demonstrate the effectiveness of the proposed algorithm through numerical experiments on synthetic benchmarks and simulation optimization problems involving discrete event systems.

97 MATHEMATICS AND COMPUTING↗

Modelling recrystallization textures driven by intragranular fluctuations implemented in the viscoplastic self-consistent formulation

This work presents a recrystallization model driven by intragranular orientation gradients and strain energy fields calculated by means of the viscoplastic self-consistent (VPSC) formulation. The VPSC model is extended for calculation of the coupling between intragranular stress fluctuations with corresponding second moments of lattice spin and misorientation fields in the grains. Access to these quantities allows modelling of transition bands and nucleation kinetics. In the proposed recrystallization model, grain growth is assumed to be proportional to the difference between the stored energy of each grain and that of the effective medium. Recrystallization textures for several cubic metals are simulated, showing good agreement with corresponding experiments. The model reveals the importance of considering appropriate, microstructurally-based and orientation-dependent recrystallization nucleation mechanisms. The recrystallization texture of heavily rolled copper with a strong cube texture component is found to be a consequence of nucleation at transition bands, which is also the cause of the recrystallization textures in compressed iron and drawn copper wire. Finally, in contrast, the recrystallization texture of rolled interstitial-free steel is found to be caused by grain boundary nucleation occurring in grains with the highest strain energy.

36 MATERIALS SCIENCE↗