Search NASA⌕ Search

SEARCH · Search NASA

Results for “linear implicitness”

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 541 records · Page 30

Computation of steady and unsteady quasi-one-dimensional viscous/inviscid interacting internal flows at subsonic, transonic, and supersonic Mach numbers

Computations of viscous-inviscid interacting internal flowfields are presented for steady and unsteady quasi-one-dimensional (Q1D) test cases. The unsteady Q1D Euler equations are coupled with integral boundary-layer equations for unsteady, two-dimensional (planar or axisymmetric), turbulent flow over impermeable, adiabatic walls. The coupling methodology differs from that used in most techniques reported previously in that the above mentioned equation sets are written as a complete system and solved simultaneously; that is, the coupling is carried out directly through the equations as opposed to coupling the solutions of the different equation sets. Solutions to the coupled system of equations are obtained using both explicit and implicit numerical schemes for steady subsonic, steady transonic, and both steady and unsteady supersonic internal flowfields. Computed solutions are compared with measurements as well as Navier-Stokes and inverse boundary-layer methods. An analysis of the eigenvalues of the coefficient matrix associated with the quasi-linear form of the coupled system of equations indicates the presence of complex eigenvalues for certain flow conditions. It is concluded that although reasonable solutions can be obtained numerically, these complex eigenvalues contribute to the overall difficulty in obtaining numerical solutions to the coupled system of equations.

Swafford, Timothy W.↗

Exploiting graphical processing units to enable quantum chemistry calculation of large solvated molecules with conductor-like polarizable continuum models

The conductor–like polarizable continuum model (C–PCM) with switching/Gaussian smooth discretization is a widely used implicit solvation model in quantum chemistry. We have previously implemented C–PCM solvation for Hartree–Fock (HF) and density functional theory (DFT) on graphical processing units (GPUs), enabling the quantum mechanical treatment of large solvated biomolecules. Here, we first propose a GPU–based algorithm for the PCM conjugate gradient linear solver that greatly improves the performance for very large molecules. The overhead for PCM–related evaluations now consumes less than 15% of the total runtime for DFT calculations on large molecules. Second, we demonstrate that our algorithms tailored for ground state C–PCM are transferable to excited state properties. Using a single GPU, our method evaluates the analytic gradient of the linear response PCM time–dependent density functional theory energy up to 80× faster than a conventional central processing unit (CPU)–based implementation. In addition, our C–PCM algorithms are transferable to other methods that require electrostatic potential (ESP) evaluations. For example, we achieve speed–ups of up to 130× for restricted ESP–based atomic charge evaluations, when compared to CPU–based codes. As a result, we also summarize and compare the different PCM cavity discretization schemes used in some popular quantum chemistry packages as a reference for both users and developers.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Towards a Scalable Fully-Implicit Fully-coupled Resistive MHD Formulation with Stabilized FE Methods

This paper explores the development of a scalable, nonlinear, fully-implicit stabilized unstructured finite element (FE) capability for 2D incompressible (reduced) resistive MHD. The discussion considers the implementation of a stabilized FE formulation in context of a fully-implicit time integration and direct-to-steady-state solution capability. The nonlinear solver strategy employs Newton-Krylov methods, which are preconditioned using fully-coupled algebraic multilevel preconditioners. These preconditioners are shown to enable a robust, scalable and efficient solution approach for the large-scale sparse linear systems generated by the Newton linearization. Verification results demonstrate the expected order-of-accuracy for the stabilized FE discretization. The approach is tested on a variety of prototype problems, including both low-Lundquist number (e.g., an MHD Faraday conduction pump and a hydromagnetic Rayleigh-Bernard linear stability calculation) and moderately-high Lundquist number (magnetic island coalescence problem) examples. Initial results that explore the scaling of the solution methods are presented on up to 4096 processors for problems with up to 64M unknowns on a CrayXT3/4. Additionally, a large-scale proof-of-capability calculation for 1 billion unknowns for the MHD Faraday pump problem on 24,000 cores is presented.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗

