Search NASA⌕ Search

SEARCH · Search NASA

Results for “generalized algorithm”

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 433 records · Page 24

A generalized Poisson solver for first-principles device simulations

Electronic structure calculations of atomistic systems based on density functional theory involve solving the Poisson equation. In this paper, we present a plane-wave based algorithm for solving the generalized Poisson equation subject to periodic or homogeneous Neumann conditions on the boundaries of the simulation cell and Dirichlet type conditions imposed at arbitrary subdomains. In this way, source, drain, and gate voltages can be imposed across atomistic models of electronic devices. Dirichlet conditions are enforced as constraints in a variational framework giving rise to a saddle point problem. The resulting system of equations is then solved using a stationary iterative method in which the generalized Poisson operator is preconditioned with the standard Laplace operator. The solver can make use of any sufficiently smooth function modelling the dielectric constant, including density dependent dielectric continuum models. For all the boundary conditions, consistent derivatives are available and molecular dynamics simulations can be performed. The convergence behaviour of the scheme is investigated and its capabilities are demonstrated.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Approximating the Generalized Voronoi Diagram of Closely Spaced Objects

We present an algorithm to compute an approximation of the generalized Voronoi diagram (GVD) on arbitrary collections of 2D or 3D geometric objects. In particular, we focus on datasets with closely spaced objects; GVD approximation is expensive and sometimes intractable on these datasets using previous algorithms. With our approach, the GVD can be computed using commodity hardware even on datasets with many, extremely tightly packed objects. Our approach is to subdivide the space with an octree that is represented with an adjacency structure. We then use a novel adaptive distance transform to compute the distance function on octree vertices. The computed distance field is sampled more densely in areas of close object spacing, enabling robust and parallelizable GVD surface generation. We demonstrate our method on a variety of data and show example applications of the GVD in 2D and 3D.

97 MATHEMATICS AND COMPUTING↗

Multicomponent transport algorithms for partially ionized mixtures

We investigate iterative methods for solving linear systems arising from the kinetic theory of gases and providing multicomponent transport coefficients of partially ionized plasmas. We consider the situations of weak and strong magnetic fields as well as electron temperature nonequilibrium and the linear systems are investigated in their natural constrained singular symmetric form. Stationary iterative techniques are considered with new more singular formulations of the transport linear systems as well as orthogonal residuals algorithms. The new formulations are derived by considering generalized inverses with nullspaces of increasing dimension. Numerical tests are performed with high temperature air and iterative techniques lead to fast and accurate evaluation of the transport coefficients for all ionization levels and magnetic field intensities.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Central Difference Interval Method for Solving the Wave Equation

This paper presents path of construction the interval method of second order for solving the wave equation. Taken into consideration is the central difference interval method for one-dimensional partial differential equation. Numerical results, obtained by two presented algorithms, in floating-point interval arithmetic are considered.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Experimental realization of the Deutsch-Jozsa algorithm with a six-qubit cluster state

We describe an experimental realization of the Deutsch-Jozsa quantum algorithm to evaluate the properties of a two-bit Boolean function in the framework of one-way quantum computation. For this purpose, a two-photon six-qubit cluster state was engineered. Its peculiar topological structure is the basis of the original measurement pattern allowing the algorithm realization. The good agreement of the experimental results with the theoretical predictions, obtained at {approx}1 kHz success rate, demonstrates the correct implementation of the algorithm.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Integrated Multiscale Modeling of Molecular Computing Devices

The main bottleneck in modeling transport in molecular devices is to develop the correct formulation of the problem and efficient algorithms for analyzing the electronic structure and dynamics using, for example, the time-dependent density functional theory. We have divided this task into several steps. The first step is to developing the right mathematical formulation and numerical algorithms for analyzing the electronic structure using density functional theory. The second step is to study time-dependent density functional theory, particularly the far-field boundary conditions. The third step is to study electronic transport in molecular devices. We are now at the end of the first step. Under DOE support, we have made subtantial progress in developing linear scaling and sub-linear scaling algorithms for electronic structure analysis. Although there has been a huge amount of effort in the past on developing linear scaling algorithms, most of the algorithms developed suffer from the lack of robustness and controllable accuracy. We have made the following progress: (1) We have analyzed thoroughly the localization properties of the wave-functions. We have developed a clear understanding of the physical as well as mathematical origin of the decay properties. One important conclusion is that even for metals, one can choose wavefunctions that decay faster than any algebraic power. (2) We have developed algorithms that make use of these localization properties. Our algorithms are based on non-orthogonal formulations of the density functional theory. Our key contribution is to add a localization step into the algorithm. The addition of this localization step makes the algorithm quite robust and much more accurate. Moreover, we can control the accuracy of these algorithms by changing the numerical parameters. (3) We have considerably improved the Fermi operator expansion (FOE) approach. Through pole expansion, we have developed the optimal scaling FOE algorithm.

