Search NASA⌕ Search

SEARCH · Search NASA

Results for “implicit methods”

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,063 records · Page 59

A comparison of two methods for solving 3-D unsteady compressible viscous flows

Numerical solutions of 3D unsteady compressible flows for several steady and unsteady cases are obtained using two procedures - a noniterative Alternating Direction Implicit (ADI) scheme and a Generalized Minimal RESidual (GMRES) method. Results obtained are compared with each other and also with experimental data. It is found that the GMRES procedure can provide significant speedups compared to the noniterative ADI procedure.

Hixon, Ray↗

Implicit and explicit schemes for mass consistency preservation in hybrid particle/finite-volume algorithms for turbulent reactive flows

This work addresses the issue of particle mass consistency in Large Eddy Simulation/Probability Density Function (LES/PDF) methods for turbulent reactive flows. Numerical schemes for the implicit and explicit enforcement of particle mass consistency (PMC) are introduced, and their performance is examined in a representative LES/PDF application, namely the Sandia–Sydney Bluff-Body flame HM1. A new combination of interpolation schemes for velocity and scalar fields is found to better satisfy PMC than multilinear and fourth-order Lagrangian interpolation. A second-order accurate time-stepping scheme for stochastic differential equations (SDE) is found to improve PMC relative to Euler time stepping, which is the first time that a second-order scheme is found to be beneficial, when compared to a first-order scheme, in an LES/PDF application. An explicit corrective velocity scheme for PMC enforcement is introduced, and its parameters optimized to enforce a specified PMC criterion with minimal corrective velocity magnitudes.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Treecode-based generalized Born method

We have developed a treecode-based O(N log N) algorithm for the generalized Born (GB) implicit solvation model. Our treecode-based GB (tGB) is based on the GBr6 [J. Phys. Chem. B 111, 3055 (2007)], an analytical GB method with a pairwise descreening approximation for the R6 volume integral expression. The algorithm is composed of a cutoff scheme for the effective Born radii calculation, and a treecode implementation of the GB charge–charge pair interactions. Test results demonstrate that the tGB algorithm can reproduce the vdW surface based Poisson solvation energy with an average relative error less than 0.6% while providing an almost linear-scaling calculation for a representative set of 25 proteins with different sizes (from 2815 atoms to 65456 atoms). For a typical system of 10k atoms, the tGB calculation is three times faster than the direct summation as implemented in the original GBr6 model. Thus, our tGB method provides an efficient way for performing implicit solvent GB simulations of larger biomolecular systems at longer time scales.

59 BASIC BIOLOGICAL SCIENCES↗

An FFT-based approach for Bloch wave analysis: application to polycrystals

A method based on the Fast Fourier Transform is proposed to obtain the dispersion relation of acoustic waves in heterogeneous periodic media with arbitrary microstructures. The microstructure is explicitly considered using a voxelized Representative Volume Element (RVE). The dispersion diagram is obtained solving an eigenvalue problem for Bloch waves in Fourier space. To this aim, two linear operators representing stiffness and mass are defined through the use of differential operators in Fourier space. The smallest eigenvalues are obtained using the implicitly restarted Lanczos and the subspace iteration methods, and the required inverse of the stiffness operator is done using the conjugate gradient with a preconditioner. The method is used to study the propagation of acoustic waves in elastic polycrystals, showing the strong effect of crystal anistropy and polycrystaline texture on the propagation. It is shown that the method combines the simplicity of classical Fourier series analysis with the versatility of Finite Elements to account for complex geometries proving an efficient and general approach which allows the use of large RVEs in 3D.

97 MATHEMATICS AND COMPUTING↗

Fractional Step and Pseudocompressibility Methods for the Solution of Incompressible Navier-Stokes Equations

