Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Algorithms.”

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 559 records · Page 31

Lightning Jump Algorithm and Relation to Thunderstorm Cell Tracking, GLM Proxy and Other Meteorological Measurements

The lightning jump algorithm has a robust history in correlating upward trends in lightning to severe and hazardous weather occurrence. The algorithm uses the correlation between the physical principles that govern an updraft's ability to produce microphysical and kinematic conditions conducive for electrification and its role in the development of severe weather conditions. Recent work has demonstrated that the lightning jump algorithm concept holds significant promise in the operational realm, aiding in the identification of thunderstorms that have potential to produce severe or hazardous weather. However, a large amount of work still needs to be completed in spite of these positive results. The total lightning jump algorithm is not a stand-alone concept that can be used independent of other meteorological measurements, parameters, and techniques. For example, the algorithm is highly dependent upon thunderstorm tracking to build lightning histories on convective cells. Current tracking methods show that thunderstorm cell tracking is most reliable and cell histories are most accurate when radar information is incorporated with lightning data. In the absence of radar data, the cell tracking is a bit less reliable but the value added by the lightning information is much greater. For optimal application, the algorithm should be integrated with other measurements that assess storm scale properties (e.g., satellite, radar). Therefore, the recent focus of this research effort has been assessing the lightning jump's relation to thunderstorm tracking, meteorological parameters, and its potential uses in operational meteorology. Furthermore, the algorithm must be tailored for the optically-based GOES-R Geostationary Lightning Mapper (GLM), as what has been observed using Very High Frequency Lightning Mapping Array (VHF LMA) measurements will not exactly translate to what will be observed by GLM due to resolution and other instrument differences. Herein, we present some of the promising aspects and challenges encountered in utilizing objective tracking and GLM proxy data, as well as recent results that demonstrate the value added information gained by combining the lightning jump concept with traditional meteorological measurements.

Schultz, Christopher J.↗

Combined Dust Detection Algorithm by Using MODIS Infrared Channels over East Asia

A new dust detection algorithm is developed by combining the results of multiple dust detectionmethods using IR channels onboard the MODerate resolution Imaging Spectroradiometer (MODIS). Brightness Temperature Difference (BTD) between two wavelength channels has been used widely in previous dust detection methods. However, BTDmethods have limitations in identifying the offset values of the BTDto discriminate clear-sky areas. The current algorithm overcomes the disadvantages of previous dust detection methods by considering the Brightness Temperature Ratio (BTR) values of the dual wavelength channels with 30-day composite, the optical properties of the dust particles, the variability of surface properties, and the cloud contamination. Therefore, the current algorithm shows improvements in detecting the dust loaded region over land during daytime. Finally, the confidence index of the current dust algorithm is shown in 10 × 10 pixels of the MODIS observations. From January to June, 2006, the results of the current algorithm are within 64 to 81% of those found using the fine mode fraction (FMF) and aerosol index (AI) from the MODIS and Ozone Monitoring Instrument (OMI). The agreement between the results of the current algorithm and the OMI AI over the non-polluted land also ranges from 60 to 67% to avoid errors due to the anthropogenic aerosol. In addition, the developed algorithm shows statistically significant results at four AErosol RObotic NETwork (AERONET) sites in East Asia.

East Asia↗

Integration of the Total Lightning Jump Algorithm into Current Operational Warning Environment Conceptual Models

