Search NASA⌕ Search

SEARCH · Search NASA

Results for “Grid singularity”

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 55 records · Page 3

Barriers to Achieving Textbook Multigrid Efficiency (TME) in CFD

As a guide to attaining this optimal performance for general CFD problems, the table below lists every foreseen kind of computational difficulty for achieving that goal, together with the possible ways for resolving that difficulty, their current state of development, and references. Included in the table are staggered and nonstaggered, conservative and nonconservative discretizations of viscous and inviscid, incompressible and compressible flows at various Mach numbers, as well as a simple (algebraic) turbulence model and comments on chemically reacting flows. The listing of associated computational barriers involves: non-alignment of streamlines or sonic characteristics with the grids; recirculating flows; stagnation points; discretization and relaxation on and near shocks and boundaries; far-field artificial boundary conditions; small-scale singularities (meaning important features, such as the complete airplane, which are not visible on some of the coarse grids); large grid aspect ratios; boundary layer resolution; and grid adaption.

Brandt, Achi↗

Towards Verification of Unstructured-Grid Solvers

New methodology for verification of computational methods using unstructured grids is presented. The discretization order properties are studied in computational windows, easily constructed within a collection of grids or a single grid. The windows can be adjusted to isolate the interior discretization, the boundary discretization, or singularities. A major component of the methodology is the downscaling test, introduced previously for studying the convergence rates of truncation and discretization errors of finite-volume discretization schemes on general unstructured grids. Demonstrations of the method are shown, including a comparative accuracy assessment of commonly-used schemes on general mixed grids and the identification of local accuracy deterioration at intersections of tangency and inflow/outflow boundaries. Recommendations for the use of the methodology in large-scale computational simulations are given.

Thomas, James L.↗

Explicit Monotone Stable Super-Time-stepping Methods for Finite Time Singularities

We explore a novel way to numerically resolve the scaling behavior of finite-time singularities in solutions of nonlinear parabolic PDEs. The Runge–Kutta–Legendre (RKL) and Runge–Kutta–Gegenbauer (RKG) super-time-stepping methods were originally developed for nonlinear complex physics problems with diffusion. These are multistage single step second-order, forward-in-time methods with no implicit solves. The advantage is that the time-step size for stability scales with stage number 𝑠 as $\mathcal{O}$⁡(𝑠 2 ). Many interesting nonlinear PDEs have finite-time singularities, and the presence of diffusion often limits one to using implicit or semi-implicit time-step methods for stability constraints. Finite-time singularities are particularly challenging due to the large range of scales that one desires to resolve, often with adaptive spatial grids and adaptive time steps. Here, in this study, we show two examples of nonlinear PDEs for which the self-similar singularity structure has time and space scales that are resolvable using the RKL and RKG methods, without forcing even smaller time steps. Compared to commonly used implicit numerical methods, we achieve a significantly smaller run time while maintaining comparable accuracy. We also prove numerical monotonicity for both the RKL and RKG methods under their linear stability conditions for the constant coefficient heat equation, in the case of infinite domain and periodic boundary condition, leading to a theoretical guarantee of the superiority of the RKL and RKG methods over traditional super-time-stepping methods, such as the Runge-Kutta-Chebyshev and the orthogonal Runge-Kutta-Chebyshev methods. Code can be found at https://github.com/ZT220501/SRK-Singularity.

97 MATHEMATICS AND COMPUTING↗

Matrix Completion for Improved Observability in Low-Voltage Distribution Grids

This paper considers the problem of recovering missing entries in a partially observed matrix from relatively few measurements (i.e., the so-called matrix completion problem) with the aim of increasing the presently limited observability of low-voltage distribution grids. To this end, the partially observed matrix is formed using scarce voltage magnitude measurements while accounting for their spatial information. Voltage readings are assumed to be collected from distribution utility sensors and/or geographically-distributed cable television network sensors located in immediate proximity to distribution grid nodes. A matrix completion approach built on the parameter-less singular value shrinkage technique is used to estimate voltage magnitudes at otherwise non-observable low-voltage nodes using a small number of single- or multiple-snapshot data. The effectiveness of the proposed approach is demonstrated using a U.S.-style distribution test system from the synthetic SMART- DS data set under very low- to moderate-observability conditions.

low-rank matrix completion↗