The fractional step and the pseudocompressibility methods for the solution of the incompressible Navier-Stokes equations are outlined. The fractional step method is based on finite-volume formulation and uses the pressure and the volume fluxes across the faces of each cell as dependent variables. The momentum equations are solved implicitly and the Poisson equation for the pressure is solved by using the multigrid method. The pseudocompressibility approach uses an implicit-higher-order-upwind differencing scheme for the convective terms together with the Gauss-Seidel line relaxation method. The dependent variables in the pseudocompressibility approach are the pressure and the cartesian velocity components in unstaggered mesh orientation. The 90-degree square duct flow, the wing-tip vortex wake flow and unsteady turbulent flows over an oscillating NACA 0015 airfoil are computed using both the fractional step and the pseudocompressibility methods. The results obtained from two different schemes are compared against experimental measurements.

Kiris, Cetin↗

Considering computational speed vs. accuracy: Choosing appropriate mesoscale RVE boundary conditions

Modeling a material’s microstructure using continuum theories allows for inspection of the relationship between coarse scale and fine scale behaviors. Computational limits generally require selection of a sub-volume from a bulk sample in order to directly model the microstructure. Boundary conditions are applied to the sub-volume to mimic the excluded bulk material. Appropriate selection of boundary conditions helps effectively determine the appropriate spatial scale required of the sub-volume. Applicable boundary conditions include direct displacement, periodic, and uniform traction. While direct displacement and periodic boundary conditions are commonly used, uniform traction boundary conditions have seen limited use due to rigid body stability issues in simulations of compression or shear deformation. A new application of uniform traction boundary conditions was developed through linear constraint equations, similar to approaches employed by direct displacement and periodic boundary conditions, to quench rigid body motions with minimal interference of the relative deformation of the model. These boundary conditions were tested by compressing several synthetically generated periodic microstructures using the finite element method. Evaluating the effective stiffness along the compression axis, the direct displacement boundary condition produced the stiffest response, whereas the uniform traction boundary condition produced the most compliant. Periodic boundary conditions produced the same response for all volumes analyzed and both the direct displacement and uniform traction boundary conditions trended toward the periodic response as the domain volume increased. Computational performance was also evaluated for each boundary condition using implicit and explicit solvers. Direct displacement boundary conditions presented the lowest computational cost of all of the boundary conditions followed by periodic then uniform traction. The computational expense of periodic and uniform traction boundary conditions limited the viable spatial scale and mesh resolutions able to be simulated. Selection of appropriate boundary conditions for specific uses need to be a balance between allowable computational expense and accuracy of the method. Techniques for evaluating which boundary conditions to use are discussed.

42 ENGINEERING↗

Viscous analysis of three-dimensional rotor flows using a multigrid method

A three-dimensional code for rotating blade-row flow analysis was developed. The space discretization uses a cell-centered scheme with eigenvalues scaling for the artificial dissipation. The computational efficiency of a four-stage Runge-Kutta scheme is enhanced by using variable coefficients, implicit residual smoothing, and a full-multigrid method. An application is presented for the NASA rotor 67 transonic fan. Due to the blade stagger and twist, a zonal, non-periodic H-type grid is used to minimize the mesh skewness. The calculation is validated by comparing it with experiments in the range from the maximum flow rate to a near-stall condition. A detailed study of the flow structure near peak efficiency and near stall is presented by means of pressure distribution and particle traces inside boundary layers.

Arnone, A.↗

Time-marching methods for three-dimensional steady and unsteady viscous imcompressible flows

An implicit algorithm for the solution of three-dimensional, steady and unsteady, viscous, incompressible flows is presented. The algorithm is based on an upwind-relaxation finite-difference method. Steady-state solutions are carried out using a time-marching solution technique in combination with a local time-stepping strategy. To obtain time-accurate solutions, a subiterative procedure is employed at each physical time step using a global time step to ensure the divergence-free condition. Steady-state flows in several straight ducts and in a square duct with a 90-degree bend are computed and compared with analytical and experimental results. The classical problem of starting flow in a circular pipe is chosen to verify the time accuracy of the present scheme. Finally, the three-dimensional bubble-type vortex breakdown of a slender cylindrical vortex in an unbounded flow is investigated.

Hsu, C.-H.↗

