Search NASA⌕ Search

SEARCH · Search NASA

Results for “approximate computing”

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 505 records · Page 28

Building and destroying symmetry in 1-D elastic systems

Locally periodic rods, which show approximate invariance with respect to translations, are constructed by joining N unit cells. The spectrum then shows a band spectrum. We then break the local periodicity by including one or more defects in the system. When the defects follow a certain definite prescription, an analog of the Wannier-Stark ladders is gotten; when the defects are random, an elastic rod showing Anderson localization is obtained. In all cases experimental values match the theoretical predictions.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Fourier analysis of cell-wise Block-Jacobi splitting in two-dimensional geometry

A Fourier analysis is conducted in two-dimensional (2D) geometry for the discrete-ordinates (SN) approximation of the neutron transport problem solved with Richardson iteration (Source Iteration) using the cell-wise Block-Jacobi (B1) algorithm. The results of the Fourier analysis show that convergence of cell-wise BJ can degrade, leading to a spectral radius equal to 1, in problems containing optically thin cells. For problems containing cells that are optically thick, instead, the spectral radius tends to O. Hence, in the optically thick-cell regime, cell-wise BJ is rapidly convergent even for problems that are scattering dominated, with a scattering ratio c close to I.

97 MATHEMATICS AND COMPUTING↗

Evaluation of the use of color-set geometry during lattice physics constants generation for boiling water reactor simulation

Current methods for BWR nuclear design and analysis consist of using lattice physics neutron transport methods to generate the two-group homogenized cross-sections that are then used in a nodal diffusion theory code. The lattice transport solutions are performed for a single assembly with reflective boundary conditions, which is a practical approximation. A method is developed to account for assembly exposure distributions (environment) in the core within the lattice transport calculations with the use of color-sets (2x2) geometry. The loading pattern is examined and an appropriate number of characteristic color-set cells are selected for analysis. Treatment of the co-resident exposed fuel within this method is also presented. The calculation process was followed for a recent BWR cycle design with comparisons being performed on both a lattice and core-wide basis to evaluate the proposed method. The lattice based comparisons show noticeable differences in the pin power distribution predictions, which require further investigation to see how this translates into core performance calculations. The core-wide comparisons show minor differences and are generally in a good agreement, which is expected with this small perturbation. A slight improvement was noticed in the reduction of the power distribution uncertainty. However, given the additional amount of work and computer run time increase, further evaluation, especially of core pin power predictions, is needed to consider this method for production level design and safety analysis calculations. (authors)

21 SPECIFIC NUCLEAR REACTORS AND ASSOCIATED PLANTS↗

ASSESSING MAGNETIC TORQUES AND ENERGY FLUXES IN CLOSE-IN STAR–PLANET SYSTEMS

Planets in close-in orbit interact with the magnetized wind of their hosting star. This magnetic interaction was proposed to be a source for enhanced emissions in the chromosphere of the star, and to participate in setting the migration timescale of the close-in planet. The efficiency of the magnetic interaction is known to depend on the magnetic properties of the host star and of the planet, and on the magnetic topology of the interaction. We use a global, three-dimensional numerical model of close-in star–planet systems, based on the magnetohydrodynamics approximation, to compute a grid of simulations for varying properties of the orbiting planet. We propose a simple parametrization of the magnetic torque that applies to the planet, and of the energy flux generated by the interaction. The dependency upon the planet properties and the wind properties is clearly identified in the derived scaling laws, which can be used in secular evolution codes to take into account the effect of magnetic interactions in planet migration. They can also be used to estimate a potential magnetic source of enhanced emissions in observed close-in star–planet systems, in order to constrain observationally possible exoplanetary magnetic fields.

79 ASTRONOMY AND ASTROPHYSICS↗

A Hybrid Monte Carlo-Deterministic Method for Global Binary Stochastic Medium Transport Problems