Retrieval of energy spectra for all flavours of neutrinos from core-collapse supernova with multiple detectors

ABSTRACT We present a new method by which to retrieve energy spectrum for all falvours of neutrinos from core-collapse supernova (CCSN). In the retrieval process, we do not assume any analytic formulas to express the energy spectrum of neutrinos but rather take a direct way of spectrum reconstruction from the observed data; the singular value decomposition algorithm with a newly developed adaptive energy-gridding technique is adopted. We employ three independent reaction channels having different flavour sensitivity to neutrinos. Two reaction channels, inverse beta decay on proton and elastic scattering on electrons, from a water Cherenkov detector such as Super-Kamiokande (SK) and Hyper-Kamiokande (HK), and a charged current reaction channel with Argon from the Deep Underground Neutrino Experiment (DUNE) are adopted. Given neutrino oscillation models, we iteratively search the neutrino energy spectra at the CCSN source until they provide the consistent event counts in the three reaction channels. We test the capability of our method by demonstrating the spectrum retrieval to a theoretical neutrino data computed by our recent three-dimensional CCSN simulation. Although the energy spectrum with either electron-type or electron-type antineutrinos at the CCSN source has relatively large error compared to that of other species, the joint analysis with HK + DUNE or SK + DUNE will provide precise energy spectrum of all flavours of neutrinos at the source. Finally, we discuss perspectives for improvements of our method by using neutrino data of other detectors.

79 ASTRONOMY AND ASTROPHYSICS↗

Pseudospectral Landau-Lifshitz description of magnetization dynamics

Magnetic materials host a wealth of nonlinear dynamics, textures, and topological defects. This is possible due to the competition between strong nonlinearity and dispersion, which act at the atomic scale, as well as long-range interactions. However, these features are difficult to study analytically and numerically because of the vastly different temporal and spatial scales involved. Here, in this work, we present a pseudospectral approach for the Landau-Lifshitz equation that invokes energy and momentum conservation embodied in the magnon dispersion relation to accurately describe both atomic and continuum limits. Furthermore, this approach enables analytical study at every scale. We show the applicability of this model in both the continuum and atomic limit by investigating modulational instability and ultrafast evolution of magnetization due to transient grating, respectively, in a one-dimensional ferromagnetic chain with perpendicular magnetic anisotropy. This model provides the possibility of grid-independent multiscale numerical approaches that will enable the description of singularities within a single framework.

1-dimensional spin chains↗

The piecewise-linear predictor-corrector code - A Lagrangian-remap method for astrophysical flows

We describe a time-explicit finite-difference algorithm for solving the nonlinear fluid equations. The method is similar to existing Eulerian schemes in its use of operator-splitting and artificial viscosity, except that we solve the Lagrangian equations of motion with a predictor-corrector and then remap onto a fixed Eulerian grid. The remap is formulated to eliminate errors associated with coordinate singularities, with a general prescription for remaps of arbitrary order. We perform a comprehensive series of tests on standard problems. Self-convergence tests show that the code has a second-order rate of convergence in smooth, two-dimensional flow, with pressure forces, gravity, and curvilinear geometry included. While not as accurate on idealized problems as high-order Riemann-solving schemes, the predictor-corrector Lagrangian-remap code has great flexibility for application to a variety of astrophysical problems.

Lufkin, Eric A.↗

Constructing field-aligned coordinate systems for gyrokinetic simulations of tokamaks in X-point geometries

Structures in tokamak plasmas are elongated along the direction of the magnetic field and short in the directions perpendicular to the magnetic field. Many tokamak simulation codes take advantage of this by using a field-aligned coordinate system. However, field-aligned coordinate systems have a coordinate singularity at magnetic X-points where the poloidal magnetic field vanishes, which makes it difficult to use field-aligned coordinate systems when simulating the core and scrape-off layer simultaneously. Here, we present an algorithm for grid generation and computing geometric quantities in a standard field-aligned coordinate system that avoids the singularity and allows one to conduct two-dimensional gyrokinetic axisymmetric simulations in X-point geometries. Convergence tests of advection, boundary value problems and geometric quantities all show greater than first-order convergence even in the vicinity of the X-point. We also demonstrate the geometric consistency of our algorithm with an example simulation of the spherical tokamak for energy production, which shows machine-precision particle conservation.