The presence and rates of total lightning are both correlated to and physically dependent upon storm updraft strength, mixed phase precipitation volume and the size of the charging zone. The updraft modulates the ingredients necessary for electrification within a thunderstorm, while the updraft also plays a critical role in the development of severe and hazardous weather. Therefore utilizing this relationship, the monitoring of lightning rates and jumps provides an additional piece of information on the evolution of a thunderstorm, more often than not, at higher temporal resolution than current operational radar systems. This correlation is the basis for the total lightning jump algorithm that has been developed in recent years. Currently, the lightning jump algorithm is being tested in two separate but important efforts. Schultz et al. (2014; AMS 10th Satellite Symposium) is exploring the transition of the algorithm from its research based formulation to a fully objective algorithm that includes storm tracking, Geostationary Lightning Mapper (GLM) Proxy data and the lightning jump algorithm. Chronis et al. (2014; this conference) provides context for the transition to current operational forecasting using lightning mapping array based products. However, what remains is an end to end physical and dynamical basis for relating lightning rates to severe storm manifestation, so the forecaster has a reason beyond simple correlation to utilize the lightning jump algorithm within their severe storm conceptual models. Therefore, the physical basis for the lightning jump algorithm in relation to severe storm dynamics and microphysics is a key component that must be further explored. Many radar studies have examined flash rates and their relation to updraft strength, updraft volume, precipitation‐sized ice mass, etc.; however, relation specifically to lightning jumps is fragmented within the literature. Thus the goal of this study is to use multiple Doppler techniques to resolve the physical and dynamical storm characteristics specifically around the time of the lightning jump. This information will help forecasters anticipate lightning jump occurrence, or even be of use to determine future characteristics of a given storm (e.g., development of a mesocyclone, downdraft, or hail signature on radar), providing additional lead time/confidence in the severe storm warning paradigm.

Shultz, Christopher J.↗

Developer Tools for Evaluating Multi-Objective Algorithms

Multi-objective algorithms for scheduling offer many advantages over the more conventional single objective approach. By keeping user objectives separate instead of combined, more information is available to the end user to make trade-offs between competing objectives. Unlike single objective algorithms, which produce a single solution, multi-objective algorithms produce a set of solutions, called a Pareto surface, where no solution is strictly dominated by another solution for all objectives. From the end-user perspective a Pareto-surface provides a tool for reasoning about trade-offs between competing objectives. From the perspective of a software developer multi-objective algorithms provide an additional challenge. How can you tell if one multi-objective algorithm is better than another? This paper presents formal and visual tools for evaluating multi-objective algorithms and shows how the developer process of selecting an algorithm parallels the end-user process of selecting a solution for execution out of the Pareto-Surface.

multi-objective optimization↗

Dependence of Adaptive Cross-correlation Algorithm Performance on the Extended Scene Image Quality

Recently, we reported an adaptive cross-correlation (ACC) algorithm to estimate with high accuracy the shift as large as several pixels between two extended-scene sub-images captured by a Shack-Hartmann wavefront sensor. It determines the positions of all extended-scene image cells relative to a reference cell in the same frame using an FFT-based iterative image-shifting algorithm. It works with both point-source spot images as well as extended scene images. We have demonstrated previously based on some measured images that the ACC algorithm can determine image shifts with as high an accuracy as 0.01 pixel for shifts as large 3 pixels, and yield similar results for both point source spot images and extended scene images. The shift estimate accuracy of the ACC algorithm depends on illumination level, background, and scene content in addition to the amount of the shift between two image cells. In this paper we investigate how the performance of the ACC algorithm depends on the quality and the frequency content of extended scene images captured by a Shack-Hatmann camera. We also compare the performance of the ACC algorithm with those of several other approaches, and introduce a failsafe criterion for the ACC algorithm-based extended scene Shack-Hatmann sensors.

wave-front sensing and control↗

A Semianalytical Ocean Color Inversion Algorithm with Explicit Water Column Depth and Substrate Reflectance Parameterization

