Search NASA⌕ Search

SEARCH · Search NASA

Results for “finite difference”

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,783 records · Page 99

Reducing Disk Storage of Full-3D Seismic Waveform Tomography (F3DT) Through Lossy Online Compression

Full-3D seismic waveform tomography (F3DT) is the latest seismic tomography technique that can assimilate broadband, multi-component seismic waveform observations into high-resolution 3D subsurface seismic structure models. The main drawback in the current F3DT implementation, in particular the scattering-integral implementation (F3DT-SI), is the high disk storage cost and the associated I/O overhead of archiving the 4D space-time wavefields of the receiver- or source-side strain tensors. The strain tensor fields are needed for computing the data sensitivity kernels, which are used for constructing the Jacobian matrix in the Gauss-Newton optimization algorithm. In this study, we have successfully integrated a lossy compression algorithm into our F3DT SI workflow to significantly reduce the disk space for storing the strain tensor fields. The compressor supports a user-specified tolerance for bounding the error, and can be integrated into our finite-difference wave-propagation simulation code used for computing the strain fields. The decompressor can be integrated into the kernel calculation code that reads the strain fields from the disk and compute the data sensitivity kernels. During the wave-propagation simulations, we compress the strain fields before writing them to the disk. To compute the data sensitivity kernels, we read the compressed strain fields from the disk and decompress them before using them in kernel calculations. Experiments using a realistic dataset in our California statewide F3DT project have shown that we can reduce the strain-field disk storage by at least an order of magnitude with acceptable loss, and also improve the overall I/O performance of the entire F3DT-SI workflow significantly. The integration of the lossy online compressor may potentially open up the possibilities of the wide adoption of F3DT-SI in routine seismic tomography practices in the near future.

97 MATHEMATICS AND COMPUTING↗

Generating one-column grids with fractal flow dimension

The grid generation capability built into the numerical simulator TOUGH for multi-phase fluid and heat flow through geologic media can create one-column grids with linear or radial geometry, corresponding to one-dimensional or two-dimensional radial flow, respectively. The integral-finite-difference-method that TOUGH employs for spatial discretization makes it very simple to generalize the grid-generation algorithm from integer to non-integer (fractal) flow dimension. Here the grid-generation algorithm is generalized to create one-column grids with fractal flow dimension ranging from less than 1 to 3. The fractal grid generation method is verified by comparing numerical simulation results to an analytical solution for a generalized Theis solution for integer and non-integer flow dimensions between 0.4 and 3. It is then applied to examine gas production decline curves from hydraulically fractured shale that is modeled as a fractal-dimensioned fracture network with flow dimensions between 0.25 and 3. Grids with fractal flow dimension are useful for representing flow through fracture networks or highly heterogeneous geologic media with fractal geometry, and may be particularly useful for inverse methods.

58 GEOSCIENCES↗

An overlapping Domain Decomposition preconditioning method for monolithic solution of shear bands

Metals subjected to high strain rate impact often exhibit a sudden and profound drop in the material’s load bearing capability, a ductile failure phenomenon known as shear banding. Shear bands, characterized as material instabilities, are driven by shear heating and described as narrow regions that have sustained intense plastic deformation and high temperature rise. This coupled thermo-mechanical localization problem can be formulated as a nonlinear system with two balance equations, momentum and energy, and two constitutive laws for elasticity and plasticity. Here in our formulation, mixed finite elements are used to discretize the equations in space and an implicit finite difference scheme is used to advance the system in time, where at every time step, a Newton type method is used to solve the system monolithically. To that end, a block Jacobian matrix is formed analytically using Gâteaux derivatives. The resulting Jacobian is sparse, nonsymmetric and its sparsity pattern and eigenvalue content vary with the different stages of shear bands formation, consequently posing a significant challenge to iterative solvers. To address this issue, an overlapping Domain Decomposition preconditioner that takes into account the physics of shear bands and the domain in which it forms, is proposed. The key idea is to resolve the shear band domain accurately while only solving the remaining domain approximately, with selective updates when necessary. The preconditioner is formed on the basis of an additive Schwartz method that is applied to a Schur complement partition of the system. The proposed preconditioner is implemented in parallel and tested on three different benchmark problems as compared against off-the-shelf solvers. We study the effect of h- and k-refinement that are obtained from Isogeometric discretizations of the system, the overlapping strategy and its parallel performance. Excellent performance is demonstrated in serial and parallel on all benchmark examples.

42 ENGINEERING↗

Constrained or unconstrained? Neural-network-based equation discovery from data

