Search NASA⌕ Search

SEARCH · Search NASA

Results for “linearly implicit”

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 613 records · Page 34

Direct numerical simulation of electrokinetic instability and transition to chaotic motion

A new type of instability—electrokinetic instability—and an unusual transition to chaotic motion near a charge-selective surface (semiselective electric membrane, electrode, or system of micro-/nanochannels) was studied by the numerical integration of the Nernst-Planck-Poisson-Stokes system and a weakly nonlinear analysis near the threshold of instability. A special finite-difference method was used for the space discretization along with a semi-implicit 31/3 -step Runge-Kutta scheme for the integration in time. Two kinds of initial conditions were considered: (a) white-noise initial conditions to mimic “room disturbances” and subsequent natural evolution of the solution, and (b) an artificial monochromatic ion distribution with a fixed wave number to simulate regular wave patterns. The results were studied from the viewpoint of hydrodynamic stability and bifurcation theory. The threshold of electroconvective movement was found by the linear spectral stability theory, the results of which were confirmed by numerical simulation of the entire system. Our weakly nonlinear analysis and numerical integration of the entire system predict possibility of both kinds of bifurcations at the critical point, supercritical and subcritical, depending on the system parameters. The following regimes, which replace each other as the potential drop between the selective surfaces increases, were obtained: one-dimensional steady solution, two-dimensional steady electroconvective vortices (stationary point in a proper phase space), unsteady vortices aperiodically changing their parameters (homoclinic contour), periodic motion (limit cycle), and chaotic motion. The transition to chaotic motion does not include Hopf bifurcation. The numerical resolution of the thin concentration polarization layer showed spike-like charge profiles along the surface, which could be, depending on the regime, either steady or aperiodically coalescent. The numerical investigation confirmed the experimentally observed absence of regular (near-sinusoidal) oscillations for the overlimiting regimes. There is a qualitative agreement of the experimental and the theoretical values of the threshold of instability, the dominant size of the observed coherent structures, and the experimental and theoretical volt–current characteristics.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Cloud droplet diffusional growth in homogeneous isotropic turbulence: bin microphysics versus Lagrangian super-droplet simulations

The increase in the spectral width of an initially monodisperse population of cloud droplets in homogeneous isotropic turbulence is investigated by applying a finite-difference fluid flow model combined with either Eulerian bin microphysics or a Lagrangian particle-based scheme. The turbulence is forced applying a variant of the so-called linear forcing method that maintains the mean turbulent kinetic energy (TKE) and the TKE partitioning between velocity components. The latter is important for maintaining the quasi-steady forcing of the supersaturation fluctuations that drive the increase in the spectral width. We apply a large computational domain (64 3 m 3 ), one of the domains considered in Thomas et al. (2020). The simulations apply 1 m grid length and are in the spirit of the implicit large eddy simulation (ILES), that is, with small-scale dissipation provided by the model numerics. This is in contrast to the scaled-up direct numerical simulation (DNS) applied in Thomas et al. (2020). Two TKE intensities and three different droplet concentrations are considered. Analytic solutions derived in Sardina et al. (2015), valid for the case when the turbulence integral timescale is much larger than the droplet phase relaxation timescale, are used to guide the comparison between the two microphysics simulation techniques. The Lagrangian approach reproduces the scalings relatively well. Representing the spectral width increase in time is more challenging for the bin microphysics because appropriately high resolution in the bin space is needed. The bin width of 0.5 µm is only sufficient for the lowest droplet concentration (26 cm -3 ). For the highest droplet concentration (650 cm -3 ), an order of magnitude smaller bin size is barely sufficient. The scalings are not expected to be valid for the lowest droplet concentration and the high-TKE case, and the two microphysics schemes represent similar departures. Finally, because the fluid flow is the same for all simulations featuring either low or high TKE, one can compare point-by-point simulation results. Such a comparison shows very close temperature and water vapor point-by-point values across the computational domain and larger differences between simulated mean droplet radii and spectral width. The latter are explained by fundamental differences in the two simulation methodologies, numerical diffusion in the Eulerian bin approach and a relatively small number of Lagrangian particles that are used in the particle-based microphysics.

54 ENVIRONMENTAL SCIENCES↗

High resolution upwind schemes for the three-dimensional incompressible Navier-Stokes equations

