Search NASA⌕ Search

SEARCH · Search NASA

Results for “solve time”

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 109 records · Page 6

Cost of emulating a small quantum annealing problem in the circuit model

Demonstrations of quantum advantage for certain sampling problems have generated considerable excitement for quantum computing and have further spurred the development of circuit-model quantum computers, which represent quantum programs as a sequence of quantum gates acting on a finite number of qubits. Amongst this excitement, analog quantum computation has become less prominent, with the expectation that circuit-model quantum computers will eventually be sufficient for emulating analog quantum computation and thus rendering analog quantum computation obsolete. In this work we explore the basic requirements for emulating a specific analog quantum computation in the circuit model: the preparation of a biased superposition of degenerate ground states of an Ising Hamiltonian using an adiabatic evolution. We show that the overhead of emulation is substantial even for this simple problem. This supports using analog quantum computation for solving time-dependent Hamiltonian dynamics in the short term and midterm, assuming analog errors can be made low enough and coherence times long enough to solve problems of practical interest.

Quantum algorithms & computation↗

Solving constrained minimum-time robot problems using the sequential gradient restoration algorithm

Three constrained minimum-time control problems of a two-link manipulator are solved using the Sequential Gradient and Restoration Algorithm (SGRA). The inequality constraints considered are reduced via Valentine-type transformations to nondifferential path equality constraints. The SGRA is then used to solve these transformed problems with equality constraints. The results obtained indicate that at least one of the two controls is at its limits at any instant in time. The remaining control then adjusts itself so that none of the system constraints is violated. Hence, the minimum-time control is either a pure bang-bang control or a combined bang-bang/singular control.

Lee, Allan Y.↗

Solving MaxCut with quantum imaginary time evolution

We introduce a method to solve the MaxCut problem efficiently based on quantum imaginary time evolution (QITE). We employ a linear Ansatz for unitary updates and an initial state involving no entanglement, as well as an imaginary-time-dependent Hamiltonian interpolating between a given graph and a subgraph with two edges excised. We apply the method to thousands of randomly selected graphs with up to fifty vertices. We show that our algorithm exhibits a 93% and above performance converging to the maximum solution of the MaxCut problem for all considered graphs. Our results compare favorably with the performance of classical algorithms, such as the greedy and Goemans–Williamson algorithms. We also discuss the overlap of the final state of the QITE algorithm with the ground state as a performance metric, which is a quantum feature not shared by other classical algorithms.

97 MATHEMATICS AND COMPUTING↗

Motivation for Using Generalized Geometry in the Time Dependent Transport Code TDKENO

We are proposing to use the code, TDKENO, to model TREAT. TDKENO solves the time dependent, three dimensional Boltzmann transport equation with explicit representation of delayed neutrons. Instead of directly integrating this equation, the neutron flux is factored into two components – a rapidly varying amplitude equation and a slowly varying shape equation and each is solved separately on different time scales. The shape equation is solved using the 3D Monte Carlo transport code KENO, from Oak Ridge National Laboratory’s SCALE code package. Using the Monte Carlo method to solve the shape equation is still computationally intensive, but the operation is only performed when needed. The amplitude equation is solved deterministically and frequently, so the solution gives an accurate time-dependent solution without having to repeatedly We have modified TDKENO to incorporate KENO-VI so that we may accurately represent the geometries within TREAT. This paper explains the motivation behind using generalized geometry, and provides the results of our modifications. TDKENO uses the Improved Quasi-Static method to accomplish this. In this method, the neutron flux is factored into two components. One component is a purely time-dependent and rapidly varying amplitude function, which is solved deterministically and very frequently (small time steps). The other is a slowly varying flux shape function that weakly depends on time and is only solved when needed (significantly larger time steps).

IQS↗

Stark Profiles In Plasmas Interacting With A Strong Oscillatory Quasi-Monochromatic Electric Field

