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 1,603 records · Page 89

Simulation of dynamic fracture using peridynamics, finite element modeling, and contact.

Peridynamics is a nonlocal extension of classical solid mechanics that allows for the modeling of bodies in which discontinuities occur spontaneously. Because the peridynamic expression for the balance of linear momentum does not contain spatial derivatives and is instead based on an integral equation, it is well suited for modeling phenomena involving spatial discontinuities such as crack formation and fracture. In this study, both peridynamics and classical finite element analysis are applied to simulate material response under dynamic blast loading conditions. A combined approach is utilized in which the portion of the simulation modeled with peridynamics interacts with the finite element portion of the model via a contact algorithm. The peridynamic portion of the analysis utilizes an elastic-plastic constitutive model with linear hardening. The peridynamic interface to the constitutive model is based on the calculation of an approximate deformation gradient, requiring the suppression of possible zero-energy modes. The classical finite element portion of the model utilizes a Johnson-Cook constitutive model. Simulation results are validated by direct comparison to expanding tube experiments. The coupled modeling approach successfully captures material response at the surface of the tube and the emerging fracture pattern. The coupling of peridynamics and finite element analysis via a contact algorithm has been shown to be a viable means for simulating material fracture in a high-velocity impact experiment. A combined peridynamics/finite element approach was applied to model an expanding tube experiment performed by Vogler, et al., in which loading on the tube is a result of Lexan slugs impacting inside the tube. The Lexan portion of the simulation was modeled with finite elements and a Johnson-Cook elastic-plastic material model in conjunction with an equation-of-state law. The steel tube portion of the simulation was modeled with peridynamics, an elastic-plastic material model, and a critical stretch bond damage model. The application of peridynamics to the tube portion of the model allowed the capture of the formation of cracks and eventual fragmentation of the tube. The simulation results yielded good agreement with the experimental results published by Vogler, et al., for the velocity and displacement profiles on the surface of the tube and the resulting fragment distribution. Numerical difficulties were encountered that required removal of hexahedron elements from the Lexan portion of the model over the course of the simulation. The significant number of inverted and nearly-inverted elements appearing over the course of the simulation is believed to be a result of irregularities in the contact between the Lexan and AerMet portions of the model, and was likely exacerbated by the ultra-high strength of the AerMet tube. Future simulations are planned in which the Lexan portion of the simulation is modeled with peridynamics, or with an alternative method such as smoothed particle hydrodynamics, with the goal of reducing these numerical difficulties.

36 MATERIALS SCIENCE↗

BDDC for nonsymmetric positive definite and symmetric indefinite problems

The balancing domain decomposition methods by constraints are extended to solving both nonsymmetric, positive definite and symmetric, indefinite linear systems. In both cases, certain nonstandard primal constraints are included in the coarse problems of BDDC algorithms to accelerate the convergence. Under the assumption that the subdomain size is small enough, a convergence rate estimate for the GMRES iteration is established that the rate is independent of the number of subdomains and depends only slightly on the subdomain problem size. Numerical experiments for several two-dimensional examples illustrate the fast convergence of the proposed algorithms.

97 MATHEMATICS AND COMPUTING↗

Numerical simulation of cathode plasma dynamics in magnetically insulated vacuum transmission lines

A novel algorithm for the simulation of cathode plasmas in particle-in-cell codes is described and applied to investigate cathode plasma evolution in magnetically insulated transmission lines (MITLs). The MITL electron sheath is modeled by a fully kinetic electron species. Electron and ion macroparticles, both modeled as fluid species, form a dense plasma which is initially localized at the cathode surface. Energetic plasma electron particles can be converted to kinetic electrons to resupply the electron flux at the plasma edge (the “effective” cathode). Using this model, we compare results for the time evolution of the cathode plasma and MITL electron flow with a simplified (isothermal) diffusion model. Simulations in 1D show a slow diffusive expansion of the plasma from the cathode surface. But in multiple dimensions, the plasma can expand much more rapidly due to anomalous diffusion caused by an instability due to the strong coupling of a transverse magnetic mode in the electron sheath with the expanding resistive plasma layer.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

Unified Geometric Multigrid Algorithm for Hybridized High-Order Finite Element Methods