Based on flux-difference splitting, implicit high resolution schemes are constructed for efficient computations of steady-state solutions to the three-dimensional, incompressible Navier-Stokes equations in curvilinear coordinates. These schemes use first-order accurate Euler backward-time differencing and second-order central differencing for the viscous shear fluxes. Up to third-order accurate upwind differencing is achieved through a reconstruction of the solution from its cell averages. The reconstruction is accomplished by linear interpolation, where the node stencils are selected such that in regions of smooth solution the flow is highly resolved while spurious oscillations in regions of rapid changes in gradient are still suppressed. Fairly rapid convergence to steady-state solutions is attained with a completely vectorizable hybrid time-marching method. Flows around a sharp-edged delta wing are computed with the maximum accuracy of the upwind-differencing restricted to first-, second-, and third-order, to illustrate the effect of accuracy on the global and on the local vortical flow fields. The results are validated with experimental data.

Hartwich, PETER-M.↗

Accurate solutions, parameter studies and comparisons for the Euler and potential flow equations

Parameter studies are conducted using the Euler and potential flow equation models for unsteady and steady flows in both two and three dimensions. The Euler code is an implicit, upwind, finite volume code which uses the Van Leer method of flux-vector-splitting which has been recently extended for use on dynamic meshes and maintain all the properties of the original splitting. The potential flow code is an implicit, finite difference method for solving the transonic small disturbance equations and incorporates both entropy and vorticity corrections into the solution procedures thereby extending its applicability into regimes where shock strength normally precludes its use. Parameter studies resulting in benchmark type calculations include the effects of spatial and temporal refinement, spatial order of accuracy, far field boundary conditions for steady flow, frequency of oscillation, and the use of subiterations at each time step to reduce linearization and factorization errors. Comparisons between Euler and potential flows results are made as well as with experimental data where available.

Anderson, W. Kyle↗

Accurate solutions, parameter studies and comparisons for the Euler and potential flow equations

Parameter studies are conducted using the Euler and potential flow equation models for steady and unsteady flows in both two and three dimensions. The Euler code is an implicit, upwind, finite volume code which uses the Van Leer method of flux vector splitting which has been recently extended for use on dynamic meshes and maintain all the properties of the original splitting. The potential flow code is an implicit, finite difference method for solving the transonic small disturbance equations and incorporates both entropy and vorticity corrections into the solution procedures thereby extending its applicability into regimes where shock strength normally precludes its use. Parameter studies resulting in benchmark type calculations include the effects of spatial and temporal refinement, spatial order of accuracy, far field boundary conditions for steady flow, frequency of oscillation, and the use of subiterations at each time step to reduce linearization and factorization errors. Comparisons between Euler and potential flow results are made, as well as with experimental data where available.

Anderson, W. Kyle↗

Application of a full-potential solver to bending-torsion flutter in cascades

A two-dimensional, unsteady, full-potential cascade aerodynamic code has been used for flutter calculations. The code, which uses a time-marching implicit scheme with internal Newton-iterations at each time step, allows oscillatory blade motions with phase lag between adjacent blades to be modeled using a single inter-blade passage. This aerodynamic code has been used with a two-degrees-of-freedom typical section structural model to determine the aeroelastic stability of a bladed disk. The unsteady pressure results calculated from the aerodynamic code have been verified by comparison with results from the linear and linearized potential theories. Flutter results have been presented for two cases. A comparison with linear theory shows identical trends; however, the present calculations show a lower flutter frequency.

Bakhle, Milind A.↗

Genetic Network Inference: From Co-Expression Clustering to Reverse Engineering

Advances in molecular biological, analytical, and computational technologies are enabling us to systematically investigate the complex molecular processes underlying biological systems. In particular, using high-throughput gene expression assays, we are able to measure the output of the gene regulatory network. We aim here to review datamining and modeling approaches for conceptualizing and unraveling the functional relationships implicit in these datasets. Clustering of co-expression profiles allows us to infer shared regulatory inputs and functional pathways. We discuss various aspects of clustering, ranging from distance measures to clustering algorithms and multiple-duster memberships. More advanced analysis aims to infer causal connections between genes directly, i.e., who is regulating whom and how. We discuss several approaches to the problem of reverse engineering of genetic networks, from discrete Boolean networks, to continuous linear and non-linear models. We conclude that the combination of predictive modeling with systematic experimental verification will be required to gain a deeper insight into living organisms, therapeutic targeting, and bioengineering.

Dhaeseleer, Patrik↗

Spatiotemporally dynamic implicit large eddy simulation using machine learning classifiers