Global deep-penetration transport problems are difficult to solve using traditional Monte Carlo techniques. In these problems, the scalar flux distribution is desired at all points in the spatial domain (global nature), and the scalar flux typically drops by several orders of magnitude across the problem (deep-penetration nature). As a result, few particle histories may reach certain regions of the domain, producing a relatively large variance in tallies in those regions. Implicit capture (also known as survival biasing or absorption suppression) can be used to increase the efficiency of the Monte Carlo transport algorithm to some degree. A hybrid Monte Carlo-deterministic technique has previously been developed by Cooper and Larsen to reduce variance in global problems by distributing particles more evenly throughout the spatial domain. This hybrid method uses an approximate deterministic estimate of the forward scalar flux distribution to automatically generate weight windows for the Monte Carlo transport simulation, avoiding the necessity for the code user to specify the weight window parameters. In a binary stochastic medium, the material properties at a given spatial location are known only statistically. The most common approach to solving particle transport problems involving binary stochastic media is to use the atomic mix (AM) approximation in which the transport problem is solved using ensemble-averaged material properties. The most ubiquitous deterministic model developed specifically for solving binary stochastic media transport problems is the Levermore-Pomraning (L-P) model. Zimmerman and Adams proposed a Monte Carlo algorithm (Algorithm A) that solves the Levermore-Pomraning equations and another Monte Carlo algorithm (Algorithm B) that is more accurate as a result of improved local material realization modeling. Recent benchmark studies have shown that Algorithm B is often significantly more accurate than Algorithm A (and therefore the L-P model) for deep penetration problems such as examined in this paper. In this research, we investigate the application of a variant of the hybrid Monte Carlo-deterministic method proposed by Cooper and Larsen to global deep penetration problems involving binary stochastic media. To our knowledge, hybrid Monte Carlo-deterministic methods have not previously been applied to problems involving a stochastic medium. We investigate two approaches for computing the approximate deterministic estimate of the forward scalar flux distribution used to automatically generate the weight windows. The first approach uses the atomic mix approximation to the binary stochastic medium transport problem and a low-order discrete ordinates angular approximation. The second approach uses the Levermore-Pomraning model for the binary stochastic medium transport problem and a low-order discrete ordinates angular approximation. In both cases, we use Monte Carlo Algorithm B with weight windows automatically generated from the approximate forward scalar flux distribution to obtain the solution of the transport problem.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Canards in a minimal piecewise-linear square-wave burster

We construct a piecewise-linear (PWL) approximation of the Hindmarsh-Rose (HR) neuron model that is minimal, in the sense that the vector field has the least number of linearity zones, in order to reproduce all the dynamics present in the original HR model with classical parameter values. This includes square-wave bursting and also special trajectories called canards, which possess long repelling segments and organise the transitions between stable bursting patterns with n and n + 1 spikes, also referred to as spike-adding canard explosions. We propose a first approximation of the smooth HR model, using a continuous PWL system, and show that its fast subsystem cannot possess a homoclinic bifurcation, which is necessary to obtain proper square-wave bursting. We then relax the assumption of continuity of the vector field across all zones, and we show that we can obtain a homoclinic bifurcation in the fast subsystem. We use the recently developed canard theory for PWL systems in order to reproduce the spike-adding canard explosion feature of the HR model as studied, e.g., in Desroches et al., Chaos 23(4), 046106 (2013).

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Time scales of spike-train correlation for neural oscillators with common drive

We examine the effect of the phase-resetting curve on the transfer of correlated input signals into correlated output spikes in a class of neural models receiving noisy superthreshold stimulation. We use linear-response theory to approximate the spike correlation coefficient in terms of moments of the associated exit time problem and contrast the results for type I vs type II models and across the different time scales over which spike correlations can be assessed. We find that, on long time scales, type I oscillators transfer correlations much more efficiently than type II oscillators. On short time scales this trend reverses, with the relative efficiency switching at a time scale that depends on the mean and standard deviation of input currents. This switch occurs over time scales that could be exploited by downstream circuits.

97 MATHEMATICS AND COMPUTING↗

Poisson-Nernst-Planck equations for simulating biomolecular diffusion-reaction processes I: Finite element solutions