In this paper, we consider a standard elliptic partial differential equation and propose a geometric multigrid algorithm based on Dirichlet-to-Neumann (DtN) maps for hybridized high-order finite element methods. The proposed unified approach is applicable to any locally conservative hybridized finite element method including multinumerics with different hybridized methods in different parts of the domain. For these methods, the linear system involves only the unknowns residing on the mesh skeleton, and constructing intergrid transfer operators is therefore not trivial. The key to our geometric multigrid algorithm is the physics-based energy-preserving intergrid transfer operators which depend only on the fine scale DtN maps. Thanks to these operators, we completely avoid upscaling of parameters and no information regarding subgrid physics is explicitly required on coarse meshes. Moreover, our algorithm is agglomeration-based and can straightforwardly handle unstructured meshes. We perform extensive numerical studies with hybridized mixed methods, hybridized discontinuous Galerkin methods, weak Galerkin methods, and hybridized versions of interior penalty discontinuous Galerkin methods on a range of elliptic problems including subsurface flow through highly heterogeneous porous media. We compare the performance of different smoothers and analyze the effect of stabilization parameters on the scalability of the multigrid algorithm.

97 MATHEMATICS AND COMPUTING↗

Quasioptical modeling of wave beams with and without mode conversion. III. Numerical simulations of mode-converting beams

This work continues a series of papers where we propose an algorithm for quasi-optical modeling of electromagnetic beams with and without mode conversion. The general theory was reported in the first paper of this series, where a parabolic partial differential equation was derived for the field envelope that may contain one or multiple modes with close group velocities. In the second paper, we presented a corresponding code PARADE (PAraxial RAy DEscription) and its test applications to single-mode beams. Here, we report quasi-optical simulations of mode-converting beams for the first time. Here, we also demonstrate that PARADE can model splitting of two-mode beams. The numerical results produced by PARADE show good agreement with those of one-dimensional full-wave simulations and also with conventional ray tracing (to the extent that one-dimensional and ray-tracing simulations are applicable).

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

Artifacts in X-ray Dark-Field Tomography

Grating-based x-ray imaging provides three principle kinds of contrast: absorption, phase, and dark-field. Due to the availability of tomographic reconstruction algorithms for the dark-field contrast, it is now possible to take advantage of quantitative scatter information. However, the published algorithm is based on several assumptions that might be violated in reality. We use numerical simulations in order to identify artifacts in the reconstructions, which is crucial for the interpretation of experimental data.

07 ISOTOPE AND RADIATION SOURCES↗

Accelerated kinetic model for global macro stability studies of high-beta fusion reactors