fusion plasma↗

A development of grid generation procedure for multicomponent aerodynamic configuration

Two approaches for solving the transonic flow in a multi-block grid were explored. The first approach examines a method involving "zonal decomposition" wherein block boundaries are treated as true boundary surfaces separating interfacing grids. The issues investigated involve techniques for matching solutions at a block boundary. A feasibility study was completed and the results are presented. The second approach involves overlapping grids for differencing across a block boundary near an artificially induced coordinate singularity occurring at a fictitious corner. This approach selects a set of neighboring nodes for the fictitious corner such that the resulting physical cells for a node are topologically the same as any other node on the airfoil surface.

Chen, H. C.↗

H-AMR: A New GPU-accelerated GRMHD Code for Exascale Computing with 3D Adaptive Mesh Refinement and Local Adaptive Time Stepping

General relativistic magnetohydrodynamic (GRMHD) simulations have revolutionized our understanding of black hole accretion. Here, we present a GPU-accelerated GRMHD code H-AMR with multifaceted optimizations that, collectively, accelerate computation by 2–5 orders of magnitude for a wide range of applications. First, it introduces a spherical grid with 3D adaptive mesh refinement that operates in each of the three dimensions independently. This allows us to circumvent the Courant condition near the polar singularity, which otherwise cripples high-resolution computational performance. Second, we demonstrate that local adaptive time stepping on a logarithmic spherical-polar grid accelerates computation by a factor of ≲10 compared to traditional hierarchical time-stepping approaches. Jointly, these unique features lead to an effective speed of ~10 9 zone cycles per second per node on 5400 NVIDIA V100 GPUs (i.e., 900 nodes of the OLCF Summit supercomputer). We illustrate H-AMR's computational performance by presenting the first GRMHD simulation of a tilted thin accretion disk threaded by a toroidal magnetic field around a rapidly spinning black hole. With an effective resolution of 13,440 × 4608 × 8092 cells and a total of ≲22 billion cells and ~0.65 × 10 8 time steps, it is among the largest astrophysical simulations ever performed. We find that frame dragging by the black hole tears up the disk into two independently precessing subdisks. The innermost subdisk rotation axis intermittently aligns with the black hole spin, demonstrating for the first time that such long-sought alignment is possible in the absence of large-scale poloidal magnetic fields.

79 ASTRONOMY AND ASTROPHYSICS↗

A New Method for Accurate Treatment of Flow Equations in Cylindrical Coordinates Using Series Expansions

The motivation of this work is the ongoing effort at the Center for Turbulence Research (CTR) to use large eddy simulation (LES) techniques to calculate the noise radiated by jet engines. The focus on engine exhaust noise reduction is motivated by the fact that a significant reduction has been achieved over the last decade on the other main sources of acoustic emissions of jet engines, such as the fan and turbomachinery noise, which gives increased priority to jet noise. To be able to propose methods to reduce the jet noise based on results of numerical simulations, one first has to be able to accurately predict the spatio-temporal distribution of the noise sources in the jet. Though a great deal of understanding of the fundamental turbulence mechanisms in high-speed jets was obtained from direct numerical simulations (DNS) at low Reynolds numbers, LES seems to be the only realistic available tool to obtain the necessary near-field information that is required to estimate the acoustic radiation of the turbulent compressible engine exhaust jets. The quality of jet-noise predictions is determined by the accuracy of the numerical method that has to capture the wide range of pressure fluctuations associated with the turbulence in the jet and with the resulting radiated noise, and by the boundary condition treatment and the quality of the mesh. Higher Reynolds numbers and coarser grids put in turn a higher burden on the robustness and accuracy of the numerical method used in this kind of jet LES simulations. As these calculations are often done in cylindrical coordinates, one of the most important requirements for the numerical method is to provide a flow solution that is not contaminated by numerical artifacts. The coordinate singularity is known to be a source of such artifacts. In the present work we use 6th order Pade schemes in the non-periodic directions to discretize the full compressible flow equations. It turns out that the quality of jet-noise predictions using these schemes is especially sensitive to the type of equation treatment at the singularity axis. The objective of this work is to develop a generally applicable numerical method for treating the singularities present at the polar axis, which is particularly suitable for highly accurate finite-differences schemes (e.g., Pade schemes) on non-staggered grids. The main idea is to reinterpret the regularity conditions developed in the context of pseudo-spectral methods. A set of exact equations at the singularity axis is derived using the appropriate series expansions for the variables in the original set of equations. The present treatment of the equations preserves the same level of accuracy as for the interior scheme. We also want to point out the wider utility of the method, proposed here in the context of compressible flow equations, as its extension for incompressible flows or for any other set of equations that are solved on a non-staggered mesh in cylindrical coordinates with finite-differences schemes of various level of accuracy is straightforward. The robustness and accuracy of the proposed technique is assessed by comparing results from simulations of laminar forced-jets and turbulent compressible jets using LES with similar calculations in which the equations are solved in Cartesian coordinates at the polar axis, or in which the singularity is removed by employing a staggered mesh in the radial direction without a mesh point at r = 0.

