Search NASA⌕ Search

SEARCH · Search NASA

Results for “Numerical 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 55 records · Page 3

A NUMERICAL METHOD FOR STUDYING SUPER-EDDINGTON MASS TRANSFER IN DOUBLE WHITE DWARF BINARIES

We present a numerical method for the study of double white dwarf (DWD) binary systems at the onset of super-Eddington mass transfer. We incorporate the physics of ideal inviscid hydrodynamical flow, Newtonian self-gravity, and radiation transport on a three-dimensional uniformly rotating cylindrical Eulerian grid. Care has been taken to conserve the key physical quantities such as angular momentum and energy. Our new method conserves total energy to a higher degree of accuracy than other codes that are presently being used to model mass transfer in DWD systems. We present the results of verification tests and simulate the first 20 + orbits of a binary system of mass ratio q 0.7 at the onset of dynamically unstable direct impact mass transfer. The mass transfer rate quickly exceeds the critical Eddington limit by many orders of magnitude, and thus we are unable to model a trans-Eddington phase. It appears that radiation pressure does not significantly affect the accretion flow in the highly super-Eddington regime. An optically thick common envelope forms around the binary within a few orbits. Although this envelope quickly exceeds the spatial domain of the computational grid, the fraction of the common envelope that exceeds zero gravitational binding energy is extremely small, suggesting that radiation-driven mass loss is insignificant in this regime. It remains to be seen whether simulations that capture the trans-Eddington phase of such flows will lead to the same conclusion or show that substantial material gets expelled.

79 ASTRONOMY AND ASTROPHYSICS↗

Solving the Bateman equations in CASMO5 using implicit ode numerical methods for stiff systems

The Bateman equations, which describe the transmutation of nuclides over time as a result of radioactive decay, absorption, and fission, are often numerically stiff. This is especially true if short-lived nuclides are included in the system. This paper describes the use of implicit numerical methods for o D Es applied to the stiff Bateman equations, specifically employing the Backward Differentiation Formulas (BDF) form of the linear multistep method. As is true in other domains, using an implicit method removes or lessens the (sometimes severe) step-length constraints by which explicit methods must abide. To gauge its accuracy and speed, the BDF method is compared to a variety of other solution methods, including Runge-Kutta explicit methods and matrix exponential methods such as the Chebyshev Rational Approximation Method (CRAM). A preliminary test case was chosen as representative of a PWR lattice depletion step and was solved with numerical libraries called from a Python front-end. The Figure of Merit (a combined measure of accuracy and efficiency) for the BDF method was nearly identical to that for CRAM, while explicit methods and other matrix exponential approximations trailed behind. The test case includes 319 nuclides, in which the shortest-lived nuclide is {sup 98}Nb with a half-life of 2.86 seconds. Finally, the BDF and CRAM methods were compared within CASMO5, where CRAM had a FOM about four times better than BDF, although the BDF implementation was not fully optimized. (authors)

21 SPECIFIC NUCLEAR REACTORS AND ASSOCIATED PLANTS↗

Novel Numerical Method for Acquiring a Geometrical Description of Nanodielectrics

Nanodielectric electrical insulation has shown promising characteristics in recent years. Potential applications are numerous, ranging from advanced capacitors to optical sensors. To be able to tailor novel materials and determine their full potential, one needs to establish the structure-property-performance relationship in these materials. One such approach is laid out in this study. We have employed a widely used numerical method (the finite element method) to estimate the effective permittivity of an actual binary mixture (a clay-filled nanodielectric) from a two-dimensional transmission electron microscopy image. The obtained effective permittivity was then used to determine the spectral densities for various depolarization factors. We show explicitly that the spectral density resolves the geometrical description in the nanodielectric. As a result, low frequency impedance data can be used as a microscopy technique. We believe that the approach employed here has potential in several fields of science and engineering.

dielectric properties↗

THE FORMATION OF A MILKY WAY-SIZED DISK GALAXY. I. A COMPARISON OF NUMERICAL METHODS

