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,477 records · Page 82

A physics-motivated Centroidal Voronoi Particle domain decomposition method

In this paper, we propose a novel domain decomposition method for large-scale simulations in continuum mechanics by merging the concepts of Centroidal Voronoi Tessellation (CVT) and Voronoi Particle dynamics (VP). The CVT is introduced to achieve a high-level compactness of the partitioning subdomains by the Lloyd algorithm which monotonically decreases the CVT energy. The number of computational elements between neighboring partitioning subdomains, which scales the communication effort for parallel simulations, is optimized implicitly as the generated partitioning subdomains are convex and simply connected with small aspect-ratios. Moreover, Voronoi Particle dynamics employing physical analogy with a tailored equation of state is developed, which relaxes the particle system towards the target partition with good load balance. Since the equilibrium is computed by an iterative approach, the partitioning subdomains exhibit locality and the incremental property. Numerical experiments reveal that the proposed Centroidal Voronoi Particle (CVP) based algorithm produces high-quality partitioning with high efficiency, independently of computational-element types. Thus it can be used for a wide range of applications in computational science and engineering.

97 MATHEMATICS AND COMPUTING↗

OBTAINING POTENTIAL FIELD SOLUTIONS WITH SPHERICAL HARMONICS AND FINITE DIFFERENCES

Potential magnetic field solutions can be obtained based on the synoptic magnetograms of the Sun. Traditionally, a spherical harmonics decomposition of the magnetogram is used to construct the current- and divergence-free magnetic field solution. This method works reasonably well when the order of spherical harmonics is limited to be small relative to the resolution of the magnetogram, although some artifacts, such as ringing, can arise around sharp features. When the number of spherical harmonics is increased, however, using the raw magnetogram data given on a grid that is uniform in the sine of the latitude coordinate can result in inaccurate and unreliable results, especially in the polar regions close to the Sun. We discuss here two approaches that can mitigate or completely avoid these problems: (1) remeshing the magnetogram onto a grid with uniform resolution in latitude and limiting the highest order of the spherical harmonics to the anti-alias limit; (2) using an iterative finite difference algorithm to solve for the potential field. The naive and the improved numerical solutions are compared for actual magnetograms and the differences are found to be rather dramatic. We made our new Finite Difference Iterative Potential-field Solver (FDIPS) a publicly available code so that other researchers can also use it as an alternative to the spherical harmonics approach.

79 ASTRONOMY AND ASTROPHYSICS↗

Orbital spaces in the divide-expand-consolidate coupled cluster method

The theoretical foundation for solving coupled cluster singles and doubles (CCSD) amplitude equations to a desired precision in terms of independent fragment calculations using restricted local orbital spaces is reinvestigated with focus on the individual error sources. Four different error sources are identified theoretically and numerically and it is demonstrated that, for practical purposes, local orbital spaces for CCSD calculations can be identified from calculations at the MP2 level. The development establishes a solid theoretical foundation for local CCSD calculations for the independent fragments, and thus for divide–expand–consolidate coupled cluster calculations for large molecular systems with rigorous error control. Based on this theoretical foundation, we have developed an algorithm for determining the orbital spaces needed for obtaining the single fragment energies to a requested precision and numerically demonstrated the robustness and precision of this algorithm

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Learning to Predict Physical Properties Using Sums of Separable Functions

We present an algorithm for learning the function that maps a material structure to its value on some property, given the value of this function on several structures. We pose this problem as one of learning (regressing) a function of many variables from scattered data. Each structure is first converted to a weighted set of points by a process that removes irrelevant translations and rotations but otherwise retains full information about the structure. Then, incorporating a weighted average for each structure, we construct the multivariate regression function as a sum of separable functions, following the paradigm of separated representations. The algorithm can treat all finite and periodic structures within a common framework, and in particular does not require all structures to lie on a common lattice. We show how the algorithm simplifies when the structures do lie on a common lattice, and we present numerical results for that case.

36 MATERIALS SCIENCE↗

Implicit-explicit evolution of single black holes