A semianalytical ocean color inversion algorithm was developed for improving retrievals of inherent optical properties (IOPs) in optically shallow waters. In clear, geometrically shallow waters, light reflected off the seafloor can contribute to the water-leaving radiance signal. This can have a confounding effect on ocean color algorithms developed for optically deep waters, leading to an overestimation of IOPs. The algorithm described here, the Shallow Water Inversion Model (SWIM), uses pre-existing knowledge of bathymetry and benthic substrate brightness to account for optically shallow effects. SWIM was incorporated into the NASA Ocean Biology Processing Group's L2GEN code and tested in waters of the Great Barrier Reef, Australia, using the Moderate Resolution Imaging Spectroradiometer (MODIS) Aqua time series (2002-2013). SWIM-derived values of the total non-water absorption coefficient at 443 nm, at(443), the particulate backscattering coefficient at 443 nm, bbp(443), and the diffuse attenuation coefficient at 488 nm, Kd(488), were compared with values derived using the Generalized Inherent Optical Properties algorithm (GIOP) and the Quasi-Analytical Algorithm (QAA). The results indicated that in clear, optically shallow waters SWIM-derived values of at(443), bbp(443), and Kd(443) were realistically lower than values derived using GIOP and QAA, in agreement with radiative transfer modeling. This signified that the benthic reflectance correction was performing as expected. However, in more optically complex waters, SWIM had difficulty converging to a solution, a likely consequence of internal IOP parameterizations. Whilst a comprehensive study of the SWIM algorithm's behavior was conducted, further work is needed to validate the algorithm using in situ data.

Great Barrier Reef↗

An Efficient, Multi-Layered Crown Delineation Algorithm for Mapping Individual Tree Structure Across Multiple Ecosystems

Deriving individual tree information from discrete return, small footprint LiDAR data may improve forest above ground biomass estimates, and provide tree-level information that is important in many ecological studies. Several crown delineation algorithms have been developed to extract individual tree information from LiDAR point clouds or rasterized canopy height models (CHM), but many of these algorithms have difficulty discriminating between overlapping crowns, and also may fail to detect understory trees. Our approach uses a watershed based delineation of a CHM, which is subsequently refined using the LiDAR point cloud. Individual tree detection was validated with stem mapped field data from the Smithsonian Environmental Research Center (SERC), Maryland, and on a plot and stand level through comparisons of stem density and basal area to delineated metrics at both SERC and a study area in the Sierra Nevada, California. For individual tree detection, the algorithm correctly identified 70% of dominant trees, 58% of co-dominant trees, 35% of intermediate trees and 21% of suppressed trees at SERC. The algorithm had difficulty distinguishing between crowns of small, dense understory trees of approximately the same height. Delineated crown volume alone explained 53% and 84% of the variability in basal area at the SERC and Sierra Nevada sites, respectively. The algorithm produced crown area distributions comparable to diameter at breast height (DBH) size class distributions observed in the field in both study sites. The algorithm detected understory crowns better in the conifer-dominated Sierra Nevada site than in the closed-canopy deciduous site in Maryland. The ability for the algorithm to reproduce both accurate tree size distributions and individual crown geometries in two dissimilar and complex forests suggests great promise for applicability to a wide range of forest systems.

LiDAR↗

Exact and Heuristic Algorithms for Runway Scheduling

This paper explores the Single Runway Scheduling (SRS) problem with arrivals, departures, and crossing aircraft on the airport surface. Constraints for wake vortex separations, departure area navigation separations and departure time window restrictions are explicitly considered. The main objective of this research is to develop exact and heuristic based algorithms that can be used in real-time decision support tools for Air Traffic Control Tower (ATCT) controllers. The paper provides a multi-objective dynamic programming (DP) based algorithm that finds the exact solution to the SRS problem, but may prove unusable for application in real-time environment due to large computation times for moderate sized problems. We next propose a second algorithm that uses heuristics to restrict the search space for the DP based algorithm. A third algorithm based on a combination of insertion and local search (ILS) heuristics is then presented. Simulation conducted for the east side of Dallas/Fort Worth International Airport allows comparison of the three proposed algorithms and indicates that the ILS algorithm performs favorably in its ability to find efficient solutions and its computation times.

safe & surface operations↗

The Precipitation Rate Retrieval Algorithms for the GPM Dual-frequency Precipitation Radar