Constantinescu, G.S.↗

On some theoretical and practical aspects of multigrid methods

A description and explanation of a simple multigrid algorithm for solving finite element systems is given. Numerical results for an implementation are reported for a number of elliptic equations, including cases with singular coefficients and indefinite equations. The method shows the high efficiency, essentially independent of the grid spacing, predicted by the theory.

Nicolaides, R. A.↗

Editors’ Choice—Perspective—Challenges in Moving to Multiscale Battery Models: Where Electrochemistry Meets and Demands More from Math

There has been significant recent interest in studying multiscale characteristics of current and next-generation batteries, including lithium-metal and lithium-sulfur batteries. Advances in computing power make researchers believe that the detailed multiscale models can be efficiently simulated to arrive at the insights for the degradation and performance loss; however, this is not true and special attention needs to be paid to local singularities, boundary layers, moving boundaries, etc. This article presents 2D examples that illustrate the importance of grid convergence studies, provides well-defined detailed models to test the efficiency of numerical schemes, and discusses the associated simulation challenges.

Shah, Krishna (ORCID:0000000278026361)↗

Decadal Seasonal Shifts of Precipitation and Temperature in TRMM and AIRS Data

We present results from an analysis of seasonal phase shifts in the global precipitation and surface temperatures. We use data from the TRMM (Tropical Rainfall Measuring Mission) Multi-satellite Precipitation Algorithm (TMPA), and the Atmospheric Infrared Sounder (AIRS) on Aqua satellite, all hosted at NASA Goddard Earth Science Data and Information Services Center (GES DISC). We explore the information content and data usability by first aggregating daily grids from the entire records of both missions to pentad (5-day) series which are then processed using Singular Value Decomposition approach. A strength of this approach is the normalized principal components that can then be easily converted from real to complex time series. Thus, we can separate the most informative, the seasonal, components and analyze unambiguously for potential seasonal phase drifts. TMPA and AIRS records represent correspondingly 20 and 15 years of data, which allows us to run simple “phase learning†from the first 5 years of records and use it as reference. The most recent 5 years are then phase-compared with the reference. We demonstrate that the seasonal phase of global precipitation and surface temperatures has been stable in the past two decades. However, a small global trend of delayed precipitation, and earlier arrival of surface temperatures seasons, are detectable at 95% confidence level. Larger phase shifts are detectable at regional level, in regions recognizable from the Eigen vectors to having strong seasonal patterns. For instance, in Central North America, including the North American Monsoon region, confident phase shifts of 1-2 days per decade are detected at 95% confidence level. While seemingly symbolic, these shifts are indicative of larger changes in the Earth Climate System. We thus also demonstrate a potential usability scenario of Earth Science Data Records curated at the NASA GES DISC in partnership with Earth Science Missions.

surface temperatures↗

Solution of Poisson equations for 3-dimensional grid generations

A method for generating three dimensional, finite difference grids about complicated geometries by using Poisson equations is developed. The inhomogenous terms are automatically chosen such that orthogonality and spacing restrictions at the body surface are satisfied. Spherical variables are used to avoid the axis singularity, and an alternating-direction-implicit (ADI) solution scheme is used to accelerate the computations. Computed results are presented that show the capability of the method. Since most of the results presented have been used as grids for flow-field computations, this is indicative that the method is a useful tool for generating three-dimensional grids about complicated geometries.

Fujii, K.↗

An object-oriented approach for parallel self adaptive mesh refinement on block structured grids

