Search NASA⌕ Search

SEARCH · Search NASA

Results for “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 1,603 records · Page 89

Direct discontinuous Galerkin method and its variations for second order elliptic equations

In this study, we study direct discontinuous Galerkin method (Liu and Yan in SIAM J Numer Anal 47(1):475–698, 2009) and its variations (Liu and Yan in Commun Comput Phys 8(3):541–564, 2010; Vidden and Yan in J Comput Math 31(6):638–662, 2013; Yan in J Sci Comput 54(2–3):663–683, 2013) for 2nd order elliptic problems. A priori error estimate under energy norm is established for all four methods. Optimal error estimate under L 2 norm is obtained for DDG method with interface correction (Liu and Yan in Commun Comput Phys 8(3):541–564, 2010) and symmetric DDG method (Vidden and Yan in J Comput Math 31(6):638–662, 2013). A series of numerical examples are carried out to illustrate the accuracy and capability of the schemes. Numerically we obtain optimal (k+1)th order convergence for DDG method with interface correction and symmetric DDG method on nonuniform and unstructured triangular meshes. An interface problem with discontinuous diffusion coefficients is investigated and optimal (k+1)th order accuracy is obtained. Peak solutions with sharp transitions are captured well. Highly oscillatory wave solutions of Helmholz equation are well resolved.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Analysis and Entropy Stability of the Line-Based Discontinuous Galerkin Method

We develop a discretely entropy-stable line-based discontinuous Galerkin method for hyperbolic conservation laws based on a flux differencing technique. By using standard entropy-stable and entropy-conservative numerical flux functions, this method guarantees that the discrete integral of the entropy is non-increasing. This nonlinear entropy stability property is important for the robustness of the method, in particular when applied to problems with discontinuous solutions or when the mesh is under-resolved. This line-based method is significantly less computationally expensive than a standard DG method. Numerical results are shown demonstrating the effectiveness of the method on a variety of test cases, including Burgers’ equation and the Euler equations, in one, two, and three spatial dimensions.

97 MATHEMATICS AND COMPUTING↗

Implicit Multirate GARK Methods

This article considers multirate generalized-structure additively partitioned Runge–Kutta methods for solving stiff systems of ordinary differential equations with multiple time scales. These methods treat different partitions of the system with different timesteps for a more targeted and efficient solution compared to monolithic single rate approaches. With implicit methods used across all partitions, methods must find a balance between stability and the cost of solving nonlinear equations for the stages. In order to characterize this important trade-off, we explore multirate coupling strategies, problems for assessing linear stability, and techniques to efficiently implement Newton iterations for stage equations. Unlike much of the existing multirate stability analysis which is limited in scope to particular methods, we present general statements on stability and describe fundamental limitations for certain types of multirate schemes. New implicit multirate methods up to fourth order are derived, and their accuracy and efficiency properties are verified with numerical tests.

97 MATHEMATICS AND COMPUTING↗

GSTS-Uzawa method for a class of complex singular saddle point problems

In this paper, we propose GSTS–Uzawa method for solving a class of complex singular saddle point problems based on generalized skew-Hermitian triangular splitting (GSTS) iteration method and classical Uzawa method. We research on its semi-convergence properties and the eigenvalues distributions of its preconditioned matrix. The resulting GSTS–Uzawa preconditioner is used to precondition Krylov subspace methods such as the restarted generalized minimal residual (GMRES) method for solving the equivalent formulation of the complex singular saddle point problems. The theoretical results and effectiveness of the GSTS–Uzawa method are supported by a numerical example.

97 MATHEMATICS AND COMPUTING↗

Numerical implementation, verification and validation of two-phase flow four-equation drift flux model with Jacobian-free Newton–Krylov method