The field reversed configuration (FRC), such as studied in the C-2W experiment at TAE Technologies, is an attractive candidate for realizing a nuclear fusion reactor. In an FRC, kinetic ion effects play the majority role in macroscopic stability, which allows global stability studies to make use of fluid-kinetic hybrid (also referred to as Ohm's law) models wherein ions are treated kinetically while electrons are treated as a fluid. The development and validation of such a hybrid particle-in-cell algorithm in the Exascale Computing Project code WarpX are reported here. Implementation of this model in the WarpX framework benefits from the numerical efficiency of WarpX as well as its scalability on large HPC systems and portability to different architectures. Performance benchmarks of the new algorithm for large, 3-dimensional, full device simulations from the Perlmutter supercomputer are presented. Results of a series of FRC simulations are discussed in which the impact of two-fluid effects on the tilt-mode growth rate was studied. It was observed that, in agreement with previous Hall-MHD studies, two-fluid effects have a stabilizing impact on the tilt mode.

Physics↗

Nonperturbative QCD simulations with 2+1 flavors of improved staggered quarks

Dramatic progress has been made over the last decade in the numerical study of quantum chromodynamics (QCD) through the use of improved formulations of QCD on the lattice (improved actions), the development of new algorithms, and the rapid increase in computing power available to lattice gauge theorists. In this article simulations of full QCD are described using the improved staggered quark formalism, ''asqtad'' fermions. These simulations were carried out with two degenerate flavors of light quarks (up and down) and with one heavier flavor, the strange quark. Several light quark masses, down to about three times the physical light quark mass, and six lattice spacings have been used. These enable controlled continuum and chiral extrapolations of many low energy QCD observables. The improved staggered formalism is reviewed, emphasizing both advantages and drawbacks. In particular, the procedure for removing unwanted staggered species in the continuum limit is reviewed. Then the asqtad lattice ensembles created by the MILC Collaboration are described. All MILC lattice ensembles are publicly available, and they have been used extensively by a number of lattice gauge theory groups. The physics results obtained with them are reviewed, and the impact of these results on phenomenology is discussed. Topics include the heavy quark potential, spectrum of light hadrons, quark masses, decay constants of light and heavy-light pseudoscalar mesons, semileptonic form factors, nucleon structure, scattering lengths, and more.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Cyber‐Resilient Distributed Energy Resource Control Algorithms for Smart Distribution Grids

ABSTRACT This paper focuses on the development of cyber‐resilient gradient‐based optimisation algorithms and theoretical proof for grid‐interactive distributed energy resource (DER) control to enable two grid services of virtual power plants (VPPs) dispatch and grid voltage regulation, considering the communication and security impacts. Firstly, the combined DER dispatch and voltage regulation as a real‐time gradient‐based optimisation problem is recapped. Thereafter, we consider a probabilistic traffic model to characterise packet delays and loss in a communication network, and study how the delays enter the process of information exchange among the grid measurement units, local DER controllers and the grid control centre that execute this control algorithm in a coordinated manner. Then, a strategy combining delay thresholds and message update rules is proposed to immunity the asynchrony resulting from the communications traffic and it avoids possible numerical instabilities and sensitivities of the power tracking and voltage regulation capabilities, resulting as cyber‐resilient DER control algorithms. Additionally, their convergence is theoretically proved. Effectiveness of proposed cyber‐resilient algorithms has been validated on the IEEE 37‐bus system in terms of convergence, VPP tracking and voltage regulation performance for smart distribution systems with high penetration of DERs.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Recent progress in 3-D imaging of sea freight containers

The inspection of very large objects like sea freight containers with X-ray Computed Tomography (CT) is an emerging technology. A complete 3-D CT scan of a see-freight container takes several hours. Of course, this is too slow to apply it to a large number of containers. However, the benefits of a 3-D CT for sealed freight are obvious: detection of potential threats or illicit cargo without being confronted with legal complications or high time consumption and risks for the security personnel during a manual inspection. Recently distinct progress was made in the field of reconstruction of projections with only a relatively low number of angular positions. Instead of today’s 500 to 1000 rotational steps, as needed for conventional CT reconstruction techniques, this new class of algorithms provides the potential to reduce the number of projection angles approximately by a factor of 10. The main drawback of these advanced iterative methods is the high consumption for numerical processing. But as computational power is getting steadily cheaper, there will be practical applications of these complex algorithms in a foreseeable future. In this paper, we discuss the properties of iterative image reconstruction algorithms and show results of their application to CT of extremely large objects scanning a sea-freight container. A specific test specimen is used to quantitatively evaluate the image quality in terms of spatial and contrast resolution and depending on different number of projections.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Application of the new IAPWS Guideline on the fast and accurate calculation of steam and water properties with the Spline-Based Table Look-Up Method (SBTL) in RELAP-7

The numerical simulation of thermalhydraulic processes in nuclear power plants requires very accurate and extremely fast algorithms for calculating the thermophysical properties of water and steam. In order to provide such algorithms, the International Association for the Properties of Water and Steam (IAPWS) has adopted the new “IAPWS Guideline on the Fast Calculation of Steam and Water Properties with the Spline-Based Table Look-Up Method (SBTL)”. In this article, the SBTL method is applied to property functions of specific volume and specific internal energy (v,e) based on the scientific formulation IAPWS-95 and the latest IAPWS formulations for transport properties. From the newly generated SBTL functions, thermodynamic and transport properties as well as their derivatives and inverse functions are calculable in the fluid range of state for pressures up to 100 MPa and for temperatures up to 1273 K, including the metastable liquid and the metastable vapor regions. The SBTL functions reproduce the underlying formulations with an accuracy of 10–100 ppm and significantly reduced computing times. The SBTL method has been implemented into the nuclear reactor system safety analysis code RELAP-7 [2] to consider the real fluid behavior of water and steam in a novel 7-equation two-phase flow model.

42 ENGINEERING↗

Alignment of leading-edge and peak-picking time of arrival methods to obtain accurate source locations

The location of a radiating source can be determined by time-tagging the arrival of the radiated signal at a network of spatially distributed sensors. The accuracy of this approach depends strongly on the particular time-tagging algorithm employed at each of the sensors. If different techniques are used across the network, then the time tags must be referenced to a common fiducial for maximum location accuracy. In this report we derive the time corrections needed to temporally align leading-edge, time-tagging techniques with peak-picking algorithms. We focus on broadband radio frequency (RF) sources, an ionospheric propagation channel, and narrowband receivers, but the final results can be generalized to apply to any source, propagation environment, and sensor. Our analytic results are checked against numerical simulations for a number of representative cases and agree with the specific leading-edge algorithm studied independently by Kim and Eng (1995) and Pongratz (2005 and 2007).

97 MATHEMATICS AND COMPUTING↗

Self-learning Monte Carlo method and cumulative update in fermion systems

In this study, we develop the self-learning Monte Carlo (SLMC) method, a general-purpose numerical method recently introduced to simulate many-body systems, for studying interacting fermion systems. Our method uses a highly efficient update algorithm, which we design and dub “cumulative update”, to generate new candidate configurations in the Markov chain based on a self-learned bosonic effective model. From a general analysis and a numerical study of the double exchange model as an example, we find that the SLMC with cumulative update drastically reduces the computational cost of the simulation, while remaining statistically exact. Remarkably, its computational complexity is far less than the conventional algorithm with local updates.

36 MATERIALS SCIENCE↗

A Model-Free No-arbitrage Price Bound for Variance Options

We suggest a numerical approximation for an optimization problem, motivated by its applications in finance to find the model-free no-arbitrage bound of variance options given the marginal distributions of the underlying asset. A first approximation restricts the computation to a bounded domain. Then we propose a gradient projection algorithm together with the finite difference scheme to solve the optimization problem. We prove the general convergence, and derive some convergence rate estimates. Finally, we give some numerical examples to test the efficiency of the algorithm.

97 MATHEMATICS AND COMPUTING↗

Conservative high-order data transfer method on generalized polygonal meshes

A conservative data transfer (remap) between two meshes is an important step of arbitrary Lagrangian-Eulerian (ALE) hydrodynamics simulations. High-order numerical methods for ALE simulations require both high-order (curvilinear) meshes and high-order remap algorithms. Here we develop a conservative and bounds-preserving method for accurate remapping of discrete fields on generalized polygonal meshes with curvilinear edges. The properties of the proposed method are studied theoretically and numerically for various (smooth and non-smooth) mesh deformations and discrete fields that represent smooth and discontinuous functions.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

An Iterative Local Updating Ensemble Smoother for Estimation and Uncertainty Assessment of Hydrologic Model Parameters With Multimodal Distributions

Abstract Ensemble smoother (ES) has been widely used in inverse modeling of hydrologic systems. However, for problems where the distribution of model parameters is multimodal, using ES directly would be problematic. One popular solution is to use a clustering algorithm to identify each mode and update the clusters with ES separately. However, this strategy may not be very efficient when the dimension of parameter space is high or the number of modes is large. Alternatively, we propose in this paper a very simple and efficient algorithm, i.e., the iterative local updating ensemble smoother (ILUES), to explore multimodal distributions of model parameters in nonlinear hydrologic systems. The ILUES algorithm works by updating local ensembles of each sample with ES to explore possible multimodal distributions. To achieve satisfactory data matches in nonlinear problems, we adopt an iterative form of ES to assimilate the measurements multiple times. Numerical cases involving nonlinearity and multimodality are tested to illustrate the performance of the proposed method. It is shown that overall the ILUES algorithm can well quantify the parametric uncertainties of complex hydrologic models, no matter whether the multimodal distribution exists.

Zhang, Jiangjiang↗

Modified Newton-Raphson GRAPE methods for optimal control of spin systems

Quadratic convergence throughout the active space is achieved for the gradient ascent pulse engineering (GRAPE) family of quantum optimal control algorithms. We demonstrate in this communication that the Hessian of the GRAPE fidelity functional is unusually cheap, having the same asymptotic complexity scaling as the functional itself. This leads to the possibility of using very efficient numerical optimization techniques. In particular, the Newton-Raphson method with a rational function optimization (RFO) regularized Hessian is shown in this work to require fewer system trajectory evaluations than any other algorithm in the GRAPE family. This communication describes algebraic and numerical implementation aspects (matrix exponential recycling, Hessian regularization, etc.) for the RFO Newton-Raphson version of GRAPE and reports benchmarks for common spin state control problems in magnetic resonance spectroscopy.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Optical character recognition of handwritten Arabic using hidden Markov models

The problem of optical character recognition (OCR) of handwritten Arabic has not received a satisfactory solution yet. In this paper, an Arabic OCR algorithm is developed based on Hidden Markov Models (HMMs) combined with the Viterbi algorithm, which results in an improved and more robust recognition of characters at the sub-word level. Integrating the HMMs represents another step of the overall OCR trends being currently researched in the literature. The proposed approach exploits the structure of characters in the Arabic language in addition to their extracted features to achieve improved recognition rates. Useful statistical information of the Arabic language is initially extracted and then used to estimate the probabilistic parameters of the mathematical HMM. A new custom implementation of the HMM is developed in this study, where the transition matrix is built based on the collected large corpus, and the emission matrix is built based on the results obtained via the extracted character features. The recognition process is triggered using the Viterbi algorithm which employs the most probable sequence of sub-words. The model was implemented to recognize the sub-word unit of Arabic text raising the recognition rate from being linked to the worst recognition rate for any character to the overall structure of the Arabic language. Numerical results show that there is a potentially large recognition improvement by using the proposed algorithms.

Character recognition↗