Engineering Papers⌕ Search

SEARCH · Engineering Papers

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 775 records · Page 43

High-order matrix-free incompressible flow solvers with GPU acceleration and low-order refined preconditioners

In this work, we present a matrix-free flow solver for high-order finite element discretizations of the incompressible Navier-Stokes and Stokes equations with GPU acceleration. For high polynomial degrees, assembling the matrix for the linear systems resulting from the finite element discretization can be prohibitively expensive, both in terms of computational complexity and memory. For this reason, it is necessary to develop matrix-free operators and preconditioners, which can be used to efficiently solve these linear systems without access to the matrix entries themselves. The matrix-free operator evaluations utilize GPU-accelerated sum-factorization techniques to minimize memory movement and maximize throughput. The preconditioners developed in this work are based on a low-order refined methodology with parallel subspace corrections, as described for diffusion problems in [1]. The saddle-point Stokes system is solved using block-preconditioning techniques, which are robust in mesh size, polynomial degree, time step, and viscosity. For the incompressible Navier-Stokes equations, we make use of projection (fractional step) methods, which require Helmholtz and Poisson solves at each time step. The performance of our flow solvers is assessed on several benchmark problems in two and three spatial dimensions.

97 MATHEMATICS AND COMPUTING↗

Asynoptic meteorological data assimilation by means of a time coordinate transformation

A possible method for assimilating large quantities of asynoptic data, such as satellite observations, into numerical weather forecasts, is investigated. The method is based on a transformation of the time coordinate to coincide with satellite paths, and a well-posed problem is solved in order to obtain forecasts beyond the time of data acquisition. Simulated barotropic forecasts based on the proposed technique are compared with forecasts derived from the direct insertion of data. Results indicate that only in ideal situations, when asynoptic data are obtained both continuosly and accurately, will the method function well as compared with direct insertion techniques.

Halberstam, I.↗

Dynamic remapping of parallel computations with varying resource demands

A large class of computational problems is characterized by frequent synchronization, and computational requirements which change as a function of time. When such a problem must be solved on a message passing multiprocessor machine, the combination of these characteristics lead to system performance which decreases in time. Performance can be improved with periodic redistribution of computational load; however, redistribution can exact a sometimes large delay cost. We study the issue of deciding when to invoke a global load remapping mechanism. Such a decision policy must effectively weigh the costs of remapping against the performance benefits. We treat this problem by constructing two analytic models which exhibit stochastically decreasing performance. One model is quite tractable; we are able to describe the optimal remapping algorithm, and the optimal decision policy governing when to invoke that algorithm. However, computational complexity prohibits the use of the optimal remapping decision policy. We then study the performance of a general remapping policy on both analytic models. This policy attempts to minimize a statistic W(n) which measures the system degradation (including the cost of remapping) per computation step over a period of n steps. We show that as a function of time, the expected value of W(n) has at most one minimum, and that when this minimum exists it defines the optimal fixed-interval remapping policy. Our decision policy appeals to this result by remapping when it estimates that W(n) is minimized. Our performance data suggests that this policy effectively finds the natural frequency of remapping. We also use the analytic models to express the relationship between performance and remapping cost, number of processors, and the computation's stochastic activity.

Nicol, D. M.↗

A multiprocessing architecture for real-time monitoring

A multiprocessing architecture for performing real time monitoring and analysis using knowledge-based problem solving techniques is discussed. To handle asynchronous inputs and perform in real time, the system consists of three or more separate processes which run concurrently on one or more processors and communicate via a message passing scheme. The Data Management Process gathers, compresses, scales and sends the incoming telemetry data to other tasks. The Inference Process consists of a proprietary high performance inference engine that runs at 1000 rules per second using telemetry data to perform real time analysis on the state and health of the Space Telescope. The multiprocessing architecture has been interfaced to a simulator and is able to process the incoming telemetry in real time.

Laffey, Thomas J.↗

A multiprocessing architecture for real-time monitoring

