On the coupling of Navier–Stokes and linearised Euler equations for aeroacoustic simulation

Aerodynamic generation of sound is governed by the Navier–Stokes equations while acoustic propagation in a non-uniform medium is effectively described by the linearised Euler equations. Different numerical schemes are required for the efficient solution of these two sets of equations, and therefore, coupling techniques become an essential issue. Two types of one-way coupling between the flow solver and the acoustic solver are discussed: (a) for aerodynamic sound generated at solid surfaces, and (b) in the free stream. Test results indicate how the coupling achieves the necessary accuracy so that Computational Fluid Dynamics codes can be used in aeroacoustic simulations.

[Lecture review] 4. 'Three great mathematicians: Euler', 6 March 2002

Tony Mann provides a review of the lecture: 'Three great mathematicians: Euler' held on 6 March 2002 as the fourth and last lecture of the Gresham College History of Mathematics season.

Discretization of highly persistent correlated AR(1) shocks

The finite state Markov-chain approximation methods developed by Tauchen (1986) and Tauchen and Hussey (1991) are widely used in economics, finance and econometrics to solve functional equations in which state variables follow autoregressive processes. For highly persistent processes, the methods require a large number of discrete values for the state variables to produce close approximations which leads to an undesirable reduction in computational speed, especially in a multivariate case. This paper proposes an alternative method of discretizing multivariate autoregressive processes. This method can be treated as an extension of Rouwenhorst's (1995) method which, according to our finding, outperforms the existing methods in the scalar case for highly persistent processes. The new method works well as an approximation that is much more robust to the number of discrete values for a wide range of the parameter space.

Discretization and solution of the inhomogeneous Bogoliubov-de Gennes equations

In the presence of inhomogeneities, defects and currents, the equations describing a Bose-condensed ensemble of alkali atoms have to be solved numerically. By combining both linear and nonlinear equations within a Discrete Variable Representation framework, we describe a computational scheme for the solution of the coupled Bogoliubov-de Gennes (BdG) and nonlinear Schrodinger (NLS) equations for fields in a 3D spheroidal potential. We use the method to calculate the collective excitation spectrum and quasiparticle mode densities for excitations of a Bose condensed gas in a spheroidal trap. The method is compared against finite-difference and spectral methods, and we find the DVR computational scheme to be superior in accuracy and efficiency for the cases we consider. (C) 2004 Elsevier B.V. All rights reserved.

Simulating water mixing in a barotropic estuary: the effect of vertical discretization

Mixing between estuarine and coastal waters is strongly dependent on the processes that occur in the vertical direction. This applies both for stratified and homogeneous estuaries. In homogeneous estuaries important recirculation flows in the vertical plane can arise, in regions with strong batimetry gradients, produced by the combined action of inertia and friction. On the Platform close to the inlet this structures can trap estuarine water during the ebb period, releasing it to the interior again during the flood.

Incremental filter and wrapper approaches for feature discretization

Discrete data representations are necessary, or at least convenient, in many machine learning problems. While feature selection (FS) techniques aim at finding relevant subsets of features, the goal of feature discretization (FD) is to find concise (quantized) data representations, adequate for the learning task at hand. In this paper, we propose two incremental methods for FD. The first method belongs to the filter family, in which the quality of the discretization is assessed by a (supervised or unsupervised) relevance criterion. The second method is a wrapper, where discretized features are assessed using a classifier. Both methods can be coupled with any static (unsupervised or supervised) discretization procedure and can be used to perform FS as pre-processing or post-processing stages. The proposed methods attain efficient representations suitable for binary and multi-class problems with different types of data, being competitive with existing methods. Moreover, using well-known FS methods with the features discretized by our techniques leads to better accuracy than with the features discretized by other methods or with the original features. (C) 2013 Elsevier B.V. All rights reserved.

Euler : el maestro de todos los matemáticos.

Recorrido por la biografía del matemático suizo Leonhard Euler. El artículo se estructura en base a los diferentes periodos de la vida del científico y sus aportaciones en el mundo de las matemáticas, sobretodo en el campo del álgebra.

El problema de Basilea. El año de Euler : 1707-2007.

Se muestran algunas de las teorías del matemático Leonhard Euler..

El teorema de Euler a partir de la teoría de grafos.

Se estudia la teoría de grafos en relación con el teorema de Euler. La teoría de grafos se refiere a la teoría de conjuntos relativa a las relaciones binarias de un conjunto numerable consigo mismo. Esta teoría posee un vasto campo de aplicaciones en Física, Economía, Teoría de la Información, Programación Lineal, Transportas, Psicología, e incluso en ciertos dominios del arte. Se pretende realizar un trabajo que sirva como seminario optativo para los alumnos de COU, que presente a los alumnos un teorema clásico de geometría mediante la teoría de grafos, un aspecto bastante olvidado en los programas. Se utilizan los métodos y el lenguaje de la teoría de grafos para demostrar el teorema de Euler, que liga caras, vértices y aristas de un poliedro regular. Para todo ello en primer lugar se sistematizan una serie de conceptos previos, se analizan las propiedades de distintos tipos de grafos, y por último, se realizan demostraciones.

View-dependent information theory quality measures for pixel sampling and scene discretization in flatland

In this paper, we present view-dependent information theory quality measures for pixel sampling and scene discretization in flatland. The measures are based on a definition for the mutual information of a line, and have a purely geometrical basis. Several algorithms exploiting them are presented and compare well with an existing one based on depth differences

A cell by cell anisotropic adaptive mesh ALE scheme for the numerical solution of the Euler equations

In this paper a cell by cell anisotropic adaptive mesh technique is added to an existing staggered mesh Lagrange plus remap finite element ALE code for the solution of the Euler equations. The quadrilateral finite elements may be subdivided isotropically or anisotropically and a hierarchical data structure is employed. An efficient computational method is proposed, which only solves on the finest level of resolution that exists for each part of the domain with disjoint or hanging nodes being used at resolution transitions. The Lagrangian, equipotential mesh relaxation and advection (solution remapping) steps are generalised so that they may be applied on the dynamic mesh. It is shown that for a radial Sod problem and a two-dimensional Riemann problem the anisotropic adaptive mesh method runs over eight times faster.