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 181 records · Page 10
All sourcesNASA NTRSDOE OSTI
DOE OSTI2022

Error analysis of numerical methods for thick diffusive neutron transport problems on Shishkin mesh

A thin layer will develop at the boundary if the incoming angular flux is anisotropic in thick diffusive neutron transport problems. Solving such singularly perturbed problems, which have non-smooth solutions with singularity near the boundary, is computationally challenging. Standard finite difference schemes on a uniform mesh cannot yield ε-uniform convergence, where ε is a small parameter, while it can be achieved on a suitable piecewise-uniform Shishkin mesh. We present a formal error analysis of the diamond difference (DD) method and step difference (SD) method for solving the S{sub N} neutron transport equation. The analysis can be extended to other finite difference methods. Numerical results are presented to confirm the error estimates and the advantages of the Shishkin mesh. (author)

22 GENERAL STUDIES OF NUCLEAR REACTORS↗
NASA NTRS2004

Discontinuous Spectral Difference Method for Conservation Laws on Unstructured Grids

A new, high-order, conservative, and efficient discontinuous spectral finite difference (SD) method for conservation laws on unstructured grids is developed. The concept of discontinuous and high-order local representations to achieve conservation and high accuracy is utilized in a manner similar to the Discontinuous Galerkin (DG) and the Spectral Volume (SV) methods, but while these methods are based on the integrated forms of the equations, the new method is based on the differential form to attain a simpler formulation and higher efficiency. Conventional unstructured finite-difference and finite-volume methods require data reconstruction based on the least-squares formulation using neighboring point or cell data. Since each unknown employs a different stencil, one must repeat the least-squares inversion for every point or cell at each time step, or to store the inversion coefficients. In a high-order, three-dimensional computation, the former would involve impractically large CPU time, while for the latter the memory requirement becomes prohibitive. In addition, the finite-difference method does not satisfy the integral conservation in general. By contrast, the DG and SV methods employ a local, universal reconstruction of a given order of accuracy in each cell in terms of internally defined conservative unknowns. Since the solution is discontinuous across cell boundaries, a Riemann solver is necessary to evaluate boundary flux terms and maintain conservation. In the DG method, a Galerkin finite-element method is employed to update the nodal unknowns within each cell. This requires the inversion of a mass matrix, and the use of quadratures of twice the order of accuracy of the reconstruction to evaluate the surface integrals and additional volume integrals for nonlinear flux functions. In the SV method, the integral conservation law is used to update volume averages over subcells defined by a geometrically similar partition of each grid cell. As the order of accuracy increases, the partitioning for 3D requires the introduction of a large number of parameters, whose optimization to achieve convergence becomes increasingly more difficult. Also, the number of interior facets required to subdivide non-planar faces, and the additional increase in the number of quadrature points for each facet, increases the computational cost greatly.

Liu, Yen↗
NASA NTRS1990

Dynamical approach study of spurious steady-state numerical solutions of nonlinear differential equations. Part 1: The ODE connection and its implications for algorithm development in computational fluid dynamics

Spurious stable as well as unstable steady state numerical solutions, spurious asymptotic numerical solutions of higher period, and even stable chaotic behavior can occur when finite difference methods are used to solve nonlinear differential equations (DE) numerically. The occurrence of spurious asymptotes is independent of whether the DE possesses a unique steady state or has additional periodic solutions and/or exhibits chaotic phenomena. The form of the nonlinear DEs and the type of numerical schemes are the determining factor. In addition, the occurrence of spurious steady states is not restricted to the time steps that are beyond the linearized stability limit of the scheme. In many instances, it can occur below the linearized stability limit. Therefore, it is essential for practitioners in computational sciences to be knowledgeable about the dynamical behavior of finite difference methods for nonlinear scalar DEs before the actual application of these methods to practical computations. It is also important to change the traditional way of thinking and practices when dealing with genuinely nonlinear problems. In the past, spurious asymptotes were observed in numerical computations but tended to be ignored because they all were assumed to lie beyond the linearized stability limits of the time step parameter delta t. As can be seen from the study, bifurcations to and from spurious asymptotic solutions and transitions to computational instability not only are highly scheme dependent and problem dependent, but also initial data and boundary condition dependent, and not limited to time steps that are beyond the linearized stability limit.

