Search NASA⌕ Search

SEARCH · Search NASA

Results for “implicit method”

Search indexed NASA NTRS and DOE OSTI research on propulsion, heat transfer, battery materials and energy systems. Follow report and document links to the original sources.

Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.

At least 1,207 records · Page 67

High‐order methods for low Reynolds number flows around moving obstacles based on universal meshes

Summary We propose a family of methods for simulating two‐dimensional incompressible, low Reynolds number flow around a moving obstacle whose motion is prescribed. The methods make use of a universal mesh: a fixed background mesh that adapts to the geometry of the immersed obstacle at all times by adjusting a few elements in the neighborhood of the obstacle's boundary. The resulting mesh provides a conforming triangulation of the fluid domain over which discretizations of any desired order of accuracy in space and time can be constructed using standard finite element spaces together with off‐the‐shelf time integrators. We demonstrate the approach by using Taylor‐Hood elements to approximate the fluid velocity and pressure. To integrate in time, we consider implicit Runge‐Kutta schemes as well as a fractional step scheme. We illustrate the methods and study their convergence numerically via examples that involve flow around obstacles that undergo prescribed deformations. Copyright © 2015 John Wiley & Sons, Ltd.

Gawlik, Evan S.↗

Development of iterative techniques for the solution of unsteady compressible viscous flows

Efficient iterative solution methods are being developed for the numerical solution of two- and three-dimensional compressible Navier-Stokes equations. Iterative time marching methods have several advantages over classical multi-step explicit time marching schemes, and non-iterative implicit time marching schemes. Iterative schemes have better stability characteristics than non-iterative explicit and implicit schemes. Thus, the extra work required by iterative schemes can also be designed to perform efficiently on current and future generation scalable, missively parallel machines. An obvious candidate for iteratively solving the system of coupled nonlinear algebraic equations arising in CFD applications is the Newton method. Newton's method was implemented in existing finite difference and finite volume methods. Depending on the complexity of the problem, the number of Newton iterations needed per step to solve the discretized system of equations can, however, vary dramatically from a few to several hundred. Another popular approach based on the classical conjugate gradient method, known as the GMRES (Generalized Minimum Residual) algorithm is investigated. The GMRES algorithm was used in the past by a number of researchers for solving steady viscous and inviscid flow problems with considerable success. Here, the suitability of this algorithm is investigated for solving the system of nonlinear equations that arise in unsteady Navier-Stokes solvers at each time step. Unlike the Newton method which attempts to drive the error in the solution at each and every node down to zero, the GMRES algorithm only seeks to minimize the L2 norm of the error. In the GMRES algorithm the changes in the flow properties from one time step to the next are assumed to be the sum of a set of orthogonal vectors. By choosing the number of vectors to a reasonably small value N (between 5 and 20) the work required for advancing the solution from one time step to the next may be kept to (N+1) times that of a noniterative scheme. Many of the operations required by the GMRES algorithm such as matrix-vector multiplies, matrix additions and subtractions can all be vectorized and parallelized efficiently.

Sankar, Lakshmi N.↗

Finite element methodology for transient conduction/forced-convection thermal analysis

Finite element methodology for steady state thermal analysis of convectively cooled structures has been extended for transient analysis. The finite elements are based on representing the fluid passages by fluid bulk-temperature nodes and fluid-solid interface nodes. The formulation of the finite element equations for a typical flow passage is based on the weighted residual method with upwind weighting functions. Computer implementation of the convective finite element methodology using explicit and implicit time integration algorithms is described. Accuracy and efficiency of the methodology is evaluated by comparisons with analytical solutions and finite-difference lumped-parameter analyses. The comparative analyses demonstrate that finite element conduction/conduction methodology may be used to predict transient temperatures with an accuracy equal or superior to the lumped-parameter finite-difference method.

Thornton, E. A.↗

Efficient Multigrid Reduction-in-Time for Method-of-Lines Discretizations of Linear Advection

Parallel-in-time methods for partial differential equations (PDEs) have been the subject of intense development over recent decades, particularly for diffusion-dominated problems. It has been widely reported in the literature, however, that many of these methods perform quite poorly for advection-dominated problems. In this report we analyze the particular iterative parallel-in-time algorithm of multigrid reduction-in-time (MGRIT) for discretizations of constant-wave-speed linear advection problems. We focus on common method-of-lines discretizations that employ upwind finite differences in space and Runge-Kutta methods in time. Using a convergence framework we developed in previous work, we prove for a subclass of these discretizations that, if using the standard approach of rediscretizing the fine-grid problem on the coarse grid, robust MGRIT convergence with respect to CFL number and coarsening factor is not possible. This poor convergence and non-robustness is caused, at least in part, by an inadequate coarse-grid correction for smooth Fourier modes in space-time known as characteristic components. We propose an alternative coarse-grid operator that provides a better correction of these modes. This coarse-grid operator is related to previous work and uses a semi-Lagrangian discretization combined with an implicitly treated truncation error correction. Theory and numerical experiments show the proposed coarse-grid operator yields fast MGRIT convergence for many of the method-of-lines discretizations considered, including for both implicit and explicit discretizations of high order. Parallel results demonstrate speed-up over sequential time-stepping.

