Search NASA⌕ Search

SEARCH · Search NASA

Results for “multiple iterations”

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 145 records · Page 8

Enhanced Confinement Scenarios Without Large Edge Localized Modes in Tokamaks: Control, Performance, and Extrapolability Issues for ITER

Large edge localized modes (ELMs) typically accompany good H-mode confinement in fusion devices, but can present problems for plasma facing components because of high transient heat loads. Here the range of techniques for ELM control deployed in fusion devices is reviewed. The two baseline strategies in the ITER baseline design are emphasized: rapid ELM triggering and peak heat flux control via pellet injection, and the use of magnetic perturbations to suppress or mitigate ELMs. While both of these techniques are moderately well developed, with reasonable physical bases for projecting to ITER, differing observations between multiple devices are also discussed to highlight the needed community R & D. In addition, recent progress in ELM-free regimes, namely Quiescent H-mode, I-mode, and Enhanced Pedestal H-mode is reviewed, and open questions for extrapolability are discussed. Finally progress and outstanding issues in alternate ELM control techniques are reviewed: supersonic molecular beam injection, edge electron cyclotron heating, lower hybrid heating and/or current drive, controlled periodic jogs of the vertical centroid position, ELM pace-making via periodic magnetic perturbations, ELM elimination with lithium wall conditioning, and naturally occurring small ELM regimes.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

HydrogenAR: Interactive Data-Driven Presentation of Dispenser Reliability: Preprint

When delivering presentations to a co-located audience, we typically use slides with text and 2D graphics to complement the spoken narrative. Though presentations have largely been explored on 2D media, augmented reality (AR) allows presentation designers to add data and augmentations to existing physical infrastructure on display. This could provide a more engaging experience to the audience and support comprehension. With HydrogenAR, we present a novel application that leverages the benefits of data-driven storytelling with those of AR to explain the unique challenges of hydrogen dis- penser reliability. Utilizing physical props, situated data, and virtual augmentations and animations, HydrogenAR serves as a unique presentation tool, particularly critical for stakeholders, tour groups, and VIPs. HydrogenAR is a product of multiple collaborative de- sign iterations with a local Hydrogen Fuel research team and is evaluated through interviews with team members and a user study with end-users to evaluate the usability and quality of the interactive AR experience. Through this work, we provide design considera- tions for AR data-driven presentations and discuss how AR could be used for innovative content delivery beyond traditional slide-based presentations.

augmented reality↗

Neutron diffusion calculation in heterogeneous geometry based on local/global iteration using proper orthogonal decomposition

This study newly proposes a heterogeneous core calculation method based on local/global iteration using proper orthogonal decomposition (POD). By using the singular value decomposition (SVD) and the low-rank approximation, appropriate POD bases for expanding the neutron flux can be obtained from snapshot data of the neutron flux obtained by fine mesh calculations. By projection using the POD bases, the dimension of the target equation (e.g., discretized neutron diffusion equation) can be dramatically reduced. In the proposed method, POD is effectively applied to each single assembly calculation (local calculation). Furthermore, using the local/global iteration, the effective neutron multiplication factor and the neutron flux distribution in the whole core geometry can be obtained by combining the numerical results of the local calculation for each fuel assembly and the global calculation for the whole core. As a feasibility study, the proposed method is applied to a one-dimensional heterogeneous core analysis, and the accuracy is investigated by changing the total number of POD bases. (authors)

22 GENERAL STUDIES OF NUCLEAR REACTORS↗

Real space iterative reconstruction for vector tomography (RESIRE-V)

Tomography has had an important impact on the physical, biological, and medical sciences. To date, most tomographic applications have been focused on 3D scalar reconstructions. However, in some crucial applications, vector tomography is required to reconstruct 3D vector fields such as the electric and magnetic fields. Over the years, several vector tomography methods have been developed. Here, we present the mathematical foundation and algorithmic implementation of REal Space Iterative REconstruction for Vector tomography, termed RESIRE-V. RESIRE-V uses multiple tilt series of projections and iterates between the projections and a 3D reconstruction. Each iteration consists of a forward step using the Radon transform and a backward step using its transpose, then updates the object via gradient descent. Incorporating with a 3D support constraint, the algorithm iteratively minimizes an error metric, defined as the difference between the measured and calculated projections. The algorithm can also be used to refine the tilt angles and further improve the 3D reconstruction. To validate RESIRE-V, we first apply it to a simulated data set of the 3D magnetization vector field, consisting of two orthogonal tilt series, each with a missing wedge. Our quantitative analysis shows that the three components of the reconstructed magnetization vector field agree well with the ground-truth counterparts. We then use RESIRE-V to reconstruct the 3D magnetization vector field of a ferromagnetic meta-lattice consisting of three tilt series. Our 3D vector reconstruction reveals the existence of topological magnetic defects with positive and negative charges. We expect that RESIRE-V can be incorporated into different imaging modalities as a general vector tomography method. To make the algorithm accessible to a broad user community, we have made our RESIRE-V MATLAB source codes and the data freely available at https://github.com/minhpham0309/RESIRE-V.