Yee, H. C.↗
NASA NTRS1991

Dynamical approach study of spurious steady-state numerical solutions of nonlinear differential equations. I - The dynamics of time discretization and its implications for algorithm development in computational fluid dynamics

Spurious stable as well as unstable steady state numerical solutions, spurious asymptotic numerical solutions of higher period, and even stable chaotic behavior can occur when finite difference methods are used to solve nonlinear differential equations (DE) numerically. The occurrence of spurious asymptotes is independent of whether the DE possesses a unique steady state or has additional periodic solutions and/or exhibits chaotic phenomena. The form of the nonlinear DEs and the type of numerical schemes are the determining factor. In addition, the occurrence of spurious steady states is not restricted to the time steps that are beyond the linearized stability limit of the scheme. In many instances, it can occur below the linearized stability limit. Therefore, it is essential for practitioners in computational sciences to be knowledgeable about the dynamical behavior of finite difference methods for nonlinear scalar DEs before the actual application of these methods to practical computations. It is also important to change the traditional way of thinking and practices when dealing with genuinely nonlinear problems. In the past, spurious asymptotes were observed in numerical computations but tended to be ignored because they all were assumed to lie beyond the linearized stability limits of the time step parameter delta t. As can be seen from the study, bifurcations to and from spurious asymptotic solutions and transitions to computational instability not only are highly scheme dependent and problem dependent, but also initial data and boundary condition dependent, and not limited to time steps that are beyond the linearized stability limit.

Yee, H. C.↗
NASA NTRS1993

Issac, Jason Cherian ses in transonic flow

Flutter analysis of a two degree of freedom airfoil in compressible flow is performed using a state-space representation of the unsteady aerodynamic behavior. Indicial response functions are used to represent the normal force and moment response of the airfoil. The structural equations of motion of the airfoil with bending and torsional degrees of freedom are coupled to the unsteady air loads and the aeroelastic system so modelled is solved as an eigenvalue problem to determine the stability. The aeroelastic equations are also directly integrated with respect to time and the time-domain results compared with the results from the eigenanalysis. A good agreement is obtained. The derivatives of the flutter speed obtained from the eigenanalysis are calculated with respect to the mass and stiffness parameters by both analytical and finite-difference methods for various transonic Mach numbers. The experience gained from the two degree of freedom model is applied to study the sensitivity of the flutter response of a wing with respect to various shape parameters. The parameters being considered are as follows: (1) aspect ratio; (2) surface area of the wing; (3) taper ratio; and (4) sweep. The wing deflections are represented by Chebyshev polynomials. The compressible aerodynamic state-space model used for the airfoil section is extended to represent the unsteady aerodynamic forces on a generally laminated tapered skewed wing. The aeroelastic equations are solved as an eigenvalue problem to determine the flutter speed of the wing. The derivatives of the flutter speed with respect to the shape parameters are calculated by both analytical and finite difference methods.

Issac, Jason Cherion↗
NASA NTRS1976

The nonlinear transient response of thin, rectangular elastic plates

The results of experiments and theoretical analysis of the nonlinear, transient response of thin, rectangular, elastic, simply supported plates are presented. In the experiments, a plane wave tube with a special pulse generator at one end and a thin glass plate mounted at the other end was used to subject the glass plate to pressure pulses of different magnitudes. Whole-field measurements of the response of the plate were obtained by the reflected moire grid technique. The largest ratio of center deflection to thickness of the plate during the experiments was 5.6. The theoretical response of the glass plate to the pressure pulses was computed by solving the von Karman equations governing large deflections in elastic plates by two methods - (1) the finite-difference method, and (2) Galerkin's method. Good agreement was found between theoretically predicted and experimentally measured response.

