Phase synchronization between stratospheric and tropospheric quasi-biennial and semi-annual oscillations

A combination of singular systems analysis and analytic phase techniques are used to investigate the possible occurrence in observations of coherent synchronization between quasi-biennial and semi-annual oscillations (QBOs; SAOs) in the stratosphere and troposphere. Time series of zonal mean zonal winds near the Equator are analysed from the ERA-40 and ERA-interim reanalysis datasets over a ∼ 50-year period. In the stratosphere, the QBO is found to synchronize with the SAO almost all the time, but with a frequency ratio that changes erratically between 4:1, 5:1 and 6:1. A similar variable synchronization is also evident in the tropical troposphere between semi-annual and quasi-biennial cycles (known as TBOs). Mean zonal winds from ERA-40 and ERA-interim, and also time series of indices for the Indian and West Pacific monsoons, are commonly found to exhibit synchronization, with SAO/TBO ratios that vary between 4:1 and 7:1. Coherent synchronization between the QBO and tropical TBO does not appear to persist for long intervals, however. This suggests that both the QBO and tropical TBOs may be separately synchronized to SAOs that are themselves enslaved to the seasonal cycle, or to the annual cycle itself. However, the QBO and TBOs are evidently only weakly coupled between themselves and are frequently found to lose mutual coherence when each changes its frequency ratio to its respective SAO. This suggests a need to revise a commonly cited paradigm that advocates the use of stratospheric QBO indices as a predictor for tropospheric phenomena such as monsoons and hurricanes. © 2012 Royal Meteorological Society.

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.

Optimisation of passive and semi-active heavy vehicle suspensions

An investigation into the potential for reducing road damage by optimising the design of heavy vehicle suspensions is described. In the first part of the paper two simple mathematical models are used to study the optimisation of conventional passive suspensions. Simple modifications are made to the steel spring suspension of a tandem axle trailer and it is found experimentally that RMS dynamic tyre forces can be reduced by 15% and theoretical road damage by 5.2%. A mathematical model of an air-sprung articulated vehicle is validated, and its suspension is optimised according to the simple models. This vehicle generates about 9% less damage than the leaf-sprung vehicle in the unmodified state and it is predicted that, for the operating conditions examined, the road damage caused by this vehicle can be reduced by a further 5.4%. Finally, it is shown experimentally that computer-controlled semi-active dampers have the potential to reduce road damage by a further 5-6%, compared to an air suspension with optimum passive damping. © Copyright 1994 Society of Automotive Engineers, Inc.

A Bayesian framework to predict deformations during supported excavations based on a semi-empirical method

The ground movements induced by the construction of supported excavation systems are generally predicted by empirical/semi-empirical methods in the design stage. However, these methods cannot account for the site-specific conditions and for information that becomes available as an excavation proceeds. A Bayesian updating methodology is proposed to update the predictions of ground movements in the later stages of excavation based on recorded deformation measurements. As an application, the proposed framework is used to predict the three-dimensional deformation shapes at four incremental excavation stages of an actual supported excavation project. © 2011 Taylor & Francis Group, London.

Reliability analysis of deep excavation based on a semi-empirical approach

The design and construction of deep excavations in urban environment is often governed by serviceability limit state related to the risk of damage to adjacent buildings. In current practice, the assessment of excavation-induced building damage has focused on a deterministic approach. This paper presents a component/system reliability analysis framework to assess the probability that specified threshold design criteria for multiple serviceability limit states are exceeded. A recently developed Bayesian probabilistic framework is used to update the predictions of ground movements in the later stages of excavation based on the recorded deformation measurements. An example is presented to show how the serviceability performance for excavation problems can be assessed based on the component/system reliability analysis. © 2011 ASCE.

A Bayesian framework to predict deformations during supported excavations based on a semi-empirical method

The ground movements induced by the construction of supported excavation systems are generally predicted in the design stage by empirical/semi-empirical methods. However, these methods cannot account for the site-specific conditions and for information that become available as an excavation proceeds. A Bayesian updating methodology is proposed to update the predictions of ground movements in the later stages of excavation based on recorded deformation measurements. As an application, the proposed framework is used to predict the three-dimensional deformation shapes at four incremental excavation stages of an actual supported excavation project. Copyright © ASCE 2011.

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.

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.

Consensus on homogeneous manifolds

The present paper considers distributed consensus algorithms for agents evolving on a connected compact homogeneous (CCH) manifold. The agents track no external reference and communicate their relative state according to an interconnection graph. The paper first formalizes the consensus problem for synchronization (i.e. maximizing the consensus) and balancing (i.e. minimizing the consensus); it thereby introduces the induced arithmetic mean, an easily computable mean position on CCH manifolds. Then it proposes and analyzes various consensus algorithms on manifolds: natural gradient algorithms which reach local consensus equilibria; an adaptation using auxiliary variables for almost-global synchronization or balancing; and a stochastic gossip setting for global synchronization. It closes by investigating the dependence of synchronization properties on the attraction function between interacting agents on the circle. The theory is also illustrated on SO(n) and on the Grassmann manifolds. ©2009 IEEE.

Consensus optimization on manifolds

The present paper considers distributed consensus algorithms that involve N agents evolving on a connected compact homogeneous manifold. The agents track no external reference and communicate their relative state according to a communication graph. The consensus problem is formulated in terms of the extrema of a cost function. This leads to efficient gradient algorithms to synchronize (i.e., maximizing the consensus) or balance (i.e., minimizing the consensus) the agents; a convenient adaptation of the gradient algorithms is used when the communication graph is directed and time-varying. The cost function is linked to a specific centroid definition on manifolds, introduced here as the induced arithmetic mean, that is easily computable in closed form and may be of independent interest for a number of manifolds. The special orthogonal group SO (n) and the Grassmann manifold Grass (p, n) are treated as original examples. A link is also drawn with the many existing results on the circle. © 2009 Society for Industrial and Applied Mathematics.