Numerical solution of Euler's equation by perturbed functionals

A perturbed functional iteration has been developed to solve nonlinear systems. It adds at each iteration level, unique perturbation parameters to nonlinear Gauss-Seidel iterates which enhances its convergence properties. As convergence is approached these parameters are damped out. Local linearization along the diagonal has been used to compute these parameters. The method requires no computation of Jacobian or factorization of matrices. Analysis of convergence depends on properties of certain contraction-type mappings, known as D-mappings. In this article, application of this method to solve an implicit finite difference approximation of Euler's equation is studied. Some representative results for the well known shock tube problem and compressible flows in a nozzle are given.

Dey, S. K.↗

Numerical simulation of homogeneous, isotropic, compressible turbulence

A new numerical algorithm is developed and applied to the direct simulation of compressible, homogeneous turbulent flows at low Mach numbers. A split method in time first solves a subset of the equations explicitly, followed by an implicit treatment of the pressure terms. The definition of an average sound speed over the entire field allows the implicit equations to be solved analytically, while relaxing the severe time limit imposed by the large sound speeds. Results from direct simulations on 96(3) grids provide a data base against which a new subgrid-scale model for compressible homogeneous turbulence is tested. This model reduces to the linear combination model in the absence of compressibility.

Erlebacher, G.↗

Numerical simulation of icing, deicing, and shedding

An algorithm has been developed to numerically model the concurrent phenomena of two-dimensional transient heat transfer, ice accretion, ice shedding and ice trajectory which arise from the use of electrothermal pad. The Alternating Direction Implicit method is used to simultaneously solve the heat transfer and accretion equations occurring in the multilayered body covered with ice. In order to model the phase change between ice and water, a technique was used which assumes a phase for each node. This allows the equations to be linearized such that a direct solution is possible. This technique requires an iterative procedure to find the correct phase at each node. The computer program developed to find this solution has been integrated with the NASA-Lewis flow/trajectory code LEWICE.

Wright, W. B.↗

Numerical analysis of a thermal deicer

An algorithm has been developed to numerically model the concurrent phenomena of two-dimensional transient heat transfer, ice accretion and ice shedding which arise from the use of an electrothermal pad. The Alternating Direction Implicit method is used to simultaneously solve the heat transfer and accretion equations occurring in a multilayered body covered with ice. In order to model the phase change between ice and water, a technique was used which assumes a phase for each node. This allows the equations to be linearized such that a direct solution is possible. This technique requires an iterative procedure to find the correct phase at each node. The computer program developed to find this solution has been integrated with the NASA/Lewis flow/trajectory code LEWICE.

Wright, W. B.↗

Boyd Report1

Andrew Crow arrived at Lawrence Livermore National Laboratory with the intention of continuing work on the Complex Particle Kinetic (CPK) method developed D. Larson and D. Hewett. Andrew Crow had previously worked on duplicating the results of D. Hewett in his previous work. Since arrival, A. Crow has been working with D. Larson on a slightly different project. The current method, still under development, is a Particle in Cell (PIC) code with the following features: (1) all particles begin each timestep at a gridpoint; (2) particles are then advanced in time using a standard special advancement method. The exact method has not been decided upon, but there are many reliable methods from which to choose. (3) All particles within each cell undergo a simultaneous implicit collision step. This is the current area of focus. Currently, A. Crow is not aware of any method of performing implicit collisions over a large number of charged particles. Implicit methods for charged particle movement and electron-electron collisions, have been developed. The work of L. pareschi and G. Russo on the Time Relaxed Direct Simulation Monte Carlo method, also appears to be a good basis for implicit particle collisions. (4) Each individual particle will be divided into a set of particles with a Gaussian velocity distribution. This will collect some of the thermal effects created by the collisions. This algorithm has not been created. (5) Particles will be projected on to the grid points. Currently, a linear weighting technique is intended to be used, but has not settled upon. (6) Once on the gridpoints the particle number will be reduced using a set of quadrature points based on the third order velocity moments of the particles. The method proposed by R. Fox has been programmed and shown to conserve energy, momentum and mass to machine precision. In addition to reducing the number of particles this method will work to quiet the simulation it will behave as a higher order version of the Quiet DSMC method proposed by B. Albright et al. (7) These quadrature points then become the new particles for the next timestep. the advantage of this method can be many: The self force on ions can be easily removed since all particles begin on grid points. The size of the timesteps should not be limited by collision rate, and should only be impacted by particle travel time through the cell. The particle reduction technique should keep many of the higher order features of the particle distribution while reducing the number of particles in the system. It should also quite the variance in the system. The two largest unknowns, at this time are, how large a part numerical diffusion will play in the scheme and how computationally expensive each timestep will be.