Rajagopal, G.↗
DOE OSTI2020

Rupture Dynamics Simulations of Shallow Crustal Earthquakes on Reverse Slip Faults

The main goal of this study was to perform dynamic rupture simulations in order constrain the characterization of kinematic rupture models implemented in techniques for simulating strong ground motion for crustal earthquakes. First, we investigated the rupture process of the 2008 Iwate-Miyagi Nairiku earthquake by developing a dynamic rupture model on a reverse fault using a trial-and-error technique that produced a slip distribution and near-fault ground motion that matched the recorded ones. The simulations were performed in the frequency range 0-2 Hz, using a 3D staggered grid finite-difference method and a linear slip weakening friction law. Constrained by the observed slip distribution and consistent with dynamic rupture models, the derived kinematic rupture model of the Iwate-Miyagi Nairiku earthquake contains areas with relatively large slip rate, representing strong motion generation areas, set against lower amplitude heterogeneous background slip, and a relatively low slip rate in the weak zone of the top-most crust (upper 3km). Second, we performed rupture dynamics modeling to constrain shallow slip characterization in rupture models for strike-slip crustal earthquakes. The objective was to establish general rules about the characterization of slip rate function and slip at shallow depths and in the strong motion generation areas (SMGAs). The simulations of spontaneous rupture were performed in the frequency range 0-2.0Hz, using a 3D staggered-grid finite-difference method and a layer over half-space 1D crustal velocity model with a minimum shear-wave velocity of 2.8 km/s. In order to account for changes in material ductility and reduction of stress drop, observed in the shallow crust (upper 3-5 km), and the transition from ductile state to brittle state in the upper seismogenic zone, in our stress models we included a shallow weak zone (<4km). In this zone the stress drop was set to zero at the free surface and gradually increased with depth, while the slip weakening distance was set to 75 cm at the free surface and decreased to 50 cm at the base of the weak zone. As in the case of reverse faulting during the Iwate-Miyagi Nairiku earthquake, from these computations we found a systematic change in the shape of the slip-rate function, from Kostrov-type in the deeper part of the fault to a more symmetric cosine-type in the upper few kilometers, near the free-surface. Moreover, the average slip duration in the weak zone, with respect to slip duration in the deeper parts of the fault, increases by at most a factor of 1.5. We found a systematic and gradual change in the shape of the slip-rate function from Kostrov-type in the asperity areas (SMGAs), to more symmetric cosine-type in the upper few km near the free-surface, on the long period motion generation area (LMGA). The effective rise time in the LMGA, with respect to that in the SMGAs, increases by at most a factor of 2. Effective rise time is the time difference between the time at which the slip rate drops to a level that is equal to 25% of its peak and the onset time of the signal. In addition, the slip in the LMGA located above the SMGAs is almost the same as the one in the SMGAs, and about 1.5 times larger than the average slip.

58 GEOSCIENCES↗
DOE OSTI2017

An energy-conserving method for stochastic Maxwell equations with multiplicative noise

In this paper, it is shown that three-dimensional stochastic Maxwell equations with multiplicative noise are stochastic Hamiltonian partial differential equations possessing a geometric structure (i.e. stochastic multi-symplectic conservation law), and the energy of system is a conservative quantity almost surely. We propose a stochastic multi-symplectic energy-conserving method for the equations by using the wavelet collocation method in space and stochastic symplectic method in time. Numerical experiments are performed to verify the excellent abilities of the proposed method in providing accurate solution and preserving energy. The mean square convergence result of the method in temporal direction is tested numerically, and numerical comparisons with finite difference method are also investigated.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
NASA NTRS1973

Supersonic turbulent boundary-layer flows with tangential slot injection.