In this article, we utilize machine learning to dynamically determine if a point on the computational grid requires implicit numerical dissipation for large eddy simulation (LES). The decision making process is learnt through a priori training on quantities derived from direct numerical simulation (DNS) data. In particular, we compute eddy-viscosities obtained through the coarse-graining of DNS quantities and utilize their projection onto a Gaussian distribution to categorize areas that may require dissipation. If our learning determines that closure is necessary, an upwinded scheme is utilized for computing the non-linear Jacobian. In contrast, if it is determined that closure is unnecessary, a symmetric and second-order accurate energy and enstrophy preserving Arakawa scheme is utilized instead. This results in a closure framework that precludes the specification of any model-form for the small scale contributions of turbulence but deploys an appropriate numerical dissipation from explicit closure driven hypotheses. Here, this methodology is deployed for the Kraichnan turbulence test-case and assessed through various statistical quantities such as angle-averaged kinetic energy spectra and vorticity structure functions. Our framework thus establishes a link between the use of explicit LES ideologies for closure and numerical dissipation-based modeling of turbulence leading to improved statistical fidelity of a posteriori simulations.

42 ENGINEERING↗

Airfoil Computational Fluid Dynamics - 9k shapes, 2 AoA's

This dataset contains aerodynamic quantities - including flow field values (momentum, energy, and vorticity) and summary values (coefficients of lift, drag, and momentum) - for 8,996 airfoil shapes, computed using the HAM2D CFD (computational fluid dynamics) model. The airfoil shapes were designed using the separable shape tensor parameterization that encodes two-dimensional shapes as elements of the Grassmann manifold. This data-driven approach learns two independent spaces of parameter from a collection of sample airfoils. The first captures large-scale, linear perturbations, and the second defines small-scale, higher-order perturbations. For this data, we used the G2Aero database of over 19,000 airfoil shapes to learn a parameter space that captured a wide array of shape characteristics. We fixed the linear deformations to be the mean over the database and sampled new shapes over a four-dimensional parameter space of higher-order perturbation. This sampling approaches allows for isolated analysis of non-linear airfoil shape deformations while holding other aspects (e.g., airfoil thickness) approximately constant. The aerodynamic quantities for the generated airfoil were obtained using the HAM2D code, which is a finite-volume Reynolds-averaged Navier-Stokes (RANS) flow solver. We employ a fifth-order WENO scheme for spatial reconstruction with Roe's flux difference scheme for inviscid flux and second-order central differencing for viscous flux. A preconditioned GMRES method is applied for implicit integration. The Spalart-Allmaras 1-eq turbulence model is used for the turbulence closure, and the Medida-Baeder 2-eq transition model is applied to account for the effects of laminar turbulent transition. The airfoil grid is generated with a total of 400 points on the airfoil surface, the initial wall-normal spacing of y+ = 1, and an outer boundary located at 300 chord lengths away from the wall. The CFD simulations are performed at a freestream Mach number of 0.1, Reynolds number of 9M, and at two angles of attack, 4 deg. and 12 deg. The simulations were performed using the Bridges-2 system at the Pittsburgh Supercomputing Center in February 2023 as part of the INTEGRATE project funded by the Advanced Research Projects Agency - Energy in the U.S. Department of Energy. The data was collected, reformatted, and preprocessed for this OEDI submission in July 2023 under the Foundational AI for Wind Energy project funded by the U.S. Department of Energy Wind Energy Technologies Office. This dataset is intended to serve as a benchmark against which new artificial intelligence (AI) or machine learning (ML) tools may be tested. Baseline AI/ML methods for analyzing this dataset have been implemented, and a link to their repository containing those models has been provided. The .h5 data file structure can be found in the GitHub Repository resource under explore_airfoil_9k_data.ipynb.

9k↗

Time integration algorithms for the two-dimensional Euler equations on unstructured meshes

Explicit and implicit time integration algorithms for the two-dimensional Euler equations on unstructured grids are presented. Both cell-centered and cell-vertex finite volume upwind schemes utilizing Roe's approximate Riemann solver are developed. For the cell-vertex scheme, a four-stage Runge-Kutta time integration, a fourstage Runge-Kutta time integration with implicit residual averaging, a point Jacobi method, a symmetric point Gauss-Seidel method and two methods utilizing preconditioned sparse matrix solvers are presented. For the cell-centered scheme, a Runge-Kutta scheme, an implicit tridiagonal relaxation scheme modeled after line Gauss-Seidel, a fully implicit lower-upper (LU) decomposition, and a hybrid scheme utilizing both Runge-Kutta and LU methods are presented. A reverse Cuthill-McKee renumbering scheme is employed for the direct solver to decrease CPU time by reducing the fill of the Jacobian matrix. A comparison of the various time integration schemes is made for both first-order and higher order accurate solutions using several mesh sizes, higher order accuracy is achieved by using multidimensional monotone linear reconstruction procedures. The results obtained for a transonic flow over a circular arc suggest that the preconditioned sparse matrix solvers perform better than the other methods as the number of elements in the mesh increases.