In this paper, precipitation rate retrieval algorithms for the Global Precipitation Measurement mission's Dual-frequency Precipitation Radar (DPR) are developed. The DPR consists of a Ku-band radar (KuPR; 13.6 GHz) and a Ka-band radar (KaPR; 35.5 GHz). For the KuPR, an algorithm similar to the Tropical Rainfall Measuring Mission's Precipitation Radar algorithm is developed, with the relation between precipitation rate R and massweighted mean diameter D m (R−D m relation) replacing the relation between the specific attenuation k and effective radar reflectivity factor Z e . The R−D m relation can also be applied to the KaPR and dual-frequency algorithms. In both the single-frequency and dual-frequency algorithms, the forward retrieval method is applied with an assumed adjustment factor for the R−D m relation (ε) and the results are evaluated to select the best value of ε. The advantages of the dual-frequency algorithm are the availability of the dual-frequency surface reference technique and the ZfKa method, which is a method to use the attenuation-corrected radar reflectivity factor Z f of KaPR, to select ε as well as the possibility to selectively use measurements from KuPR or KaPR. This paper also describes the derivation of the scattering table and the R−D m relation as well as the procedure for non-uniform beam filling correction in detail. The outputs are then statistically analyzed to demonstrate algorithm performance.

precipitation radar↗

The Calipso Version 4.5 Stratospheric Aerosol Subtyping Algorithm

The accurate classification of aerosol types injected into the stratosphere is important to properly characterize their chemical and radiative impacts within the Earth climate system. The updated stratospheric aerosol subtyping algorithm used in the version 4.5 (V4.5) release of the Cloud Aerosol Lidar with Orthogonal Polarization (CALIOP) level 2 data products now delivers more comprehensive and accurate classifications than its predecessor. The original algorithm identified four aerosol subtypes for layers detected above the tropopause: volcanic ash, smoke, sulfate/other, and polar stratospheric aerosol (PSA). In the revised algorithm, sulfates are separately identified as a distinct, homogeneous subtype, and the diffuse, weakly scattering layers previously assigned to the sulfate/other class are recategorized as a fifth “unclassified” subtype. By making two structural changes to the algorithm and revising two thresholds, the V4.5 algorithm improves the ability to discriminate between volcanic ash and smoke from pyrocumulonimbus injections, improves the fidelity of the sulfate subtype, and more accurately reflects the uncertainties inherent in the classification process. The 532 nm lidar ratio for volcanic ash was also revised to a value more consistent with the current state of knowledge. This paper briefly reviews the previous version of the algorithm (V4.1 and V4.2) then fully details the rationale and impact of the V4.5 changes on subtype classification frequency for specific events where the dominant aerosol type is known based on the literature. Classification accuracy is best for volcanic ash due to its characteristically high depolarization ratio. Smoke layers in the stratosphere are also classified with reasonable accuracy, though during the daytime a substantial fraction are misclassified as ash. It is also possible for mixtures of ash and sulfate to be misclassified as smoke. The V4.5 sulfate subtype accuracy is less than that for ash or smoke, with sulfates being misclassified as smoke about one-third of the time. However, because exceptionally tenuous layers are now assigned to the unclassified subtype and the revised algorithm levies more stringent criteria for identifying an aerosol as sulfate, it is more likely that layers labeled as this subtype are in fact sulfate compared to those assigned the sulfate/other classification in the previous data release.

Jason L Tackett↗

Development of Radiative Transfer Models and Retrieval Algorithms for Satellite Remote Sensors

Hyperspectral IR sounders such as AIRS on Aqua, CrIS on S-NPP, NOAA20 and JPSS-2, IASI on Metop A, B, and C provide high-quality atmospheric temperature, water, vapor, and greenhouse gas vertical profiles. Additionally, they provide atmospheric cloud properties, surface emissivity, and surface skin temperatures. We have developed two algorithms which can consistently derive these products from multiple IR sounders. The first one is a Single Field-of-view Sounder Atmospheric Product (SIFSAP) algorithm and the second one is a Climate Fingerprinting Sounder Product (ClimFiSP) algorithm. The SiFSAP algorithm performs one retrieval for each FOV using an all-sky optimal estimation approach. The core of the SiFSAP algorithm is an accurate and fast Principal Component-based Radiative Transfer Model (PCRTM), which can calculate hyperspectral radiance spectra under both clear and cloudy conditions. The PCRTM was developed in the past decade using consistent reference line-by-line radiative transfer model and spectroscopy for hyperspectral sounders such as AIRS, CrIS, IASI, NAST-I, and S-HIS. The ClimFiSP algorithm, which performs retrievals from spatiotemporally averaged L1 hyperspectral radiances directly, will be orders of magnitude faster than traditional method. he ClimFiSP algorithm uses consistent radiative kernels and a robust spectral fingerprinting method. It provides accurate data climate data fusion products from multiple satellite sensors. Both SiFSAP and ClimFiSP will be available at NASA GES DISC data center for public access.