The long-standing challenge of creating a Milky Way- (MW-) like disk galaxy from cosmological simulations has motivated significant developments in both numerical methods and physical models. We investigate these two fundamental aspects in a new comparison project using a set of cosmological hydrodynamic simulations of an MW-sized galaxy. In this study, we focus on the comparison of two particle-based hydrodynamics methods: an improved smoothed particle hydrodynamics (SPH) code Gadget, and a Lagrangian Meshless Finite-Mass (MFM) code Gizmo. All the simulations in this paper use the same initial conditions and physical models, which include star formation, “energy-driven” outflows, metal-dependent cooling, stellar evolution, and metal enrichment. We find that both numerical schemes produce a late-type galaxy with extended gaseous and stellar disks. However, notable differences are present in a wide range of galaxy properties and their evolution, including star-formation history, gas content, disk structure, and kinematics. Compared to Gizmo, the Gadget simulation produced a larger fraction of cold, dense gas at high redshift which fuels rapid star formation and results in a higher stellar mass by 20% and a lower gas fraction by 10% at z = 0, and the resulting gas disk is smoother and more coherent in rotation due to damping of turbulent motion by the numerical viscosity in SPH, in contrast to the Gizmo simulation, which shows a more prominent spiral structure. Given its better convergence properties and lower computational cost, we argue that the MFM method is a promising alternative to SPH in cosmological hydrodynamic simulations.

79 ASTRONOMY AND ASTROPHYSICS↗

An Integrated Numerical Method to Predict the Strain Sensing Behavior of Flexible Conductive Fibers under Electric–Thermal Conditions

Flexible conductive textiles have attracted an increasing amount of attention due to being flexible and stretchable with multi-functions, in addition to the strain sensing function. In this paper, an integrated numerical method is established to predict the strain sensing behavior of PPy-coated flexible conductive fibers. Based on our previous investigation on the strain sensing behavior of the PPy-coated elastic conductive fibers, it has been known that the main strain sensing mechanisms of the conductive fibers are micro-cracks opening under stretching and closing under unloading. Therefore, in the numerical approach, extended finite element method is used to simulate the multi-crack initiation and propagation. Then, by establishing a representative element model including a single crack, the resistance variation with the increase in crack width/depth can be obtained using the electric–thermal package in ABAQUS software. Combining the relationship between crack width and strain, the relationship between fractional increment in resistance (ΔR/R{sub 0}) and the strain can be obtained. The prediction of the fractional increment in resistance (ΔR/R{sub 0}) versus strain is consistent with the experimental results of PPy-coated Lycra fibers. The new integrated method is further verified by experimental results of PPy-coated XLA fibers, showing that the integrated numerical approach can capture the complicated strain sensing mechanisms of PPy-coated elastic fibers and predict the strain sensing behavior of flexible conductive fibers. This approach will make it possible to shorten the period, and reduce the cost in R&D of the PPy-coated electrically conductive fibers, comparing with the corresponding experimental work.

36 MATERIALS SCIENCE↗

Theoretical, experimental and numerical methods for investigating the characteristics of laser radiation scattered in the integrated-optical waveguide with three-dimensional irregularities

We consider theoretical, experimental and numerical methods which make it possible to analyse the key characteristics of laser radiation scattered in the integrated-optical waveguide with three-dimensional irregularities. The main aspects of the three-dimensional vector electrodynamic problem of waveguide scattering are studied. The waveguide light scattering method is presented and its main advantages over the methods of single scattering of laser radiation are discussed. The experimental setup and results of measurements are described. Theoretical and experimental results confirming the validity of the vector theory of three-dimensional waveguide scattering of laser radiation developed by the author are compared for the first time. (fiber and integrated optics)

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Introduction to Numerical Methods [Slides]

These are slides for a lecture for the Parallel Computing Summer Research Internship at the National Security Education Center. This gives an introduction to numerical methods. Repetitive algorithms are used to obtain approximate solutions to mathematical problems, using sorting, searching, root finding, optimization, interpolation, extrapolation, least squares regression, Eigenvalue problems, ordinary differential equations, and partial differential equations. Many equations are shown. Discretizations allow us to approximate solutions to mathematical models of physical systems using a repetitive algorithm and introduce errors that can lead to numerical instabilities if we are not careful.

