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 649 records · Page 36

Study of Crystal Growth and Solute Precipitation through Front Tracking Method

Crystal growth and solute precipitation is a Stefan problem. It is a free boundary problem for a parabolic partial differential equation with a time-dependent phase interface. The velocity of the moving interface between solute and crystal is a local function. The dendritic structure of the crystal interface, which develops dynamically, requires high resolution of the interface geometry. These facts make the Lagrangian front tracking method well suited for the problem. In this paper, we introduce an upgraded version of the front tracking code and its associated algorithms for the numerical study of crystal formation. We compare our results with the smoothed particle hydrodynamics method (SPH) in terms of the crystal fractal dimension with its dependence on the Damkohler number and density ratio.

97 MATHEMATICS AND COMPUTING↗

Random Forests and Networks Analysis

Wilson (Proceedings of the twenty-eight annual acm symposium on the theory of computing, pp. 296–303, 1996) in the 1990s described a simple and efficient algorithm based on loop-erased random walks to sample uniform spanning trees and more generally weighted trees or forests spanning a given graph. This algorithm provides a powerful tool in analyzing structures on networks and along this line of thinking, in recent works (Avena and Gaudillière in A proof of the transfer-current theorem in absence of reversibility, in Stat. Probab. Lett. 142, 17–22 (2018); Avena and Gaudillière in J Theor Probab, 2017. https://doi.org/10.1007/s10959-017-0771-3 ; Avena et al. in Approximate and exact solutions of intertwining equations though random spanning forests, 2017. arXiv:1702.05992v1 ; Avena et al. in Intertwining wavelets or multiresolution analysis on graphs through random forests, 2017. arXiv:1707.04616 , to appear in ACHA (2018)) we focused on applications of spanning rooted forests on finite graphs. The resulting main conclusions are reviewed in this paper by collecting related theorems, algorithms, heuristics and numerical experiments. A first foundational part on determinantal structures and efficient sampling procedures is followed by four main applications: (1) a random-walk-based notion of well-distributed points in a graph, (2) a framework to describe metastable-like dynamics in finite settings by means of Markov intertwining dualities, (3) coarse graining schemes for networks and associated processes, (4) wavelets-like pyramidal algorithms for graph signals.

97 MATHEMATICS AND COMPUTING↗

Spatially hybrid computations for streamer discharges with generic features of pulled fronts: I. Planar fronts

Streamers are the first stage of sparks and lightning; they grow due to a strongly enhanced electric field at their tips; this field is created by a thin curved space charge layer. These multiple scales are already challenging when the electrons are approximated by densities. However, electron density fluctuations in the leading edge of the front and non-thermal stretched tails of the electron energy distribution (as a cause of X-ray emissions) require a particle model to follow the electron motion. But present computers cannot deal with all electrons in a fully developed streamer. Therefore, super-particle have to be introduced, which leads to wrong statistics and numerical artifacts. The method of choice is a hybrid computation in space where individual electrons are followed in the region of high electric field and low density while the bulk of the electrons is approximated by densities (or fluids). We here develop the hybrid coupling for planar fronts. First, to obtain a consistent flux at the interface between particle and fluid model in the hybrid computation, the widely used classical fluid model is replaced by an extended fluid model. Then the coupling algorithm and the numerical implementation of the spatially hybrid model are presented in detail, in particular, the position of the model interface and the construction of the buffer region. The method carries generic features of pulled fronts that can be applied to similar problems like large deviations in the leading edge of population fronts, etc.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

State estimation of an acid gas removal (AGR) plant as part of an integrated gasification combined cycle (IGCC) plant with CO2 capture

An accurate estimation of process state variables not only can increase the effectiveness and reliability of process measurement technology, but can also enhance plant efficiency, improve control system performance, and increase plant availability. Future integrated gasification combined cycle (IGCC) power plants with CO2 capture will have to satisfy stricter operational and environmental constraints. To operate the IGCC plant without violating stringent environmental emission standards requires accurate estimation of the relevant process state variables, outputs, and disturbances. Unfortunately, a number of these process variables cannot be measured at all, while some of them can be measured, but with low precision, low reliability, or low signal-to-noise ratio. As a result, accurate estimation of the process variables is of great importance to avoid the inherent difficulties associated with the inaccuracy of the data. Motivated by this, the current paper focuses on the state estimation of an acid gas removal (AGR) process as part of an IGCC plant with CO2 capture. This process has extensive heat and mass integration and therefore is very suitable for testing the efficiency of the designed estimators in the presence of complex interactions between process variables. The traditional Kalman filter (KF) (Kalman, 1960) algorithm has been used as a state estimator which resembles that of a predictor-corrector algorithm for solving numerical problems. In traditional KF implementation, good guesses for the process noise covariance matrix (Q) and the measurement noise covariance matrix (R) are required to obtain satisfactory filter performance. However, in the real world, these matrices are unknown and it is difficult to generate good guesses for them. In this paper, use of an adaptive KF will be presented that adapts Q and R at every time step of the algorithm. Results show that very accurate estimations of the desired process states, outputs or disturbances can be achieved by using the adaptive KF.

97 MATHEMATICS AND COMPUTING↗

Comment on “Symplectic integration of magnetic systems”: A proof that the Boris algorithm is not variational

One popular technique for the numerical time advance of charged particles interacting with electric and magnetic fields according to the Lorentz force law [1], [2], [3] and [4] is the Boris algorithm. Its popularity stems from simple implementation, rapid iteration, and excellent long-term numerical fidelity [1] and [5]. Excellent long-term behavior strongly suggests the numerical dynamics exhibit conservation laws analogous to those governing the continuous Lorentz force system [6]. Moreover, without conserved quantities to constrain the numerical dynamics, algorithms typically dissipate or accumulate important observables such as energy and momentum over long periods of simulated time [6]. Identification of the conservative properties of an algorithm is important for establishing rigorous expectations on the long-term behavior; energy-preserving, symplectic, and volume-preserving methods each have particular implications for the qualitative numerical behavior [6], [7], [8], [9], [10] and [11].

97 MATHEMATICS AND COMPUTING↗

Three-dimensional parallel UNIPIC-3D code for simulations of high-power microwave devices

This paper introduces a self-developed, three-dimensional parallel fully electromagnetic particle simulation code UNIPIC-3D. In this code, the electromagnetic fields are updated using the second-order, finite-difference time-domain method, and the particles are moved using the relativistic Newton-Lorentz force equation. The electromagnetic field and particles are coupled through the current term in Maxwell's equations. Two numerical examples are used to verify the algorithms adopted in this code, numerical results agree well with theoretical ones. This code can be used to simulate the high-power microwave (HPM) devices, such as the relativistic backward wave oscillator, coaxial vircator, and magnetically insulated line oscillator, etc. UNIPIC-3D is written in the object-oriented C++ language and can be run on a variety of platforms including WINDOWS, LINUX, and UNIX. Users can use the graphical user's interface to create the complex geometric structures of the simulated HPM devices, which can be automatically meshed by UNIPIC-3D code. This code has a powerful postprocessor which can display the electric field, magnetic field, current, voltage, power, spectrum, momentum of particles, etc. For the sake of comparison, the results computed by using the two-and-a-half-dimensional UNIPIC code are also provided for the same parameters of HPM devices, the numerical results computed from these two codes agree well with each other.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

Rapid Quantum Ground State Preparation via Dissipative Dynamics

Inspired by natural cooling processes, dissipation has become a promising approach for preparing low-energy states of quantum systems. However, the potential of dissipative protocols remains unclear beyond certain commuting Hamiltonians. This work provides significant analytical and numerical insights into the power of dissipation for preparing the ground state of noncommuting Hamiltonians. For quasi-free dissipative dynamics, including certain 1D spin systems with boundary dissipation, our results reveal a new connection between the mixing time in trace distance and the spectral properties of a non-Hermitian Hamiltonian, leading to an explicit and sharp bound on the mixing time that scales polynomially with system size. For more general spin systems, we develop a tensor network-based algorithm for constructing the Lindblad jump operator and for simulating the dynamics. Using this algorithm, we demonstrate numerically that dissipative ground state preparation protocols can achieve rapid mixing for certain 1D local Hamiltonians under bulk dissipation, with a mixing time that scales logarithmically with the system size. We then prove the rapid mixing result for certain weakly interacting spin and fermionic systems in arbitrary dimensions, extending recent results for high-temperature quantum Gibbs samplers to the zero-temperature regime. Together, these results show that dissipation can be a powerful tool for ground state preparation, with potential applications across condensed matter physics, quantum materials science, and beyond.

decoherence↗

On the asymptotic distribution of block-modified random matrices

We study random matrices acting on tensor product spaces which have been transformed by a linear block operation. Using operator-valued free probability theory, under some mild assumptions on the linear map acting on the blocks, we compute the asymptotic eigenvalue distribution of the modified matrices in terms of the initial asymptotic distribution. Moreover, using recent results on operator-valued subordination, we present an algorithm that computes, numerically but in full generality, the limiting eigenvalue distribution of the modified matrices. Our analytical results cover many cases of interest in quantum information theory: we unify some known results and we obtain new distributions and various generalizations.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

An Algebraic Quantum Circuit Compression Algorithm for Hamiltonian Simulation

Quantum computing is a promising technology that harnesses the peculiarities of quantum mechanics to deliver computational speedups for some problems that are intractable to solve on a classical computer. Current generation noisy intermediate-scale quantum (NISQ) computers are severely limited in terms of chip size and error rates. Shallow quantum circuits with uncomplicated topologies are essential for successful applications in the NISQ era. In this work, based on matrix analysis, we derive localized circuit transformations to efficiently compress quantum circuits for simulation of certain spin Hamiltonians known as free fermions. The depth of the compressed circuits is independent of simulation time and grows linearly with the number of spins. The proposed numerical circuit compression algorithm behaves backward stable and scales cubically in the number of spins enabling circuit synthesis beyond O(10 3 ) spins. The resulting quantum circuits have a simple nearest-neighbor topology, which makes them ideally suited for NISQ devices.

Hamiltonian simulation↗

Pushing the Limits of High-speed X-ray Tomography to See the Unknown

First-of-their kind datasets from a high-speed X-ray tomography system were collected, and a novel numerical effort utilizing temporal information to reduce measurement uncertainty was shown. The experimental campaign used three high-speed X-ray imaging systems to collect data at 100 kHz of a scene containing high-velocity objects. The scene was a group of known objects propelled by a 12-gauge shotgun shell reaching speeds of hundreds of meters per second. These data represent a known volume where the individual components are known, with experimental uncertainties that can be used for reconstruction algorithm validation. The numerical effort used synthetic volumes in MATLAB to produce projections along known lines of sight to perform tomographic reconstructions. These projections and reconstructions were performed on a single object at two orientations, representing two timesteps, to increase the reconstruction accuracy.

36 MATERIALS SCIENCE↗

Combination of the discontinuous Galerkin method with finite differences for simulation of seismic wave propagation

We present an algorithm for the numerical simulation of seismic wave propagation in models with a complex near surface part and free surface topography. The approach is based on the combination of finite differences with the discontinuous Galerkin method. The discontinuous Galerkin method can be used on polyhedral meshes; thus, it is easy to handle the complex surfaces in the models. However, this approach is computationally intense in comparison with finite differences. Finite differences are computationally efficient, but in general, they require rectangular grids, leading to the stair-step approximation of the interfaces, which causes strong diffraction of the wavefield. In this research we present a hybrid algorithm where the discontinuous Galerkin method is used in a relatively small upper part of the model and finite differences are applied to the main part of the model.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

A novel partitioning method for block-structured adaptive meshes

We propose a novel partitioning method for block-structured adaptive meshes utilizing the meshless Lagrangian particle concept. With the observation that an optimum partitioning has high analogy to the relaxation of a multi-phase fluid to steady state, physically motivated model equations are developed to characterize the background mesh topology and are solved by multi-phase smoothed-particle hydrodynamics. In contrast to well established partitioning approaches, all optimization objectives are implicitly incorporated and achieved during the particle relaxation to stationary state. Distinct partitioning sub-domains are represented by colored particles and separated by a sharp interface with a surface tension model. In order to obtain the particle relaxation, special viscous and skin friction models, coupled with a tailored time integration algorithm are proposed. Numerical experiments show that the present method has several important properties: generation of approximately equal-sized partitions without dependence on the mesh-element type, optimized interface communication between distinct partitioning sub-domains, continuous domain decomposition which is physically localized and implicitly incremental. Therefore it is particularly suitable for load-balancing of high-performance CFD simulations.

97 MATHEMATICS AND COMPUTING↗

An ensemble Kalman filter for statistical estimation of physics constrained nonlinear regression models

A central issue in contemporary science is the development of nonlinear data driven statistical–dynamical models for time series of noisy partial observations from nature or a complex model. It has been established recently that ad-hoc quadratic multi-level regression models can have finite-time blow-up of statistical solutions and/or pathological behavior of their invariant measure. Recently, a new class of physics constrained nonlinear regression models were developed to ameliorate this pathological behavior. Here a new finite ensemble Kalman filtering algorithm is developed for estimating the state, the linear and nonlinear model coefficients, the model and the observation noise covariances from available partial noisy observations of the state. Several stringent tests and applications of the method are developed here. In the most complex application, the perfect model has 57 degrees of freedom involving a zonal (east–west) jet, two topographic Rossby waves, and 54 nonlinearly interacting Rossby waves; the perfect model has significant non-Gaussian statistics in the zonal jet with blocked and unblocked regimes and a non-Gaussian skewed distribution due to interaction with the other 56 modes. We only observe the zonal jet contaminated by noise and apply the ensemble filter algorithm for estimation. Numerically, we find that a three dimensional nonlinear stochastic model with one level of memory mimics the statistical effect of the other 56 modes on the zonal jet in an accurate fashion, including the skew non-Gaussian distribution and autocorrelation decay. On the other hand, a similar stochastic model with zero memory levels fails to capture the crucial non-Gaussian behavior of the zonal jet from the perfect 57-mode model.

97 MATHEMATICS AND COMPUTING↗

Viscoelastic Model for Lung Parenchyma for Multi-Scale Modeling of Respiratory System Phase I: Hypo-Elastic Model for CFD Implementation

An isotropic constitutive model for the parenchyma of lung has been derived from the theory of hypo-elasticity. The intent is to use it to represent the mechanical response of this soft tissue in sophisticated, computational, fluid-dynamic models of the lung. This demands that the continuum model be accurate, yet simple and effcient. An objective algorithm for its numeric integration is provided. The response of the model is determined for several boundary-value problems whose experiments are used for material characterization. The effective elastic, bulk, and shear moduli, and Poisson’s ratio, as tangent functions, are also derived. The model is characterized against published experimental data for lung. A bridge between this continuum model and a dodecahedral model of alveolar geometry is investigated, with preliminary findings being reported.

59 BASIC BIOLOGICAL SCIENCES↗

Relativistic stars in f(R) and scalar-tensor theories

We study relativistic stars in the context of scalar-tensor theories of gravity that try to account for the observed cosmic acceleration and satisfy the local gravity constraints via the chameleon mechanism. More specifically, we consider two types of models: scalar-tensor theories with an inverse power law potential and f(R) theories. Using a relaxation algorithm, we construct numerically static relativistic stars, both for constant energy density configurations and for a polytropic equation of state. We can reach a gravitational potential up to {Phi}{approx}0.3 at the surface of the star, even in f(R) theories with an 'unprotected' curvature singularity. However, we find static configurations only if the pressure does not exceed one third of the energy density, except possibly in a limited region of the star (otherwise, one expects tachyonic instabilities to develop). This constraint is satisfied by realistic equations of state for neutron stars.

79 ASTRONOMY AND ASTROPHYSICS↗

Rapid estimation of earthquake locations using waveform traveltimes

SUMMARY We introduce a new approach for locating earthquakes using arrival times derived from waveforms. The most costly computational step of the algorithm scales as the number of stations in the active seismographic network. In this approach, a variation on existing grid search methods, a series of full waveform simulations are conducted for all receiver locations, with sources positioned successively at each station. The traveltime field over the region of interest is calculated by applying a phase picking algorithm to the numerical wavefields produced from each simulation. An event is located by subtracting the stored traveltime field from the arrival time at each station. This provides a shifted and time-reversed traveltime field for each station. The shifted and time-reversed fields all approach the origin time of the event at the source location. The mean or median value at the source location thus approximates the event origin time. Measures of dispersion about this mean or median time at each grid point, such as the sample standard error and the average deviation, are minimized at the correct source position. Uncertainty in the event position is provided by the contours of standard error defined over the grid. An application of this technique to a synthetic data set indicates that the approach provides stable locations even when the traveltimes are contaminated by additive random noise containing a significant number of outliers and velocity model errors. It is found that the waveform-based method out-performs one based upon the eikonal equation for a velocity model with rapid spatial variations in properties due to layering. A comparison with conventional location algorithms in both a laboratory and field setting demonstrates that the technique performs at least as well as existing techniques.

58 GEOSCIENCES↗

Ab initio two-component Ehrenfest dynamics

We present an ab initio two-component Ehrenfest-based mixed quantum/classical molecular dynamics method to describe the effect of nuclear motion on the electron spin dynamics (and vice versa) in molecular systems. The two-component time-dependent non-collinear density functional theory is used for the propagation of spin-polarized electrons while the nuclei are treated classically. We use a three-time-step algorithm for the numerical integration of the coupled equations of motion, namely, the velocity Verlet for nuclear motion, the nuclear-position-dependent midpoint Fock update, and the modified midpoint and unitary transformation method for electronic propagation. As a test case, the method is applied to the dissociation of H{sub 2} and O{sub 2}. In contrast to conventional Ehrenfest dynamics, this two-component approach provides a first principles description of the dynamics of non-collinear (e.g., spin-frustrated) magnetic materials, as well as the proper description of spin-state crossover, spin-rotation, and spin-flip dynamics by relaxing the constraint on spin configuration. This method also holds potential for applications to spin transport in molecular or even nanoscale magnetic devices.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

2D-FFTLog: efficient computation of real-space covariance matrices for galaxy clustering and weak lensing

ABSTRACT Accurate covariance matrices for two-point functions are critical for inferring cosmological parameters in likelihood analyses of large-scale structure surveys. Among various approaches to obtaining the covariance, analytic computation is much faster and less noisy than estimation from data or simulations. However, the transform of covariances from Fourier space to real space involves integrals with two Bessel integrals, which are numerically slow and easily affected by numerical uncertainties. Inaccurate covariances may lead to significant errors in the inference of the cosmological parameters. In this paper, we introduce a 2D-FFTLog algorithm for efficient, accurate, and numerically stable computation of non-Gaussian real-space covariances for both 3D and projected statistics. The 2D-FFTLog algorithm is easily extended to perform real-space bin-averaging. We apply the algorithm to the covariances for galaxy clustering and weak lensing for a Dark Energy Survey Year 3-like and a Rubin Observatory’s Legacy Survey of Space and Time Year 1-like survey, and demonstrate that for both surveys, our algorithm can produce numerically stable angular bin-averaged covariances with the flat sky approximation, which are sufficiently accurate for inferring cosmological parameters. The code CosmoCov for computing the real-space covariances with or without the flat-sky approximation is released along with this paper.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