A multitasking architecture for performing real-time monitoring and analysis using knowledge-based problem solving techniques is described. To handle asynchronous inputs and perform in real time, the system consists of three or more distributed processes which run concurrently and communicate via a message passing scheme. The Data Management Process acquires, compresses, and routes the incoming sensor data to other processes. The Inference Process consists of a high performance inference engine that performs a real-time analysis on the state and health of the physical system. The I/O Process receives sensor data from the Data Management Process and status messages and recommendations from the Inference Process, updates its graphical displays in real time, and acts as the interface to the console operator. The distributed architecture has been interfaced to an actual spacecraft (NASA's Hubble Space Telescope) and is able to process the incoming telemetry in real-time (i.e., several hundred data changes per second). The system is being used in two locations for different purposes: (1) in Sunnyville, California at the Space Telescope Test Control Center it is used in the preflight testing of the vehicle; and (2) in Greenbelt, Maryland at NASA/Goddard it is being used on an experimental basis in flight operations for health and safety monitoring.

Schmidt, James L.↗

Transient cooling of a square region of radiating medium

A time-accurate numerical solution was carried out for transient radiative cooling of a gray emitting and absorbing medium in a square two-dimensional region. The integro-differential energy equation for transient temperature distributions was solved in two stages. At each time increment, the local radiative source term was obtained by numerical integration of the temperature field using two-dimensional Gaussian integration over rectangular subregions. Then the differential portion of the equation was integrated forward in time by use of the local first and second time derivatives. The results were compared with available limiting case, and excellent agreement was obtained. Transient results are given for a wide range of optical thicknesses of the region. Optimum transient cooling is obtained when the optical side length is about 4.

Siegel, Robert↗

A Multiblock Approach for Calculating Incompressible Fluid Flows on Unstructured Grids

A multiblock approach is presented for solving two-dimensional incompressible turbulent flows on unstructured grids. The artificial compressibility form of the governing equations is solved by a vertex-centered, finite-volume implicit scheme which uses a backward Euler time discretization. Point Gauss-Seidel relaxations are used to solve the linear system of equations at each time step. This work introduces a multiblock strategy to the solution procedure, which greatly improves the efficiency of the algorithm by significantly reducing the memory requirements while not increasing the CPU time. Results presented in this work shows that the current multiblock algorithm requires 70% less memory than the single block algorithm.

Sheng, Chunhua↗

A finite-volume numerical method to calculate fluid forces and rotordynamic coefficients in seals

A numerical method to calculate rotordynamic coefficients of seals is presented. The flow in a seal is solved by using a finite-volume formulation of the full Navier-Stokes equations with appropriate turbulence models. The seal rotor is perturbed along a diameter such that the position of the rotor is a sinusoidal function of time. The resulting flow domain changes with time, and the time-dependent flow in the seal is solved using a space conserving moving grid formulation. The time-varying fluid pressure reaction forces are then linked with the rotor center displacement, velocity and acceleration to yield the rotordynamic coefficients. Results for an annular seal are presented, and compared with experimental data and other more simplified numerical methods.

Athavale, M. M.↗

Supporting ARPA-E Power Grid Optimization (Final Report)

Pacific Northwest National Laboratory (PNNL), Arizona State University (ASU), Georgia Institute of Technology (Georgia Tech), Los Alamos National Laboratory (LANL), National Renewable Energy Laboratory (NREL), Texas A&M University (TAMU), The University of Texas at Austin (UT), and the University of Wisconsin-Madison (UW-M) supported the ARPA-E Grid Optimization (GO) Competition by providing a common problem formulation, data format, datasets, evaluation mechanism, scoring, rules, and results that resulted in the awarding of $\$9.24$ million dollars to teams from academia, industry, and national labs for solving three sets of increasingly difficult non-linear, security- constrained AC Optimal Powerflow (AC-OPF) optimization problems in order to increase the efficiency of the US Electric Grid. It is estimated that a 1% increase in efficiency can save $\$1$ billion. Current industry practices typically use a linear DC model (DC-OPF) in order solve the OPF problem within the time constraints of the operation schedule. The GO Competition challenges the best power engineers, mathematicians, and computer scientists to make possible operational decisions based on accurate physical models. To accomplish this, the GO Competition created a series of Challenges and funded teams to produce the best solver. Challenge 1 was to solve the security constrained Alternating Current Optimal Power Flow (ACOPF) problem. Challenge 2 extended that to by adding adjustable transformer tap ratios, phase shifting transformers, switchable shunts, price-responsive demand, ramp rate constrained generators and loads, and fast-start unit commitment (UC). Furthermore, Challenge 2 was a maximization problem while Challenge 1 was a minimization problem. While Challenge 3 was being developed, the entrants were invited to find better solutions to the Challenge 2 synthetic datasets with no restrictions on time, hardware, or algorithms. The Challenge 2 solutions turned out to be very good. Challenge 3 expanded the Challenge 2 problem further by using multiperiod dynamic markets, including advisory models for extreme weather events, day-ahead markets, and the real-time markets with an extended look-ahead. These problems included active bid-in demand and topology optimization. Together the Challenges used nearly 30 million CPU hours. Since each team was working on the same problem, using the same data, and running on the same hardware, fair comparisons could be drawn as to the best solver. The datasets were varied enough, however, that the best solver for one dataset was not necessarily the best at another, so cumulative scores were used. The process was managed by the PNNL maintained website https://GOCompetition.energy.gov, where Entrants could find information about the problem, the data, the rules, submit their solver for evaluation, and see the scores of all the competing teams on a Leaderboard. Interest was world-wide but only American teams were eligible for prizes. The Competition has produced 34 journal articles 115 papers and been cited over 500 times in the literature, including 12 dissertations (4 from foreign countries; Columbia (2), Germany, and Italy) and 3 from the DOE ExaScale project. Software developed by Pearl Street Technologies for Challenges 1 and 2 is now deployed by Southwest Power Pool (SPP) and Midcontinent Independent Service Operator (MISO). Other teams have received inquiries from venture capitalists. Google DeepMind has thanked the Competition for making the datasets developed for the Competition public. They are using it to train machine learning models. The larger datasets have billions of unknowns to be solved for, but only a small percent matter in the final solution. Knowing what unknowns are important can dramatically speedup the solution.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Nonlinear calculations of the time evolution of black hole accretion disks

Based on previous works on black hole accretion disks, I continue to explore the disk dynamics using the finite difference method to solve the highly nonlinear problem of time-dependent alpha disk equations. Here a radially zoned model is used to develop a computational scheme in order to accommodate functional dependence of the viscosity parameter alpha on the disk scale height and/or surface density. This work is based on the author's previous work on the steady disk structure and the linear analysis of disk dynamics to try to apply to x-ray emissions from black candidates (i.e., multiple-state spectra, instabilities, QPO's, etc.).