Self-adaptive mesh refinement dynamically matches the computational demands of a solver for partial differential equations to the activity in the application's domain. In this paper we present two C++ class libraries, P++ and AMR++, which significantly simplify the development of sophisticated adaptive mesh refinement codes on (massively) parallel distributed memory architectures. The development is based on our previous research in this area. The C++ class libraries provide abstractions to separate the issues of developing parallel adaptive mesh refinement applications into those of parallelism, abstracted by P++, and adaptive mesh refinement, abstracted by AMR++. P++ is a parallel array class library to permit efficient development of architecture independent codes for structured grid applications, and AMR++ provides support for self-adaptive mesh refinement on block-structured grids of rectangular non-overlapping blocks. Using these libraries, the application programmers' work is greatly simplified to primarily specifying the serial single grid application and obtaining the parallel and self-adaptive mesh refinement code with minimal effort. Initial results for simple singular perturbation problems solved by self-adaptive multilevel techniques (FAC, AFAC), being implemented on the basis of prototypes of the P++/AMR++ environment, are presented. Singular perturbation problems frequently arise in large applications, e.g. in the area of computational fluid dynamics. They usually have solutions with layers which require adaptive mesh refinement and fast basic solvers in order to be resolved efficiently.

Lemke, Max↗

Theoretical analysis of aircraft afterbody flow

The strongly interactive flow field about aircraft afterbodies is investigated using computational techniques by which the thin-shear-layer formulation of the compressible, Reynolds-averaged Navier-Stokes equations is solved. A time-dependent implicit numerical algorithm is used to obtain solutions for a variety of afterbody and nozzle geometries, within the class of bodies of revolution, for both subsonic and supersonic external flow, and for sonic and supersonic underexpanded jets. Only centered nozzles with either a sharp lip or a blunt base are considered. In all cases, computed results are compared with experimental data taken at flight Reynolds numbers for like-flow conditions. Turbulence closure is realized using algebraic eddy-viscosity concepts. A new and unique adaptive-grid technique is used to resolve flow regimes with large gradients and to improve the accuracy and efficiency of the computational scheme. Special singular point boundary conditions are used for similar purposes, and are especially effective for highly under-expanded jets. For all cases considered, except one with a very large base-to-nozzle-exit-diameter ratio, the agreement with experimental measurements is excellent. For geometries with large base regions, enhancements in the turbulence transport model are necessary to support improvements in the flow-field simulation.

Deiwert, G. S.↗

A Highly Accurate Technique for the Treatment of Flow Equations at the Polar Axis in Cylindrical Coordinates using Series Expansions

Numerical methods for solving the flow equations in cylindrical or spherical coordinates should be able to capture the behavior of the exact solution near the regions where the particular form of the governing equations is singular. In this work we focus on the treatment of these numerical singularities for finite-differences methods by reinterpreting the regularity conditions developed in the context of pseudo-spectral methods. A generally applicable numerical method for treating the singularities present at the polar axis, when nonaxisymmetric flows are solved in cylindrical, coordinates using highly accurate finite differences schemes (e.g., Pade schemes) on non-staggered grids, is presented. Governing equations for the flow at the polar axis are derived using series expansions near r=0. The only information needed to calculate the coefficients in these equations are the values of the flow variables and their radial derivatives at the previous iteration (or time) level. These derivatives, which are multi-valued at the polar axis, are calculated without dropping the accuracy of the numerical method using a mapping of the flow domain from (0,R)*(0,2pi) to (-R,R)*(0,pi), where R is the radius of the computational domain. This allows the radial derivatives to be evaluated using high-order differencing schemes (e.g., compact schemes) at points located on the polar axis. The proposed technique is illustrated by results from simulations of laminar-forced jets and turbulent compressible jets using large eddy simulation (LES) methods. In term of the general robustness of the numerical method and smoothness of the solution close to the polar axis, the present results compare very favorably to similar calculations in which the equations are solved in Cartesian coordinates at the polar axis, or in which the singularity is removed by employing a staggered mesh in the radial direction without a mesh point at r=0, following the method proposed recently by Mohseni and Colonius (1). Extension of the method described here for incompressible flows or for any other set of equations that are solved on a non-staggered mesh in cylindrical or spherical coordinates with finite-differences schemes of various level of accuracy is immediate.

Constantinescu, George S.↗