An implicit finite-difference method has been developed for the solution of the compressible boundary-layer equations. This method is applied to tangential slot injection into supersonic turbulent boundary-layer flows. In addition, the effects induced by the interaction between the boundary-layer displacement thickness and the external pressure field are considered. Three different eddy viscosity models have been used to specify the turbulent momentum exchange. One model depends on the species concentration profile, and the species conservation equation has been included in the system of governing partial differential equations. For air injected into air, the freestream and injected gases are treated as separate species which have common fluid properties. Calculations were made and results were compared with experimental data at freestream Mach numbers of 2.4 and 6.0 and with results of another finite-difference method. Good agreement was obtained for the reduction of wall skin friction with slot injection.

Miner, E. W.↗
DOE OSTI2017

PLATO (Parallel Load Assignment Tool): A Parallel Workload Partitioner for Particle-based Methods

A key first step in many large-scale high-performance scientific computing applications is the distribution of the computational domain across all participating processors of a parallel computing platform such as a shared memory machine, cluster or a tightly-coupled supercomputer. The primary goal of such a partitioning step is to ensure that the computational work performed by each process remains load-balanced throughout the execution of the parallel application. In this project, a general-purpose parallel partitioning tool, code-named PLATO, was designed and implemented. PLATO assumes that the workload is a set of points in an n-dimensional metric space. These points are abstractions of computational units that may represent point-like computational units such as celestial objects in astrophysics, atoms in materials sciences and molecules in biology/chemistry, or may represent more abstract computational units such as grid points in finite difference methods, grid elements in finite element methods or n-dimensional points in the feature space of a host of other applications. PLATO supports several key and useful capabilities, namely: (a) multiple load partitioning strategies, (b) support for arbitrary user-defined processor topology, (c) pre-fetching data from neighboring processors based on user-defined parameters, and (d) support for arbitrary number and types of attributes associated with each point in the computational domain. PLATO is implemented in the C programming language using Message Passing Interface (MPI) for inter-processor communications and its parallel performance tested on up to 48 processors of a shared memory machine. This report includes a detailed performance study of PLATO using parallel speedup and iso-efficiency as the two main metrics of parallel performance. In addition, a user manual and DOXYGEN generated code documentation have been included for completeness.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2022

Spatial resolution of different discretizations over long-time for the Dirac equation with small potentials

In this report we compare the long-time error bounds and spatial resolution of finite difference methods with different spatial discretizations for the Dirac equation with small electromagnetic potentials characterized by $\varepsilon \in (0, 1]$ a dimensionless parameter. We begin with the simple and widely used finite difference time domain (FDTD) methods, and establish rigorous error bounds of them, which are valid up to the time at $O(1/\varepsilon)$. In the error estimates, we pay particular attention to how the errors depend explicitly on the mesh size $h$ and time step $\tau$ as well as the small parameter $\varepsilon$. Based on the results, in order to obtain "correct" numerical solutions up to the time at $O(1/\varepsilon)$, the $\varepsilon$-scalability (or meshing strategy requirement) of the FDTD methods should be taken as $h = O(\varepsilon^{1/2})$ and $\tau = O(\varepsilon^{1/2})$. To improve the spatial resolution capacity, we apply the Fourier spectral method to discretize the Dirac equation in space. Error bounds of the resulting finite difference Fourier pseudospectral (FDFP) methods show that they exhibit uniform spatial errors in the long-time regime, which are optimal in space as suggested by the Shannon's sampling theorem. Extensive numerical results are reported to confirm the error bounds and demonstrate that they are sharp.

79 ASTRONOMY AND ASTROPHYSICS↗
DOE OSTI2020

Quantum Spectral Methods for Differential Equations

Recently developed quantum algorithms address computational challenges in numerical analysis by performing linear algebra in Hilbert space. Such algorithms can produce a quantum state proportional to the solution of a d-dimensional system of linear equations or linear differential equations with complexity poly(logd). While several of these algorithms approximate the solution to within ϵ with complexity poly(log(1/ϵ)), no such algorithm was previously known for differential equations with time-dependent coefficients. In this work, we develop a quantum algorithm for linear ordinary differential equations based on so-called spectral methods, an alternative to finite difference methods that approximates the solution globally. Using this approach, we give a quantum algorithm for time-dependent initial and boundary value problems with complexity poly(logd, log(1/ϵ)).