This paper presents an advanced analysis of the spectroscopic signatures of the interaction of a strong oscillating Quasi-monochromatic Electric Field (QEF), generated by a high-power short-pulse laser, with a preformed laser-produced plasma. The computation of a synthetic spectrum emitted by such plasmas requires the calculation of the Stark line shape in the presence of a QEF and the evaluation of the QEF intensity profile throughout the line of sight in the plasma. As for the Stark profiles in hot dense plasmas submitted to a strong QEF, they are calculated using the so-called Floquet-Liouville formalism. In this formalism, the Liouville space, usually used for the calculation of Stark profiles in dense plasmas, and the Floquet theory, developed to solve time-periodic problems, have been joined together to solve the time-dependent Liouville equation. A second kind of simulations involving Particle-In-Cell PIC kinetic simulations is required for the calculation of the QEF inhomogeneous intensity and the exotic features exhibited in the spectroscopic diagnostic. The global synthetic profile is obtained integrating all individual contributions for every time and location in the plasma. Finally, a spectroscopic analysis of the experimental Al He {beta} line is performed using the tools presented in this work. The spectroscopic signatures of the QEF show up as prominent satellites, non symmetrical with respect to the unperturbed line and distinguishable from the di-electronic satellites.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

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

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

97 MATHEMATICS AND COMPUTING↗

An implicit numerical scheme for the simulation of internal viscous flows on unstructured grids

The Navier-Stokes equations are solved numerically for two-dimensional steady viscous laminar flows. The grids are generated based on the method of Delaunay triangulation. A finite-volume approach is used to discretize the conservation law form of the compressible flow equations written in terms of primitive variables. A preconditioning matrix is added to the equations so that low Mach number flows can be solved economically. The equations are time marched using either an implicit Gauss-Seidel iterative procedure or a solver based on a conjugate gradient like method. A four color scheme is employed to vectorize the block Gauss-Seidel relaxation procedure. This increases the memory requirements minimally and decreases the computer time spent solving the resulting system of equations substantially. A factor of 7.6 speed up in the matrix solver is typical for the viscous equations. Numerical results are obtained for inviscid flow over a bump in a channel at subsonic and transonic conditions for validation with structured solvers. Viscous results are computed for developing flow in a channel, a symmetric sudden expansion, periodic tandem cylinders in a cross-flow, and a four-port valve. Comparisons are made with available results obtained by other investigators.

Jorgenson, Philip C. E.↗

Evolution of a massless test scalar field on boson star space-times

We numerically solve the massless test scalar field equation on the space-time background of boson stars and black holes. In order to do so, we use a numerical domain that contains future null infinity. We achieve this construction using a scri-fixing conformal compactification technique based on hyperboloidal constant mean curvature foliations of the space-time and solve the conformally invariant wave equation. We present two results: the scalar field shows oscillations of the quasinormal mode type found for black holes only for boson star configurations that are compact; and no signs of tail decay are found in the parameter space we explored. Even though our results do not correspond to the master equation of perturbations of boson star solutions, they indicate that the parameter space of boson stars as black hole mimickers is restricted to compact configurations.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Issues in visual support to real-time space system simulation solved in the Systems Engineering Simulator

The Systems Engineering Simulator has addressed the major issues in providing visual data to its real-time man-in-the-loop simulations. Out-the-window views and CCTV views are provided by three scene systems to give the astronauts their real-world views. To expand the window coverage for the Space Station Freedom workstation a rotating optics system is used to provide the widest field of view possible. To provide video signals to as many viewpoints as possible, windows and CCTVs, with a limited amount of hardware, a video distribution system has been developed to time-share the video channels among viewpoints at the selection of the simulation users. These solutions have provided the visual simulation facility for real-time man-in-the-loop simulations for the NASA space program.

Yuen, Vincent K.↗

A dual method for optimal control problems with initial and final boundary constraints.

This paper presents two new algorithms belonging to the family of dual methods of centers. The first can be used for solving fixed time optimal control problems with inequality constraints on the initial and terminal states. The second one can be used for solving fixed time optimal control problems with inequality constraints on the initial and terminal states and with affine instantaneous inequality constraints on the control. Convergence is established for both algorithms. Qualitative reasoning indicates that the rate of convergence is linear.

Pironneau, O.↗

On the impact of initially stressed composite laminates

The impact response behavior of initially stressed composite laminates is investigated using the finite element method. An experimentally established contact law is incorporated into the finite element program. The Newmark time integration algorithm is used for solving the time dependent equations of the plate and the impactor. Numerical results, including the contact force history, deflection, and strain in the plate, are presented. Effects of impact velocity, initial stress, and the mass and size of the impactor are discussed.

Sun, C. T.↗

Numerical simulation of homogeneous, isotropic, compressible turbulence

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

Erlebacher, G.↗