Numerical simulations of binary black holes - an important predictive tool for the detection of gravitational waves - are computationally expensive, especially for binaries with high mass ratios or with rapidly spinning constituent holes. Existing codes for evolving binary black holes rely on explicit time-stepping methods, for which the time-step size is limited by the smallest spatial scale through the Courant-Friedrichs-Lewy condition. Binary inspiral typically involves spatial scales (the spatial resolution required by a small or rapidly spinning hole) which are orders of magnitude smaller than the relevant (orbital, precession, and radiation-reaction) time scales characterizing the inspiral. Therefore, in explicit evolutions of binary black holes, the time-step size is typically orders of magnitude smaller than the relevant physical time scales. Implicit time-stepping methods allow for larger time steps, and they often reduce the total computational cost (without significant loss of accuracy) for problems dominated by spatial rather than temporal error, such as for binary-black-hole inspiral in corotating coordinates. However, fully implicit methods can be difficult to implement for nonlinear evolution systems like the Einstein equations. Therefore, in this paper we explore implicit-explicit (IMEX) methods and use them for the first time to evolve black-hole spacetimes. Specifically, as a first step toward IMEX evolution of a full binary-black-hole spacetime, we develop an IMEX algorithm for the generalized harmonic formulation of the Einstein equations and use this algorithm to evolve stationary and perturbed single-black-hole spacetimes. Numerical experiments explore the stability and computational efficiency of our method.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Functional entropy variables: A new methodology for deriving thermodynamically consistent algorithms for complex fluids, with particular reference to the isothermal Navier–Stokes–Korteweg equations

We propose a new methodology for the numerical solution of the isothermal Navier–Stokes–Korteweg equations. Our methodology is based on a semi-discrete Galerkin method invoking functional entropy variables, a generalization of classical entropy variables, and a new time integration scheme. We show that the resulting fully discrete scheme is unconditionally stable-in-energy, second-order time-accurate, and mass-conservative. We utilize isogeometric analysis for spatial discretization and verify the aforementioned properties by adopting the method of manufactured solutions and comparing coarse mesh solutions with overkill solutions. Various problems are simulated to show the capability of the method. Our methodology provides a means of constructing unconditionally stable numerical schemes for nonlinear non-convex hyperbolic systems of conservation laws.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Economic Dispatch With Distributed Energy Resources: Co-Optimization of Transmission and Distribution Systems

The increasing penetration of distributed energy resources (DERs) in the distribution networks has turned the conventionally passive load buses into active buses that can provide grid services for the transmission system. To take advantage of the DERs in the distribution networks, this letter formulates a transmission-and-distribution (T&D) systems co-optimization problem that achieves economic dispatch at the transmission level and optimal voltage regulation at the distribution level by leveraging large generators and DERs. A primal-dual gradient algorithm is proposed to solve this optimization problem jointly for T&D systems, and a distributed market-based equivalent of the gradient algorithm is used for practical implementation. Finally, the results are corroborated by numerical examples with the IEEE 39-Bus system connected with 7 different distribution networks.

24 POWER TRANSMISSION AND DISTRIBUTION↗

A Unified Differential Evolution Algorithm for Global Optimization

Abstract?In this paper, we propose a new unified differential evolution (uDE) algorithm for single objective global optimization. Instead of selecting among multiple mutation strategies as in the conventional differential evolution algorithm, this algorithm employs a single equation as the mutation strategy. It has the virtue of mathematical simplicity and also provides users the flexbility for broader exploration of different mutation strategies. Numerical tests using twelve basic unimodal and multimodal functions show promising performance of the proposed algorithm in comparison to convential differential evolution algorithms.

43 PARTICLE ACCELERATORS↗

Study of Single and Coupled-Bunch Instabilities for NSLS-II

We study single and coupled-bunch instabilities for the NSLS-II storage ring with a recently developed parallel tracking code. For accurate modelling of the coupled-bunch instability, we investigate improvements to current point-bunch models to take into account finite bunch-size effects. Accurate modelling of single and coupled-bunch instabilities is of crucial importance for the machine performance of light sources such as NSLS-II, that provide high current beams. The complexity of the model consists in the accurate calculation of the impedance of the various components of the ring that can excite single and multibunch instabilities via short and long range wakefields. Moreover, a full account of the coupling between transverse and longitudinal dynamics must be taken into account to study effects such as chromaticity and Landau cavity effects. A parallel algorithm for the study of single and coupled-bunch instabilities has been implemented in a particle tracking code. The theoretical framework for single bunch instabilities is the same used in the code TRANFT, while for coupled-bunch instabilities a self-consistent algorithm has been implemented to allow the study of finite bunch-size effects and multibunch effects in arbitrary filling modes. In this paper we present numerical studies of the microwave instability for NSLS-II and discuss the self-consistent algorithm for simulation of coupled-bunch instabilities.