97 MATHEMATICS AND COMPUTING↗

Fully Implicit Monte Carlo (FIMC) (September 2019-September 2020 Progress Report)

This research is focused on applying the NLem method to the full thermal radiative transfer (TRT) equations in the context of a Monte Carlo solution strategy. A framework has been developed for obtaining a solution to the TRT equations using the nonlinear elimination method (NLem) method. Current efforts are focused of the development and verification of the required Monte Carlo algorithm, diffusion algorithm, and material energy solver. Once all three pieces have been verified, the algorithms will then be coupled into a fully functioning method for applying NLem to the TRT equations.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Acceleration of convergence by shifting the spectrum of implicit finite difference operators associated with the equations of gas dynamics

Eigensystem analysis techniques are applied to finite difference formulations of the Navier-Stokes equations in one dimension. Spectra of the resulting implicit difference operators are computed. The largest eigenvalues are calculated by using a combination of the Frechet derivative of the operators and Arnoldi's method. The accuracy of Arnoldi's method is tested by comparing the rate of convergence of the iterative method with the dominant eigenvalue of the original iteration matrix. On the basis of the pattern of eigenvalue distributions for various flow configurations, a shifting of the implicit operators in question is devised. This procedure has improved the rates of convergence of CFD codes by 20 - 50 percent.

Cheer, A.↗

Advances in upwind relaxation methods

Numerical techniques for solving the compressible Euler and Navier-Stokes equations are discussed with an emphasis on characteristic-based schemes. Two popular approaches, flux difference splitting and flux vector splitting, are described in one-dimensional Cartesian coordinates and then extended to three-dimensional generalized coordinates. A technique for increasing the spatial accuracy is presented, followed by a discussion of numerical dissipation mechanisms. An introduction to the use of implicit time integration schemes for accelerating the convergence rate to steady-state solutions including Newton's method, relaxation strategies, and approximate factorization techniques and their implementation on a vector processor concludes the chapter.

Walters, R. W.↗

An efficient solution technique for shockwave-boundary layer interactions with flow separation and slot suction effects

An efficient method for computing two-dimensional compressible Navier-Stokes flow fields is presented. The solution algorithm is a fully-implicit approximate factorization technique based on an unsymmetric line Gauss-Seidel splitting of the equation system Jacobian matrix. Convergence characteristics are improved by the addition of acceleration techniques based on Shamanskii's method for nonlinear equations and Broyden's quasi-Newton update. Characteristic-based differencing of the equations is provided by means of Van Leer's flux vector splitting. In this investigation, emphasis is placed on the fast and accurate computation of shock-wave-boundary layer interactions with and without slot suction effects. In the latter context, a set of numerical boundary conditions for simulating the transpiration flow in an open slot is devised. Both laminar and turbulent cases are considered, with turbulent closure provided by a modified Cebeci-Smith algebraic model. Comparisons with computational and experimental data sets are presented for a variety of interactions, and a fully-coupled simulation of a plenum chamber/inlet flowfield with shock interaction and suction is also shown and discussed.

Edwards, Jack R.↗

Fully coupled hydro-mechanical numerical manifold modeling of porous rock with dominant fractures

Coupled hydro-mechanical (HM) processes are significant in geological engineering such as oil and gas extraction, geothermal energy, nuclear waste disposal and for the safety assessment of dam foundations and rock slopes, where the geological media usually consist of fractured rock masses. We developed a model for the analysis of coupled hydro-mechanical processes in porous rock containing dominant fractures, by using the numerical manifold method (NMM). In the current model, the fractures are regarded as different material domains from surrounding rock, i.e., finite-thickness fracture zones as porous media. Compared with the rock matrix, these fractured porous media are characterized with nonlinear behavior of hydraulic and mechanical properties, involving not only direct (poroelastic) coupling but also indirect (property change) coupling. By combining the potential energy associated with mechanical responses, fluid flow and solid–fluid interactions, a new formulation for direct HM coupling in porous media is established. For indirect coupling associated with fracture opening/closure, we developed a new approach implicitly considering the nonlinear properties by directly assembling the corresponding strain energy. Compared with traditional methods with approximation of the nonlinear constitutive equations, this new formulation achieves a more accurate representation of the nonlinear behavior. We implemented the new model for coupled HM analysis in NMM, which has fixed mathematical grid and accurate integration, and developed a new computer code. We tested the code for direct coupling on two classical poroelastic problems with coarse mesh and compared the results with the analytical solutions, achieving excellent agreement, respectively. We tested for indirect coupling on models with a single dominant fracture and obtained reasonable results. The current poroelastic NNM model with a continuous finite-thickness fracture zone will be further developed considering thin fractures in a discontinuous approach for a comprehensive model for HM analysis in fractured porous rock masses.