Luo, C.↗

A forward method for optimal stochastic nonlinear and adaptive control

A computational approach is taken to solve the optimal nonlinear stochastic control problem. The approach is to systematically solve the stochastic dynamic programming equations forward in time, using a nested stochastic approximation technique. Although computationally intensive, this provides a straightforward numerical solution for this class of problems and provides an alternative to the usual dimensionality problem associated with solving the dynamic programming equations backward in time. It is shown that the cost degrades monotonically as the complexity of the algorithm is reduced. This provides a strategy for suboptimal control with clear performance/computation tradeoffs. A numerical study focusing on a generic optimal stochastic adaptive control example is included to demonstrate the feasibility of the method.

Bayard, David S.↗

Higher Order Time Integration Schemes for the Unsteady Navier-Stokes Equations on Unstructured Meshes

The rapid increase in available computational power over the last decade has enabled higher resolution flow simulations and more widespread use of unstructured grid methods for complex geometries. While much of this effort has been focused on steady-state calculations in the aerodynamics community, the need to accurately predict off-design conditions, which may involve substantial amounts of flow separation, points to the need to efficiently simulate unsteady flow fields. Accurate unsteady flow simulations can easily require several orders of magnitude more computational effort than a corresponding steady-state simulation. For this reason, techniques for improving the efficiency of unsteady flow simulations are required in order to make such calculations feasible in the foreseeable future. The purpose of this work is to investigate possible reductions in computer time due to the choice of an efficient time-integration scheme from a series of schemes differing in the order of time-accuracy, and by the use of more efficient techniques to solve the nonlinear equations which arise while using implicit time-integration schemes. This investigation is carried out in the context of a two-dimensional unstructured mesh laminar Navier-Stokes solver.

Jothiprasad, Giridhar↗

Geostationary Microwave Sounders: Science, Applications and the Geostar Instrument Concept

Microwave atmospheric sounders have long provided some of the most imporant data for use in numerical weather prediction (NWP) and have played an important role in atmospheric weather and climate research. With 7 US satellites now carrying such sensors, we are in a 'golden age' of microwave remote sensing of the atmosphere. However, as this fleet ages and is replaced by a smaller number of new sensors in the coming yars, the main shortcoming of sensors in low Earth orbit -i.e. poor spacial and temporal converage and sampling - will become more apparent. Placing such sensors on geostationary satellites, enabling time-continuous views of large portions of the Earth disc, would solve this problem. but the GEO orbit is approximately 40 times higher than a typical LEO orbit, which requires antenna apertures also about 40 times larger than for LEO systems to maintain spatial resolution, and it has not been feasible to develop such systems. Recently, a solution to this problem has appeared in the form of aperture synthesis.

numerical weather prediction (NWP)↗

A comparison of two plasma models

The time dependent behavior of a plasma which surrounds a highly biased conducting sphere is considered. This plasma is treated as either a cold two component fluid or as a warm plasma whose time development can be found by solving the Vlasov equation. Both models demonstrate oscillatory behavior, but the electric fields predicted by the models are quantitatively quite different in regions close to the surface of the sphere and very similar otherwise. A broadening of the electron distribution function with time is observed indicating local heating of the plasma near the surface of the sphere.