43 PARTICLE ACCELERATORS↗

Delayed Slater determinant update algorithms for high efficiency quantum Monte Carlo

Within ab initio Quantum Monte Carlo simulations, the leading numerical cost for large systems is the computation of the values of the Slater determinants in the trial wavefunction. Each Monte Carlo step requires finding the determinant of a dense matrix. This is most commonly iteratively evaluated using a rank-1 Sherman-Morrison updating scheme to avoid repeated explicit calculation of the inverse. The overall computational cost is therefore formally cubic in the number of electrons or matrix size. To improve the numerical efficiency of this procedure, we propose a novel multiple rank delayed update scheme. This strategy enables probability evaluation with application of accepted moves to the matrices delayed until after a predetermined number of moves, K . The accepted events are then applied to the matrices en bloc with enhanced arithmetic intensity and computational efficiency via matrix-matrix operations instead of matrix-vector operations. Here this procedure does not change the underlying Monte Carlo sampling or its statistical efficiency. For calculations on large systems and algorithms such as diffusion Monte Carlo where the acceptance ratio is high, order of magnitude improvements in the update time can be obtained on both multi- core CPUs and GPUs.

97 MATHEMATICS AND COMPUTING↗

Stochastic multiscale flux basis for Stokes-Darcy flows

Three algorithms are developed for uncertainty quantification in modeling coupled Stokes and Darcy flows. The porous media may consist of multiple regions with different properties. The permeability is modeled as a non-stationary stochastic variable, with its log represented as a sum of local Karhunen-Loève (KL) expansions. The problem is approximated by stochastic collocation on either tensor-product or sparse grids, coupled with a multiscale mortar mixed finite element method for the spatial discretization. A non-overlapping domain decomposition algorithm reduces the global problem to a coarse scale mortar interface problem, which is solved by an iterative solver, for each stochastic realization. In the traditional domain decomposition implementation, each subdomain solves a local Dirichlet or Neumann problem in every interface iteration. To reduce this cost, two additional algorithms based on deterministic or stochastic multiscale flux basis are introduced. The basis consists of the local flux (or velocity trace) responses from each mortar degree of freedom. It is computed for each subdomain independently before the interface iteration begins. The use of the multiscale flux basis avoids the need for subdomain solves on each iteration. The deterministic basis is computed at each stochastic collocation and used only at this realization. The stochastic basis is formed by further looping over all local realizations of a subdomain's KL region before the stochastic collocation begins. It is used over multiple realizations. Numerical tests are presented to illustrate the performance of the three algorithms, with the stochastic multiscale flux basis showing significant savings in computational cost compared to the other two algorithms.

97 MATHEMATICS AND COMPUTING↗

Charge-and-energy conserving moment-based accelerator for a multi-species Vlasov–Fokker–Planck–Ampère system, part I: Collisionless aspects

In this study, we propose a charge, momentum, and energy conserving discretization for the 1D–1V Vlasov–Ampère system of equations on an Eulerian grid. The new conservative discretization is nonlinear in nature, but can be efficiently converged with a moment-based nonlinear accelerator algorithm. We demonstrate the conservation and convergence properties of the scheme with various numerical examples, including a multi-scale ion–acoustic shockwave problem.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

On coarse projective integration for atomic deposition in amorphous systems

Direct molecular dynamics simulation of atomic deposition under realistic conditions is notoriously challenging because of the wide range of time scales that must be captured. Numerous simulation approaches have been proposed to address the problem, often requiring a compromise between model fidelity, algorithmic complexity, and computational efficiency. Coarse projective integration, an example application of the “equation-free” framework, offers an attractive balance between these constraints. Here, periodically applied, short atomistic simulations are employed to compute time derivatives of slowly evolving coarse variables that are then used to numerically integrate differential equations over relatively large time intervals. A key obstacle to the application of this technique in realistic settings is the “lifting” operation in which a valid atomistic configuration is recreated from knowledge of the coarse variables. Using Ge deposition on amorphous SiO{sub 2} substrates as an example application, we present a scheme for lifting realistic atomistic configurations comprised of collections of Ge islands on amorphous SiO{sub 2} using only a few measures of the island size distribution. The approach is shown to provide accurate initial configurations to restart molecular dynamics simulations at arbitrary points in time, enabling the application of coarse projective integration for this morphologically complex system.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Interlocked optimization and fast gradient algorithm for a seismic inverse problem