This study presents a numerical investigation on using the Jacobian-free Newton–Krylov (JFNK) method to solve the two-phase flow four-equation drift flux model with realistic constitutive correlations (‘closure models’). The drift flux model is based on Isshi and his collaborators’ work. Additional constitutive correlations for vertical channel flow, such as two-phase flow pressure drop, flow regime map, wall boiling and interfacial heat transfer models, were taken from the RELAP5-3D Code Manual and included to complete the model. The staggered grid finite volume method and fully implicit backward Euler method was used for the spatial discretization and time integration schemes, respectively. The Jacobian-free Newton–Krylov method shows no difficulty in solving the two-phase flow drift flux model with a discrete flow regime map. In addition to the Jacobian-free approach, the preconditioning matrix is obtained by using the default finite differencing method provided in the PETSc package, and consequently the labor-intensive implementation of complex analytical Jacobian matrix is avoided. Extensive and successful numerical verification and validation have been performed to prove the correct implementation of the models and methods. Code-to-code comparison with RELAP5-3D has further demonstrated the successful implementation of the drift flux model.

42 ENGINEERING↗

The W4 method: A new multi-dimensional root-finding scheme for nonlinear systems of equations

We propose a new class of method for solving nonlinear systems of equations, which, among other things, has four nice features: (i) it is inspired by the mathematical property of damped oscillators, (ii) it can be regarded as a simple extension to the Newton-Raphson (NR) method, (iii) it has the same local convergence as the NR method does, (iv) it has a significantly wider convergence region or the global convergence than that of the NR method. In this article, we present the evidence of these properties, applying our new method to some examples and comparing it with the NR method.

97 MATHEMATICS AND COMPUTING↗

Efficient shallow Ritz method for 1D diffusion problems

This paper studies the shallow Ritz method for solving the one-dimensional diffusion problem. It is shown that the shallow Ritz method improves the order of approximation dramatically for non-smooth problems. To realize this optimal or nearly optimal order of the shallow Ritz approximation, we develop a damped block Newton (dBN) method that alternates between updates of the linear and non-linear parameters. Per each iteration, the linear and the non-linear parameters are updated by exact inversion and one step of a modified, damped Newton method applied to a reduced non-linear system, respectively. The computational cost of each dBN iteration is $\mathcal{O}$(n). Starting with the non-linear parameters as a uniform partition of the interval, numerical experiments show that the dBN is capable of efficiently moving mesh points to nearly optimal locations. In conclusion, to improve the efficiency of the dBN further, we propose an adaptive damped block Newton (AdBN) method by combining the dBN with the adaptive neuron enhancement (ANE) method [28].

Diffusion problems↗

Reduction of very large reaction mechanisms using methods based on simulation error minimization

A new species reduction method called the Simulation Error Minimization Connectivity Method (SEM-CM) was developed. According to the SEM-CM algorithm, a mechanism building procedure is started from the important species. Strongly connected sets of species, identified on the basis of the normalized Jacobian, are added and several consistent mechanisms are produced. The combustion model is simulated with each of these mechanisms and the mechanism causing the smallest error (i.e. deviation from the model that uses the full mechanism), considering the important species only, is selected. Then, in several steps other strongly connected sets of species are added, the size of the mechanism is gradually increased and the procedure is terminated when the error becomes smaller than the required threshold. A new method for the elimination of redundant reactions is also presented, which is called the Principal Component Analysis of Matrix F with Simulation Error Minimization (SEM-PCAF). According to this method, several reduced mechanisms are produced by using various PCAF thresholds. The reduced mechanism having the least CPU time requirement among the ones having almost the smallest error is selected. Application of SEM-CM and SEM-PCAF together provides a very efficient way to eliminate redundant species and reactions from large mechanisms. The suggested approach was tested on a mechanism containing 6874 irreversible reactions of 345 species that describes methane partial oxidation to high conversion. The aim is to accurately reproduce the concentration-time profiles of 12 major species with less than 5% error at the conditions of an industrial application. The reduced mechanism consists of 246 reactions of 47 species and its simulation is 116 times faster than using the full mechanism. The SEM-CM was found to be more effective than the classic Connectivity Method, and also than the DRG, two-stage DRG, DRGASA, basic DRGEP and extended DRGEP methods. (author)

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

A reconstructed discontinuous Galerkin method for the compressible Navier-Stokes equations on three-dimensional hybrid grids