99 GENERAL AND MISCELLANEOUS↗

Improving unfolding and systematic uncertainty estimation using generative diffusion networks (Final Technical Report)

This final technical report summarizes the key accomplishments on the unfolding using diffusion model project, a DOE award received by PI Pierre-Hugues Beauchemin at Tufts University. This project main goal was to investigate the potential of diffusion models for unfolding experimental High Energy Physics data from detector effects while controlling systematics uncertainties. The project accomplished its goals by completing the following objectives: 1) Performing an object-by-object, event-by-event unfolding of various kinematic distributions reconstructed from detector data in HEP in a way that keeps correlations between unfolded observables while demonstrating competitive performance compared to standard algorithms used in the field; 2) Address the generalization problem by developing an unfolding algorithm capable to correctly infer the underlying distributions of observables and processes never seen before, while controlling the dominant theoretical uncertainties affecting the process, therefore increasing the effectiveness, the precision, and the applicability of the developed algorithm; 3) Understand the theoretical foundations between the developed algorithm so to extend it to applications beyond experimental HEP, for broader benefits to the society. This report provides an overview of the accomplishments related to each of these key objectives.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

A simple extension of Roe's scheme for real gases

The purpose of this paper is to develop a highly accurate numerical algorithm to model real gas flows in local thermodynamic equilibrium (LTE). The Euler equations are solved using a finite volume method based on Roe's flux difference splitting scheme including real gas effects. A novel algorithm is proposed to calculate the Jacobian matrix which satisfies the flux difference splitting exactly in the average state for a general equation of state. This algorithm increases the robustness and accuracy of the method, especially around the contact discontinuities and shock waves where the gas properties jump appreciably. The results are compared with an exact solution of the Riemann problem for the shock tube which considers the real gas effects. In addition, the method is applied to a blunt cone to illustrate the capability of the proposed extension in solving two dimensional flows.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Simple and efficient relaxation methods for interfaces separating compressible fluids, cavitating flows and shocks in multiphase mixtures

Numerical approximation of the five-equation two-phase flow of Kapila et al. [A.K. Kapila, R. Menikoff, J.B. Bdzil, S.F. Son, D.S. Stewart, Two-phase modeling of deflagration-to-detonation transition in granular materials: reduced equations, Physics of Fluids 13(10) (2001) 3002-3024] is examined. This model has shown excellent capabilities for the numerical resolution of interfaces separating compressible fluids as well as wave propagation in compressible mixtures [A. Murrone, H. Guillard, A five equation reduced model for compressible two phase flow problems, Journal of Computational Physics 202(2) (2005) 664-698; R. Abgrall, V. Perrier, Asymptotic expansion of a multiscale numerical scheme for compressible multiphase flows, SIAM Journal of Multiscale and Modeling and Simulation (5) (2006) 84-115; F. Petitpas, E. Franquet, R. Saurel, O. Le Metayer, A relaxation-projection method for compressible flows. Part II. The artificial heat exchange for multiphase shocks, Journal of Computational Physics 225(2) (2007) 2214-2248]. However, its numerical approximation poses some serious difficulties. Among them, the non-monotonic behavior of the sound speed causes inaccuracies in wave's transmission across interfaces. Moreover, volume fraction variation across acoustic waves results in difficulties for the Riemann problem resolution, and in particular for the derivation of approximate solvers. Volume fraction positivity in the presence of shocks or strong expansion waves is another issue resulting in lack of robustness. To circumvent these difficulties, the pressure equilibrium assumption is relaxed and a pressure non-equilibrium model is developed. It results in a single velocity, non-conservative hyperbolic model with two energy equations involving relaxation terms. It fulfills the equation of state and energy conservation on both sides of interfaces and guarantees correct transmission of shocks across them. This formulation considerably simplifies numerical resolution. Following a strategy developed previously for another flow model [R. Saurel, R. Abgrall, A multiphase Godunov method for multifluid and multiphase flows, Journal of Computational Physics 150 (1999) 425-467], the hyperbolic part is first solved without relaxation terms with a simple, fast and robust algorithm, valid for unstructured meshes. Second, stiff relaxation terms are solved with a Newton method that also guarantees positivity and robustness. The algorithm and model are compared to exact solutions of the Euler equations as well as solutions of the five-equation model under extreme flow conditions, for interface computation and cavitating flows involving dynamics appearance of interfaces. In order to deal with correct dynamic of shock waves propagating through multiphase mixtures, the artificial heat exchange method of Petitpas et al. [F. Petitpas, E. Franquet, R. Saurel, O. Le Metayer, A relaxation-projection method for compressible flows. Part II. The artificial heat exchange for multiphase shocks, Journal of Computational Physics 225(2) (2007) 2214-2248] is adapted to the present formulation.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Scalable method for demonstrating the Deutsch-Jozsa and Bernstein-Vazirani algorithms using cluster states