Liquid Phase Modeling in Porous Media: Adsorption of Methanol and Ethanol in H-MFI in Condensed Water

Zeolites are used in the chemical and separation industries for their exceptional selectivity, adsorption capacity, regenerability, and stability in gas and liquid phase processing. Here, we developed an explicit solvation method for predicting solvent/condensed phase effects on adsorption free energies in microporous media such as zeolites based on the hybrid quantum mechanical/molecular mechanical free energy perturbation (QM/MM-FEP) technique. Our explicit solvation method for zeolite systems, called eSZS, aims to capture site-specific interactions during the adsorption process at the Brønsted acid sites of H-MFI zeolite while still considering the diverse configuration space of the solvent molecules. This strategy is ideal for chemical reactions or adsorbates that interact with the microporous medium in few distinct adsorbate/transition state configurations, i.e., the harmonic or similar approximations are acceptable for the adsorbate/transition state while such approximations break down for the solvent molecules that require extensive configuration space sampling. In this way, our approach effectively overcomes the limitations of implicit solvation models and classical force field methods for describing solvation effects on chemical reactions within porous materials such as zeolites. Specifically, in this study, we investigated various aspects of our hybrid QM/MM approach, including QM cluster size dependencies in a periodic electrostatically embedded cluster model (PEECM), rules for link atoms at the QM/MM boundary, and functional and basis set considerations for converged and reasonably accurate gas and aqueous phase methanol and ethanol adsorption free energy predictions in H-MFI. For gas phase adsorption of methanol and ethanol in H-MFI at a Brønsted acid site in T12 position, we compute adsorption free energies at 298 K of −0.61 and −0.75 eV, respectively, using a PEECM containing 50 Si and 1 Al atom with ωB97x-D/def2-TZVP level of theory. For solvent effect calculations, we sample the aqueous phase using grand canonical Monte Carlo (GCMC) simulations to (1) obtain a mean field of electrostatic interactions in the reaction system and (2) perform a rigorous free energy perturbation calculation. Similar to the experimentally and computationally observed endergonic solvation effects observed for hydrocarbon adsorption on metal surfaces, we also observe that a condensed aqueous environment destabilizes methanol and ethanol at these acid sites in H-MFI at 298 K. Specifically, the computed solvation free energies of adsorption (ΔΔG solv ) for methanol and ethanol are +0.44 and +0.54 eV, respectively. From this study, it is evident that adsorbates (methanol and ethanol) are competing with water for adsorption space inside the H-MFI zeolite, leading to an endergonic solvation effect. Here, we expect that the endergonic, aqueous solvent effect during adsorption in microporous zeolites is highly tunable by changing the pore size and hydrophobicity of the microporous material as this will affect the water density inside the pore structure.

Adsorption↗

High order finite difference and multigrid methods for spatially evolving instability in a planar channel

The fourth-order finite-difference scheme with fully implicit time-marching presently used to computationally study the spatial instability of planar Poiseuille flow incorporates a novel treatment for outflow boundary conditions that renders the buffer area as short as one wavelength. A semicoarsening multigrid method accelerates convergence for the implicit scheme at each time step; a line-distributive relaxation is developed as a robust fast solver that is efficient for anisotropic grids. Computational cost is no greater than that of explicit schemes, and excellent agreement with linear theory is obtained.

Liu, C.↗

Scalable edge clustering of dynamic graphs via weighted line graphs