97 MATHEMATICS AND COMPUTING↗
NASA NTRS1988

On the application of pseudo-spectral FFT technique to non-periodic problems

The reduction-to-periodicity method using the pseudo-spectral Fast Fourier Transform (FFT) technique is applied to the solution of nonperiodic problems including the two-dimensional Navier-Stokes equations. The accuracy of the method is demonstrated by calculating derivatives of given functions, one- and two-dimensional convective-diffusive problems, and by comparing the relative errors due to the FFT method with seocnd order Finite Difference Methods (FDM). Finally, the two-dimensional Navier-Stokes equations are solved by a fractional step procedure using both the FFT and the FDM methods for the driven cavity flow and the backward facing step problems. Comparisons of these solutions provide a realistic assessment of the FFT method indicating its range of applicability.

Biringen, S.↗
NASA NTRS1989

A zonal approach to V/STOL vehicle aerodynamics

A zonal method based on an iterative coupling between an inviscid panel method and two viscous finite difference methods is applied to solve for the region of jets issued from generic V/STOL models in order to assess the influence of the jet upon V/STOL configurations. The low-order panel method, VSAERO, is used to solve for the entire flow region, which includes the V/STOL model and jet boundary. ARC3D, a well known compressible, thin layer Navier-Stokes (NS) code developed at NASA-Ames, and APPL, a parabolized NS code, are used to solve for the jet region subject to the boundary condition provided by the VSAERO calculation. Overlapping boundaries are used for the purpose of coupling. Results are presented with the available experimental data for the jet and V/STOL configurations.

Yoo, Sungyul↗
NASA NTRS1993

On the Daubechies-based wavelet differentiation matrix

The differentiation matrix for a Daubechies-based wavelet basis is constructed and superconvergence is proven. That is, it will be proven that under the assumption of periodic boundary conditions that the differentiation matrix is accurate of order 2M, even though the approximation subspace can represent exactly only polynomials up to degree M-1, where M is the number of vanishing moments of the associated wavelet. It is illustrated that Daubechies-based wavelet methods are equivalent to finite difference methods with grid refinement in regions of the domain where small-scale structure is present.

Jameson, Leland↗
NASA NTRS1993

On the dynamics of approximating schemes for dissipative nonlinear equations

Since one can rarely write down the analytical solutions to nonlinear dissipative partial differential equations (PDE's), it is important to understand whether, and in what sense, the behavior of approximating schemes to these equations reflects the true dynamics of the original equations. Further, because standard error estimates between approximations of the true solutions coming from spectral methods - finite difference or finite element schemes, for example - and the exact solutions grow exponentially in time, this analysis provides little value in understanding the infinite time behavior of a given approximating scheme. The notion of the global attractor has been useful in quantifying the infinite time behavior of dissipative PDEs, such as the Navier-Stokes equations. Loosely speaking, the global attractor is all that remains of a sufficiently large bounded set in phase space mapped infinitely forward in time under the evolution of the PDE. Though the attractor has been shown to have some nice properties - it is compact, connected, and finite dimensional, for example - it is in general quite complicated. Nevertheless, the global attractor gives a way to understand how the infinite time behavior of approximating schemes such as the ones coming from a finite difference, finite element, or spectral method relates to that of the original PDE. Indeed, one can often show that such approximations also have a global attractor. We therefore only need to understand how the structure of the attractor for the PDE behaves under approximation. This is by no means a trivial task. Several interesting results have been obtained in this direction. However, we will not go into the details. We mention here that approximations generally lose information about the system no matter how accurate they are. There are examples that show certain parts of the attractor may be lost by arbitrary small perturbations of the original equations.

Jones, Donald A.↗