42 ENGINEERING↗

Implicit unsteady transonic airfoil calculations at supersonic freestreams

The computer code LTRAN2 has been extended to compute unsteady transonic flows about oscillating airfoils with supersonic freestreams. The LTRAN2 code uses an alternating direction implicit (ADI) algorithm to solve the two-dimensional, nonlinear, low-frequency, transonic small-disturbance (LF-TSD) equation. The modified code, LTRAN2-SS, includes a 'high-frequency' option. Steady solutions are checked against those computed by the steady TSD code, TSFOIL; unsteady computations of the linear LF-TSD equation are compared with known linear theory solutions; and new unsteady nonlinear solutions are presented. These cases include standard AGARD test cases for the NLR 7301, MBB-A3, and DO Al supercritical airfoils, as well as several NACA airfoils. The modified code enables aerodynamicists to quickly and efficiently compute transonic flows for both subsonic and supersonic freestreams, and thus resolve flutter boundaries through the full extent of the transonic dip phenomenon.

Chow, L. J.↗

High order sensitivity analysis of complex, coupled systems

The Sobieszczanski-Sobieski (1988) algorithm is extended to include second- and higher-order derivatives while retaining the obviation of finite-differencing of the system analysis. This is accomplished by means of a recursive application of the same implicit function theorem as in the original algorithm. In optimization, the computational cost of the higher-order derivatives is relative to the aggregate cost of analysis together with a repetition of the first-order sensitivity analysis as often as is required to produce the equivalent information by successive linearizations within move limits.

Sobieszczanski-Sobieski, Jaroslaw↗

Towards a Scalable Fully-Implicit Fully-coupled Resistive MHD Formulation with Stabilized FE Methods

This paper presents an initial study that is intended to explore the development of a scalable fully-implicit stabilized unstructured finite element (FE) capability for low-Mach-number resistive MHD. The discussion considers the development of the stabilized FE formulation and the underlying fully-coupled preconditioned Newton-Krylov nonlinear iterative solver. To enable robust, scalable and efficient solution of the large-scale sparse linear systems generated by the Newton linearization, fully-coupled algebraic multilevel preconditioners are employed. Verification results demonstrate the expected order-of-acuracy for the stabilized FE discretization of a 2D vector potential form for the steady and transient solution of the resistive MHD system. In addition, this study puts forth a set of challenging prototype problems that include the solution of an MHD Faraday conduction pump, a hydromagnetic Rayleigh-Bernard linear stability calculation, and a magnetic island coalescence problem. Initial results that explore the scaling of the solution methods are presented on up to 4096 processors for problems with up to 64M unknowns on a CrayXT3/4. Additionally, a large-scale proof-of-capability calculation for 1 billion unknowns for the MHD Faraday pump problem on 24,000 cores is presented.

99 GENERAL AND MISCELLANEOUS↗

A Comparison of Classical and Aggregation-Based Algebraic Multigrid Preconditioners for High-Fidelity Simulation of Wind Turbine Incompressible Flows