97 MATHEMATICS AND COMPUTING↗

An Introduction of Numerical Methods for Unconstrained Nonlinear Equations

Many applications in computational physics are nonlinear problems. These nonlinear problems include quantitative object reconstruction problems, inverse transport problems, nuclear weapon design problems, and particle tracking on unstructured meshes. The numerical algorithms used to solve nonlinear equations should be robust, reliable, and efficient. Numerical methods for unconstrained nonlinear equations are introduced in the slides.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

MODELING COLLISIONAL CASCADES IN DEBRIS DISKS: THE NUMERICAL METHOD

We develop a new numerical algorithm to model collisional cascades in debris disks. Because of the large dynamical range in particle masses, we solve the integro-differential equations describing erosive and catastrophic collisions in a particle-in-a-box approach, while treating the orbital dynamics of the particles in an approximate fashion. We employ a new scheme for describing erosive (cratering) collisions that yields a continuous set of outcomes as a function of colliding masses. We demonstrate the stability and convergence characteristics of our algorithm and compare it with other treatments. We show that incorporating the effects of erosive collisions results in a decay of the particle distribution that is significantly faster than with purely catastrophic collisions.

79 ASTRONOMY AND ASTROPHYSICS↗

Numerical methods for the weakly compressible Generalized Langevin Model in Eulerian reference frame

A well established approach for the computation of turbulent flow without resolving all turbulent flow scales is to solve a filtered or averaged set of equations, and to model non-resolved scales by closures derived from transported probability density functions (PDF) for velocity fluctuations. Effective numerical methods for PDF transport employ the equivalence between the Fokker–Planck equation for the PDF and a Generalized Langevin Model (GLM), and compute the PDF by transporting a set of sampling particles by GLM (Pope (1985) [1]). The natural representation of GLM is a system of stochastic differential equations in a Lagrangian reference frame, typically solved by particle methods. A representation in a Eulerian reference frame, however, has the potential to significantly reduce computational effort and to allow for the seamless integration into a Eulerian-frame numerical flow solver. GLM in a Eulerian frame (GLMEF) formally corresponds to the nonlinear fluctuating hydrodynamic equations derived by Nakamura and Yoshimori (2009) [12]. Unlike the more common Landau–Lifshitz Navier–Stokes (LLNS) equations these equations are derived from the underdamped Langevin equation and are not based on a local equilibrium assumption. Similarly to LLNS equations the numerical solution of GLMEF requires special considerations. In this paper we investigate different numerical approaches to solving GLMEF with respect to the correct representation of stochastic properties of the solution. We find that a discretely conservative staggered finite-difference scheme, adapted from a scheme originally proposed for turbulent incompressible flow, in conjunction with a strongly stable (for non-stochastic PDE) Runge–Kutta method performs better for GLMEF than schemes adopted from those proposed previously for the LLNS. We show that equilibrium stochastic fluctuations are correctly reproduced.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Evaluation of the Faraday angle by numerical methods and comparison with the Tore Supra and JET polarimeter electronics

On the Tore Supra tokamak, a far infrared polarimeter diagnostic has been routinely used for diagnosing the current density by measuring the Faraday rotation angle. A high precision of measurement is needed to correctly reconstruct the current profile. To reach this precision, electronics used to compute the phase and the amplitude of the detected signals must have a good resilience to the noise in the measurement. In this article, the analogue card's response to the noise coming from the detectors and their impact on the Faraday angle measurements are analyzed, and we present numerical methods to calculate the phase and the amplitude. These validations have been done using real signals acquired by Tore Supra and JET experiments. These methods have been developed to be used in real-time in the future numerical cards that will replace the Tore Supra present analogue ones.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗

A numerical method for fully resolved simulation (FRS) of rigid particle-flow interactions in complex flows

