Combustion rumble prediction with integrated computational-fluid-dynamics/ low-order-model methods

The pressure oscillation within combustion chambers of aeroengines and industrial gas turbines is a major technical challenge to the development of high-performance and low-emission propulsion systems. In this paper, an approach integrating computational fluid dynamics and one-dimensional linear stability analysis is developed to predict the modes of oscillation in a combustor and their frequencies and growth rates. Linear acoustic theory was used to describe the acoustic waves propagating upstream and downstream of the combustion zone, which enables the computational fluid dynamics calculation to be efficiently concentrated on the combustion zone. A combustion oscillation was found to occur with its predicted frequency in agreement with experimental measurements. Furthermore, results from the computational fluid dynamics calculation provide the flame transfer function to describe unsteady heat release rate. Departures from ideal one-dimensional flows are described by shape factors. Combined with this information, low-order models can work out the possible oscillation modes and their initial growth rates. The approach developed here can be used in more general situations for the analysis of combustion oscillations. Copyright © 2012 by the American Institute of Aeronautics and Astronautics, Inc. All rights reserved.

Semi-implicit second order finite volume jet stream computations

Semi-implicit, second order temporal and spatial finite volume computations of the flow in a differentially heated rotating annulus are presented. For the regime considered, three cyclones and anticyclones separated by a relatively fast moving jet of fluid or "jet stream" are predicted. Two second order methods are compared with, first order spatial predictions, and experimental measurements. Velocity vector plots are used to illustrate the predicted flow structure. Computations made using second order central differences are shown to agree best with experimental measurements, and to be stable for integrations over long time periods (> 1000s). No periodic smoothing is required to prevent divergence.

High-order DES and zonal LES of a labyrinth seal

Hybrid numerical large eddy simulation (NLES) and detached eddy simulation (DES) methods are assessed on a labyrinth seal geometry. A high sixth order discretization scheme is used and is validated using a test case of a two dimensional vortex. The hybrid approach adopts a new blending function and along with DES is initially validated using a simple cavity flow. The NLES method is also validated outside of RANS zones. It is found that there is very little resolved turbulence in the cavity for the DES simulation. For the labyrinth seal calculations the DES approach is problematic giving virtually no resolved turbulence content. It is seen that over the tooth tips the extent of the LES region is small and is likely to be a strong contributor to excessive flow damping in these regions. On the other hand the zonal Hamilton-Jacobi approach did not suffer from this trait. In both cases the meshes used are considered to be hybrid RANS-LES adequate. Fortunately (or perhaps unfortunately) the DES profiles are in agreement with the time mean experimental measurements. It is concluded that for an inexperienced CFD practitioner this could have wider implications particularly if transient results such as unsteady loading are desired. Copyright © 2012 by the American Institute of Aeronautics and Astronautics, Inc.

Temporal difference models describe higher-order learning in humans.

The ability to use environmental stimuli to predict impending harm is critical for survival. Such predictions should be available as early as they are reliable. In pavlovian conditioning, chains of successively earlier predictors are studied in terms of higher-order relationships, and have inspired computational theories such as temporal difference learning. However, there is at present no adequate neurobiological account of how this learning occurs. Here, in a functional magnetic resonance imaging (fMRI) study of higher-order aversive conditioning, we describe a key computational strategy that humans use to learn predictions about pain. We show that neural activity in the ventral striatum and the anterior insula displays a marked correspondence to the signals for sequential learning predicted by temporal difference models. This result reveals a flexible aversive learning process ideally suited to the changing and uncertain nature of real-world environments. Taken with existing data on reward learning, our results suggest a critical role for the ventral striatum in integrating complex appetitive and aversive predictions to coordinate behaviour.

Rank-preserving geometric means of positive semi-definite matrices

The generalization of the geometric mean of positive scalars to positive definite matrices has attracted considerable attention since the seminal work of Ando. The paper generalizes this framework of matrix means by proposing the definition of a rank-preserving mean for two or an arbitrary number of positive semi-definite matrices of fixed rank. The proposed mean is shown to be geometric in that it satisfies all the expected properties of a rank-preserving geometric mean. The work is motivated by operations on low-rank approximations of positive definite matrices in high-dimensional spaces.© 2012 Elsevier Inc. All rights reserved.

Low-rank optimization for distance matrix completion

This paper addresses the problem of low-rank distance matrix completion. This problem amounts to recover the missing entries of a distance matrix when the dimension of the data embedding space is possibly unknown but small compared to the number of considered data points. The focus is on high-dimensional problems. We recast the considered problem into an optimization problem over the set of low-rank positive semidefinite matrices and propose two efficient algorithms for low-rank distance matrix completion. In addition, we propose a strategy to determine the dimension of the embedding space. The resulting algorithms scale to high-dimensional problems and monotonically converge to a global solution of the problem. Finally, numerical experiments illustrate the good performance of the proposed algorithms on benchmarks. © 2011 IEEE.

Linear regression under fixed-rank constraints: A Riemannian approach

In this paper, we tackle the problem of learning a linear regression model whose parameter is a fixed-rank matrix. We study the Riemannian manifold geometry of the set of fixed-rank matrices and develop efficient line-search algorithms. The proposed algorithms have many applications, scale to high-dimensional problems, enjoy local convergence properties and confer a geometric basis to recent contributions on learning fixed-rank matrices. Numerical experiments on benchmarks suggest that the proposed algorithms compete with the state-of-the-art, and that manifold optimization offers a versatile framework for the design of rank-constrained machine learning algorithms. Copyright 2011 by the author(s)/owner(s).

Regression on fixed-rank positive semidefinite matrices: A Riemannian approach

The paper addresses the problem of learning a regression model parameterized by a fixed-rank positive semidefinite matrix. The focus is on the nonlinear nature of the search space and on scalability to high-dimensional problems. The mathematical developments rely on the theory of gradient descent algorithms adapted to the Riemannian geometry that underlies the set of fixedrank positive semidefinite matrices. In contrast with previous contributions in the literature, no restrictions are imposed on the range space of the learned matrix. The resulting algorithms maintain a linear complexity in the problem size and enjoy important invariance properties. We apply the proposed algorithms to the problem of learning a distance function parameterized by a positive semidefinite matrix. Good performance is observed on classical benchmarks. © 2011 Gilles Meyer, Silvere Bonnabel and Rodolphe Sepulchre.

Riemannian metric and geometric mean for positive semidefinite matrices of fixed rank

This paper introduces a new metric and mean on the set of positive semidefinite matrices of fixed-rank. The proposed metric is derived from a well-chosen Riemannian quotient geometry that generalizes the reductive geometry of the positive cone and the associated natural metric. The resulting Riemannian space has strong geometrical properties: it is geodesically complete, and the metric is invariant with respect to all transformations that preserve angles (orthogonal transformations, scalings, and pseudoinversion). A meaningful approximation of the associated Riemannian distance is proposed, that can be efficiently numerically computed via a simple algorithm based on SVD. The induced mean preserves the rank, possesses the most desirable characteristics of a geometric mean, and is easy to compute. © 2009 Society for Industrial and Applied Mathematics.

Shape signifiers for control of a low-order compressor model

Rotating stall and surge, two instability mechanisms limiting the performance of aeroengines compressors, are studied on the third-order Moore-Greitzer model. The skewness of the compressor characteristic, a single parameter shape signifier, is shown to determine the key qualitative properties of feedback control.