Throughout many fields, practitioners often rely on differential equations to model systems. Yet, for many applications, the theoretical derivation of such equations and/or the accurate resolution of their solutions may be intractable. Instead, recently developed methods, including those based on parameter estimation, operator subset selection, and neural networks, allow for the data-driven discovery of both ordinary and partial differential equations (PDEs), on a spectrum of interpretability. The success of these strategies is often contingent upon the correct identification of representative equations from noisy observations of state variables and, as importantly and intertwined with that, the mathematical strategies utilized to enforce those equations. Specifically, the latter has been commonly addressed via unconstrained optimization strategies. Representing the PDE as a neural network, we propose to discover the PDE (or the associated operator) by solving a constrained optimization problem and using an intermediate state representation similar to a physics-informed neural network (PINN). The objective function of this constrained optimization problem promotes matching the data, while the constraints require that the discovered PDE is satisfied at a number of spatial collocation points. We present a penalty method and a widely used trust-region barrier method to solve this constrained optimization problem, and we compare these methods on numerical examples. Our results on several example problems demonstrate that the latter constrained method outperforms the penalty method, particularly for higher noise levels or fewer collocation points. This work motivates further exploration into using sophisticated constrained optimization methods in scientific machine learning, as opposed to their commonly used, penalty-method or unconstrained counterparts. For both of these methods, we solve these discovered neural network PDEs with classical methods, such as finite difference methods, as opposed to PINNs-type methods relying on automatic differentiation. Here, we briefly highlight how simultaneously fitting the data while discovering the PDE improves the robustness to noise and other small, yet crucial, implementation details.

Data-driven discovery↗

Multiscale dendritic needle network model of alloy solidification with fluid flow

We present a mathematical formulation of a multiscale model for solidification with convective flow in the liquid phase. The model is an extension of the dendritic needle network approach for crystal growth in a binary alloy. We propose a simple numerical implementation based on finite differences and step-wise approximations of parabolic dendritic branches of arbitrary orientation. Results of the two-dimensional model are verified against reference benchmark solutions for steady, unsteady, and buoyant flow, as well as steady-state dendritic growth in the diffusive regime. Simulations of equiaxed growth under forced flow yield dendrite tip velocities within 10% of quantitative phase-field results from the literature. Finally, we perform illustrative simulations of polycrystalline solidification using physical parameters for an aluminum-10wt% copper alloy. Resulting microstructures show notable differences when taking into account natural buoyancy in comparison to a purely diffusive transport regime. The resulting model opens new avenues for computationally and quantitatively investigating the influence of fluid flow and gravity-induced buoyancy upon the selection of dendritic microstructures. Further ongoing developments include an equivalent formulation for directional solidification conditions and the implementation of the model in three dimensions, which is critical for quantitative comparison to experimental measurements.

36 MATERIALS SCIENCE↗

A sharp interface model for deterministic simulation of dendrite growth

A high order level set model is developed for deterministic simulation of dendritic growth in unstable solidifying systems. The model captures motion of the front implicitly on a structured finite difference grid, enables calculation of its geometric properties and also applies boundary conditions on the immersed interface. Interfacial capillary effect is incorporated in the model through the Gibbs-Thomson condition. Canonical problems for evaluating grid convergence of the numerical method and validation tests for stability of a growing nucleus in the presence of isotropic surface tension are presented. The growth morphology of solidifying nuclei in undercooled metallic melts is quantitatively analyzed. Effects of crystal anisotropy and melt undercooling on the front geometry, propagation speed and formation of branched dendritic structures are examined. In conclusion, the complex morphological changes, such as remelting of secondary perturbations under specific conditions of undercooling, are also captured during the quantitative analysis.

36 MATERIALS SCIENCE↗

ExaCA v2.0: A versatile, scalable, and performance portable cellular automata application for additive manufacturing solidification

The previously established ExaCA software for performance portable alloy grain structure simulation has been updated to better represent the solidification behavior during complex alloy processing conditions, such as those encountered during metal additive manufacturing (AM), and for improved performance and scalability. Here, an extension to the time–temperature history input data format and the core ExaCA algorithm to include an arbitrary number of melting and solidification events yielded improved prediction of texture for various melt pool geometries, expanding the range of AM-relevant conditions that can be accurately simulated. Improved heat transport process simulation coupling, including the creation of large raster datasets from single track time–temperature history data and in-memory coupling with the new, performance portable finite difference code Finch, were also demonstrated in example studies on the effect of multilayer AM microstructure predictions on hatch spacing and cell size, respectively. Additional new features are detailed and demonstrated, including the ability to perform simulations using various interfacial response function forms, execute simulations on state-of-the-art hardware, improved usability through post-processing versatility, and improved strong and weak scaling performance. The performance, physics, and versatility improvements demonstrated here will further enable large-scale studies on AM process–microstructure relationships that were not previously possible. Furthermore, the usability improvements and ability to run coupled AM process–microstructure simulations using the Finch-ExaCA workflow will facilitate broader use of this open-source software by the computational materials community.

