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,297 records · Page 72

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↗

Filtering and error analysis via the UDU super T covariance factorization

Kalman filter algorithms based on the UDU super T covariance factorization are discussed, with special attention given to algorithm implementation efficiency. A U-D-factored covariance error-analysis algorithm is formulated, and its efficiency and numerical stability are demonstrated in a representative orbit determination problem. The numerical results are compared with those obtained using covariance error-analysis formulas, and the comparison highlights the numerical superiority of the present algorithm. A byproduct of the U-D analysis is a highly efficient algorithm mechanization of the arbitrary gain covariance update formula.

Thornton, C. L.↗

The computation of optimal control programmes using a modified successive sweep method.

A second-order method for numerically solving control optimization problems has been developed. The method, referred to as the modified sweep method (MSM), differs from the successive sweep method (SSM) proposed by McReynolds and Bryson (1965) in that the conditions for local control optimality are used to determine the control as an explicit function of the state variables and time. The control is eliminated from the problem and the solution to the resulting two-point boundary value problem can be obtained by linear perturbation methods. The modified sweep method proposed here uncouples the perturbation equations for the state variables and the Lagrange multipliers by using a generalized matrix-Riccati transformation of variables. The resulting algorithm for the numerical iteration process is concerned with determining the initial values of a set of Lagrange multipliers rather than correcting a numerical control programme over the entire time interval of interest.

Colunga, D.↗

Modal element method for potential flow in non-uniform ducts: Combining closed form analysis with CFD

An analytical procedure is presented, called the modal element method, that combines numerical grid based algorithms with eigenfunction expansions developed by separation of variables. A modal element method is presented for solving potential flow in a channel with two-dimensional cylindrical like obstacles. The infinite computational region is divided into three subdomains; the bounded finite element domain, which is characterized by the cylindrical obstacle and the surrounding unbounded uniform channel entrance and exit domains. The velocity potential is represented approximately in the grid based domain by a finite element solution and is represented analytically by an eigenfunction expansion in the uniform semi-infinite entrance and exit domains. The calculated flow fields are in excellent agreement with exact analytical solutions. By eliminating the grid surrounding the obstacle, the modal element method reduces the numerical grid size, employs a more precise far field boundary condition, as well as giving theoretical insight to the interaction of the obstacle with the mean flow. Although the analysis focuses on a specific geometry, the formulation is general and can be applied to a variety of problems as seen by a comparison to companion theories in aeroacoustics and electromagnetics.

Baumeister, Kenneth J.↗

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↗

An efficient DSMC algorithm applied to a delta wing

A new algorithm for 3D direct simulation Monte Carlo (DSMC) is tested and numerical results are compared with wind tunnel data and results obtained earlier with a more traditional DSMC code. The test case is the flowfield around a delta wing at incidence at Knudsen number of 0.016 and Mach number of 20.2. The results are shown to compare favorably with both experimental and earlier numerical results. The new algorithm is described with special emphasis placed on its distinctive features: Cartesian/unstructured combination grid, special body surface definition, discretization in physical space.

Rault, D. F. G.↗

Progress on a Taylor weak statement finite element algorithm for high-speed aerodynamic flows

A new finite element numerical Computational Fluid Dynamics (CFD) algorithm has matured to the point of efficiently solving two-dimensional high speed real-gas compressible flow problems in generalized coordinates on modern vector computer systems. The algorithm employs a Taylor Weak Statement classical Galerkin formulation, a variably implicit Newton iteration, and a tensor matrix product factorization of the linear algebra Jacobian under a generalized coordinate transformation. Allowing for a general two-dimensional conservation law system, the algorithm has been exercised on the Euler and laminar forms of the Navier-Stokes equations. Real-gas fluid properties are admitted, and numerical results verify solution accuracy, efficiency, and stability over a range of test problem parameters.

Baker, A. J.↗

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↗

Numerical Experiments in Error Control for Sound Propagation Using a Damping Layer Boundary Treatment

This paper presents results from numerical experiments for controlling the error caused by a damping layer boundary treatment when simulating the propagation of an acoustic signal from a continuous pressure source. The computations are with the 2D Linearized Euler Equations (LEE) for both a uniform mean flow and a steady parallel jet. The numerical experiments are with algorithms that are third, fifth, seventh and ninth order accurate in space and time. The numerical domain is enclosed in a damping layer boundary treatment. The damping is implemented in a time accurate manner, with simple polynomial damping profiles of second, fourth, sixth and eighth power. At the outer boundaries of the damping layer the propagating solution is uniformly set to zero. The complete boundary treatment is remarkably simple and intrinsically independant from the dimension of the spatial domain. The reported results show the relative effect on the error from the boundary treatment by varying the damping layer width, damping profile power, damping amplitude, propagtion time, grid resolution and algorithm order. The issue that is being addressed is not the accuracy of the numerical solution when compared to a mathematical solution, but the effect of the complete boundary treatment on the numerical solution, and to what degree the error in the numerical solution from the complete boundary treatment can be controlled. We report maximum relative absolute errors from just the boundary treatment that range from O[10-2] to O[10-7].

Algorithm↗

Numerical Experiments in Error Control for Sound Propagation Using a Damping Layer Boundary Treatment

This paper presents results from numerical experiments for controlling the error caused by a damping layer boundary treatment when simulating the propagation of an acoustic signal from a continuous pressure source. The computations are with the 2D Linearized Euler Equations (LEE) for both a uniform mean flow and a steady parallel jet. The numerical experiments are with algorithms that are third, fifth, seventh and ninth order accurate in space and time. The numerical domain is enclosed in a damping layer boundary treatment. The damping is implemented in a time accurate manner, with simple polynomial damping profiles of second, fourth, sixth and eighth power. At the outer boundaries of the damping layer the propagating solution is uniformly set to zero. The complete boundary treatment is remarkably simple and intrinsically independant from the dimension of the spatial domain. The reported results show the relative effect on the error from the boundary treatment by varying the damping layer width, damping profile power, damping amplitude, propagtion time, grid resolution and algorithm order. The issue that is being addressed is not the accuracy of the numerical solution when compared to a mathematical solution, but the effect of the complete boundary treatment on the numerical solution, and to what degree the error in the numerical solution from the complete boundary treatment can be controlled. We report maximum relative absolute errors from just the boundary treatment that range from O[10-2] to O[10-7].

Computational Aeroacoustics↗