In this paper we developed accurate finite element methods for solving 3-D Poisson-Nernst-Planck (PNP) equations with singular permanent charges for simulating electrodiffusion in solvated biomolecular systems. The electrostatic Poisson equation was defined in the biomolecules and in the solvent, while the Nernst-Planck equation was defined only in the solvent. We applied a stable regularization scheme to remove the singular component of the electrostatic potential induced by the permanent charges inside biomolecules, and formulated regular, well-posed PNP equations. An inexact-Newton method was used to solve the coupled nonlinear elliptic equations for the steady problems; while an Adams-Bashforth-Crank-Nicolson method was devised for time integration for the unsteady electrodiffusion. We numerically investigated the conditioning of the stiffness matrices for the finite element approximations of the two formulations of the Nernst-Planck equation, and theoretically proved that the transformed formulation is always associated with an ill-conditioned stiffness matrix. We also studied the electroneutrality of the solution and its relation with the boundary conditions on the molecular surface, and concluded that a large net charge concentration is always present near the molecular surface due to the presence of multiple species of charged particles in the solution. The numerical methods are shown to be accurate and stable by various test problems, and are applicable to real large-scale biophysical electrodiffusion problems.

97 MATHEMATICS AND COMPUTING↗

An improved resonance self-shielding method for heterogeneous fast reactor assembly and core calculations

An improved resonance self-shielding method has been developed to accurately estimate the effective multigroup cross sections for heterogeneous fast reactor assembly and core calculations. In the method, the heterogeneity effect is considered by the use of isotopic escape cross sections while the resonance interference effect is accounted for through the narrow resonance approximation or slowing-down calculations for specific compositions. The isotopic escape cross sections are calculated by solving fixed-source transport equations with the method of characteristics for the whole problem domain. This method requires no pre-calculated resonance integral tables or parameters that are typically necessary in the subgroup method. Preliminary results for multi pin-cell fast reactor problems show that the escape cross sections estimated from the explicit-geometry fixed source calculations produce more accurate eigenvalue and self-shielded effective cross sections than those from conventional one-dimensional geometry models. (authors)

22 GENERAL STUDIES OF NUCLEAR REACTORS↗

Two-Sided Semi-Local Smoothing Splines

A semi-local smoothing spline of degree n and class C{sup p} is a function defined on an interval, having p continuous derivatives on that interval, and coinciding with a polynomial of degree n on the subintervals forming its partition. The domain of each polynomial is a subinterval on which m + 1 values of the approximated function are given, but in order to construct the polynomial, it is necessary to know M ≥ m + 1 values (m and M are determined by the class and the degree of the spline). The additional values can be borrowed from the adjacent subintervals. When constructing an S-spline in the periodic case, the problem of additional values is solved on the basis of periodicity, but in the nonperiodic case, one is expected to define the lacking values of a function beyond the domain. The present paper is aimed at nonperiodic two-sided S-splines whose construction does not require additional data.

97 MATHEMATICS AND COMPUTING↗

On the convergence of difference schemes for the equations of ocean dynamics

The difference scheme which approximates the equations of large-scale ocean dynamics in a unit cube to the second degree in the space variables is investigated. It is shown that the solutions converge to the solution of the differential problem. Namely, under the assumption that the solution is sufficiently smooth it is proved that (max)/0{<=}m{<=}M||u(m{tau})-v{sup m}||=O({tau}+h{sup 3/2}), M{tau}=T, where ||{center_dot}|| is the grid L{sub 2}-norm with respect to the space variables, v is the solution of the grid problem, and u is the solution of the differential problem. Bibliography: 7 titles.

97 MATHEMATICS AND COMPUTING↗

An approximate {kappa} state solutions of the Dirac equation for the generalized Morse potential under spin and pseudospin symmetry

By using an improved approximation scheme to deal with the centrifugal (pseudo-centrifugal) term, we solve the Dirac equation for the generalized Morse potential with arbitrary spin-orbit quantum number {kappa}. In the presence of spin and pseudospin symmetry, the analytic bound state energy eigenvalues and the associated upper- and lower-spinor components of two Dirac particles are found by using the basic concepts of the Nikiforov-Uvarov method. We study the special cases when {kappa}={+-}1 (l=l-tilde=0, s-wave), the non-relativistic limit and the limit when {alpha} becomes zero (Kratzer potential model). The present solutions are compared with those obtained by other methods.

97 MATHEMATICS AND COMPUTING↗

An extension of the Lighthill theory of jet noise to encompass refraction and shielding