This paper presents a comparison of parallel strong scaling performance of classical and aggregation algebraic multigrid (AMG) preconditioners in the context of wind turbine simulations. Fluid motion is governed by the incompressible Navier--Stokes equations, discretized in space with control-volume finite elements and in time with an inexact projection scheme using an implicit integrator. A discontinuous-Galerkin sliding-mesh algorithm captures rotor motion. The momentum equations are solved with iterative Krylov methods, preconditioned by symmetric Gauss--Seidel (SGS) in Trilinos and $\ell_1$ SGS in hypre. The mass-continuity equation is solved with GMRES preconditioned by AMG and can account for the majority of simulation time. Reducing this continuity solve time is crucial. Wind turbine simulations present two unique challenges for AMG preconditioned solvers: the computational meshes include strongly anisotropic elements, and mesh motion requires matrix reinitialization and computation of preconditioners at each time step. Detailed timing profiles are presented and analyzed, and best practices are discussed for both classical and aggregation-based AMG. Results are presented for simulations of two different wind turbines with up to 6 billion grid points on two different computer architectures. For moving mesh problems that require linear-system reinitialization, the well-established strategy of amortizing preconditioner setup costs over a large number of time steps to reduce the solve time is no longer valid. Instead, results show that faster time to solution is achieved by reducing preconditioner setup costs at the expense of linear-system solve costs. Standard smoothed aggregation with Chebyshev relaxation was found to perform poorly when compared with classical AMG in terms of solve time and robustness. However, plain aggregation was comparable to classical AMG.

97 MATHEMATICS AND COMPUTING↗

On the asymptotic preserving property of the unified gas kinetic scheme for the diffusion limit of linear kinetic models

The unified gas kinetic scheme (UGKS) of K. Xu et al. (2010) [37], originally developed for multiscale gas dynamics problems, is applied in this paper to a linear kinetic model of radiative transfer theory. While such problems exhibit purely diffusive behavior in the optically thick (or small Knudsen) regime, we prove that UGKS is still asymptotic preserving (AP) in this regime, but for the free transport regime as well. Moreover, this scheme is modified to include a time implicit discretization of the limit diffusion equation, and to correctly capture the solution in case of boundary layers. Contrary to many AP schemes, this method is based on a standard finite volume approach, it does neither use any decomposition of the solution, nor staggered grids. Several numerical tests demonstrate the properties of the scheme.

97 MATHEMATICS AND COMPUTING↗

Pair and many-body interactions between ligated Au nanoparticles

Here, we report the results of molecular dynamics simulations of the properties of a pseudo-atom (united atom) model of dodecane thiol ligated 5-nm diameter gold nanoparticles (AuNPs) in a vacuum as a function of ligand coverage and particle separation in three states of aggregation, namely, the isolated AuNPs, the isolated pair of AuNPs, and a square lattice of four AuNPs. Our calculations show that the ligand density along a radius emanating from the core of an isolated AuNP has the same gross features for all values of the coverage; it oscillates around a constant value up to a distance along the chain corresponding to the position of the fourth pseudo-atom and then smoothly decays to zero, reflecting both the restricted conformations of the chain near the core surface and the larger numbers of conformations available further from the core. Interaction between two AuNPs generates changes in the ligand distributions of each. We examine the structure and general shape of the ligand envelope as a function of the coverage and demonstrate that the equilibrium structure of the envelope and the deformation of that envelope generated by interaction between the NPs are coverage-dependent so that the shape, depth, and position of the minimum of the potential of mean force display a systematic dependence on the ligand coverage. We propose an accurate analytical description of the calculated potential of mean force as a function of a set of parameters that scale linearly with the ligand coverage. Noting that the conformational freedom of the ligands implies that multiparticle induced deviations from additivity of the pair potential of mean force are likely important; we define and calculate a “bond stretching” effective pair potential of mean force for a square lattice of particles that contains, implicitly, both the three- and four-NP contributions. We find that the bond stretching effective pair potential of mean force in this cluster has a different minimum and a different well depth from the isolated pair potential of mean force. Previous work has found that the three-particle contribution to deviation from pair additivity is monotonically repulsive, whereas we find that the combined three- and four-particle contributions have an attractive well, implying that the three- and four-particle contributions are of comparable magnitude but opposite sign, thereby suggesting that even higher order correction terms likely play a significant role in the behavior of dense assemblies of many nanoparticles.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Industrial Compositional Streamline Simulation for Efficient and Accurate Prediction of Gas Injection and WAG Processes