47 OTHER INSTRUMENTATION↗

Distributed Quantum Learning with co-Management in a Multi-tenant Quantum System

The rapid advancement of quantum computing has pushed classical designs into the quantum domain, breaking physical boundaries for computing-intensive and data-hungry applications with the hope that some systems may provide a quantum speedup. For example, variational quantum algorithms have been proposed for quantum neural networks to train deep learning models on qubits, achieving promising results. Existing quantum learning architectures and systems rely on single, monolithic quantum machines with abundant and stable resources, such as qubits. However, fabricating a large, monolithic quantum device is considerably more challenging than producing an array of smaller devices. In this paper, we investigate a distributed quantum system that combines multiple quantum machines into a unified system. We propose DQuLearn, which divides a quantum learning task into multiple subtasks. Each subtask can be executed distributively on individual quantum machines, with the results looping back to classical machines for subsequent training iterations. Additionally, our system supports multiple concurrent clients and dynamically manages their circuits according to the runtime status of quantum workers. Through extensive experiments, we demonstrate that DQuLearn achieves similar accuracies with significant runtime reduction, by up to 68.7% and an increase per-second circuit processing speed, by up to 3.99 times, in a 4-worker multi-tenant setting.

quantum computing↗

Some Remarks on GMRES for Transport Theory

We review some work on the application of GMRES to the solution of the discrete ordinates transport equation in one-dimension. We note that GMRES can be applied directly to the angular flux vector, or it can be applied to only a vector of flux moments as needed to compute the scattering operator of the transport equation. In the former case we illustrate both the delights and defects of ILU right-preconditioners for problems with anisotropic scatter and for problems with upscatter. When working with flux moments we note that GMRES can be used as an accelerator for any existing transport code whose solver is based on a stationary fixed-point iteration, including transport sweeps and DSA transport sweeps. We also provide some numerical illustrations of this idea. We finally show how space can be traded for speed by taking multiple transport sweeps per GMRES iteration. Key Words: transport equation, GMRES, Krylov subspace

Patton, Bruce W.↗

Highly Scalable Matching Pursuit Signal Decomposition Algorithm

Matching Pursuit Decomposition (MPD) is a powerful iterative algorithm for signal decomposition and feature extraction. MPD decomposes any signal into linear combinations of its dictionary elements or atoms . A best fit atom from an arbitrarily defined dictionary is determined through cross-correlation. The selected atom is subtracted from the signal and this procedure is repeated on the residual in the subsequent iterations until a stopping criterion is met. The reconstructed signal reveals the waveform structure of the original signal. However, a sufficiently large dictionary is required for an accurate reconstruction; this in return increases the computational burden of the algorithm, thus limiting its applicability and level of adoption. The purpose of this research is to improve the scalability and performance of the classical MPD algorithm. Correlation thresholds were defined to prune insignificant atoms from the dictionary. The Coarse-Fine Grids and Multiple Atom Extraction techniques were proposed to decrease the computational burden of the algorithm. The Coarse-Fine Grids method enabled the approximation and refinement of the parameters for the best fit atom. The ability to extract multiple atoms within a single iteration enhanced the effectiveness and efficiency of each iteration. These improvements were implemented to produce an improved Matching Pursuit Decomposition algorithm entitled MPD++. Disparate signal decomposition applications may require a particular emphasis of accuracy or computational efficiency. The prominence of the key signal features required for the proper signal classification dictates the level of accuracy necessary in the decomposition. The MPD++ algorithm may be easily adapted to accommodate the imposed requirements. Certain feature extraction applications may require rapid signal decomposition. The full potential of MPD++ may be utilized to produce incredible performance gains while extracting only slightly less energy than the standard algorithm. When the utmost accuracy must be achieved, the modified algorithm extracts atoms more conservatively but still exhibits computational gains over classical MPD. The MPD++ algorithm was demonstrated using an over-complete dictionary on real life data. Computational times were reduced by factors of 1.9 and 44 for the emphases of accuracy and performance, respectively. The modified algorithm extracted similar amounts of energy compared to classical MPD. The degree of the improvement in computational time depends on the complexity of the data, the initialization parameters, and the breadth of the dictionary. The results of the research confirm that the three modifications successfully improved the scalability and computational efficiency of the MPD algorithm. Correlation Thresholding decreased the time complexity by reducing the dictionary size. Multiple Atom Extraction also reduced the time complexity by decreasing the number of iterations required for a stopping criterion to be reached. The Course-Fine Grids technique enabled complicated atoms with numerous variable parameters to be effectively represented in the dictionary. Due to the nature of the three proposed modifications, they are capable of being stacked and have cumulative effects on the reduction of the time complexity.