A formalism for jet noise prediction is derived that includes the refractive 'cone of silence' and other effects; outside the cone it approximates the simple Lighthill format. A key step is deferral of the simplifying assumption of uniform density in the dominant 'source' term. The result is conversion to a convected wave equation retaining the basic Lighthill source term. The main effect is to amend the Lighthill solution to allow for refraction by mean flow gradients, achieved via a frequency-dependent directional factor. A general formula for power spectral density emitted from unit volume is developed as the Lighthill-based value multiplied by a squared 'normalized' Green's function (the directional factor), referred to a stationary point source. The convective motion of the sources, with its powerful amplifying effect, also directional, is already accounted for in the Lighthill format: wave convection and source convection are decoupled. The normalized Green's function appears to be near unity outside the refraction dominated 'cone of silence', this validates our long term practice of using Lighthill-based approaches outside the cone, with extension inside via the Green's function. The function is obtained either experimentally (injected 'point' source) or numerically (computational aeroacoustics). Approximation by unity seems adequate except near the cone and except when there are shrouding jets: in that case the difference from unity quantifies the shielding effect. Further extension yields dipole and monopole source terms (cf. Morfey, Mani, and others) when the mean flow possesses density gradients (e.g., hot jets).

Ribner, Herbert S.↗

On the convergence and convergence order of finite volume gradient schemes for oblique derivative boundary value problems

This work is an improvement of the previous note (Bradji in: Fuhrmann et al., Finite volumes for complex applications VII–methods, theoretical aspects. Proceedings of the FVCA 7, Berlin, 2014) which dealt with the convergence analysis of a finite volume scheme for the Poisson’s equation with a linear oblique derivative boundary condition. The formulation of the finite volume scheme given in Bradji (in: Fuhrmann et al., Finite volumes for complex applications VII–methods, theoretical aspects. Proceedings of the FVCA 7, Berlin, 2014) involves the discrete gradient introduced recently in Eymard et al. (IMA J Numer Anal 30(4):1009–1043, 2010). In this paper, we consider the convergence analysis of finite volume schemes involving the discrete gradient of Eymard et al. (IMA J Numer Anal 30(4):1009–1043, 2010) for elliptic and parabolic equations with linear oblique derivative boundary conditions. Linear oblique derivative boundary conditions arise for instance in the study of the motion of water in a canal, cf. Lesnic (Commun Numer Methods Eng 23(12):1071–1080, 2007). We derive error estimates in several norms which allow us to get error estimates for the approximations of the exact solutions and its first derivatives. In particular, we provide an error estimate between the gradient of the exact solutions and the discrete gradient of the approximate solutions. Convergence of the family of finite volume approximate solutions towards the exact solution under weak regularity assumption is also investigated. In the case of parabolic equations with oblique derivative boundary conditions, we develop a new discrete a priori estimate result. The proof of this result is based on the use of a discrete mean Poincaré–Wirtinger inequality. Thanks to the stated a priori estimate and to a comparison with an appropriately chosen auxiliary finite volume scheme, we derive the convergence results. This work can be viewed as a continuation of the previous work (Bradji and Gallouët in Int J Finite Vol 3(2):1–35, 2006) where a convergence analysis for a finite volume scheme, based on the admissible mesh of Eymard et al. (In: Ciarlet and Lions, Handbook of numerical analysis, North-Holland, Amsterdam, 2000), for the Poisson’s equation with a linear oblique derivative boundary conditions is given. The obtained convergence results do not require any relation between the mesh sizes of the spatial and time discretizations. Some numerical tests are presented for both elliptic and parabolic equations. In particular, we present three methods to compute the discrete solution.

97 MATHEMATICS AND COMPUTING↗

Systems of Markov functions generated by graphs and the asymptotics of their Hermite-Pade approximants

The paper considers Hermite-Pade approximants to systems of Markov functions defined by means of directed graphs. The minimization problem for the energy functional is investigated for a vector measure whose components are related by a given interaction matrix and supported in some fixed system of intervals. The weak asymptotics of the approximants are obtained in terms of the solution of this problem. The defining graph is allowed to contain undirected cycles, so the minimization problem in question is considered within the class of measures whose masses are not fixed, but allowed to 'flow' between intervals. Strong asymptotic formulae are also obtained. The basic tool that is used is an algebraic Riemann surface defined by means of the supports of the components of the extremal measure. The strong asymptotic formulae involve standard functions on this Riemann surface and solutions of some boundary value problems on it. The proof depends upon an asymptotic solution of the corresponding matrix Riemann-Hilbert problem. Bibliography: 40 titles.