A fictitious-domain based formulation for fully resolved simulations of arbitrary shaped, freely moving rigid particles in unsteady flows is presented. The entire fluid-particle domain is assumed to be an incompressible, but variable density, fluid. The numerical method is based on a finite-volume approach on a co-located, Cartesian grid together with a fractional step method for variable density, low-Mach number flows. The flow inside the fluid region is constrained to be divergence-free for an incompressible fluid, whereas the flow inside the particle domain is constrained to undergo rigid body motion. In this approach, the rigid body motion constraint is imposed by avoiding the explicit calculation of distributed Lagrange multipliers and is based upon the formulation developed by Patankar [N. Patankar, A formulation for fast computations of rigid particulate flows, Center for Turbulence Research Annual Research Briefs 2001 (2001) 185-196]. The rigidity constraint is imposed and the rigid body motion (translation and rotational velocity fields) is obtained directly in the context of a two-stage fractional step scheme. The numerical approach is applied to both imposed particle motion and fluid-particle interaction problems involving freely moving particles. Grid and time-step convergence studies are performed to evaluate the accuracy of the approach. Finally, simulation of rigid particles in a decaying isotropic turbulent flow is performed to study the feasibility of simulations of particle-laden turbulent flows.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Numerical methods for the inverse problem of density functional theory

Here, the inverse problem of Kohn–Sham density functional theory (DFT) is often solved in an effort to benchmark and design approximate exchange-correlation potentials. The forward and inverse problems of DFT rely on the same equations but the numerical methods for solving each problem are substantially different. We examine both problems in this tutorial with a special emphasis on the algorithms and error analysis needed for solving the inverse problem. Two inversion methods based on partial differential equation constrained optimization and constrained variational ideas are introduced. We compare and contrast several different inversion methods applied to one-dimensional finite and periodic model systems.

97 MATHEMATICS AND COMPUTING↗

Numerical Method Improvements in Griffin for Pebble Bed Reactors with a Focus on the Computation of Burnup

Griffin, a MOOSE (Multiphysics Object-Oriented Simulation Environment) based application targeting transient multiphysics modeling of advanced reactors, has been used recently to model both high-temperature gas-cooled and fluoride-salt-cooled pebble bed reactors (PBRs). Griffin uses deterministic methods for solving neutron transport and an Eulerian approach to model pebble movement. An Eulerian approach is also used to directly compute burnup instead of using a pass approach like other tools such as VSOP or PANGU. This work discusses verification efforts and numerical method improvements related specifically to the Eulerian modeling approach implemented for directly computing pebble burnup.

22 - GENERAL STUDIES OF NUCLEAR REACTORS↗

A Feynman-Kac based numerical method for the exit time probability of a class of transport problems

The exit time probability, which gives the likelihood that an initial condition leaves a prescribed region of the phase space of a dynamical system at, or before, a given time, is arguably one of the most natural and important transport problems. In this work, we present an accurate and efficient numerical method for computing this probability for systems described by non-autonomous (time-dependent) stochastic differential equations (SDEs) or their equivalent Fokker-Planck partial differential equations. The method is based on the direct approximation of the Feynman-Kac formula that establishes a link between the adjoint Fokker-Planck equation and the forward SDE. The Feynman-Kac formula is approximated using the Gauss-Hermite quadrature rules and piecewise cubic Hermite interpolating polynomials, and a GPU accelerated matrix representation is used to compute the entire time evolution of the exit time probability using a single pass of the algorithm. The method is unconditionally stable, exhibits second order convergence in space, first order convergence in time, and it is straightforward to parallelize. Applications are presented to the advection diffusion of a passive tracer in a fluid flow exhibiting chaotic advection, and to the runaway acceleration of electrons in a plasma in the presence of an electric field, collisions, and radiation damping. Benchmarks against analytical solutions as well as comparisons with explicit and implicit finite difference standard methods for the adjoint Fokker-Planck equation are presented.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Numerical Methods for Large-Scale Data Factorization (Final Report (Milestone Date 9/30/11) for Subcontract No. B594099)