Xu Liu↗

Latest Development in Radiative Transfer Models and Retrieval Algorithms Using Principal Components

The radiative transfer model (RTMs) has a wide range of applications in satellite remote sensing and atmospheric radiation applications. However, millions of line-by-line (LBL) radiative transfer calculations at fine monochromatic frequencies are needed in order to properly calculate spectral contributions of water vapor and trace gases in the atmosphere in infrared and solar spectral regions. Therefore, fast and accurate RTMs are needed to efficiently process large amount of satellite data. A Principal Component-based Radiative Transfer Model (PCRTM) was first developed in 2004 at NASA Langley Research Centre to fulfil this need. By using PC-compression, one can reduce the data dimension significantly while maintaining original information content. The PCRTM can directly compute PC-scores and their derivatives with respect to retrieved parameters. The PCRTM can simulate the top-of-atmosphere (TOA) radiance or reflectance spectra from 0.250 µm (400000 cm-1) to 2000 µm (50 cm-1) with several orders of magnitude faster speed as compared to a LBL RTM. It is also extremely accurate compared to LBL RTM benchmarks (0.03 K RMS error in IR and 0.05% in solar). The PCRTM model has been developed for hyperspectral sensors such as AIRS, CrIS, IASI, NAST-I, SHIS, FIRST, and CLARREO-IR in thermal IR spectral region and CLARREO-Solar, CPF, TEMPO, EMIT, OMI, and SCIAMACHY in solar spectral region. The PCRTM accuracy has been demonstrated via RTM intercomparisons and with real satellite observations from AIRS, CrIS, IASI, SCHIAMACHY, and EMIT etc. In this presentation, we will describe two PCRTM-based inversion algorithms to retrieve atmospheric temperature, water vapor, and trace gas profiles, as well as cloud and surface properties from hyperspectral sounders such as AIRS, CrIS, IASI, and NAST-I. The first one is called Single Fieldof-view Sounder Atmospheric Product (SiFSAP) algorithm. It provides L2 products with 9-times higher area spatial resolution as compared to current cloud-clearing sounder algorithms. The SiFSAP L2 and L3 products are available at NASA's Goddard Earth Sciences Data and Information Services Center (GES DISC) for public access. The second inversion algorithm is called Climate Fingerprinting Atmospheric Product (ClimFiSP) algorithm. It is designed to produce high quality climate products (trends, anomalies, daily, and monthly profiles of temperature, water vapor, traces, clouds, and surface properties) from multiple satellite sensors such AIRS on Aqua and CrIS on multiple satellites. This product will be available at NASA GES DISC later this year. The PCRTMbased high fidelity simulators for CLARREO and CPF have been used for sensor performance trade studies, algorithm development, and inter-satellite calibrations. We have also used PCRTM generated TOA radiance spectra to train an AI-based algorithm and successfully retrieved cloud properties from EMIT solar hyperspectral imagers.

PCRTM↗

A Diagnoser Algorithm for Anomaly Detection in DEDS under Partial Unreliable Observations: Characterization and Inclusion in Sensor Configuration Optimizaton

