Search NASA⌕ Search

SEARCH · Search NASA

Results for “finite difference method”

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 127 records · Page 7

Numerical methods for nonlocal and fractional models

Partial differential equations (PDEs) are used with huge success to model phenomena across all scientific and engineering disciplines. However, across an equally wide swath, there exist situations in which PDEs fail to adequately model observed phenomena, or are not the best available model for that purpose. On the other hand, in many situations, nonlocal models that account for interaction occurring at a distance have been shown to more faithfully and effectively model observed phenomena that involve possible singularities and other anomalies. Here, we consider a generic nonlocal model, beginning with a short review of its definition, the properties of its solution, its mathematical analysis and of specific concrete examples. We then provide extensive discussions about numerical methods, including finite element, finite difference and spectral methods, for determining approximate solutions of the nonlocal models considered. In that discussion, we pay particular attention to a special class of nonlocal models that are the most widely studied in the literature, namely those involving fractional derivatives. The article ends with brief considerations of several modelling and algorithmic extensions, which serve to show the wide applicability of nonlocal modelling.

97 MATHEMATICS AND COMPUTING↗

Numerical methods for nonlocal and fractional models

Partial differential equations (PDEs) are used, with huge success, to model phenomena arising across all scientific and engineering disciplines. However, across an equally wide swath, there exist situations in which PDE models fail to adequately model observed phenomena or are not the best available model for that purpose. On the other hand, in many situations, nonlocal models that account for interaction occurring at a distance have been shown to more faithfully and effectively model observed phenomena that involve possible singularities and other anomalies. In this article, we consider a generic nonlocal model, beginning with a short review of its definition, the properties of its solution, its mathematical analysis, and specific concrete examples. We then provide extensive discussions about numerical methods, including finite element, finite difference, and spectral methods, for determining approximate solutions of the nonlocal models considered. In that discussion, we pay particular attention to a special class of nonlocal models that are the most widely studied in the literature, namely those involving fractional derivatives. The article ends with brief considerations of several modeling and algorithmic extensions which serve to show the wide applicability of nonlocal modeling.

97 MATHEMATICS AND COMPUTING↗

High-order accurate finite difference discretisations on fully unstructured dual quadrilateral meshes

Here, we present a novel approach for high-order accurate numerical differentiation on unstructured meshes of quadrilateral elements. To differentiate a given function, an auxiliary function with greater smoothness properties is defined which when differentiated provides the derivatives of the original function. The method generalises traditional finite difference methods to meshes of arbitrary topology in any number of dimensions for any order of derivative and accuracy. We demonstrate the accuracy of the numerical scheme using dual quadrilateral meshes and a refinement method based on subdivision surfaces. The scheme is applied to the solution of a range of partial differential equations, including both linear and nonlinear, second and fourth order equations, and a time-dependent first order equation.

97 MATHEMATICS AND COMPUTING↗

Simulating magnetized neutron stars with discontinuous Galerkin methods

Discontinuous Galerkin methods are popular because they can achieve high order where the solution is smooth, because they can capture shocks while needing only nearest-neighbor communication, and because they are relatively easy to formulate on complex meshes. We perform a detailed comparison of various limiting strategies presented in the literature applied to the equations of general relativistic magnetohydrodynamics. We compare the standard minmod /ΛΠ N limiter, the hierarchical limiter of Krivodonova, the simple WENO limiter, the HWENO limiter, and a discontinuous Galerkin-finite-difference hybrid method. The ultimate goal is to understand what limiting strategies are able to robustly simulate magnetized Tolman-Oppenheimer-Volkoff stars without any fine-tuning of parameters. Among the limiters explored in the paper, the only limiting strategy we can endorse is a discontinuous Galerkin-finite-difference hybrid method.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Ultrahigh-order Maxwell solver with extreme scalability for electromagnetic PIC simulations of plasmas

The advent of massively parallel supercomputers, with their distributed-memory technology using many processing units, has favored the development of highly-scalable local low-order solvers at the expense of harder-to-scale global very high-order spectral methods. Indeed, FFT-based methods, which were very popular on shared memory computers, have been largely replaced by finite-difference (FD) methods for the solution of many problems, including plasmas simulations with electromagnetic Particle-In-Cell methods. For some problems, such as the modeling of so-called “plasma mirrors” for the generation of high-energy particles and ultra-short radiations, we have shown that the inaccuracies of standard FD-based PIC methods prevent the modeling on present supercomputers at sufficient accuracy. Here, we demonstrate here that a new method, based on the use of local FFTs, enables ultrahigh-order accuracy with unprecedented scalability, and thus for the first time the accurate modeling of plasma mirrors in 3D.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