Highlights: {yields} A 2D extension of the 1D nonlinear inversion of well-seismic data is given. {yields} Appropriate regularization yields a well-determined large scale inverse problem. {yields} An interlocked optimization loop acts as an efficient preconditioner. {yields} The adjoint state method is used to compute the misfit function gradient. {yields} Domain decomposition method yields an efficient parallel implementation. - Abstract: We give a nonlinear inverse method for seismic data recorded in a well from sources at several offsets from the borehole in a 2D acoustic framework. Given the velocity field, approximate values of the impedance are recovered. This is a 2D extension of the 1D inversion of vertical seismic profiles . The inverse problem generates a large scale undetermined ill-conditioned problem. Appropriate regularization terms render the problem well-determined. An interlocked optimization algorithm yields an efficient preconditioning. A gradient algorithm based on the adjoint state method and domain decomposition gives a fast parallel numerical method. For a realistic test case, convergence is attained in an acceptable time with 128 processors.

97 MATHEMATICS AND COMPUTING↗

A Non-perturbative Approach to Computing Seismic Normal Modes in Rotating Planets

In this work, a continuous Galerkin method based approach is presented to compute the seismic normal modes of rotating planets. Special care is taken to separate out the essential spectrum in the presence of a fluid outer core using a polynomial filtering eigensolver. The relevant elastic-gravitational system of equations, including the Coriolis force, is subjected to a mixed finite-element method, while self-gravitation is accounted for with the fast multipole method. Our discretization utilizes fully unstructured tetrahedral meshes for both solid and fluid regions. The relevant eigenvalue problem is solved by a combination of several highly parallel and computationally efficient methods. We validate our three-dimensional results in the non-rotating case using analytical results for constant elastic balls, as well as numerical results for an isotropic Earth model from standard “radial” algorithms. We also validate the computations in the rotating case, but only in the slowly-rotating regime where perturbation theory applies, because no other independent algorithms are available in the general case. The algorithm and code are used to compute the point spectra of eigenfrequencies in several Earth and Mars models studying the effects of heterogeneity on a large range of scales.

58 GEOSCIENCES↗

Projected nonmonotone search methods for optimization with orthogonality constraints

In this paper, we propose two feasible methods based on projections using a curvilinear search for solving optimization problems with orthogonality constraints. In one of them we apply a projected Adams–Moulton-like update scheme. All our algorithms compute the SVD decomposition in each iteration to preserve feasibility. Additionally, we present some convergence results. Finally, we perform numerical experiments with simulated problems; and analyze the performance of the proposed methods compared with state-of-the-art algorithms.

97 MATHEMATICS AND COMPUTING↗

On the effective implementation of a boundary element code on graphics processing units unsing an out-of-core LU algorithm

A collocation boundary element code for solving the three-dimensional Laplace equation, publicly available from \url{http://www.intetec.org}, has been adapted to run on an Nvidia Tesla general purpose graphics processing unit (GPU). Global matrix assembly and LU factorization of the resulting dense matrix were performed on the GPU. Out-of-core techniques were used to solve problems larger than available GPU memory. The code achieved over eight times speedup in matrix assembly and about 56~Gflops/sec in the LU factorization using only 512~Mbytes of GPU memory. Details of the GPU implementation and comparisons with the standard sequential algorithm are included to illustrate the performance of the GPU code.

99 GENERAL AND MISCELLANEOUS↗

The backward phase flow and FBI-transform-based Eulerian Gaussian beams for the Schroedinger equation

We propose the backward phase flow method to implement the Fourier-Bros-Iagolnitzer (FBI)-transform-based Eulerian Gaussian beam method for solving the Schroedinger equation in the semi-classical regime. The idea of Eulerian Gaussian beams has been first proposed in . In this paper we aim at two crucial computational issues of the Eulerian Gaussian beam method: how to carry out long-time beam propagation and how to compute beam ingredients rapidly in phase space. By virtue of the FBI transform, we address the first issue by introducing the reinitialization strategy into the Eulerian Gaussian beam framework. Essentially we reinitialize beam propagation by applying the FBI transform to wavefields at intermediate time steps when the beams become too wide. To address the second issue, inspired by the original phase flow method, we propose the backward phase flow method which allows us to compute beam ingredients rapidly. Numerical examples demonstrate the efficiency and accuracy of the proposed algorithms.

97 MATHEMATICS AND COMPUTING↗