We show that fundamental versions of the Deutsch-Jozsa and Bernstein-Vazirani quantum algorithms can be performed using a small entangled cluster state resource of only six qubits. We then investigate the minimal resource states needed to demonstrate general n-qubit versions and a scalable method to produce them. For this purpose, we propose a versatile photonic on-chip setup.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Numerical prediction of interfacial instabilities: Sharp interface method (SIM)

We introduce a sharp interface method (SIM) for the direct numerical simulation of unstable fluid-fluid interfaces. The method is based on the level set approach and the structured adaptive mesh refinement technology, endowed with a corridor of irregular, cut-cell grids that resolve the interfacial region to third-order spatial accuracy. Key in that regard are avoidance of numerical mixing, and a least-squares interpolation method that is supported by irregular datasets distinctly on each side of the interface. Results on test problems show our method to be free of the spurious current problem of the continuous surface force method and to converge, on grid refinement, at near-theoretical rates. Simulations of unstable Rayleigh-Taylor and viscous Kelvin-Helmholtz flows are found to converge at near-theoretical rates to the exact results over a wide range of conditions. Further, we show predictions of neutral-stability maps of the viscous Kelvin-Helmholtz flows (Yih instability), as well as self-selection of the most unstable wave-number in multimode simulations of Rayleigh-Taylor instability. All these results were obtained with a simple seeding of random infinitesimal disturbances of interface-shape, as opposed to seeding by a complete eigenmode. For other than elementary flows the latter would normally not be available, and extremely difficult to obtain if at all. Sample comparisons with our code adapted to mimic typical diffuse interface treatments were not satisfactory for shear-dominated flows. On the other hand the sharp dynamics of our method would appear to be compatible and possibly advantageous to any interfacial flow algorithm in which the interface is represented as a discrete Heaviside function.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Efficient traveltime solutions of the acoustic TI eikonal equation

Numerical solutions of the eikonal (Hamilton–Jacobi) equation for transversely isotropic (TI) media are essential for imaging and traveltime tomography applications. Such solutions, however, suffer from the inherent higher-order nonlinearity of the TI eikonal equation, which requires solving a quartic polynomial for every grid point. Analytical solutions of the quartic polynomial yield numerically unstable formulations. Thus, it requires a numerical root finding algorithm, adding significantly to the computational load. Using perturbation theory we approximate, in a first order discretized form, the TI eikonal equation with a series of simpler equations for the coefficients of a polynomial expansion of the eikonal solution, in terms of the anellipticity anisotropy parameter. Such perturbation, applied to the discretized form of the eikonal equation, does not impose any restrictions on the complexity of the perturbed parameter field. Therefore, it provides accurate traveltime solutions even for models with complex distribution of velocity and anisotropic anellipticity parameter, such as that for the complicated Marmousi model. The formulation allows for large cost reduction compared to using the direct TI eikonal solver. Furthermore, comparative tests with previously developed approximations illustrate remarkable gain in accuracy in the proposed algorithm, without any addition to the computational cost.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Non-normal Lanczos methods for quantum scattering

This article presents a new complex absorbing potential (CAP) block Lanczos method for computing scattering eigenfunctions and reaction probabilities. The method reduces the problem of computing energy eigenfunctions to solving two energy dependent systems of equations. An energy independent block Lanczos factorization casts the system into a block tridiagonal form, which can be solved very efficiently for all energies. We show that CAP-Lanczos methods exhibit instability due to the non-normality of CAP Hamiltonians and may break down for some systems. The instability is not due to loss of orthogonality but to non-normality of the Hamiltonian matrix. While use of a Woods-Saxon exponential CAP--as opposed to a polynomial CAP--reduced non-normality, it did not always ensure convergence. Our results indicate that the Arnoldi algorithm is more robust for non-normal systems and less prone to break down. An Arnoldi version of our method is applied to a nonadiabatic tunneling Hamiltonian with excellent results, while the Lanczos algorithm breaks down for this system.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Genetic Algorithm and Tabu Search for Vehicle Routing Problems with Stochastic Demand