58 GEOSCIENCES↗

A Hybrid Boundary Element-Finite Volume Method for Unsteady Transonic Airfoil Flows

A hybrid boundary element finite volume method for unsteady transonic flow computation has been developed. In this method, the unsteady Euler equations in a moving frame of reference are solved in a small embedded domain (inner domain) around the airfoil using an implicit finite volume scheme. The unsteady full-potential equation, written in the same frame of reference and in the form of the Poisson equation. is solved in the outer domain using the integral equation boundary element method to provide the boundary conditions for the inner Euler domain. The solution procedure is a time-accurate stepping procedure, where the outer boundary conditions for the inner domain are updated using the integral equation -- boundary element solution over the outer domain. The method is applied to unsteady transonic flows around the NACA0012 airfoil undergoing pitching oscillation and ramp motion. The results are compared with those of an implicit Euler equation solver, which is used throughout a large computational domain, and experimental data.

Hu, Hong↗

Parallel implicit unstructured grid Euler solvers

A mesh-vertex finite volume scheme for solving the Euler equations on triangular unstructured meshes is implemented on an MIMD (multiple instruction/multiple data stream) parallel computer. An explicit four-stage Runge-Kutta scheme is used to solve two-dimensional flow problems. A family of implicit schemes is also developed to solve these problems, where the linear system that arises at each time step is solved by a preconditioned GMRES algorithm. Two partitioning strategies are employed, one that partitions triangles and the other that partitions vertices. The choice of the preconditioner in a distributed memory setting is discussed. All the methods are compared both in terms of elapsed times and convergence rates. It is shown that the implicit schemes offer adequate parallelism at the expense of minimal sequential overhead. The use of a global coarse grid to further minimize this overhead is also investigated. The schemes are implemented on a distributed memory parallel computer, the iPSC/860.

Venkatakrishnan, V.↗

Implicit neural representations for experimental steering of advanced experiments

Scattering measurements using electrons, neutrons, or photons are essential for obtaining microscopic insights into materials. However, limited facility availability and high-dimensional scattering data necessitate more efficient experimental steering techniques. Here, we report a machine learning method that guides scattering data collection and facilitates real-time estimation of model parameters, given a reliable forward model to simulate experimental signals. We employ implicit neural representations as efficient surrogates that link model parameters with simulated spectroscopies. This enables a Bayesian optimal experimental design framework to estimate the probability distributions of parameters from high-dimensional scattering data. We demonstrate the proposed method using inelastic neutron scattering with simulated and real experimental data, highlighting the method’s ability to provide real-time parameter estimation with quantified uncertainties and to deliver informed experimental guidance that reduces experimental time while maximizing scientific output. This approach paves the way for accelerated discoveries in condensed matter through scattering measurements.

36 MATERIALS SCIENCE↗

An a posteriori residual-based spatial discretization error estimator for S N neutron transport

The “residual source estimator”, an implicit residual-based spatial discretization error estimator for S N neutron transport methods, is introduced. The estimator uses an approximation of the residual as a fixed source for an analogous transport problem whose solution is the error estimate, using the same transport operator as the original numerical solution. The complete derivation of the residual source estimator, the approximation of the residual, and higher-order derivatives is included. The performance of the residual source estimator for 0-order DGFEM is tested against reference solutions. For problems with true solutions discontinuous in the first derivative across the singular characteristics, the residual source estimator is generally accurate, precise, and computationally affordable compared to similar estimators. It suffers in problems where solutions are discontinuous, particularly when the discontinuity inflicts significant inaccuracies on the discrete solution; however, compared to other estimators, which suffer similarly, it remains a competitive option.

42 ENGINEERING↗

Numerical modeling of the SNS H{sup −} ion source