A Fourier collocation time domain method for numerically solving Maxwell's equations

A new method for solving Maxwell's equations in the time domain for arbitrary values of permittivity, conductivity, and permeability is presented. Spatial derivatives are found by a Fourier transform method and time integration is performed using a second order, semi-implicit procedure. Electric and magnetic fields are collocated on the same grid points, rather than on interleaved points, as in the Finite Difference Time Domain (FDTD) method. Numerical results are presented for the propagation of a 2-D Transverse Electromagnetic (TEM) mode out of a parallel plate waveguide and into a dielectric and conducting medium.

Shebalin, John V.↗

Alternative Attitude Commanding and Control for Precise Spacecraft Landing

A report proposes an alternative method of control for precision landing on a remote planet. In the traditional method, the attitude of a spacecraft is required to track a commanded translational acceleration vector, which is generated at each time step by solving a two-point boundary value problem. No requirement of continuity is imposed on the acceleration. The translational acceleration does not necessarily vary smoothly. Tracking of a non-smooth acceleration causes the vehicle attitude to exhibit undesirable transients and poor pointing stability behavior. In the alternative method, the two-point boundary value problem is not solved at each time step. A smooth reference position profile is computed. The profile is recomputed only when the control errors get sufficiently large. The nominal attitude is still required to track the smooth reference acceleration command. A steering logic is proposed that controls the position and velocity errors about the reference profile by perturbing the attitude slightly about the nominal attitude. The overall pointing behavior is therefore smooth, greatly reducing the degree of pointing instability.

Singh, Gurkirpal↗

Parallel time integration software

This package implements an optimal-scaling multigrid solver for the (non) linear systems that arise from the discretization of problems with evolutionary behavior. Typically, solution algorithms for evolution equations are based on a time-marching approach, solving sequentially for one time step after the other. Parallelism in these traditional time-integrarion techniques is limited to spatial parallelism. However, current trends in computer architectures are leading twards system with more, but not faster. processors. Therefore, faster compute speeds must come from greater parallelism. One approach to achieve parallelism in time is with multigrid, but extending classical multigrid methods for elliptic poerators to this setting is a significant achievement. In this software, we implement a non-intrusive, optimal-scaling time-parallel method based on multigrid reduction techniques. The examples in the package demonstrate optimality of our multigrid-reduction-in-time algorithm (MGRIT) for solving a variety of parabolic equations in two and three sparial dimensions. These examples can also be used to show that MGRIT can achieve significant speedup in comparison to sequential time marching on modern architectures.

Source record↗

Parallel time integration software

This package implements an optimal-scaling multigrid solver for the (non) linear systems that arise from the discretization of problems with evolutionary behavior. Typically, solution algorithms for evolution equations are based on a time-marching approach, solving sequentially for one time step after the other. Parallelism in these traditional time-integrarion techniques is limited to spatial parallelism. However, current trends in computer architectures are leading twards system with more, but not faster. processors. Therefore, faster compute speeds must come from greater parallelism. One approach to achieve parallelism in time is with multigrid, but extending classical multigrid methods for elliptic poerators to this setting is a significant achievement. In this software, we implement a non-intrusive, optimal-scaling time-parallel method based on multigrid reduction techniques. The examples in the package demonstrate optimality of our multigrid-reduction-in-time algorithm (MGRIT) for solving a variety of parabolic equations in two and three sparial dimensions. These examples can also be used to show that MGRIT can achieve significant speedup in comparison to sequential time marching on modern architectures.

Source record↗

Unsteady vortex-dominated flow around wings with oscillating leading-edge flaps

Unsteady vortex-dominated flow around delta wings with oscillating leading-edge flaps represents an important classs of problems for supermaneuverability and flow control of advanced aircraft. The problem is solved using time accurate integration of the unsteady, compressible, thin-layer Navier-Stokes equations in conjunction with the unsteady, linearized, Navier-displacement equations. Starting with an initial configuration of the wing and its flaps, the Navier-Stokes equations are solved on an initial structured grid for the steady flow. The forced oscillation of the flaps is then applied, and the problem is solved accurately in time. The Navier-displacement equations are solved for the grid deformation and the Navier-Stokes equations are solved for the flowfield. Symmetric and anti-symmetric flaps oscillations are presented to study the effect of the flaps oscillation on the leading-edge vortical flow.

Kandil, Osama A.↗