This paper presents a problem of designing solid waste collection routes, involving scheduling of vehicles where each vehicle begins at the depot, visits customers and ends at the depot. It is modeled as a Vehicle Routing Problem with Stochastic Demands (VRPSD). A data set from a real world problem (a case) is used in this research. We developed Genetic Algorithm (GA) and Tabu Search (TS) procedure and these has produced the best possible result. The problem data are inspired by real case of VRPSD in waste collection. Results from the experiment show the advantages of the proposed algorithm that are its robustness and better solution qualities.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Computing single step operators of logic programming in radial basis function neural networks

Logic programming is the process that leads from an original formulation of a computing problem to executable programs. A normal logic program consists of a finite set of clauses. A valuation I of logic programming is a mapping from ground atoms to false or true. The single step operator of any logic programming is defined as a function (T{sub p}:I→I). Logic programming is well-suited to building the artificial intelligence systems. In this study, we established a new technique to compute the single step operators of logic programming in the radial basis function neural networks. To do that, we proposed a new technique to generate the training data sets of single step operators. The training data sets are used to build the neural networks. We used the recurrent radial basis function neural networks to get to the steady state (the fixed point of the operators). To improve the performance of the neural networks, we used the particle swarm optimization algorithm to train the networks.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Online State Estimation for Time-Varying Systems

The paper investigates the problem of estimating the state of a time-varying system with a linear measurement model; in particular, the paper considers the case where the number of measurements available can be smaller than the number of states. In lieu of a batch linear least-squares (LS) approach well-suited for static networks, where a sufficient number of measurements could be collected to obtain a full-rank design matrix the paper proposes an online algorithm to estimate the possibly time-varying state by processing measurements as and when available. The design of the algorithm hinges on a generalized LS cost augmented with a proximal-point-type regularization. With the solution of the regularized LS problem available in closed-form, the online algorithm is written as a linear dynamical system where the state is updated based on the previous estimate and based on the new available measurements. Conditions under which the algorithmic steps are in fact a contractive mapping are shown, and bounds on the estimation error are derived for different noise models. Numerical simulations are provided to corroborate the analytical findings.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Implementation of new PRODIAG algorithm and simulation-based acceptance test - 219

This paper presents the improvement of an automated-reasoning computer program for nuclear power plant diagnosis, namely PRODIAG. PRODIAG, first developed at the Argonne National Laboratory, uses confluence-based reasoning to perform fault diagnosis in engineering systems that can be described by the conservation laws for mass, energy, and momentum. Therefore, unlike other plant configuration-dependent rule-based diagnosis algorithms, the code is generally applicable to a wide variety of plant configurations by simply replacing the plant instrumentation diagram (PID) database. The need for improvement was raised when the original PRODIAG failed to provide the requisite degree of extensibility and maintainability for new applications. These shortcomings have been addressed through a new code architecture that uses an objected-oriented logic-programming language in place of the original Prolog language and uses an open-source automated reasoning engine in place of the original hardwired rule-evaluation sequence. This paper presents the architecture and implementation details of the code transition. Verification and validation studies were performed for the new PRODIAG, which involved re-running the distinct fault cases defined at the time the code was originally developed. (authors)

22 GENERAL STUDIES OF NUCLEAR REACTORS↗

Exchange bias training relaxation in spin glass/ferromagnet bilayers

A canonical spin glass (SG) FeAu layer is fabricated to couple to a soft ferromagnet (FM) FeNi layer. Below the SG freezing temperature, exchange bias (EB) and training are observed. Training in SG/FM bilayers is insensitive to cooling field and may suppress the EB or change the sign of the EB field from negative to positive at specific temperatures, violating from the simple power-law or the single exponential function derived from the antiferromagnet based systems. In view of the SG nature, we employ a double decay model to distinguish the contributions from the SG bulk and the SG/FM interface to training. Dynamical properties during training under different cooling fields and at different temperatures are discussed, and the nonzero shifting coefficient in the time index as a signature of slowing-down decay for SG based systems is interpreted by means of a modified Monte Carlo Metropolis algorithm.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