101,417 research outputs found
Direct numerical simulation of turbulence on a Connection Machine CM-5
In this paper we report on our first experiences with direct numerical simulation of turbulent flow on a 16-node Connection Machine CM-5. The CM-5 has been programmed at a global level using data parallel Fortran. A two-dimensional direct simulation, where the pressure is solved using a Conjugate Gradient method without preconditioning, runs at 23% of the peak. Due to higher communication costs, 3D simulations run at 13% of the peak. A diagonalwise re-ordered Incomplete Choleski Conjugate Gradient method cannot compete with a standard CG-method on the CM-5.
Recent advances on recursive filtering and sliding mode design for networked nonlinear stochastic systems: A survey
Copyright © 2013 Jun Hu et al. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.Some recent advances on the recursive filtering and sliding mode design problems for nonlinear stochastic systems with network-induced phenomena are surveyed. The network-induced phenomena under consideration mainly include missing measurements, fading measurements, signal quantization, probabilistic sensor delays, sensor saturations, randomly occurring nonlinearities, and randomly occurring uncertainties. With respect to these network-induced phenomena, the developments on filtering and sliding mode design problems are systematically reviewed. In particular, concerning the network-induced phenomena, some recent results on the recursive filtering for time-varying nonlinear stochastic systems and sliding mode design for time-invariant nonlinear stochastic systems are given, respectively. Finally, conclusions are proposed and some potential future research works are pointed out.This work was supported in part by the National Natural Science Foundation of China under Grant nos. 61134009, 61329301, 61333012, 61374127 and 11301118, the Engineering and Physical Sciences Research Council (EPSRC) of the UK under Grant no. GR/S27658/01, the Royal Society of the UK, and the Alexander von Humboldt Foundation of Germany
A Survey on Continuous Time Computations
We provide an overview of theories of continuous time computation. These
theories allow us to understand both the hardness of questions related to
continuous time dynamical systems and the computational power of continuous
time analog models. We survey the existing models, summarizing results, and
point to relevant references in the literature
Entropy Stable Finite Volume Approximations for Ideal Magnetohydrodynamics
This article serves as a summary outlining the mathematical entropy analysis
of the ideal magnetohydrodynamic (MHD) equations. We select the ideal MHD
equations as they are particularly useful for mathematically modeling a wide
variety of magnetized fluids. In order to be self-contained we first motivate
the physical properties of a magnetic fluid and how it should behave under the
laws of thermodynamics. Next, we introduce a mathematical model built from
hyperbolic partial differential equations (PDEs) that translate physical laws
into mathematical equations. After an overview of the continuous analysis, we
thoroughly describe the derivation of a numerical approximation of the ideal
MHD system that remains consistent to the continuous thermodynamic principles.
The derivation of the method and the theorems contained within serve as the
bulk of the review article. We demonstrate that the derived numerical
approximation retains the correct entropic properties of the continuous model
and show its applicability to a variety of standard numerical test cases for
MHD schemes. We close with our conclusions and a brief discussion on future
work in the area of entropy consistent numerical methods and the modeling of
plasmas
Parameterized complexity of machine scheduling: 15 open problems
Machine scheduling problems are a long-time key domain of algorithms and
complexity research. A novel approach to machine scheduling problems are
fixed-parameter algorithms. To stimulate this thriving research direction, we
propose 15 open questions in this area whose resolution we expect to lead to
the discovery of new approaches and techniques both in scheduling and
parameterized complexity theory.Comment: Version accepted to Computers & Operations Researc
- …