Christensen, Daniel↗

Numerical Simulation of Turbulent MHD Flows Using an Iterative PNS Algorithm

A new parabolized Navier-Stokes (PNS) algorithm has been developed to efficiently compute magnetohydrodynamic (MHD) flows in the low magnetic Reynolds number regime. In this regime, the electrical conductivity is low and the induced magnetic field is negligible compared to the applied magnetic field. The MHD effects are modeled by introducing source terms into the PNS equation which can then be solved in a very efficient manner. To account for upstream (elliptic) effects, the flowfields are computed using multiple streamwise sweeps with an iterated PNS algorithm. Turbulence has been included by modifying the Baldwin-Lomax turbulence model to account for MHD effects. The new algorithm has been used to compute both laminar and turbulent, supersonic, MHD flows over flat plates and supersonic viscous flows in a rectangular MHD accelerator. The present results are in excellent agreement with previous complete Navier-Stokes calculations.

Kato, Hiromasa↗

Determination of vertical ozone distributions by spacecraft measurements using a limb-scan technique

The principle of a new inversion technique which uses multiple wavelength-solar UV radiation satellite measurements for determining vertical ozone profiles is described, and examples of computer simulations for 280, 300, 320, and 340 nm are discussed. Weighting functions corresponding to the sensitivity of the limb radiance to the relative ozone density at each altitude are the basis for the inversion equation, which is then solved by an iteration technique. The use of multiple wavelengths can provide more information of higher accuracy over a wider height range than those profiles recovered at a single wavelength. It is indicated that an effective range of altitude of approximately 20-70 km with a vertical resolution of 1-2 km is feasible for determining ozone profiles with an inferred profile error about three to four times larger than the measurement error within that altitude region. Ozone profile accuracy of the highest altitude region may be improved using wavelengths down to 260 nm, and inferred ozone profiles above 70 km are possible, but with a larger error.

Aruga, T.↗

THREE-DIMENSIONAL RADIATION TRANSFER IN YOUNG STELLAR OBJECTS

We have updated our publicly available dust radiative transfer code (HOCHUNK3D) to include new emission processes and various three-dimensional (3D) geometries appropriate for forming stars. The 3D geometries include warps and spirals in disks, accretion hotspots on the central star, fractal clumping density enhancements, and misaligned inner disks. Additional axisymmetric (2D) features include gaps in disks and envelopes, ''puffed-up inner rims'' in disks, multiple bipolar cavity walls, and iteration of disk vertical structure assuming hydrostatic equilibrium (HSEQ). We include the option for simple power-law envelope geometry, which, combined with fractal clumping and bipolar cavities, can be used to model evolved stars as well as protostars. We include non-thermal emission from polycyclic aromatic hydrocarbons (PAHs) and very small grains, and external illumination from the interstellar radiation field. The grid structure was modified to allow multiple dust species in each cell; based on this, a simple prescription is implemented to model dust stratification. We describe these features in detail, and show example calculations of each. Some of the more interesting results include the following: (1) outflow cavities may be more clumpy than infalling envelopes. (2) PAH emission in high-mass stars may be a better indicator of evolutionary stage than the broadband spectral energy distribution slope; and related to this, (3) externally illuminated clumps and high-mass stars in optically thin clouds can masquerade as young stellar objects. (4) Our HSEQ models suggest that dust settling is likely ubiquitous in T Tauri disks, in agreement with previous observations.

79 ASTRONOMY AND ASTROPHYSICS↗

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.↗

Challenges of conventional iterative all-atom and coarse-grained multiscale molecular dynamics

In this work, we evaluate the biomolecular dynamics behaviors when conventionally iterating between all-atom (AA) and coarse-grained (CG) molecular dynamics (MD) simulations over multiple cycles. We implemented the workflow to iterate between AA and CG in OpenMM, namely the iterative multiscale MD (iMMD) simulation workflow. In particular, we aim to identify practical applications for iterating between AA and CG simulations in a conventional manner without any constraints or model modifications. We evaluate the iMMD workflow on four representative systems, spanning folding of two soluble proteins and protein-protein as well as protein-lipid interactions of two membrane proteins. We observe that iteration between AA and CG representations could help the soluble proteins exit undesirable metastable states to fold, resulting from random protein structural distortions due to cycling. Consequently, the most reliable use of iterative AA and CG simulations appears to be to accelerating complex lipid mixing for membrane-bound protein systems rather than sampling protein conformational space. Our work explores the practical usages and limitations for iterative AA and CG simulations using readily available AA and CG force fields. The evaluated iMMD workflow in OpenMM is made available at https://github.com/lanl/iMMD.