Gas-injection processes are widely and increasingly used for enhanced oil recovery (EOR). In the United States, for example, EOR production by gas injection accounts for approximately 45% of total EOR production and has tripled since 1986. The understanding of the multiphase, multicomponent flow taking place in any displacement process is essential for successful design of gas-injection projects. Due to complex reservoir geometry, reservoir fluid properties and phase behavior, the design of accurate and efficient numerical simulations for the multiphase, multicomponent flow governing these processes is nontrivial. In this work, we developed, implemented and tested a streamline based solver for gas injection processes that is computationally very attractive: as compared to traditional Eulerian solvers in use by industry it computes solutions with a computational speed orders of magnitude higher and a comparable accuracy provided that cross-flow effects do not dominate. We contributed to the development of compositional streamline solvers in three significant ways: improvement of the overall framework allowing improved streamline coverage and partial streamline tracing, amongst others; parallelization of the streamline code, which significantly improves wall clock time; and development of new compositional solvers that can be implemented along streamlines as well as in existing Eulerian codes used by industry. We designed several novel ideas in the streamline framework. First, we developed an adaptive streamline coverage algorithm. Adding streamlines locally can reduce computational costs by concentrating computational efforts where needed, and reduce mapping errors. Adapting streamline coverage effectively controls mass balance errors that mostly result from the mapping from streamlines to pressure grid. We also introduced the concept of partial streamlines: streamlines that do not necessarily start and/or end at wells. This allows more efficient coverage and avoids the redundant work generally done in the near-well regions. We improved the accuracy of the streamline simulator with a higher order mapping from pressure grid to streamlines that significantly reduces smoothing errors, and a Kriging algorithm is used to map from the streamlines to the background grid. The higher accuracy of the Kriging mapping means that it is not essential for grid blocks to be crossed by one or more streamlines. The higher accuracy comes at the price of increased computational costs, but allows coarser coverage and so does not generally increase the overall costs of the computations. To reduce errors associated with fixing the pressure field between pressure updates, we developed a higher order global time-stepping method that allows the use of larger global time steps. Third-order ENO schemes are suggested to propagate components along streamlines. Both in the two-phase and three-phase experiments these ENO schemes outperform other (higher order) upwind schemes. Application of the third order ENO scheme leads to overall computational savings because the computational grid used can be coarsened. Grid adaptivity along streamlines is implemented to allow sharp but efficient resolution of solution fronts at reduced computational costs when displacement fronts are sufficiently separated. A correction for Volume Change On Mixing (VCOM) is implemented that is very effective at handling this effect. Finally, a specialized gravity operator splitting method is proposed for use in compositional streamline methods that gives an effective correction of gravity segregation. A significant part of our effort went into the development of a parallelization strategy for streamline solvers on the next generation shared memory machines. We found in this work that the built-in dynamic scheduling strategies of OpenMP lead to parallel efficiencies that are comparable to optimal schedules obtained with customized explicit load balancing strategies as long as the ratio of number of streamlines to number of threads is sufficiently high, which is the case in real-field applications. This is an important result, as it eases the transition of serial to parallel streamline codes. The parallel speedup itself depends on the relative contribution of the tracing and mapping stages as compared to the solution of the transport equations along streamlines. As the physical complexity of the simulated 1D transport process increases, the contribution of the less efficient tracing and mapping stages is reduced and near-linear scalabilities can be obtained. Our work clearly shows that the owner approach, in which threads are assigned whole streamlines, is more attractive than a distributed model, in which streamline segments are assigned to threads, because it allows re-use of existing sequential code for the 1D streamline solves, also for implicit time-stepping algorithms.

02 PETROLEUM↗

Numerical Treatment of Degenerate Diffusion Equations via Feller's Boundary Classification, and Applications