Slack, David C.↗

PIC simulations of wave-particle interactions with an initial electron velocity distribution from a kinetic ring current model

Whistler wave-particle interactions play an important role in the Earth inner magnetospheric dynamics and have been the subject of numerous investigations. By running a global kinetic ring current model (RAM-SCB) in a storm event occurred on Oct 23–24 2002, we obtain the ring current electron distribution at a selected location at MLT of 9 and L of 6 where the electron distribution is composed of a warm population in the form of a partial ring in the velocity space (with energy around 15 keV) in addition to a cool population with a Maxwellian-like distribution. The warm population is likely from the injected plasma sheet electrons during substorm injections that supply fresh source to the inner magnetosphere. These electron distributions are then used as input in an implicit particle-in-cell code (iPIC3D) to study whistler-wave generation and the subsequent wave-particle interactions. Here, we find that whistler waves are excited and propagate in the quasi-parallel direction along the background magnetic field. Several different wave modes are instantaneously generated with different growth rates and frequencies. The wave mode at the maximum growth rate has a frequency around 0.62ω ce , which corresponds to a parallel resonant energy of 2.5 keV. Linear theory analysis of wave growth is in excellent agreement with the simulation results. These waves grow initially due to the injected warm electrons and are later damped due to cyclotron absorption by electrons whose energy is close to the resonant energy and can effectively attenuate waves. The warm electron population overall experiences net energy loss and anisotropy drop while moving along the diffusion surfaces towards regions of lower phase space density, while the cool electron population undergoes heating when the waves grow, suggesting the cross-population interactions.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

AN ALGORITHM FOR RADIATION MAGNETOHYDRODYNAMICS BASED ON SOLVING THE TIME-DEPENDENT TRANSFER EQUATION

We describe a new algorithm for solving the coupled frequency-integrated transfer equation and the equations of magnetohydrodynamics in the regime that light-crossing time is only marginally shorter than dynamical timescales. The transfer equation is solved in the mixed frame, including velocity-dependent source terms accurate to O(v/c). An operator split approach is used to compute the specific intensity along discrete rays, with upwind monotonic interpolation used along each ray to update the transport terms, and implicit methods used to compute the scattering and absorption source terms. Conservative differencing is used for the transport terms, which ensures the specific intensity (as well as energy and momentum) are conserved along each ray to round-off error. The use of implicit methods for the source terms ensures the method is stable even if the source terms are very stiff. To couple the solution of the transfer equation to the MHD algorithms in the ATHENA code, we perform direct quadrature of the specific intensity over angles to compute the energy and momentum source terms. We present the results of a variety of tests of the method, such as calculating the structure of a non-LTE atmosphere, an advective diffusion test, linear wave convergence tests, and the well-known shadow test. We use new semi-analytic solutions for radiation modified shocks to demonstrate the ability of our algorithm to capture the effects of an anisotropic radiation field accurately. Since the method uses explicit differencing of the spatial operators, it shows excellent weak scaling on parallel computers.

79 ASTRONOMY AND ASTROPHYSICS↗

An efficient method for solving the steady Euler equations

An efficient numerical procedure for solving a set of nonlinear partial differential equations is given, specifically for the steady Euler equations. Solutions of the equations were obtained by Newton's linearization procedure, commonly used to solve the roots of nonlinear algebraic equations. In application of the same procedure for solving a set of differential equations we give a theorem showing that a quadratic convergence rate can be achieved. While the domain of quadratic convergence depends on the problems studied and is unknown a priori, we show that firstand second-order derivatives of flux vectors determine whether the condition for quadratic convergence is satisfied. The first derivatives enter as an implicit operator for yielding new iterates and the second derivatives indicates smoothness of the flows considered. Consequently flows involving shocks are expected to require larger number of iterations. First-order upwind discretization in conjunction with the Steger-Warming flux-vector splitting is employed on the implicit operator and a diagonal dominant matrix results. However the explicit operator is represented by first- and seond-order upwind differencings, using both Steger-Warming's and van Leer's splittings. We discuss treatment of boundary conditions and solution procedures for solving the resulting block matrix system. With a set of test problems for one- and two-dimensional flows, we show detailed study as to the efficiency, accuracy, and convergence of the present method.

Liou, M. S.↗

An exponential time-integrator scheme for steady and unsteady inviscid flows