Ion source rf antennas that produce H- ions can fail when plasma heating causes ablation of the insulating coating due to small structural defects such as cracks. Reducing antenna failures that reduce the operating capabilities of the Spallation Neutron Source (SNS) accelerator is one of the top priorities of the SNS H- Source Program at ORNL. Numerical modeling of ion sources can provide techniques for optimizing design in order to reduce antenna failures. There are a number of difficulties in developing accurate models of rf inductive plasmas. First, a large range of spatial and temporal scales must be resolved in order to accurately capture the physics of plasma motion, including the Debye length, rf frequencies on the order of tens of MHz, simulation time scales of many hundreds of rf periods, large device sizes on tens of cm, and ion motions that are thousands of times slower than electrons. This results in large simulation domains with many computational cells for solving plasma and electromagnetic equations, short time steps, and long-duration simulations. In order to reduce the computational requirements, one can develop implicit models for both fields and particle motions (e.g. divergence-preserving ADI methods), various electrostatic models, or magnetohydrodynamic models. We have performed simulations using all three of these methods and have found that fluid models have the greatest potential for giving accurate solutions while still being fast enough to perform long timescale simulations in a reasonable amount of time. We have implemented a number of fluid models with electromagnetics using the simulation tool USim and applied them to modeling the SNS H- ion source. We found that a reduced, single-fluid MHD model with an imposed magnetic field due to the rf antenna current and the confining multi-cusp field generated increased bulk plasma velocities of > 200 m/s in the region of the antenna where ablation is often observed in the SNS source. We report here on comparisons of simulated plasma parameters and code performance using more accurate physical models, such as two-temperature extended MHD models, for both a related benchmark system describing a inductively coupled plasma reactor, and for the SNS ion source. We also present results from scaling studies for mesh generation and solvers in the USim simulation code.

07 ISOTOPE AND RADIATION SOURCES↗

Semantic embedding for quantum algorithms

The study of classical algorithms is supported by an immense understructure, founded in logic, type, and category theory, that allows an algorithmist to reason about the sequential manipulation of data irrespective of a computation’s realizing dynamics. As quantum computing matures, a similar need has developed for an assurance of the correctness of high-level quantum algorithmic reasoning. Parallel to this need, many quantum algorithms have been unified and improved using quantum signal processing (QSP) and quantum singular value transformation (QSVT), which characterize the ability, by alternating circuit ansätze, to transform the singular values of sub-blocks of unitary matrices by polynomial functions. However, while the algebraic manipulation of polynomials is simple (e.g., compositions and products), the QSP/QSVT circuits realizing analogous manipulations of their embedded polynomials are non-obvious. This work constructs and characterizes the runtime and expressivity of QSP/QSVT protocols where circuit manipulation maps naturally to the algebraic manipulation of functional transforms (termed semantic embedding). In this way, QSP/QSVT can be treated and combined modularly, purely in terms of the functional transforms they embed, with key guarantees on the computability and modularity of the realizing circuits. We also identify existing quantum algorithms whose use of semantic embedding is implicit, spanning from distributed search to proofs of soundness in quantum cryptography. The methods used, based in category theory, establish a theory of semantically embeddable quantum algorithms, and provide a new role for QSP/QSVT in reducing sophisticated algorithmic problems to simpler algebraic ones.

Physics↗

Simulation of an inductively coupled plasma with a two-dimensional Darwin particle-in-cell code

A two-dimensional particle-in-cell code for the simulation of low-frequency electromagnetic processes in laboratory plasmas has been developed. The code uses the Darwin method omitting the electromagnetic wave propagation. The Darwin method separates the electric field into solenoidal and irrotational parts. The solenoidal electric field is calculated with a new algorithm based on the equation for the electric field vorticity. The system of linear equations in the new algorithm is readily solved using a standard iterative method. The irrotational electric field is the electrostatic field calculated with the direct implicit algorithm. The code is verified by reproducing the two-stream instability, electron electromagnetic waves, and shear Alfvén waves. The code is applied to simulate an inductively coupled plasma with the driving current flowing around the plasma region. In this simulation, a ring of dense plasma forms at the initial stage but then the density becomes maximal in the center and decays monotonically toward the walls. The skin effect is in the transitional mode between local and non-local, and the electron velocity distribution function is non-Maxwellian.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

A zonal approach to solution of the Euler equations

A technique for the solution of the one- and two-dimensional Euler equations in a partitioned flow field is presented. The field is divided into distinct 'zones', each of which is computed separately. An implicit boundary procedure based on the characteristic propagaion of information and flux splitting methods is applied at the zonal interfaces. Numerical results are presented for both quasi-one-dimensional nozzle flows with shock waves and the unsteady shock-tube problem. These calculations demonstrate the capability of shock propagation through arbitrarily located zonal boundaries in a stable, conservative, and accurate manner. Two-dimensional results include the zonal computation of flows over blunt bodies and airfoils.

Hessenius, K. A.↗

Viscous real gas flowfields about three dimensional configurations

Laminar, real gas hypersonic flowfields over a three dimensional configuration are computed using an unsteady, factored implicit scheme. Local chemical and thermodynamic properties are evaluated by an equilibrium composition method. Transport properties are obtained from individual species properties and application of a mixture rule. Numerical solutions are presented for an ideal gas and equilibrium air for free-stream Mach numbers of 13 and 15 and at various angles of attack. The effect of real gas is to decrease the shock-layer thickness resulting from decreased shock-layer temperatures and corresponding increased density. The combined effects of viscosity and real gas are to increase the subsonic layer near the wall.

Balakrishnan, A.↗