36 MATERIALS SCIENCE↗

A multi-dimensional, energy- and charge-conserving, nonlinearly implicit, electromagnetic Vlasov–Darwin particle-in-cell algorithm

For decades, the Vlasov–Darwin model has been recognized to be attractive for particle-in-cell (PIC) kinetic plasma simulations in non-radiative electromagnetic regimes, to avoid radiative noise issues and gain computational efficiency. However, the Darwin model results in an elliptic set of field equations that renders conventional explicit time integration unconditionally unstable. We explore a fully implicit PIC algorithm for the Vlasov–Darwin model in multiple dimensions, which overcomes many difficulties of traditional semi-implicit Darwin PIC algorithms. The finite-difference scheme for Darwin field equations and particle equations of motion is space–time-centered, employing particle sub-cycling and orbit-averaging. This algorithm conserves total energy, local charge, canonical-momentum in the ignorable direction, and preserves the Coulomb gauge exactly. An asymptotically well-posed fluid preconditioner allows efficient use of large cell sizes, which are determined by accuracy considerations, not stability, and can be orders of magnitude larger than required in a standard explicit electromagnetic PIC simulation. Finally, we demonstrate the accuracy and efficiency properties of the algorithm with various numerical experiments in 2D–3V.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

Spectral Quadrature method for accurate O ( N ) electronic structure calculations of metals and insulators

We present the Clenshaw–Curtis Spectral Quadrature (SQ) method for real-space O(N) Density Functional Theory (DFT) calculations. In this approach, all quantities of interest are expressed as bilinear forms or sums over bilinear forms, which are then approximated by spatially localized Clenshaw–Curtis quadrature rules. This technique is identically applicable to both insulating and metallic systems, and in conjunction with local reformulation of the electrostatics, enables the O(N) evaluation of the electronic density, energy, and atomic forces. The SQ approach also permits infinite-cell calculations without recourse to Brillouin zone integration or large supercells. We employ a finite difference representation in order to exploit the locality of electronic interactions in real space, enable systematic convergence, and facilitate large-scale parallel implementation. In particular, we derive expressions for the electronic density, total energy, and atomic forces that can be evaluated in O(N) operations. We demonstrate the systematic convergence of energies and forces with respect to quadrature order as well as truncation radius to the exact diagonalization result. In addition, we show convergence with respect to mesh size to established O(N 3 ) planewave results. In conclusion, we establish the efficiency of the proposed approach for high temperature calculations and discuss its particular suitability for large-scale parallel computation.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗

A spectral, quasi-cylindrical and dispersion-free Particle-In-Cell algorithm

We propose a spectral Particle-In-Cell (PIC) algorithm that is based on the combination of a Hankel transform and a Fourier transform. For physical problems that have close-to-cylindrical symmetry, this algorithm can be much faster than full 3D PIC algorithms. In addition, unlike standard finite-difference PIC codes, the proposed algorithm is free of spurious numerical dispersion, in vacuum. This algorithm is benchmarked in several situations that are of interest for laser-plasma interactions. These benchmarks show that it avoids a number of numerical artifacts, that would otherwise affect the physics in a standard PIC algorithm - including the zero-order numerical Cherenkov effect.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

SQDFT: Spectral Quadrature method for large-scale parallel O ( N ) Kohn–Sham calculations at high temperature

We present SQDFT: a large-scale parallel implementation of the Spectral Quadrature (SQ) method for $\mathscr{O}(N)$ Kohn–Sham Density Functional Theory (DFT) calculations at high temperature. Specifically, we develop an efficient and scalable finite-difference implementation of the infinite-cell Clenshaw–Curtis SQ approach, in which results for the infinite crystal are obtained by expressing quantities of interest as bilinear forms or sums of bilinear forms, that are then approximated by spatially localized Clenshaw–Curtis quadrature rules. We demonstrate the accuracy of SQDFT by showing systematic convergence of energies and atomic forces with respect to SQ parameters to reference diagonalization results, and convergence with discretization to established planewave results, for both metallic and insulating systems. Here, we further demonstrate that SQDFT achieves excellent strong and weak parallel scaling on computer systems consisting of tens of thousands of processors, with near perfect $\mathscr{O}(N)$ scaling with system size and wall times as low as a few seconds per self-consistent field iteration. Finally, we verify the accuracy of SQDFT in large-scale quantum molecular dynamics simulations of aluminum at high temperature.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗

FDTD: Solving 1+1D delay PDE in parallel