Application of linear prolongation to coarse mesh finite difference acceleration in CASMO5

The Coarse-Mesh Finite Difference (CMFD) method has been used for over a decade to accelerate the convergence of the Method of Characteristics (MOC) solution to the two- dimensional particle transport equation in CASMO5. Numerical testing, along with widespread use in production-level calculations, have shown that the current CMFD implementation provides stability and robustness for a wide range of realistic reactor physics problems. However, the recent development of linear prolongation has attracted attention from the community as a way to further improve the performance and stability of CMFD. Two interpolation methods for linear prolongation are presented in this work and implemented into a test version of CASMO5. The performance of the proposed interpolations, referred to as the bilinear and linear directional schemes, is evaluated in terms of runtime relative to the default constant or uniform scaling update. Numerical results indicate that the use of linear prolongation can reduce the transport solver runtime on average by approximately 10% when tested with two hundred randomly selected cases. The new directional linear interpolation, combined with default constant boundary updates, is found to provide the highest reduction in runtime for the cases analyzed. (authors)

22 GENERAL STUDIES OF NUCLEAR REACTORS↗

Conjugacy Analysis of the Finite-Difference Equations of the Method of Characteristics on the Basis of a Linear-Algebraic Formulation

A linear-algebraic form of the equations of the method of characteristics, which is used to approximate the neutron transport equation, is obtained. It is shown on the basis of the obtained linear-algebraic form that the discrete form of the conjugate equation differs from the algebraically discrete problem constructed by linear-algebraic transformations of the discrete form of the normal problem. The reason for the discrepancy lies in the approximation of the volumes of the spatial cells in covering the working region by a network of characteristics. It is shown by means of test calculations that when the network of characteristics is refined the solution of the conjugate transport equation converges to the solution of the algebraically conjugate problem.

97 MATHEMATICS AND COMPUTING↗

Crank–Nicolson WSGI difference scheme with finite element method for multi-dimensional time-fractional wave problem

In this article, a second-order Crank–Nicolson weighted and shifted Grünwald integral (WSGI) time-discrete scheme combined with finite element method is studied for finding the numerical solution of the multi-dimensional time-fractional wave equation. The time-fractional wave equation with Caputo-fractional derivative is transformed into the time-fractional integral equation by integral technique, then the second-order Crank–Nicolson finite element scheme with a time second-order WSGI discrete approximation for fractional integral is formulated. The analysis of stability is made, then a priori error estimate is given by making use of the conversion technique between the WSGI formula and fractional integral. At the end of the article, some numerical examples covering two two-dimensional cases with rectangular element and triangular element and a three-dimensional case with tetrahedral element are shown to test and verify our theoretical results.

97 MATHEMATICS AND COMPUTING↗

MPACT Software Management Plan (V.4.3)

The MPACT code solves a discretized form of the Boltzmann transport equation on a wide variety of geometries and is distributed with a multigroup neutron cross section library. MPACT provides an advanced geometrically resolved neutral-particle transport capability to solve the flux distribution throughout the entire problem geometry, and it can model the isotopic depletion, decay, and activation of materials. The flux solution in MPACT is provided using a 2D/1D synthesis method within the framework of the 3D coarse mesh finite difference (CMFD) method for which axial and radial correction factors are obtained from 2D method of characteristics (MOC) and 1D nodal expansion method (NEM), PN, or SN. Other key characteristics of the MPACT code include the subgroup method and the embedded self-shielding method (ESSM) for resonance treatment, depletion capability based on the ORIGEN exponential matrix method, and a simplified thermal-hydraulics method for temperature/fluid feedback. The sole purpose of the simplified feedback model is to provide a mechanism for testing during code development and to provide a limited capability for educational applications. Work performed at the code level supports the VERA-QA-001, quality assurance program plan (QAPP) and VERA-QA-002, VERA Software Quality Assurance Plan.

97 MATHEMATICS AND COMPUTING↗

L{sup ∞} error bound of conservative compact difference scheme for the generalized symmetric regularized long-wave (GSRLW) equations

In this paper, we design a compact finite difference scheme which preserves the original conservative properties to solve the generalized symmetric regularized long-wave equations. The existence of the difference solution is proved by the Brouwer fixed-point theorem. Applying the discrete energy method, the convergence and stability of the difference scheme is obtained, and its numerical convergence order is O(τ{sup 2}+h{sup 4}) in the L{sup ∞}-norm for u and ρ. For computing the nonlinear algebraic system generated by the compact scheme, a decoupled iterative algorithm is constructed and proved to be convergent. Numerical experiment results show that the theory is accurate and the method is efficient and reliable.

