9 resultados para Arbitrary Lagrangian-Eulerian method
em Aston University Research Archive
Resumo:
The article deals with the CFD modelling of fast pyrolysis of biomass in an Entrained Flow Reactor (EFR). The Lagrangian approach is adopted for the particle tracking, while the flow of the inert gas is treated with the standard Eulerian method for gases. The model includes the thermal degradation of biomass to char with simultaneous evolution of gases and tars from a discrete biomass particle. The chemical reactions are represented using a two-stage, semi-global model. The radial distribution of the pyrolysis products is predicted as well as their effect on the particle properties. The convective heat transfer to the surface of the particle is computed using the Ranz-Marshall correlation.
Resumo:
The pyrolysis of a freely moving cellulosic particle inside a 41.7mgs -1 source continuously fed fluid bed reactor subjected to convective heat transfer is modelled. The Lagrangian approach is adopted for the particle tracking inside the reactor, while the flow of the inert gas is treated with the standard Eulerian method for gases. The model incorporates the thermal degradation of cellulose to char with simultaneous evolution of gases and vapours from discrete cellulosic particles. The reaction kinetics is represented according to the Broido–Shafizadeh scheme. The convective heat transfer to the surface of the particle is solved by two means, namely the Ranz–Marshall correlation and the limit case of infinitely fast external heat transfer rates. The results from both approaches are compared and discussed. The effect of the different heat transfer rates on the discrete phase trajectory is also considered.
Resumo:
A simple method for training the dynamical behavior of a neural network is derived. It is applicable to any training problem in discrete-time networks with arbitrary feedback. The method resembles back-propagation in that it is a least-squares, gradient-based optimization method, but the optimization is carried out in the hidden part of state space instead of weight space. A straightforward adaptation of this method to feedforward networks offers an alternative to training by conventional back-propagation. Computational results are presented for simple dynamical training problems, with varied success. The failures appear to arise when the method converges to a chaotic attractor. A patch-up for this problem is proposed. The patch-up involves a technique for implementing inequality constraints which may be of interest in its own right.
Resumo:
A recently proposed colour based tracking algorithm has been established to track objects in real circumstances [Zivkovic, Z., Krose, B. 2004. An EM-like algorithm for color-histogram-based object tracking. In: Proc, IEEE Conf. on Computer Vision and Pattern Recognition, pp. 798-803]. To improve the performance of this technique in complex scenes, in this paper we propose a new algorithm for optimally adapting the ellipse outlining the objects of interest. This paper presents a Lagrangian based method to integrate a regularising component into the covariance matrix to be computed. Technically, we intend to reduce the residuals between the estimated probability distribution and the expected one. We argue that, by doing this, the shape of the ellipse can be properly adapted in the tracking stage. Experimental results show that the proposed method has favourable performance in shape adaption and object localisation.
Resumo:
We study how the spatial distribution of inertial particles evolves with time in a random flow. We describe an explosive appearance of caustics and show how they influence an exponential growth of clusters due to smooth parts of the flow, leading in particular to an exponential growth of the average distance between particles. We demonstrate how caustics restrict applicability of Lagrangian description to inertial particles.
Resumo:
We present an implementation of the domain-theoretic Picard method for solving initial value problems (IVPs) introduced by Edalat and Pattinson [1]. Compared to Edalat and Pattinson's implementation, our algorithm uses a more efficient arithmetic based on an arbitrary precision floating-point library. Despite the additional overestimations due to floating-point rounding, we obtain a similar bound on the convergence rate of the produced approximations. Moreover, our convergence analysis is detailed enough to allow a static optimisation in the growth of the precision used in successive Picard iterations. Such optimisation greatly improves the efficiency of the solving process. Although a similar optimisation could be performed dynamically without our analysis, a static one gives us a significant advantage: we are able to predict the time it will take the solver to obtain an approximation of a certain (arbitrarily high) quality.
Resumo:
We propose a systematic method for the synthesis of arbitrary group delay responses by using all-pass structures of coupled optical cavities. Optimum structure parameters design, in terms of filter order and accuracy, are obtained.
Resumo:
We propose a systematic method for the synthesis of arbitrary group delay responses by using allpass structures of coupled optical cavities. Optimum structure parameters design, in terms of filter order and accuracy, are obtained. © 2012 OSA.
Resumo:
A new and simple fabrication technique is reported for the UV inscription of intrinsically apodized chirped fibre gratings at an arbitrary Bragg wavelength employing a single chirped phase-mask in a scanning Talbot interferometer set-up. Chirped gratings have been successfully produced over a large wavelength range and with bandwidths up to 5 nm. These gratings exhibit the time-delay response of a small ripple effect. In the present paper a comparison with previously reported fabrication methods is given, showing the advantages and disadvantages of the different methods.