We present a proof of concept for solving a 1+1D complex-valued, delay partial differential equation (PDE) that emerges in the study of waveguide quantum electrodynamics (QED) by adapting the finite-difference time-domain (FDTD) method. The delay term is spatially non-local, rendering conventional approaches such as the method of lines inapplicable. Here, we show that by properly designing the grid and by supplying the (partial) exact solution as the boundary condition, the delay PDE can be numerically solved. In addition, we demonstrate that while the delay imposes strong data dependency, multi-thread parallelization can nevertheless be applied to such a problem. Our code provides a numerically exact solution to the time-dependent multi-photon scattering problem in waveguide QED.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Benchmarking collective effects of electron interactions in a wiggler with OPAL-FEL

OPAL-FEL is a recently developed tool for the modeling of particle accelerators containing wigglers or undulators. It extends the well established 3D electrostatic particle-tracking code OPAL, by merging it with the finite-difference time-domain electromagnetic solver MITHRA. We present results of two benchmark cases where OPAL-FEL simulations are compared to experimental results. Both experiments concern electron beamlines where the longitudinal phase space is modulated with a short magnetic wiggler. Good agreement was found in both the space charge and radiation dominated regimes.

43 PARTICLE ACCELERATORS↗

A pseudospectral implicit particle-in-cell method with exact energy and charge conservation

The standard particle-in-cell (PIC) method employs explicit finite-difference (FD) methods (e.g. the leap-frog scheme) for both spatial and temporal integrations. Here, we employ a pseudospectral method for solving the Poisson equation and a fully implicit time integration to achieve exact energy conservation. The advantage of a pseudospectral field solver is its spectral accuracy in solving field solutions. Earlier studies of implicit time integration of PIC FD equations can enforce exact energy exchange between field and particles, resulting in exact energy-conserving schemes. Here, we prove that the exact energy conservation property can be carried over to the pseudospectral scheme. Simultaneously, we provide a solution to ensure a pseudospectral charge continuity equation. We demonstrate the new scheme in a 2D electrostatic PIC code. In conclusion, theoretical results are confirmed via numerical examples.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

STORM: Scrape-off layer turbulence in tokamak fusion reactors

The scrape-off layer of a tokamak fusion reactor carries the plasma exhaust from the hot core plasma to the material surfaces of the reactor vessel. The heat loads imposed by the exhaust are a critical limit on the performance of fusion power plants. Turbulent transport of the plasma regulates the width of the scrape-off layer plasma and must be modelled to understand the intensity of these heat loads. STORM is a plasma turbulence code capable of simulating three dimensional turbulence across the full scrape-off layer of a tokamak fusion reactor, using a drift reduced, collisional fluid model. STORM uses mostly finite difference schemes, with a staggered grid in the direction parallel to the magnetic field. We describe the model, geometry and initialisation options used by STORM, as well as the numerical methods, which are implemented using the BOUT++ plasma simulation framework. BOUT++ has been enhanced alongside the development of STORM, providing better support for staggered grid methods. We summarise these enhancements, including a detailed explanation of the parallel derivative methods, which underwent a major update for version 4 of BOUT++.

BOUT++↗

HFBTHO-AD: Differentiation of a nuclear energy density functional code

The HFBTHO code implements a nuclear energy density functional solver to model the structure of atomic nuclei. HFBTHO has previously been used to calibrate energy functionals and perform sensitivity analysis by using derivative-free methods. To enable derivative-based optimization and uncertainty quantification approaches, we must compute the derivatives of HFBTHO outputs with respect to the parameters of the energy functional, which are a subset of all input parameters of the code. Here, we use the algorithmic/automatic differentiation (AD) tool Tapenade to differentiate HFBTHO. We compare the derivatives obtained using AD against finite-difference approximation and examine the performance of the derivative computation.

Algorithmic differentiation↗

Numerical modeling of a 2K J-T heat exchanger used in Fermilab Vertical Test Stand VTS-1

Fermilab Vertical Test Stand-1 (VTS-1) is in operation since 2007 for testing the superconducting RF cavities at 2 K. This test stand has single layer coiled finned tubes heat exchanger before J-T valve. A finite difference based thermal model has been developed in Engineering Equation Solver (EES) to study its thermal performance during filling and refilling to maintain the constant liquid level of test stand. The model is also useful to predict its performance under other various operating conditions and will be useful to design the similar kind of heat exchanger for future needs. Present paper discusses the different operational modes of this heat exchanger and its thermal characteristics under these operational modes. Results of this model have also been compared with the experimental data gathered from the VTS-1 heat exchanger and they are in good agreement with the present model.

2 Kelvin J-T Heat Exchanger↗