97 MATHEMATICS AND COMPUTING↗

Hexagonal Geometries in MPACT

The MPACT code is a high-fidelity light-water reactor analysis code using whole-core pin-resolved neutron transport calculations on modern parallel-computing hardware. MPACT uses the 2D/1D method to solve 3D neutron transport problems by decomposing the problem into a stack of 2D slices, each of which is solved independently using the method of characteristics (MOC). The slices are then coupled axially using the P3 nodal expansion method (NEM-P3) for the 1D axial calculations. MPACT also employs the coarse mesh finite difference (CMFD) method to accelerate calculations. This manuscript details work supporting advanced reactor designs using hexagonal pins and hexagonal assemblies such as the VVER-1000. If performed correctly, MOC is geometry agnostic. However, MPACT previously had optimizations in place for Cartesian geometries, specifically in the modularization and current calculations. Sections 2 and 3 detail the changes made to MPACT to support MOC and CMFD calculations on hexagonal geometries. Section 4 reports results demonstrating solution consistency for problems run with and without CMFD acceleration, results demonstrating solution consistency when run in serial and parallel, and pincell results using the Monte Carlo code, McCard’s benchmark results.

22 GENERAL STUDIES OF NUCLEAR REACTORS↗

Too big, too small, or just right? A benchmark assessment of density functional theory for predicting the spatial extent of the electron density of small chemical systems

Multipole moments are the first-order responses of the energy to spatial derivatives of the electric field strength. The quality of density functional theory prediction of molecular multipole moments thus characterizes errors in modeling the electron density itself, as well as the performance in describing molecules interacting with external electric fields. However, only the lowest non-zero moment is translationally invariant, making the higher-order moments origin-dependent. Therefore, instead of using the 3 × 3 quadrupole moment matrix, we utilize the translationally invariant 3 × 3 matrix of second cumulants (or spatial variances) of the electron density as the quantity of interest (denoted by K). The principal components of K are the square of the spatial extent of the electron density along each axis. A benchmark dataset of the principal components of K for 100 small molecules at the coupled cluster singles and doubles with perturbative triples at the complete basis set limit is developed, resulting in 213 independent K components. The performance of 47 popular and recent density functionals is assessed against this Var213 dataset. Several functionals, especially double hybrids, and also SCAN and SCAN0 predict reliable second cumulants, although some modern, empirically parameterized functionals yield more disappointing performance. The H, Li, and Be atoms, in particular, are challenging for nearly all methods, indicating that future functional development could benefit from the inclusion of their density information in training or testing protocols.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Approximating and incorporating model uncertainty in an inversion for seismic source functions: Preliminary results

We present preliminary work on propagating model uncertainty into the estimation of the time domain source time functions of the seismic source. Our method is based on an estimated model covariance function, which we estimate from the data. The model covariance function is then used to construct a suite of surrogate Greens functions which we use in a Monte Carlo type inversion scheme. The result is a probability density function of the six independent source time functions, each of which corresponds to an individual component of the seismic moment tensor. We compare the results of our method with those obtained using a computationally expensive finite difference Monte Carlo method and find that our new method produces results that are deficient in low frequencies. The advantage of our new method, which we term the Karhunen-Loeve Monte Carlo (KLMC) method, is that is several orders of magnitude faster than our current method, which uses a finite difference scheme to produce the suite of forward models.

42 ENGINEERING↗

A sweeping positivity-preserving high-order finite difference WENO scheme for Euler equations

We develop a simple, high-order, conservative and robust positivity-preserving sweeping procedure for the density and the nonlinear pressure function in the compressible Euler equations. Using the scaling limiter in Zhang and Shu (J Comput Phys 229:3091–3120, 2010), we obtain a non-trivial extension of the scalar sweeping technique in Liu et al. (J Sci Comput 73:1028–1071, 2017) for the positivity of pressure. The sweeping procedure developed in this paper is a post-processing technique, which can be applied to any concave functions of the conserved variables in hyperbolic conservation law systems. Thus, it has applications beyond the Euler equations. This procedure preserves positivity and conservation of physical quantities without destroying the accuracy of the underlying scheme. The algorithm works for general schemes including finite difference, finite volume and discontinuous Galerkin methods; however, in this paper we focus on finite difference weighted essentially non-oscillatory (WENO) methods. As a result, we provide numerical tests of the fifth-order finite difference WENO scheme to demonstrate the accuracy and robustness of the technique.

Compressible Euler equations↗

Sparsity Applications for Gradient‐Based Optimization of Wind Farms

