Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “fast 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 739 records · Page 41
All sourcesNASA NTRSDOE OSTI
DOE OSTI2021

Performance Evaluation of Distributed Energy Resource Management Algorithm in Large Distribution Networks

This paper presents performance evaluation of hierarchical optimization and control for distributed energy resource management system (DERMS) in large distribution networks via an advanced hardware-in-the-loop (HIL) platform. The HIL platform provides realistic testing in a laboratory environment, including the accurate modeling of a full-scale distribution system of 11,000 nodes, the DERMS software controller, and 90 power hardware photovoltaics (PVs) and battery inverters. The applied DERMS algorithm is designed based on a realtime optimal power flow algorithm and implemented with acceleration design that performs fast dispatch of simulated PVs and real physical hardware DER devices every 4 seconds.

DERMS↗
DOE OSTI2021

Decentralized Failure-Tolerant Optimization of Electric Vehicle Charging

We present a decentralized failure-tolerant algorithm for optimizing electric vehicle (EV) charging, using charging stations as computing agents. The algorithm is based on the alternating direction method of multipliers (ADMM) and it has the following features: (i) It handles capacity, peak demand, and ancillary services coupling constraints. (ii) It does not require a central agent collecting information and performing coordination (e.g. an aggregator), instead all agents exchange information and computations are carried out in a fully decentralized fashion. (iii) It can withstand the failure of any number of computing agents, as long as the remaining computing agents are in a connected communications network. We construct this algorithm by reformulating the optimal EV charging problem in a decomposable form, amenable to ADMM, and then developing efficient decentralized solution methods for the subproblems dealing with coupling constraints. We conduct numerical experiments on industry-scale synthetic EV charging datasets, with up to 1,152 charging stations, using a high performance computing cluster. The experiments demonstrate that the proposed algorithm can solve the optimal EV charging problem fast enough to permit the integration of EV charging with real-time electricity markets, even in the presence of failures.

42 ENGINEERING↗
DOE OSTI2023

Cylindrical Fast Backprojection

Cylindrical Fast Backprojection (CFBP) is a novel image reconstruction algorithm developed at PNNL that radically increases the efficiency of normal backprojection techniques and is ideally suited to microwave and millimeter-wave imaging systems based on scanned linear arrays such as current and next-generation cylindrical body scanners in common use for aviation security screening. T

Sheen, David↗
DOE OSTI2021

Reverse annealing for nonnegative/binary matrix factorization

It was recently shown that quantum annealing can be used as an effective, fast subroutine in certain types of matrix factorization algorithms. The quantum annealing algorithm performed best for quick, approximate answers, but performance rapidly plateaued. In this paper, we utilize reverse annealing instead of forward annealing in the quantum annealing subroutine for nonnegative/binary matrix factorization problems. After an initial global search with forward annealing, reverse annealing performs a series of local searches that refine existing solutions. The combination of forward and reverse annealing significantly improves performance compared to forward annealing alone for all but the shortest run times.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2022

SMALE: Enhancing Scalability of Machine Learning Algorithms on Extreme-Scale Computing Platforms