A numerical method is devised to solve a class of linear boundary-value problems for one-dimensional parabolic equations degenerate at the boundaries. Feller theory, which classifies the nature of the boundary points, is used to decide whether boundary conditions are needed to ensure uniqueness, and, if so, which ones they are. The algorithm is based on a suitable preconditioned implicit finite-difference scheme, grid, and treatment of the boundary data. Second-order accuracy, unconditional stability, and unconditional convergence of solutions of the finite-difference scheme to a constant as the time-step index tends to infinity are further properties of the method. Several examples, pertaining to financial mathematics, physics, and genetics, are presented for the purpose of illustration.

Cacio, Emanuela↗

High-order partitioned spectral deferred correction solvers for multiphysics problems

We present an arbitrarily high-order, conditionally stable, partitioned spectral deferred correction (SDC) method for solving multiphysics problems using a sequence of pre-existing single-physics solvers. This method extends the work in [1], [2], which used implicit-explicit Runge-Kutta methods (IMEX) to build high-order, partitioned multiphysics solvers. We consider a generic multiphysics problem modeled as a system of coupled ordinary differential equations (ODEs), coupled through coupling terms that can depend on the state of each subsystem; therefore the method applies to both a semi-discretized system of partial differential equations (PDEs) or problems naturally modeled as coupled systems of ODEs. The sufficient conditions to build arbitrarily high-order partitioned SDC schemes are derived. Based on these conditions, various of partitioned SDC schemes are designed. The stability of the first-order partitioned SDC scheme is analyzed in detail on a coupled, linear model problem. We show that the scheme is conditionally stable, and under conditions on the coupling strength, the scheme can be unconditionally stable. We demonstrate the performance of the proposed partitioned solvers on several classes of multiphysics problems with moderate coupling strength. They include a stiff linear system of ODEs, advection-diffusion-reaction systems, and fluid-structure interaction problems with both incompressible and compressible flows, where we verify the design order of the SDC schemes and study various stability properties. We also directly compare the accuracy, stability, and cost of the proposed partitioned SDC solver with the partitioned IMEX method in [1], [2] on this suite of test problems. The results suggest that the high-order partitioned SDC solvers are more robust than the partitioned IMEX solvers for the numerical examples considered in this work, while the IMEX methods require fewer implicit solves.

97 MATHEMATICS AND COMPUTING↗

Fast Solution of Fully Implicit Runge--Kutta and Discontinuous Galerkin in Time for Numerical PDEs, Part II: Nonlinearities and DAEs

Fully implicit Runge--Kutta (IRK) methods have many desirable accuracy and stability properties as time integration schemes, but high-order IRK methods are not commonly used in practice with large-scale numerical PDEs because of the difficulty of solving the stage equations. This paper introduces a theoretical and algorithmic framework for solving the nonlinear equations that arise from IRK methods (and discontinuous Galerkin discretizations in time) applied to nonlinear numerical PDEs, including PDEs with algebraic constraints. Several new linearizations of the nonlinear IRK equations are developed, offering faster and more robust convergence than the often-considered simplified Newton, as well as an effective preconditioner for the true Jacobian if exact Newton iterations are desired. Inverting these linearizations requires solving a set of block 2 x 2 systems. Under quite general assumptions, it is proven that the preconditioned 2 x 2 operator's condition number is bounded by a small constant close to one, independent of the spatial discretization, spatial mesh, and time step, and with only weak dependence on the number of stages or integration accuracy. Moreover, the new method is built using the same preconditioners needed for backward Euler-type time stepping schemes, so can be readily added to existing codes. The new methods are applied to several challenging fluid flow problems, including the compressible Euler and Navier--Stokes equations, and the vorticity-streamfunction formulation of the incompressible Euler and Navier--Stokes equations. Up to 10th-order accuracy is demonstrated using Gauss IRK, while in all cases fourth-order Gauss IRK requires roughly half the number of preconditioner applications as required by standard Singly diagonally implicit Runge--Kutta methods.

97 MATHEMATICS AND COMPUTING↗