In this report an exponential time-integrator scheme of second-order accuracy based on the predictor–corrector methodology, denoted PCEXP, is developed to solve multi-dimensional nonlinear partial differential equations pertaining to fluid dynamics. The effective and efficient implementation of PCEXP is realized by means of the Krylov method. The linear stability and truncation error are analyzed through a one-dimensional model equation. The proposed PCEXP scheme is applied to the Euler equations discretized with a discontinuous Galerkin method in both two and three dimensions. The effectiveness and efficiency of the PCEXP scheme are demonstrated for both steady and unsteady inviscid flows. The accuracy and efficiency of the PCEXP scheme are verified and validated through comparisons with the explicit third-order total variation diminishing Runge–Kutta scheme (TVDRK3), the implicit backward Euler (BE) and the implicit second-order backward difference formula (BDF2). For unsteady flows, the PCEXP scheme generates a temporal error much smaller than the BDF2 scheme does, while maintaining the expected acceleration at the same time. Moreover, the PCEXP scheme is also shown to achieve the computational efficiency comparable to the implicit schemes for steady flows.

97 MATHEMATICS AND COMPUTING↗

Inference-Engine v0.1.0

Given a pre-trained neural network, Inference-Engine performs maps network inputs to outputs by executing the forward pass through the provided network. Although the predominant programming language for machine-learning is Python, most high-performance computing (HPC) applications are written in Fortran, C, or C++. Inference-Engine aims to support HPC programs and is written in Fortran, a language with a large feature set supporting interoperability with C. This software exposes concurrency in a portable way by using standard language features that some modern Fortran compilers can exploit with various optimizations, including offloading computation to a Graphics Processing Unit (GPU). In particular, this software makes extensive use of Fortran's "do concurrent" parallel loop construct, implicitly parallel array statements, and pure procedures that can be invoked inside "do concurrent" blocks. Inference-Engine also supports dynamic choice of inference methods at runtime. Two current options include one method that uses Fortran's "dot_product" intrinsic function inside "do concurrent" blocks and another method that instead uses Fortran' "matmul" array intrinsic function. We plan to investigate automatic compiler offloading of "do concurrent" calculations to GPUs and compile-time substitution of optimized libraries such as the Basic Linear Algebra Library (BLAS) for "matmul" invocations. We also envision the potential for the choice of which method to use could happen at program launch based on in situ performance measurements on any given platform.

Rouson, Damian↗

eddy Users Manual

eddy is a collection of tools - nonlinear solvers, meshing, post-processing, visualization, optimization, etc. - for performing scale-resolving simulations of multi-physics applications. The framework is designed to enable advanced R&D on a variety of topics by leveraging a mature capability for scale resolving simulations, and simultaneously be an appropriate tool for application analysis and support. Currently, eddy is at a relatively low technical readiness level (TRL), and users and developers should maintain appropriate expectations. The technical details behind eddy are outlined in several publications which can be consulted for more information [1–10]. The solvers are built around an unstructured high-order capability, and heavily utilize the tensor product sum-factorization approach for efficiency. The unsteady formulation utilizes a fully implicit space-time approach with a matrix-free Newton- Krylov method. A primitive steady-state solver is available for testing purposes, but is not expected to converge for all but simple verification cases. The Navier-Stokes fluid solvers do not support either RANS or hybrid-RANS capability, only LES and wall-modeled LES approaches. All of the solvers within eddy support three modes of operation: a primal solve of the full nonlinear problem, and two linearization approaches of the primal solve - the ad joint and the tangent solution. Details on how to select and use these three modes are outlined in Sec. 3.

Murman, Scott M.↗

A scalable nonlinear fluid–structure interaction solver based on a Schwarz preconditioner with isogeometric unstructured coarse spaces in 3D

Nonlinear fluid-structure interaction (FSI) problems on unstructured meshes in 3D appear many applications in science and engineering, such as vibration analysis of aircrafts and patient-specific diagnosis of cardiovascular diseases. In this work, we develop a highly scalable, parallel algorithmic and software framework for FSI problems consisting of a nonlinear fluid system and a nonlinear solid system, that are coupled monolithically. The FSI system is discretized by a stabilized finite element method in space and a fully implicit backward difference scheme in time. To solve the large, sparse system of nonlinear algebraic equations at each time step, we propose an inexact Newton-Krylov method together with a multilevel, smoothed Schwarz preconditioner with isogeometric coarse meshes generated by a geometry preserving coarsening algorithm. Here ''geometry'' includes the boundary of the computational domain and the wet interface between the fluid and the solid. We show numerically that the proposed algorithm and implementation are highly scalable in terms of the number of linear and nonlinear iterations and the total compute time on a supercomputer with more than 10,000 processor cores for several problems with hundreds of millions of unknowns.

97 MATHEMATICS AND COMPUTING↗