97 MATHEMATICS AND COMPUTING↗

Generalized trigonometric Fourier-series method with automatic time step control for non-linear point kinetics equations

The trigonometric Fourier-series method (TFS) is generalized to provide approximate solutions for non-linear point kinetics equations with feedback using varying step sizes. This method can provide a very stable solution against the size of the discrete time step allowing much larger step sizes to be used. Systems of the point kinetics equations are solved using Fourier-series expansion over a partition of the total time interval. The approximate solution requires determining the series coefficients over each time step in that partition. These coefficients are determined using the high-order derivatives of the solution vector at the beginning of the time step introducing a system of linear algebraic equations to be solved at each step. This system is similar to the Vandermonde system. Two successive orders of the partial sums are used to estimate the local truncation error. This error and some other constrains are used to produce the largest step size allowable at each step while keeping the error within a specific tolerance. The process of calculating suitable step sizes should be automatic and inexpensive. Convergence and stability of the proposed method are discussed and a new formula is introduced to maintain stability. The proposed method solves the general linear and non-linear kinetics problems. The method has been applied to five different types of reactivities including step/ramp insertions with temperature feedback. The method is seemed to be valid for larger time intervals than those used in the conventional numerical integration, and is thus useful in reducing computing time. Computational results are found to be consistent with the analysis, they demonstrate that the convergence of the iteration scheme can be accelerated and the resulting computing times can be greatly reduced while maintain computational accuracy.

97 MATHEMATICS AND COMPUTING↗

GW approach to Anderson model in and out of equilibrium : scaling properties in the Kondo regime.

The low-energy properties of the Anderson model for a single impurity coupled to two leads are studied using the GW approximation. We find that quantities such as the spectral function at zero temperature, the linear-response conductance as function of temperature or the differential conductance as function of bias voltage exhibit universal scaling behavior in the Kondo regime. We show how the form of the GW scaling functions relates to the form of the scaling functions obtained from the exact solution at equilibrium. We also compare the energy scale that goes inside the GW scaling functions with the exact Kondo temperature, for a broad range of the Coulomb interaction strength in the asymptotic regime. This analysis allows to clarify a presently suspended question in the literature, namely whether or not the GW solution captures the Kondo resonance.

97 MATHEMATICS AND COMPUTING↗

Counting generations in birth and death processes with competing Erlang and exponential waiting times

Lymphocyte populations, stimulated in vitro or in vivo, grow as cells divide. Stochastic models are appropriate because some cells undergo multiple rounds of division, some die, and others of the same type in the same conditions do not divide at all. If individual cells behave independently, then each cell can be imagined as sampling from a probability density of times to division and death. The exponential density is the most mathematically and computationally convenient choice. It has the advantage of satisfying the memoryless property, consistent with a Markov process, but it overestimates the probability of short division times. With the aim of preserving the advantages of a Markovian framework while improving the representation of experimentally-observed division times, we consider a multi-stage model of cellular division and death. We use Erlang-distributed (or, more generally, phase-type distributed) times to division, and exponentially distributed times to death. We classify cells into generations, using the rule that the daughters of cells in generation n are in generation n + 1. In some circumstances, our representation is equivalent to established models of lymphocyte dynamics. We find the growth rate of the cell population by calculating the proportions of cells by stage and generation. The exponent describing the late-time cell population growth, and the criterion for extinction of the population, differs from what would be expected if N steps with rate λ were equivalent to a single step of rate λ/N. We link with a published experimental dataset, where cell counts were reported after T cells were transferred to lymphopenic mice, using Approximate Bayesian Computation. In the comparison, the death rate is assumed to be proportional to the generation and the Erlang time to division for generation 0 is allowed to differ from that of subsequent generations. The multi-stage representation is preferred to a simple exponential in posterior distributions, and the mean time to first division is estimated to be longer than the mean time to subsequent divisions.

59 BASIC BIOLOGICAL SCIENCES↗