The following work has been performed by PI Hans De Sterck and graduate student Manda Winlaw for the required tasks 1-5 (as listed in the Statement of Work). Graduate student Manda Winlaw has visited LLNL January 31-March 11, 2011 and May 23-August 19, 2010, working with Van Henson and Mike O'Hara on non-negative matrix factorizations (NMF). She has investigated the dense subgraph clustering algorithm from 'Finding Dense Subgraphs for Sparse Undirected, Directed, and Bipartite Graphs' by Chen and Saad, testing this method on several term-document matrices and adapting it to cluster based on the rank of the subgraphs instead of the density. Manda Winlaw was awarded a first prize in the annual LLNL summer student poster competition for a poster on her NMF research. PI Hans De Sterck has developed a new adaptive algebraic multigrid algorithm for computing a few dominant or minimal singular triplets of sparse rectangular matrices. This work builds on adaptive algebraic multigrid methods that were further developed by the PI and collaborators (including Sanders and Henson) for Markov chains. The method also combines and extends existing multigrid algorithms for the symmetric eigenproblem. The PI has visited LLNL February 22-25, 2011, and has given a CASC seminar 'Algebraic Multigrid for the Singular Value Problem' on this work on February 23, 2011. During his visit, he has discussed this work and related topics with Van Henson, Geoffrey Sanders, Panayot Vassilevski, and others. He has tested the algorithm on PDE matrices and on a term-document matrix, with promising initial results. Manda Winlaw has also started to work, with O'Hara, on estimating probability distributions over undirected graph edges. The goal is to estimate probabilistic models from sets of undirected graph edges for the purpose of prediction, anomaly detection and support to supervised learning. Graduate student Manda Winlaw is writing a paper on the results obtained with O'Hara which will be submitted some time later in 2011 to a data mining conference. PI Hans De Sterck has developed a new optimization algorithm for canonical tensor approximation, formulating an extension of the nonlinear GMRES method to optimization problems. Numerical results for tensors with up to 8 modes show that this new method is efficient for sparse and dense tensors. He has written a paper on this which has been submitted to the SIAM Journal on Scientific Computing. PI Hans De Sterck has further developed his new optimization algorithm for canonical tensor approximation, formulating an extension in terms of steepest-descent preconditioning, which makes the approach generally applicable for nonlinear optimization. He has written a paper on this extension which has been submitted to Numerical Linear Algebra with Applications.

97 MATHEMATICS AND COMPUTING↗

Reduced-complexity numerical method for optimal gate synthesis

Although quantum computers have the potential to efficiently solve certain problems considered difficult by known classical approaches, the design of a quantum circuit remains computationally difficult. It is known that the optimal gate-design problem is equivalent to the solution of an associated optimal-control problem; the solution to which is also computationally intensive. Hence, in this article, we introduce the application of a class of numerical methods (termed the max-plus curse of dimensionality-free techniques) that determine the optimal control, thereby synthesizing the desired unitary gate. The application of this technique to quantum systems has a growth in complexity that depends on the cardinality of the control-set approximation rather than the much larger growth with respect to spatial dimensions in approaches based on gridding of the space, which is used in previous research. This technique is demonstrated by obtaining an approximate solution for the gate synthesis on SU(4) - a problem that is computationally intractable by grid-based approaches.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Numerical method for computing Maass cusp forms on triply punctured two-sphere

A quantum mechanical system on a punctured surface modeled on hyperbolic space has always been an important subject of research in mathematics and physics. This corresponding quantum system is governed by the Schrödinger equation whose solutions are the Maass waveforms. Spectral studies on these Maass waveforms are known to contain both continuous and discrete eigenvalues. The discrete eigenfunctions are usually called the Maass Cusp Forms (MCF) where their discrete eigenvalues are not known analytically. We introduce a numerical method based on Hejhal and Then algorithm using GridMathematica for computing MCF on a punctured surface with three cusps namely the triply punctured two-sphere. We also report on a pullback algorithm for the punctured surface and a point locater algorithm to facilitate the complete pullback which are essential parts of the main algorithm.

97 MATHEMATICS AND COMPUTING↗