Deployment and execution of machine learning tasks on extreme-scale computing platforms face several significant technical challenges: 1) High computing cost incurred by dense networks – The computing workload of deep networks with densely-connected topology increases rapidly with the network size, imposing a non-scalable computing model of extreme-scale computing platforms; 2) Non-optimized workload distribution – Many advanced deep learning algorithms, e.g., sparsification and irregular net-work topology, produce very unbalanced workload distribution on extreme-scale computing platforms. The computation efficiency is greatly hindered by the incurred data and computation redundancies as well as long tails of the node with extensive workload; 3) Constraints in data movement and I/O bottle-neck – Inter-node data movement in extreme-scale computing platforms are associated with high energy and latency costs, and subject to the constraints of I/O bandwidth; and 4) Generalization of algorithm realization and acceleration on computing platforms – The large varieties of machine learning algorithms and structures of extreme-scale computing platforms make the derivation of a generalized algorithm realization and acceleration method very challenging, which, however, is the requirement by domain scientists and interested users. We call the above challenges Smale’s Problems in Machine Learning and Understanding for High-Performance Computing Scientific Discovery. The objective of our three-year research project is to develop a holistic innovation set at structure, assembly, and acceleration layers of machine learning algorithms to address the above challenges in algorithm deployment and execution. Three tasks are particularly performed, including: At the algorithm structure level, we investigate the techniques that can structurally sparsify on the topology of deep networks for computing workload reduction. We also study clustering and pruning techniques that can optimize the workload distributions over the extreme-scale computing platforms; At the algorithm assembly level, we derive a unified learning framework for unsupervised transfer learning and dynamic growing capabilities. Novel training methods are also exploited to enhance the training efficiency of the proposed framework; At the algorithm acceleration level, we will develop a series of techniques that can accelerate the computation of sparse matrix operations, which are one of the core executions in deep learning and optimize memory access of the concerned platforms. Our proposed techniques attack the fundamental problems in machine learning algorithms running on extreme-scale computing platforms by vertically integrating the solutions at three closely entangled layers, paving the long-term scaling path of machine learning applications under DOE context. Three tasks corresponding to the above respective research orientations are performed during the three-year project period with our collaborators at ORNL. The outcome of the proposed project is anticipated to form a holistic solution set of novel algorithms and network topologies, efficient training techniques, and fast acceleration methods to promote the computing scalability of the machine learning applications of particular interest to DOE.

97 MATHEMATICS AND COMPUTING↗
NASA NTRS1972

Automated aircraft scheduling methods in the near terminal area.

A general scheduling algorithm for aircraft from terminal area entry to touchdown is developed. The method has the following novel features: (1) many speed classes of aircraft are considered and speed variations within classes and along portions of the flight path are permitted; (2) multiple paths are considered which may merge or diverge - the analysis is not restricted to a single runway nor to departures only; (3) landings are scheduled along conflict free flight paths in minimum time. The algorithm is currently being incorporated in a fast-time simulation of a STOL air traffic system.

Tobias, L.↗
NASA NTRS1981

SAR processing on the MPP

The processing of synthetic aperture radar (SAR) signals using the massively parallel processor (MPP) is discussed. The fast Fourier transform convolution procedures employed in the algorithms are described. The MPP architecture comprises an array unit (ARU) which processes arrays of data; an array control unit which controls the operation of the ARU and performs scalar arithmetic; a program and data management unit which controls the flow of data; and a unique staging memory (SM) which buffers and permutes data. The ARU contains a 128 by 128 array of bit-serial processing elements (PE). Two-by-four surarrays of PE's are packaged in a custom VLSI HCMOS chip. The staging memory is a large multidimensional-access memory which buffers and permutes data flowing with the system. Efficient SAR processing is achieved via ARU communication paths and SM data manipulation. Real time processing capability can be realized via a multiple ARU, multiple SM configuration.

Batcher, K. E.↗
NASA NTRS1987

Automatically reconfigurable control for rapid retargeting of flexible pointing systems

A reconfigurable nonlinear control system design methodology is proposed to automatically correct computed slew torque commands of space-based pointing systems for the effects of slew-induced structural deformations. The possibility of forcing an elastic structure, such as that of a space-based instrument frame, to deform in a preselected way in response to rapid slews is demonstrated. To accomplish this, a supervisory controller must select a pair of algorithms, one for structural counterexcitation and the other for slew torque correction. It is shown how the reachability and subsequent tracking of the appropriate 'slow manifold', where the control algorithms are valid, can be ensured by a fast tracking loop, with time-varying gain dependent only on the commanded angular acceleration.

Dwyer, Thomas A. W., III↗
NASA NTRS1988

Probabilistic structural analysis methods and applications