A reconstructed discontinuous Galerkin (rDG(P1P2)) method, originally introduced for the compressible Euler equations, is developed for the solution of the compressible Navier–Stokes equations on 3D hybrid grids. In this method, a piecewise quadratic polynomial solution is obtained from the underlying piecewise linear DG solution using a hierarchical Weighted Essentially Non-Oscillatory (WENO) reconstruction. The reconstructed quadratic polynomial solution is then used for the computation of the inviscid fluxes and the viscous fluxes using the second formulation of Bassi and Reay (Bassi–Rebay II). The developed rDG(P 1 P 2 ) method is used to compute a variety of flow problems to assess its accuracy, efficiency, and robustness. Additionally, the numerical results demonstrate that the rDG(P 1 P 2 ) method is able to achieve the designed third-order of accuracy at a cost slightly higher than its underlying second-order DG method, outperform the third order DG method in terms of both computing costs and storage requirements, and obtain reliable and accurate solutions to the direct numerical simulation (DNS) of compressible turbulent flows.

42 ENGINEERING↗

A new high-order spectral difference method for simulating viscous flows on unstructured grids with mixed-element meshes

In the present study, a spectral difference (SD) method is developed for viscous flows on meshes with a mixture of triangular and quadrilateral elements. The standard SD method for triangular elements, which employs Lagrangian interpolating functions for fluxes, is not stable when the designed accuracy of spatial discretization is third order or higher. Unlike the standard SD method, the method examined here uses vector interpolating functions in the Raviart-Thomas (RT) spaces to construct continuous flux functions on reference elements. The spectral-difference Raviart-Thomas (SDRT) method was originally proposed by Balan et al. and implemented on triangular-element meshes for invisid flow only. Our present results demonstrated that the SDRT method is stable and high-order accurate in two dimensions (2D) for a number of test problems by using triangular-, quadrilateral-, and mixed-element meshes for both inviscid and viscous flows. A stability analysis is also performed for mixed elements. Furthermore, we found our current SDRT scheme is stable for fourth-order accurate spatial discretizations. However, a stable fifth-order SDRT scheme remains to be identified.

97 MATHEMATICS AND COMPUTING↗

Enhancing photoionization rate calculations in low-temperature plasmas using spectral methods

Photoionization plays a central role in the development of streamer discharges and other non-equilibrium plasma phenomena. It creates seed electrons, which are essential for positive streamer propagation, allowing the ionization front to move forward. Because of this, accurate modeling of photoionization is very important for predicting streamer behavior and plasma evolution. The photoionization process in air (N 2 – O 2 mixture) is often described by the Zheleznyak model (1982). This model is usually solved through Helmholtz-type equations that approximate the Zheleznyak photoionization model (Zheleznyak et al. 1982) as Partial Differential Equations (PDEs). Conventional numerical methods, such as the Finite Difference Method (FDM) or Finite Volume Method (FVM), are widely used to solve these equations. Although they are prevalent, the computational cost of these methods due to their need for matrix operations and iterative solver is demanding. To address this challenge, this work develops a spectral solver based on the Fast Fourier Transform (FFT) combined with Discrete Cosine Transform (DCT) and Discrete Sine Transform (DST) to calculate the photoionization rate efficiently in an axisymmetric cylindrical domain. This method naturally satisfies the boundary conditions used in the model and converts the PDE into algebraic ones in spectral space. Thus, avoids the need for iterative matrix solvers. When compared with FDM results, it is demonstrated that the new solver not only maintains accuracy, but also reduces the computational cost, showing a performance increase of approximately 100 compared to FDM over a wide range of problem sizes. The method is parallelized using Message Passing Interface (MPI) and has been integrated into a fluid plasma model for streamer simulation. Here, this FFT-based approach provides a fast and reliable alternative for calculating photoionization in fluid models, helping large-scale plasma simulations run faster and efficiently, and allows higher-resolution simulation without extra computational cost.

Axisymmetric system↗

Large-eddy simulation of non-vaporizing sprays using the spectral-element method