Complex engineering systems have to be carefully monitored to meet demanding performance requirements, including detecting anomalies in their operations. There are two major monitoring challenges for these systems. The first challenge is that information collected from the monitored system is often partial and/or unreliable, in the sense that some occurred events may not be reported and/or may be reported incorrectly (e.g., reported as another event). The second is that anomalies often consist of sequences of event patterns separated in space and time. This paper introduces and analyzes a diagnoser algorithm that meets these challenges for detecting and counting occurrences of anomalies in engineering systems. The proposed diagnoser algorithm assumes that models are available for characterizing plant operations (via stochastic automata) and sensors (via probabilistic mappings) used for reporting partial and unreliable information. Methods for analyzing the effects of model uncertainties on the diagnoser performance are also discussed. In order to select configurations that reduce sensor costs, while satisfying diagnoser performance requirements, a sensor configuration selection algorithm developed in previous work is then extended for the proposed diagnoser algorithm. The proposed algorithms and methods are then applied to a multi-unit-operation system, which is derived from an actual facility application. Results show that the proposed diagnoser algorithm is able to detect and count occurrences of anomalies accurately and that its performance is robust to model uncertainties. Furthermore, the sensor configuration selection algorithm is able to suggest optimal sensor configurations with significantly reduced costs, while still yielding acceptable performance for counting the occurrences of anomalies.

97 MATHEMATICS AND COMPUTING↗

Sensor placement algorithm development to maximize the efficiency of acid gas removal unit for integrated gasifiction combined sycle (IGCC) power plant with CO2 capture

Future integrated gasification combined cycle (IGCC) power plants with CO{sub 2} capture will face stricter operational and environmental constraints. Accurate values of relevant states/outputs/disturbances are needed to satisfy these constraints and to maximize the operational efficiency. Unfortunately, a number of these process variables cannot be measured while a number of them can be measured, but have low precision, reliability, or signal-to-noise ratio. In this work, a sensor placement (SP) algorithm is developed for optimal selection of sensor location, number, and type that can maximize the plant efficiency and result in a desired precision of the relevant measured/unmeasured states. In this work, an SP algorithm is developed for an selective, dual-stage Selexol-based acid gas removal (AGR) unit for an IGCC plant with pre-combustion CO{sub 2} capture. A comprehensive nonlinear dynamic model of the AGR unit is developed in Aspen Plus Dynamics® (APD) and used to generate a linear state-space model that is used in the SP algorithm. The SP algorithm is developed with the assumption that an optimal Kalman filter will be implemented in the plant for state and disturbance estimation. The algorithm is developed assuming steady-state Kalman filtering and steady-state operation of the plant. The control system is considered to operate based on the estimated states and thereby, captures the effects of the SP algorithm on the overall plant efficiency. The optimization problem is solved by Genetic Algorithm (GA) considering both linear and nonlinear equality and inequality constraints. Due to the very large number of candidate sets available for sensor placement and because of the long time that it takes to solve the constrained optimization problem that includes more than 1000 states, solution of this problem is computationally expensive. For reducing the computation time, parallel computing is performed using the Distributed Computing Server (DCS®) and the Parallel Computing® toolbox from Mathworks®. In this presentation, we will share our experience in setting up parallel computing using GA in the MATLAB® environment and present the overall approach for achieving higher computational efficiency in this framework.

97 MATHEMATICS AND COMPUTING↗

Sensor placement algorithm development to maximize the efficiency of acid gas removal unit for integrated gasification combined cycle (IGCC) power plant with CO{sub 2} capture

Future integrated gasification combined cycle (IGCC) power plants with CO{sub 2} capture will face stricter operational and environmental constraints. Accurate values of relevant states/outputs/disturbances are needed to satisfy these constraints and to maximize the operational efficiency. Unfortunately, a number of these process variables cannot be measured while a number of them can be measured, but have low precision, reliability, or signal-to-noise ratio. In this work, a sensor placement (SP) algorithm is developed for optimal selection of sensor location, number, and type that can maximize the plant efficiency and result in a desired precision of the relevant measured/unmeasured states. In this work, an SP algorithm is developed for an selective, dual-stage Selexol-based acid gas removal (AGR) unit for an IGCC plant with pre-combustion CO{sub 2} capture. A comprehensive nonlinear dynamic model of the AGR unit is developed in Aspen Plus Dynamics® (APD) and used to generate a linear state-space model that is used in the SP algorithm. The SP algorithm is developed with the assumption that an optimal Kalman filter will be implemented in the plant for state and disturbance estimation. The algorithm is developed assuming steady-state Kalman filtering and steady-state operation of the plant. The control system is considered to operate based on the estimated states and thereby, captures the effects of the SP algorithm on the overall plant efficiency. The optimization problem is solved by Genetic Algorithm (GA) considering both linear and nonlinear equality and inequality constraints. Due to the very large number of candidate sets available for sensor placement and because of the long time that it takes to solve the constrained optimization problem that includes more than 1000 states, solution of this problem is computationally expensive. For reducing the computation time, parallel computing is performed using the Distributed Computing Server (DCS®) and the Parallel Computing® toolbox from Mathworks®. In this presentation, we will share our experience in setting up parallel computing using GA in the MATLAB® environment and present the overall approach for achieving higher computational efficiency in this framework.