An advanced algorithm for simulating the probabilistic distribution of structural responses due to statistical uncertainties in loads, geometry, material properties, and boundary conditions is reported. The method effectively combines an advanced algorithm for calculating probability levels for multivariate problems (fast probability integration) together with a general-purpose finite-element code for stress, vibration, and buckling analysis. Application is made to a space propulsion system turbine blade for which the geometry and material properties are treated as random variables.

Cruse, T. A.↗
NASA NTRS1989

Computing the transmission zeros of large space structures

The transmission zeros of a large space structure are frequently computed by means of the general-purpose algorithm of Emami-Naeini and Van Dooren (1982). It is shown that careful exploitation of the special form of the equations of motion of structural dynamics leads to an algorithm that is at least 60 times as fast as this when applied to an undamped structure, and 15 times as fast for a lightly damped one.

Williams, Trevor↗
NASA NTRS1991

Navier-Stokes Computations On Zonal Grids

Report describes numerical simulations of transonic flow of air about isolated wing and about wing and fuselage (not tail assembly) of F-16A aircraft. Fast, diagonalized Beam-Warming numerical-integration algorithm for solution of Euler and Navier-Stokes equations applied via Transonic Navier-Stokes computer program, using computational grids divided into zones of coarse and finer meshes.

Flores, Jolen↗
NASA NTRS1994

USAF single-event sonic boom prediction model: PCBoom3

The Air Force has developed PCBoom3, a general-purpose, single-event sonic boom prediction model. The model operates on an IBM PC or compatible, under DOS or Windows. It is accessed via an integrated environment which controls building of input cases, running boom calculations, displaying contours and signatures, and managing all associated data. The primary boom calculation is via a variation of FOBOOM, the focus-boom extension of Thomas's program. Aircraft input is either via a user-provided F-function, or simple N-wave F-functions tabulated for about 20 current aircraft. A fast boom calculation, based on Plotkin's SBORT algorithms, is included for simple N-wave F-functions in a windless atmosphere and flight altitudes up to 60,000 feet. After a run is complete, the user can access an index identifying significant events (focal zones, beginning of footprint, etc.), then plot boom amplitude contours and signatures or spectra at any point in the footprint. The primary uses of this program are expected to be operational planning and boom incident investigation. However, because of the commonality between FOBOOM and the MDBOOM program currently being used for low boom configuration design, this program is of interest to the HSCT community, especially as supersonic route planning activity increases. The Air Force recently conducted a flight test program to evaluate the focal zone capabilities of PCBoom3. Initial results of that program validate the prediction of focal zone geometry, amplitudes, and waveforms.

Plotkin, Kenneth J.↗
NASA NTRS1998

Developmental Cryogenic Active Telescope Testbed, a Wavefront Sensing and Control Testbed for the Next Generation Space Telescope

As part of the technology validation strategy of the next generation space telescope (NGST), a system testbed is being developed at GSFC, in partnership with JPL and Marshall Space Flight Center (MSFC), which will include all of the component functions envisioned in an NGST active optical system. The system will include an actively controlled, segmented primary mirror, actively controlled secondary, deformable, and fast steering mirrors, wavefront sensing optics, wavefront control algorithms, a telescope simulator module, and an interferometric wavefront sensor for use in comparing final obtained wavefronts from different tests. The developmental. cryogenic active telescope testbed (DCATT) will be implemented in three phases. Phase 1 will focus on operating the testbed at ambient temperature. During Phase 2, a cryocapable segmented telescope will be developed and cooled to cryogenic temperature to investigate the impact on the ability to correct the wavefront and stabilize the image. In Phase 3, it is planned to incorporate industry developed flight-like components, such as figure controlled mirror segments, cryogenic, low hold power actuators, or different wavefront sensing and control hardware or software. A very important element of the program is the development and subsequent validation of the integrated multidisciplinary models. The Phase 1 testbed objectives, plans, configuration, and design will be discussed.

Leboeuf, Claudia M.↗
NASA NTRS1995

B-ISBN Onboard Processing Fast Packet Switch Developed