Timestamped relational datasets consisting of records (or connections) between pairs of entities are ubiquitous in network science. For applications like peer-to-peer communication, email, various social network interactions, and computer network security, it is useful to organize these records into groups based on how and when they are occurring. Weighted line graphs offer a natural way to model how records are related in such datasets but for large real-world graph topologies, building and utilizing the line graph is prohibitively expensive. Here, we present the framework to cluster the edges of a dynamic graph via the associated line graph that contains two major contributions. The first is a method to work with the line graph implicitly and the second is a distributed scale implementation of an agglomerative hierarchical graph clustering algorithm. We outline a novel hierarchical dynamic graph edge clustering approach that efficiently breaks massive relational datasets into small sets of edges containing events at various timescales. This is in stark contrast to traditional graph clustering algorithms that prioritize highly connected (clique-like) community structures. Our approach relies on constructing a sufficient subgraph of a weighted line graph and applying a hierarchical agglomerative clustering. This approach is related to scalable techniques from spatial clustering, nonlinear-dimension reduction, topological data analysis, and draws particular inspiration from HDBSCAN. As an edge clustering, this method yields an overlapping node clustering. Our algorithm is parallelizable and we demonstrate efficient clustering of a billion-scale, real-world dynamic graph into small edge sets that correlate in topology and time. The entire clustering process for a graph with tens of billions of edges takes just a few minutes of run time on 256 nodes of a distributed compute environment. We argue how the output of the edge clustering is useful for a multitude of data visualization and powerful machine learning tasks, both involving the original massive dynamic graph data and metadata associated with the nodes and edges. Finally, we describe how this approach can be extended to dynamic hypergraphs and dynamic graphs/hypergraphs with unstructured data living on vertices and edges.

Data Analysis↗

Reducing the Spatial Discretization Error of Thermal Emission in Implicit Monte Carlo Simulations

Implicit Monte Carlo simulations of thermal radiative transport can exhibit what is known as teleportation error in problems with strong coupling between radiation and matter. Teleportation error occurs when energy deposited in a localized region of a spatial zone is emitted throughout the zone in the next time step. Teleportation error is commonly reduced by biasing the positions of photon thermal emission using a fit to the spatial distribution of temperature to the fourth power. The current work samples and stores locations along photon paths based on absorption probabilities. These locations are used as sites for emission in the subsequent time step. This method of teleportation correction is demonstrated in several sample problems, and is validated against an Implicit Monte Carlo Diffusion Method, which does not exhibit teleportation error. We report the new method reduces teleportation error relative to the source tilting method, and enables the use of lower spatial resolutions than would be required to mitigate teleportation error using the source tilting method.

97 MATHEMATICS AND COMPUTING↗

Schwarz-Based Algorithms for Compressible Flows

We investigate in this paper the application of Schwarz-based algorithms to compressible flows. First we study the combination of these methods with defect-correction procedures. We then study the effect on the Schwarz-based methods of replacing the explicit treatment of the boundary conditions by an implicit one. In the last part of this paper we study the combination of these methods with Newton-Krylov matrix-free methods. Numerical experiments that show the performance of our approaches are then presented.

Tidriri, M. D.↗

On the accuracy of the pseudocompressibility method in solving the incompressible Navier-Stokes equations

The method of pseudocompressibility is tested for its accuracy in solving the incompressible Navier-Stokes equations. An implicit, finite difference computer code is used to solve the equations in a three-dimensional, curvilinear coordinate system. The code employs artificial compressibiity for solving the pressure field, coupled with an implicit, approximate factorization scheme. This coupling is known as the pseudocompressibility method and introduces pressure waves of finite speed into the fluid medium that would otherwise have an infinite sound speed. The waves die out as the solution converges, and the steady state solution approaches a divergence-free condition. These waves, however, limit the time accuracy of the computations. The effects of these waves are analysed and criteria are set for choosing the pseudocompressibility parameter that governs the pressure wave speed; test cases are presented that verify these criteria. The code is tested by computing laminar flow over a two-dimensional, backward-facing step and over a two-dimensional, impulsively started circular cylinder.

Rogers, S. E.↗

First and second order operator splitting methods for the phase field crystal equation

In this paper, we present operator splitting methods for solving the phase field crystal equation which is a model for the microstructural evolution of two-phase systems on atomic length and diffusive time scales. A core idea of the methods is to decompose the original equation into linear and nonlinear subequations, in which the linear subequation has a closed-form solution in the Fourier space. We apply a nonlinear Newton-type iterative method to solve the nonlinear subequation at the implicit time level and thus a considerably large time step can be used. By combining these subequations, we achieve the first- and second-order accuracy in time. We present numerical experiments to show the accuracy and efficiency of the proposed methods.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Entropy viscosity method applied to Euler equations