Predictive simulations of high-pressure sprays require accurate representation of the turbulent gaseous flow field generated by liquid jet. Typically, the accuracy that can be obtained with low-order numerical methods (e.g. finite volume, finite element) is limited by stability issues in fine grids and the order of convergence of the method. In this work, we resolve the turbulent flow field in an Eulerian manner using the high-order spectral element method, coupled with a Lagrangian parcels approach to model the atomizing liquid jet. Large eddy simulations of single-hole sprays under non-evaporative conditions were conducted and compared against experimental data from Margot et al. (2008) and Spray A data from the Engine Combustion Network. The sensitivity of liquid penetration and droplet sizes to different breakup model parameters was studied. The effect of different numerical parameters, such as polynomial order of the solution (grid resolution), on liquid penetration was also analyzed. The method achieved grid-independent results using p-refinement, achieving finer resolution (by a factor of x 1.7 - x 3.5) in the gas-phase solution than in state-of-the-art simulations using the finite-volume method. Here the results showed good agreement with experimental data, demonstrating the ability of the current method to accurately capture liquid penetration and the shape of the spray.

97 MATHEMATICS AND COMPUTING↗

MRI-Based Computed Tomography Metal Artifact Correction Method for Improving Proton Range Calculation Accuracy

Purpose: Computed tomography (CT) artifacts can severely degrade dose calculation accuracy in proton therapy. Prompted by the recently increased popularity of magnetic resonance imaging (MRI) in the radiation therapy clinic, we developed an MRI-based CT artifact correction method for improving the accuracy of proton range calculations. Methods and Materials: The proposed method replaces corrupted CT data by mapping CT Hounsfield units (HU number) from a nearby artifact-free slice, using a coregistered MRI. MRI and CT volumetric images were registered with use of 3-dimensional (3D) deformable image registration (DIR). The registration was fine-tuned on a slice-by-slice basis by using 2D DIR. Based on the intensity of paired MRI pixel values and HU from an artifact-free slice, we performed a comprehensive analysis to predict the correct HU for the corrupted region. For a proof-of-concept validation, metal artifacts were simulated on a reference data set. Proton range was calculated using reference, artifactual, and corrected images to quantify the reduction in proton range error. The correction method was applied to 4 unique clinical cases. Results: The correction method resulted in substantial artifact reduction, both quantitatively and qualitatively. On respective simulated brain and head and neck CT images, the mean error was reduced from 495 and 370 HU to 108 and 92 HU after correction. Correspondingly, the absolute mean proton range errors of 2.4 cm and 1.7 cm were reduced to less than 2 mm in both cases. Conclusions: Our MRI-based CT artifact correction method can improve CT image quality and proton range calculation accuracy for patients with severe CT artifacts.

62 RADIOLOGY AND NUCLEAR MEDICINE↗

The multi-element probabilistic collocation method (ME-PCM): Error analysis and applications

Stochastic spectral methods are numerical techniques for approximating solutions to partial differential equations with random parameters. In this work, we present and examine the multi-element probabilistic collocation method (ME-PCM), which is a generalized form of the probabilistic collocation method. In the ME-PCM, the parametric space is discretized and a collocation/cubature grid is prescribed on each element. Both full and sparse tensor product grids based on Gauss and Clenshaw-Curtis quadrature rules are considered. We prove analytically and observe in numerical tests that as the parameter space mesh is refined, the convergence rate of the solution depends on the quadrature rule of each element only through its degree of exactness. In addition, the L{sup 2} error of the tensor product interpolant is examined and an adaptivity algorithm is provided. Numerical examples demonstrating adaptive ME-PCM are shown, including low-regularity problems and long-time integration. We test the ME-PCM on two-dimensional Navier-Stokes examples and a stochastic diffusion problem with various random input distributions and up to 50 dimensions. While the convergence rate of ME-PCM deteriorates in 50 dimensions, the error in the mean and variance is two orders of magnitude lower than the error obtained with the Monte Carlo method using only a small number of samples (e.g., 100). The computational cost of ME-PCM is found to be favorable when compared to the cost of other methods including stochastic Galerkin, Monte Carlo and quasi-random sequence methods.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

A high-order WENO-Z finite difference based particle-source-in-cell method for computation of particle-laden flows with shocks