Future satellite communications applications will require a packet-switched onboard satellite processing system to route packets at very high speeds from uplink beams to different downlink beams. The rapid emergence of point-to-multipoint services, and the important role of satellites in a national and global information infrastructure, makes the multicast function essential to a fast packet switch (FPS). NASA Lewis Research Center's Digital System Technology Branch has been studying possible architectures for high-speed onboard-processing satellite systems. As part of this research, COMSAT Laboratories developed a broadband integrated services digital network (B-ISDN) fast packet switch for Lewis that was delivered on December 1994. The fast packet switch consists of eight inputs and eight outputs that can receive and transmit data, respectively, at a rate of 155 Mbps. The switch features multiple priorities (three) and multiple-size (three) satellite virtual cells that are similar to ATM cells in length (52 bytes). In addition, the fast packet switch features a congestion-control algorithm that allows users to set different thresholds for individual destination ports, thus throttling back the traffic from the transmitting port.

Source record↗
NASA NTRS2011

Autorotation flight control system

The present invention provides computer implemented methodology that permits the safe landing and recovery of rotorcraft following engine failure. With this invention successful autorotations may be performed from well within the unsafe operating area of the height-velocity profile of a helicopter by employing the fast and robust real-time trajectory optimization algorithm that commands control motion through an intuitive pilot display, or directly in the case of autonomous rotorcraft. The algorithm generates optimal trajectories and control commands via the direct-collocation optimization method, solved using a nonlinear programming problem solver. The control inputs computed are collective pitch and aircraft pitch, which are easily tracked and manipulated by the pilot or converted to control actuator commands for automated operation during autorotation in the case of an autonomous rotorcraft. The formulation of the optimal control problem has been carefully tailored so the solutions resemble those of an expert pilot, accounting for the performance limitations of the rotorcraft and safety concerns.

Bachelder, Edward N.↗
NASA NTRS2005

Fitting Nonlinear Curves by use of Optimization Techniques

MULTIVAR is a FORTRAN 77 computer program that fits one of the members of a set of six multivariable mathematical models (five of which are nonlinear) to a multivariable set of data. The inputs to MULTIVAR include the data for the independent and dependent variables plus the user s choice of one of the models, one of the three optimization engines, and convergence criteria. By use of the chosen optimization engine, MULTIVAR finds values for the parameters of the chosen model so as to minimize the sum of squares of the residuals. One of the optimization engines implements a routine, developed in 1982, that utilizes the Broydon-Fletcher-Goldfarb-Shanno (BFGS) variable-metric method for unconstrained minimization in conjunction with a one-dimensional search technique that finds the minimum of an unconstrained function by polynomial interpolation and extrapolation without first finding bounds on the solution. The second optimization engine is a faster and more robust commercially available code, denoted Design Optimization Tool, that also uses the BFGS method. The third optimization engine is a robust and relatively fast routine that implements the Levenberg-Marquardt algorithm.

Hill, Scott A.↗
NASA NTRS2021

Atmospheric Correction Over Ocean for Hyperspectral Radiometers Using Multi-Angle Polarimetric Retrievals

We developed a fast and accurate POLYnomial based Atmospheric Correction (POLYAC) algorithm for hyperspectral radiometric measurements, which parameterizes the atmospheric path radiances using aerosol properties retrieved from co-located multi-wavelength Multi-Angle Polarimeter (MAP) measurements. This algorithm has been applied to co-located Spectrometer for Planetary Exploration (SPEX) airborne and Research Scanning Polarimeter (RSP) measurements, where SPEX airborne was used as a proxy of hyperspectral radiometers, and RSP as the MAP. The hyperspectral remote sensing reflectance obtained from POLYAC is accurate when compared to Aerosol Robotic Network (AERONET), and Visible Infrared Imaging Radiometer Suite (VIIRS) ocean color products. POLYAC provides a robust alternative atmospheric correction algorithm for hyperspectral or multi-spectral radiometric measurements for scenes involving coastal oceans and/or absorbing aerosols, where traditional atmospheric correction algorithms are less reliable.

ocean color↗