Optimizing wind farms is essential for designing efficient energy systems, especially as farms grow larger and span multiple sites. However, this optimization becomes increasingly challenging due to the rising computational cost associated with more turbines. Gradient‐based optimization methods scale better than gradient‐free approaches for large problems, but the most computationally expensive component remains the calculation of gradients for the objective function and constraint Jacobians. To address this, we propose leveraging sparsity to accelerate gradient evaluations and reduce the size of the constraint Jacobian. Wind farms naturally exhibit sparsity—many turbines do not influence each other under certain wind directions. However, unlike traditional sparse problems with fixed patterns, wind farm sparsity is dynamic, requiring new strategies to handle changing interactions efficiently. This paper presents a study of sparsity in wind farm optimization and introduces several methods to exploit it. These strategies are tested on multiple farms using the analytic Cumulative Curl model, with gradients computed via automatic differentiation (AD). The same sparsity‐aware techniques are also applicable to finite difference (FD) methods, where they can yield even greater speedups due to the high cost of directional evaluations. Results show that sparse methods achieve up to a 10x speedup with less than ± 5% variance in optimized wake losses compared to traditional methods. These findings suggest that sparsity‐aware optimization not only maintains solution quality but also scales efficiently with farm size, enabling more comprehensive design exploration at reduced computational cost.

17 WIND ENERGY↗

On-the-fly response function generation method for composite coarse mesh

The hybrid stochastic deterministic transport code COMET, based on the incident response expansion theory, is used to model reactor cores with high fidelity and formidable computational speed. COMET models a reactor core using a library of incident flux response expansion coefficients that are pre computed for all the unique lattice cells (e.g., fuel assemblies, reflector blocks, etc.) in the core. In order to further improve its computational efficiency in pre-calculating the response library a new response function generation method is developed to compute the response functions for the composite coarse meshes made of a smaller set of unique lattices on the fly within the COMET's deterministic transport core sweep. The efficiency is achieved by eliminating a number of unique lattices that can be made up from the reduced set of unique meshes on the fly. The numerical process consists of the following steps. First, the boundary condition on composite coarse mesh boundaries is projected onto the expansion basis to compute the incident flux moments on external surfaces of all the basic (reduced set of unique) coarse meshes. Secondly, the deterministic sweeping solver in COMET is used to converge on the outgoing/incoming flux expansion moments crossing interfaces between the basic coarse meshes. Thirdly, the response functions for the composite coarse meshes are constructed as a superposition on the fly. The new response function generation method was tested on 88 composite coarse meshes consisting of CANDU fuel bundles and moderator blocks. It was found that response functions generated by the new method agree very well with those generated by direct Monte Carlo calculations. The average and maximum relative differences in the surface-to-surface response coefficients computed by the two methods are 0.10% and 0.20%, respectively. Similarly, the average and maximum relative differences in the response fission densities are 0.13% and 0.43%, respectively. These discrepancies are within one standard deviation of the stochastic uncertainties. The new method is five times faster than the original direct Monte Carlo method. The size of the response function library for the new method is five times smaller than that for the original method, leading to significantly less requirement for the computer hard drive space and memory. (authors)

21 SPECIFIC NUCLEAR REACTORS AND ASSOCIATED PLANTS↗

Efficient sensitivity analysis of the thermal profile in powder bed fusion of metals using hypercomplex automatic differentiation finite element method

Rapid cyclic temperature fluctuation occurring in powder bed fusion of metals using a laser beam (PBF-LB/M) influences the formation of flaws in printed parts. Consequently, there is a pressing need to enhance the quality of printed parts by developing innovative methodologies that can predict thermal histories and help uncover the intricate relationships between process parameters and thermal profiles. Sensitivity Analysis (SA) emerges as an essential tool for this, offering the potential for process optimization and enhanced quality control. Nonetheless, conventional SA methodologies often incur in excessive computational costs and potential numerical approximation errors. Here, to address this technical challenge, we present a novel method for SA that integrates the HYPercomplex-based Automatic Differentiation (HYPAD) technique with transient thermal simulations conducted via the finite element method (FEM). Leveraging this methodology, we efficiently and accurately perform SA for PBF-LB/M processes in a post-processing step. Compared to traditional methods like Finite Differences (FD), HYPAD-FEM required 96 % less computational time for obtaining sensitivities for 22 process parameters, under a comparative study conducted within the context of the 2018–02 AM benchmark of the National Institute of Standards and Technology. In summary, HYPAD-FEM offers superior efficiency and accuracy in SA over conventional methods, delivering the best sensitivity of a model without the need for step-size selection and problem or parameter-based implementations.

36 MATERIALS SCIENCE↗