59 BASIC BIOLOGICAL SCIENCES↗

Multiple zeros of polynomials

Analysis of four iterative methods for approximating zeros of polynomial expressions using digital computer

Wood, C. A.↗

Solid-State Neutron Multiplicity Counting System Using Commercial Off-the-Shelf Semiconductor Detectors

This work iterates on the first demonstration of a solid-state neutron multiplicity counting system developed at Lawrence Livermore National Laboratory by using commercial off-the-shelf detectors. The system was demonstrated to determine the mass of a californium-252 neutron source within 20% error requiring only one-hour measurement time with 20 cm 2 of active detector area.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗

Stage-parallel fully implicit Runge–Kutta solvers for discontinuous Galerkin fluid simulations

In this paper, we develop new techniques for solving the large, coupled linear systems that arise from fully implicit Runge–Kutta methods. This method makes use of the iterative preconditioned GMRES algorithm for solving the linear systems, which has seen success for fluid flow problems and discontinuous Galerkin discretizations. By transforming the resulting linear system of equations, one can obtain a method which is much less computationally expensive than the untransformed formulation, and which compares competitively with other time-integration schemes, such as diagonally implicit Runge–Kutta (DIRK) methods. We develop and test several ILU-based preconditioners effective for these large systems. We additionally employ a parallel-in-time strategy to compute the Runge–Kutta stages simultaneously. Numerical experiments are performed on the Navier–Stokes equations using Euler vortex and 2D and 3D NACA airfoil test cases in serial and in parallel settings. In conclusion, the fully implicit Radau IIA Runge–Kutta methods compare favorably with equal-order DIRK methods in terms of accuracy, number of GMRES iterations, number of matrix–vector multiplications, and wall-clock time, for a wide range of time steps.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Mesh-based multiphysics coupling acceleration for fusion neutronics through clustering for fusion blanket applications

Accurate modeling of particle transport within fusion blankets is essential for predicting performance metrics such as heat deposition and the tritium breeding ratio (TBR). However, high-fidelity coupling of thermal fluids from computational fluid dynamics (CFD) to neutronics simulations often incurs significant computational costs due to the complexity of surface intersection calculations in Monte Carlo codes. This paper presents an accelerated multiphysics coupling method for neutronics that utilizes hierarchical agglomerative clustering to map complex material property distributions to a neutronics model. Implemented within the fusion reactor design and assessment (FREDA) framework, the method leverages existing Python packages to automate the creation of clustered geometries for OpenMC. The approach is demonstrated on a sector model of an ARC-class tokamak with an immersion molten salt blanket, and an simple geometry with varying isotopic concentrations. Results show that the clustering method significantly reduces computational burden without compromising fidelity, providing a foundation for agile iteration of neutronics simulations involving multiple coupled material properties.

Bae, Jin Whan [ORNL] (ORCID:0000000326548907)↗

MONACO: accurate biological network alignment through optimal neighborhood matching between focal nodes

Motivation: Alignment of protein–protein interaction networks can be used for the unsupervised prediction of functional modules, such as protein complexes and signaling pathways, that are conserved across different species. To date, various algorithms have been proposed for biological network alignment, many of which attempt to incorporate topological similarity between the networks into the alignment process with the goal of constructing accurate and biologically meaningful alignments. Especially, random walk models have been shown to be effective for quantifying the global topological relatedness between nodes that belong to different networks by diffusing node-level similarity along the interaction edges. However, these schemes are not ideal for capturing the local topological similarity between nodes. Results: Here, we propose MONACO, a novel and versatile network alignment algorithm that finds highly accurate pairwise and multiple network alignments through the iterative optimal matching of ‘local’ neighborhoods around focal nodes. Extensive performance assessment based on real networks as well as synthetic networks, for which the ground truth is known, demonstrates that MONACO clearly and consistently outperforms all other state-of-the-art network alignment algorithms that we have tested, in terms of accuracy, coherence and topological quality of the aligned network regions. Furthermore, despite the sharply enhanced alignment accuracy, MONACO remains computationally efficient and it scales well with increasing size and number of networks.

97 MATHEMATICS AND COMPUTING↗