The entropy viscosity method [4] has been successfully applied to hyperbolic systems of equations such as Burgers equation and Euler equations. The method consists in adding dissipative terms to the governing equations, where a viscosity coefficient modulates the amount of dissipation. The entropy viscosity method has been applied to the 1-D Euler equations with variable area using a continuous finite element discretization in the MOOSE framework and our results show that it has the ability to efficiently smooth out oscillations and accurately resolve shocks. Two equations of state are considered: Ideal Gas and Stiffened Gas Equations Of State. Results are provided for a second-order time implicit schemes (BDF2). Some typical Riemann problems are run with the entropy viscosity method to demonstrate some of its features. Then, a 1-D convergent-divergent nozzle is considered with open boundary conditions. The correct steady-state is reached for the liquid and gas phases with a time implicit scheme. The entropy viscosity method correctly behaves in every problem run. For each test problem, results are shown for both equations of state considered here. (authors)

97 MATHEMATICS AND COMPUTING↗

Implicit Space-Time Conservation Element and Solution Element Schemes

Artificial numerical dissipation is in important issue in large Reynolds number computations. In such computations, the artificial dissipation inherent in traditional numerical schemes can overwhelm the physical dissipation and yield inaccurate results on meshes of practical size. In the present work, the space-time conservation element and solution element method is used to construct new and accurate implicit numerical schemes such that artificial numerical dissipation will not overwhelm physical dissipation. Specifically, these schemes have the property that numerical dissipation vanishes when the physical viscosity goes to zero. These new schemes therefore accurately model the physical dissipation even when it is extremely small. The new schemes presented are two highly accurate implicit solvers for a convection-diffusion equation. The two schemes become identical in the pure convection case, and in the pure diffusion case. The implicit schemes are applicable over the whole Reynolds number range, from purely diffusive equations to convection-dominated equations with very small viscosity. The stability and consistency of the schemes are analysed, and some numerical results are presented. It is shown that, in the inviscid case, the new schemes become explicit and their amplification factors are identical to those of the Leapfrog scheme. On the other hand, in the pure diffusion case, their principal amplification factor becomes the amplification factor of the Crank-Nicolson scheme.

Chang, Sin-Chung↗

Using Bond Graphs for Articulated, Flexible Multi-bodies, Sensors, Actuators, and Controllers with Application to the International Space Station

Conceptually, modeling of flexible, multi-body systems involves a formulation as a set of time-dependent partial differential equations. However, for practical, engineering purposes, this modeling is usually done using the method of Finite Elements, which approximates the set of partial differential equations, thus generalizing the approach to all continuous media. This research investigates the links between the Bond Graph method and the classical methods used to develop system models and advocates the Bond Graph Methodology and current bond graph tools as alternate approaches that will lead to a quick and precise understanding of a flexible multi-body system under automatic control. For long endurance, complex spacecraft, because of articulation and mission evolution the model of the physical system may change frequently. So a method of automatic generation and regeneration of system models that does not lead to implicit equations, as does the Lagrange equation approach, is desirable. The bond graph method has been shown to be amenable to automatic generation of equations with appropriate consideration of causality. Indeed human-interactive software now exists that automatically generates both symbolic and numeric system models and evaluates causality as the user develops the model, e.g. the CAMP-G software package. In this paper the CAMP-G package is used to generate a bond graph model of the International Space Station (ISS) at an early stage in its assembly, Zvezda. The ISS is an ideal example because it is a collection of bodies that are articulated, many of which are highly flexible. Also many reaction jets are used to control translation and attitude, and many electric motors are used to articulate appendages, which consist of photovoltaic arrays and composite assemblies. The Zvezda bond graph model is compared to an existing model, which was generated by the NASA Johnson Space Center during the Verification and Analysis Cycle of Zvezda.

Montgomery, Raymond C.↗