A high-order particle-source-in-cell (PSIC) algorithm is presented for the computation of the interaction between shocks, small scale structures, and liquid and/or solid particles in high-speed engineering applications. The improved high-order finite difference weighted essentially non-oscillatory (WENO-Z) method for solution of the hyperbolic conservation laws that govern the shocked carrier gas flow, lies at the heart of the algorithm. Finite sized particles are modeled as points and are traced in the Lagrangian frame. The physical coupling of particles in the Lagrangian frame and the gas in the Eulerian frame through momentum and energy exchange, is numerically treated through high-order interpolation and weighing. The centered high-order interpolation of the fluid properties to the particle location is shown to lead to numerical instability in shocked flow. An essentially non-oscillatory interpolation (ENO) scheme is devised for the coupling that improves stability. The ENO based algorithm is shown to be numerically stable and to accurately capture shocks, small flow features and particle dispersion. Both the carrier gas and the particles are updated in time without splitting with a third-order Runge-Kutta TVD method. One and two-dimensional computations of a shock moving into a particle cloud demonstrates the characteristics of the WENO-Z based PSIC method (PSIC/WENO-Z). The PSIC/WENO-Z computations are not only in excellent agreement with the numerical simulations with a third-order Rusanov based PSIC and physical experiments in [V. Boiko, V.P. Kiselev, S.P. Kiselev, A. Papyrin, S. Poplavsky, V. Fomin, Shock wave interaction with a cloud of particles, Shock Waves, 7 (1997) 275-285], but also show a significant improvement in the resolution of small scale structures. In two-dimensional simulations of the Mach 3 shock moving into forty thousand bronze particles arranged in the shape of a rectangle, the long time accuracy of the high-order method is demonstrated. The fifth-order PSIC/WENO-Z method with the fifth-order ENO interpolation scheme improves the small scale structure resolution over the third-order PSIC/WENO-Z method with a second-order central interpolation scheme. Preliminary analysis of the particle interaction with the flow structures shows that sharp particle material arms form on the side of the rectangular shape. The arms initially shield the particles from the accelerated flow behind the shock. A reflected compression wave, however, reshocks the particle arm from the shielded area and mixes the particles.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

A modified implicit Monte Carlo method for time-dependent radiative transfer with adaptive material coupling

In this paper we develop a robust implicit Monte Carlo (IMC) algorithm based on more accurately updating the linearized equilibrium radiation energy density. The method does not introduce oscillations in the solution and has the same limit as {delta}t{yields}{infinity} as the standard Fleck and Cummings IMC method. Moreover, the approach we introduce can be trivially added to current implementations of IMC by changing the definition of the Fleck factor. Using this new method we develop an adaptive scheme that uses either standard IMC or the modified method basing the adaptation on a zero-dimensional problem solved in each cell. Numerical results demonstrate that the new method can avoid the nonphysical overheating that occurs in standard IMC when the time step is large. The method also leads to decreased noise in the material temperature at the cost of a potential increase in the radiation temperature noise.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

A method for solving stochastic equations by reduced order models and local approximations

A method is proposed for solving equations with random entries, referred to as stochastic equations (SEs). The method is based on two recent developments. The first approximates the response surface giving the solution of a stochastic equation as a function of its random parameters by a finite set of hyperplanes tangent to it at expansion points selected by geometrical arguments. The second approximates the vector of random parameters in the definition of a stochastic equation by a simple random vector, referred to as stochastic reduced order model (SROM), and uses it to construct a SROM for the solution of this equation. The proposed method is a direct extension of these two methods. It uses SROMs to select expansion points, rather than selecting these points by geometrical considerations, and represents the solution by linear and/or higher order local approximations. The implementation and the performance of the method are illustrated by numerical examples involving random eigenvalue problems and stochastic algebraic/differential equations. The method is conceptually simple, non-intrusive, efficient relative to classical Monte Carlo simulation, accurate, and guaranteed to converge to the exact solution.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Stabilized multilevel Monte Carlo method for stiff stochastic differential equations

A multilevel Monte Carlo (MLMC) method for mean square stable stochastic differential equations with multiple scales is proposed. For such problems, that we call stiff, the performance of MLMC methods based on classical explicit methods deteriorates because of the time step restriction to resolve the fastest scales that prevents to exploit all the levels of the MLMC approach. We show that by switching to explicit stabilized stochastic methods and balancing the stabilization procedure simultaneously with the hierarchical sampling strategy of MLMC methods, the computational cost for stiff systems is significantly reduced, while keeping the computational algorithm fully explicit and easy to implement. Numerical experiments on linear and nonlinear stochastic differential equations and on a stochastic partial differential equation illustrate the performance of the stabilized MLMC method and corroborate our theoretical findings.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