arXiv subjects

Geoffrey T. Parks

Publications and source records attributed to Geoffrey T. Parks.

6 recordsLinked to original sources

arXiv2021

Automatic Borescope Damage Assessments for Gas Turbine Blades via Deep Learning

To maximise fuel economy, bladed components in aero-engines operate close to material limits. The severe operating environment leads to in-service damage on compressor and turbine blades, having a profound and immediate impact on the performance of the engine. Current methods of blade visual inspection are mainly based on borescope imaging. During these inspections, the sentencing of components under inspection requires significant manual effort, with a lack of systematic approaches to avoid human biases. To perform fast and accurate sentencing, we propose an automatic workflow based on deep learning for detecting damage present on rotor blades using borescope videos. Building upon state-of-the-art methods from computer vision, we show that damage statistics can be presented for each blade in a blade row separately, and demonstrate the workflow on two borescope videos.

cs.CV↗

arXiv2021

Optimization by moving ridge functions: Derivative-free optimization for computationally intensive functions

A novel derivative-free algorithm, optimization by moving ridge functions (OMoRF), for unconstrained and bound-constrained optimization is presented. This algorithm couples trust region methodologies with output-based dimension reduction to accelerate convergence of model-based optimization strategies. The dimension-reducing subspace is updated as the trust region moves through the function domain, allowing OMoRF to be applied to functions with no known global low-dimensional structure. Furthermore, its low computational requirement allows it to make rapid progress when optimizing high-dimensional functions. Its performance is examined on a set of test problems of moderate to high dimension and a high-dimensional design optimization problem. The results show that OMoRF compares favourably to other common derivative-free optimization methods, even for functions in which no underlying global low-dimensional structure is known.

math.OC↗

arXiv2020

Extremum Sensitivity Analysis with Polynomial Monte Carlo Filtering

Global sensitivity analysis is a powerful set of ideas and heuristics for understanding the importance and interplay between uncertain parameters in a computational model. Such a model is characterized by a set of input parameters and an output quantity of interest, where we typically assume that the inputs are independent and their marginal densities are known. If the output quantity is smooth, polynomial chaos can be used to extract Sobol' indices. In this paper, we build on these well-known ideas by examining two different aspects of this paradigm. First, we study whether sensitivity indices can be computed efficiently if one leverages a polynomial ridge approximation -- a polynomial fit over a subspace. Given the assumption of anisotropy in the dependence of a function, we show that sensitivity indices can be computed with a reduced number of model evaluations. Second, we discuss methods for evaluating sensitivities when constrained near output extrema. Methods based on the analysis of skewness are reviewed and a novel type of indices based on Monte Carlo filtering (MCF) -- extremum Sobol' indices -- is proposed. We combine these two ideas by showing that these indices can be computed efficiently with ridge approximations, and explore the relationship between MCF-based indices and skewness-based indices empirically.

math.NA↗

arXiv2019

Dimension Reduction via Gaussian Ridge Functions

Ridge functions have recently emerged as a powerful set of ideas for subspace-based dimension reduction. In this paper we begin by drawing parallels between ridge subspaces, sufficient dimension reduction and active subspaces, contrasting between techniques rooted in statistical regression and those rooted in approximation theory. This sets the stage for our new algorithm that approximates what we call a Gaussian ridge function---the posterior mean of a Gaussian process on a dimension-reducing subspace---suitable for both regression and approximation problems. To compute this subspace we develop an iterative algorithm that optimizes over the Stiefel manifold to compute the subspace, followed by an optimization of the hyperparameters of the Gaussian process. We demonstrate the utility of the algorithm on two analytical functions, where we obtain near exact ridge recovery, and a turbomachinery case study, where we compare the efficacy of our approach with three well-known sufficient dimension reduction methods: SIR, SAVE, CR. The comparisons motivate the use of the posterior variance as a heuristic for identifying the suitability of a dimension-reducing subspace.

stat.ME↗

arXiv2018

Numerical Evaluation of Entropy Generation in Isolated Airfoils and Wells Turbines

In recent years, a number of authors have studied entropy generation in Wells turbines. This is potentially a very interesting topic, as it can provide important insights into the irreversibilities of the system, as well as a methodology for identifying, and possibly minimizing, the main sources of loss. Unfortunately, the approach used in these studies contains some crude simplifications that lead to a severe underestimation of entropy generation and, more importantly, to misleading conclusions. This paper contains a re-examination of the mechanisms for entropy generation in fluid flow, with a particular emphasis on RANS equations. An appropriate methodology for estimating entropy generation in isolated airfoils and Wells turbines is presented. Results are verified for different flow conditions, and a comparison with theoretical values is presented.

physics.flu-dyn↗

arXiv2014

Efficient optimisation of structures using tabu search

This paper presents a novel approach to the optimisation of structures using a Tabu search (TS) method. TS is a metaheuristic which is used to guide local search methods towards a globally optimal solution by using flexible memory cycles of differing time spans. Results are presented for the well established ten bar truss problem and compared to results published in the literature. In the first example a truss is optimised to minimise mass and the results compared to results obtained using an alternative TS implementation. In the second example, the problem has multiple objectives that are compounded into a single objective function value using game theory. In general the results demonstrate that the TS method is capable of solving structural optimisation problems at least as efficiently as other numerical optimisation approaches.

cs.CE↗