20 FOSSIL-FUELED POWER PLANTS↗

An Accelerated Recursive Doubling Algorithm for Block Tridiagonal Systems

Block tridiagonal systems of linear equations arise in a wide variety of scientific and engineering applications. Recursive doubling algorithm is a well-known prefix computation-based numerical algorithm that requires O(M^3(N/P + log P)) work to compute the solution of a block tridiagonal system with N block rows and block size M on P processors. In real-world applications, solutions of tridiagonal systems are most often sought with multiple, often hundreds and thousands, of different right hand sides but with the same tridiagonal matrix. Here, we show that a recursive doubling algorithm is sub-optimal when computing solutions of block tridiagonal systems with multiple right hand sides and present a novel algorithm, called the accelerated recursive doubling algorithm, that delivers O(R) improvement when solving block tridiagonal systems with R distinct right hand sides. Since R is typically about 100 1000, this improvement translates to very significant speedups in practice. Detailed complexity analyses of the new algorithm with empirical confirmation of runtime improvements are presented. To the best of our knowledge, this algorithm has not been reported before in the literature.

Seal, Sudip K↗

An Adaptive Unified Differential Evolution Algorithm for Global Optimization

In this paper, we propose a new adaptive unified differential evolution algorithm for single-objective global optimization. Instead of the multiple mutation strate- gies proposed in conventional differential evolution algorithms, this algorithm employs a single equation unifying multiple strategies into one expression. It has the virtue of mathematical simplicity and also provides users the flexibility for broader exploration of the space of mutation operators. By making all control parameters in the proposed algorithm self-adaptively evolve during the process of optimization, it frees the application users from the burden of choosing appro- priate control parameters and also improves the performance of the algorithm. In numerical tests using thirteen basic unimodal and multimodal functions, the proposed adaptive unified algorithm shows promising performance in compari- son to several conventional differential evolution algorithms.

43 PARTICLE ACCELERATORS↗

GPU Accelerated Event Detection Algorithm

Smart grid external require new algorithmic approaches as well as parallel formulations. One of the critical components is the prediction of changes and detection of anomalies within the power grid. The state-of-the-art algorithms are not suited to handle the demands of streaming data analysis. (i) need for events detection algorithms that can scale with the size of data, (ii) need for algorithms that can not only handle multi dimensional nature of the data, but also model both spatial and temporal dependencies in the data, which, for the most part, are highly nonlinear, (iii) need for algorithms that can operate in an online fashion with streaming data. The GAEDA code is a new online anomaly detection techniques that take into account spatial, temporal, multi-dimensional aspects of the data set. The basic idea behind the proposed approach is to (a) to convert a multi-dimensional sequence into a univariate time series that captures the changes between successive windows extracted from the original sequence using singular value decomposition (SVD), and then (b) to apply known anomaly detection techniques for univariate time series. A key challenge for the proposed approach is to make the algorithm scalable to huge datasets by adopting techniques from perturbation theory, incremental SVD analysis. We used recent advances in tensor decomposition techniques which reduce computational complexity to monitor the change between successive windows and detect anomalies in the same manner as described above. Therefore we propose to develop the parallel solutions on many core systems such as GPUs, because these algorithms involve lot of numerical operations and are highly data-parallelizable.

Source record↗