Linear and nonlinear model large-eddy simulations of a plane jet

The nonlinear Kosovic, and mixed Leray and α subgrid scale models are contrasted with linear Smagorinsky and Yoshizawa Large Eddy Simulations for a Re = 4000 plane jet simulation. Comparisons are made with Direct Numerical Simulation data and measurements. Global properties of the jet such as the spreading and centreline velocity decay rates are investigated. The mean-flow and turbulence parameters in the self-similar region are also studied. All models generally give encouraging agreement with the Direct Numerical Simulation data and reliable measurements. Solution differences for the models are relatively minor, none giving clear improvements for all data comparisons.

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.

Fixed-rank matrix factorizations and Riemannian low-rank optimization

Motivated by the problem of learning a linear regression model whose parameter is a large fixed-rank non-symmetric matrix, we consider the optimization of a smooth cost function defined on the set of fixed-rank matrices. We adopt the geometric framework of optimization on Riemannian quotient manifolds. We study the underlying geometries of several well-known fixed-rank matrix factorizations and then exploit the Riemannian quotient geometry of the search space in the design of a class of gradient descent and trust-region algorithms. The proposed algorithms generalize our previous results on fixed-rank symmetric positive semidefinite matrices, apply to a broad range of applications, scale to high-dimensional problems, and confer a geometric basis to recent contributions on the learning of fixed-rank non-symmetric matrices. We make connections with existing algorithms in the context of low-rank matrix completion and discuss the usefulness of the proposed framework. Numerical experiments suggest that the proposed algorithms compete with state-of-the-art algorithms and that manifold optimization offers an effective and versatile framework for the design of machine learning algorithms that learn a fixed-rank matrix. © 2013 Springer-Verlag Berlin Heidelberg.

Towards identification of a general model of damping

Characterization of damping forces in a vibrating structure has long been an active area of research in structural dynamics. In spite of a large amount of research, understanding of damping mechanisms is not well developed. A major reason for this is that unlike inertia and stiffness forces it is not in general clear what are the state variables that govern the damping forces. The most common approach is to use `viscous damping' where the instantaneous generalized velocities are the only relevant state variables. However, viscous damping by no means the only damping model within the scope of linear analysis. Any model which makes the energy dissipation functional non-negative is a possible candidate for a valid damping model. This paper is devoted to develop methodologies for identification of such general damping models responsible for energy dissipation in a vibrating structure. The method uses experimentally identified complex modes and complex natural frequencies and does not a-priori assume any fixed damping model (eg., viscous damping) but seeks to determine parameters of a general damping model described by the so called `relaxation function'. The proposed method and several related issues are discussed by considering a numerical example of a linear array of damped spring-mass oscillators.

Low-order modelling of ducted flames with temporally varying equivalence ratio in realistic geometries

The interaction between unsteady heat release and acoustic pressure oscillations in gas turbines results in self-excited combustion oscillations which can potentially be strong enough to cause significant structural damage to the combustor. Correctly predicting the interaction of these processes, and anticipating the onset of these oscillations can be difficult. In recent years much research effort has focused on the response of premixed flames to velocity and equivalence ratio perturbations. In this paper, we develop a flame model based on the socalled G-Equation, which captures the kinematic evolution of the flame surfaces, under the assumptions of axisymmetry, and ignoring vorticity and compressibility. This builds on previous work by Dowling [1], Schuller et al. [2], Cho & Lieuwen [3], among many others, and extends the model to a realistic geometry, with two intersecting flame surfaces within a non-uniform velocity field. The inputs to the model are the free-stream velocity perturbations, and the associated equivalence ratio perturbations. The model also proposes a time-delay calculation wherein the time delay for the fuel convection varies both spatially and temporally. The flame response from this model was compared with experiments conducted by Balachandran [4, 5], and found to show promising agreement with experimental forced case. To address the primary industrial interest of predicting self-excited limit cycles, the model has then been linked with an acoustic network model to simulate the closed-loop interaction between the combustion and acoustic processes. This has been done both linearly and nonlinearly. The nonlinear analysis is achieved by applying a describing function analysis in the frequency domain to predict the limit cycle, and also through a time domain simulation. In the latter case, the acoustic field is assumed to remain linear, with the nonlinearity in the response of the combustion to flow and equivalence ratio perturbations. A transfer function from unsteady heat release to unsteady pressure is obtained from a linear acoustic network model, and the corresponding Green function is used to provide the input to the flame model as it evolves in the time domain. The predicted unstable frequency and limit cycle are in good agreement with experiment, demonstrating the potential of this approach to predict instabilities, and as a test bench for developing control strategies. Copyright © 2011 by ASME.

A Monte Carlo expectation maximisation algorithm for multiple target tracking

In this paper, we present an expectation-maximisation (EM) algorithm for maximum likelihood estimation in multiple target models (MTT) with Gaussian linear state-space dynamics. We show that estimation of sufficient statistics for EM in a single Gaussian linear state-space model can be extended to the MTT case along with a Monte Carlo approximation for inference of unknown associations of targets. The stochastic approximation EM algorithm that we present here can be used along with any Monte Carlo method which has been developed for tracking in MTT models, such as Markov chain Monte Carlo and sequential Monte Carlo methods. We demonstrate the performance of the algorithm with a simulation. © 2012 ISIF (Intl Society of Information Fusi).