Cottam, Russell↗

Computation of maximum gust loads in nonlinear aircraft using a new method based on the matched filter approach and numerical optimization

Time-correlated gust loads are time histories of two or more load quantities due to the same disturbance time history. Time correlation provides knowledge of the value (magnitude and sign) of one load when another is maximum. At least two analysis methods have been identified that are capable of computing maximized time-correlated gust loads for linear aircraft. Both methods solve for the unit-energy gust profile (gust velocity as a function of time) that produces the maximum load at a given location on a linear airplane. Time-correlated gust loads are obtained by re-applying this gust profile to the airplane and computing multiple simultaneous load responses. Such time histories are physically realizable and may be applied to aircraft structures. Within the past several years there has been much interest in obtaining a practical analysis method which is capable of solving the analogous problem for nonlinear aircraft. Such an analysis method has been the focus of an international committee of gust loads specialists formed by the U.S. Federal Aviation Administration and was the topic of a panel discussion at the Gust and Buffet Loads session at the 1989 SDM Conference in Mobile, Alabama. The kinds of nonlinearities common on modern transport aircraft are indicated. The Statical Discrete Gust method is capable of being, but so far has not been, applied to nonlinear aircraft. To make the method practical for nonlinear applications, a search procedure is essential. Another method is based on Matched Filter Theory and, in its current form, is applicable to linear systems only. The purpose here is to present the status of an attempt to extend the matched filter approach to nonlinear systems. The extension uses Matched Filter Theory as a starting point and then employs a constrained optimization algorithm to attack the nonlinear problem.

Pototzky, Anthony S.↗

A Moving Discontinuous Galerkin Method with Interface Condition Enforcement for Reacting Hypersonic Flows

The necessity of enforcing conservation in computational elements or cells (element conservation) for discontinuous solutions is well understood and respected for solving conservation laws in computational fluid dynamics (CFD). In contrast, interface conservation, where the conservation across cell interfaces is enforced, is long ignored, and yet is also ruled and required by the underlying physics just like element conservation. Violation of the interface conservation across discontinuities is the root cause why an exact discontinuous solution can never be achieved in shock capturing methods. The interface conservation is examined and explored in this talk. Moving discontinuous Galerkin (MDG) finite element method with interface conservation enforcement (MDG-ICE) [1],[2] are then presented for solving compressible flow problems with discontinuities based on the observation that the interface conservation can only be satisfied, only when mesh interfaces are aligned with discontinuities. In the MDG-ICE formulation, both conservative quantities and grid geometry are considered as independent variables. A space-time DG formulation is used to solve the multi-material compressible Euler equations in the standard discontinuous solution space and the discrete grid geometry is solved using a variational formulation in a continuous space. A self-adaptive Levenberg-Marquardt method is utilized to solve the resulting over-determined system of nonlinear equations arising from the MDG-ICE formulation. A number of numerical experiments for a variety of flow problems are conducted to assess the accuracy and performance of the MDG-ICE method. Numerical results obtained indicate that the MDG-ICE method is able to deliver the designed order of both h- and p-convergence even for discontinuous solutions, and detect all types of interfaces, via interface condition enforcement and satisfy, via grid movement, the compressible Euler equations and the associated interface condition.

Discontinuous Galekin↗

Numerical simulation of shear flows over wavy boundaries

The full time-dependent two dimensional Navier-Stokes equations are solved using spectral methods to achieve high spatial accuracy and high order time-splitting methods together with conformal mapping methods to allow simulation of flow over steep waves, including general turbulent Reynolds stresses. The programs are used to study the properties of laminar and turbulent flow over a flat plate and in various wavy geometries. Results are compared with both available theory and experiment. For laminar flow, good agreement is achieved. For turbulent flow, the agreement is less satisfactory and may be explained by the simplified turbulent modelling use in the calculations.

Orszag, S. A.↗

Periodic trim solutions with HP-version finite elements in time

Finite Element in Time has been proven to be a powerful alternative solving strategy for the rotor craft trim problem. Additionally, Finite Element Method in Time has been developed in various versions like time-marching framework, Galerkin framework, Rayleigh-Ritz framework, and mixed formulation. Recently, this method was applied to the rotorcraft trim problem to obtain linearized solutions. The rotorcraft trim problem consists of trying to find a period solution for period-coefficient, differential equations subject to side constraints where certain force and momentum balance equations are forced to be equal to zero. There are free (or trim) parameters that are chosen to meet these side constraints. This project aims at expanding the application, in terms of the rotorcraft trim problem, from a linearized solution to nonlinear solution.

Source record↗