			Home About us Contact

Computational Load (computational + load)

Distribution by Scientific Domains

Engineering	45%
Chemistry	36%
Information Science and Computing	18%

Selected Abstracts

A Semi-Lagrangian CIP Fluid Solver without Dimensional Splitting

COMPUTER GRAPHICS FORUM, Issue 2 2008
Doyub Kim
Abstract In this paper, we propose a new constrained interpolation profile (CIP) method that is stable and accurate but requires less amount of computation compared to existing CIP-based solvers. CIP is a high-order fluid advection solver that can reproduce rich details of fluids. It has third-order accuracy but its computation is performed over a compact stencil. These advantageous features of CIP are, however, diluted by the following two shortcomings: (1) CIP contains a defect in the utilization of the grid data, which makes the method suitable only for simulations with a tight CFL restriction; and (2) CIP does not guarantee unconditional stability. There have been several attempts to fix these problems in CIP, but they have been only partially successful. The solutions that fixed both problems ended up introducing other undesirable features, namely increased computation time and/or reduced accuracy. This paper proposes a novel modification of the original CIP method that fixes all of the above problems without increasing the computational load or reducing the accuracy. Both quantitative and visual experiments were performed to test the performance of the new CIP in comparison to existing fluid solvers. The results show that the proposed method brings significant improvements in both accuracy and speed. [source]

Advanced eager scheduling for Java-based adaptive parallel computing

CONCURRENCY AND COMPUTATION: PRACTICE & EXPERIENCE, Issue 7-8 2005
Michael O. Neary
Abstract Javelin 3 is a software system for developing large-scale, fault-tolerant, adaptively parallel applications. When all or part of their application can be cast as a master,worker or branch-and-bound computation, Javelin 3 frees application developers from concerns about inter-processor communication and fault tolerance among networked hosts, allowing them to focus on the underlying application. The paper describes a fault-tolerant task scheduler and its performance analysis. The task scheduler integrates work stealing with an advanced form of eager scheduling. It enables dynamic task decomposition, which improves host load-balancing in the presence of tasks whose non-uniform computational load is evident only at execution time. Speedup measurements are presented of actual performance on up to 1000 hosts. We analyze the expected performance degradation due to unresponsive hosts, and measure actual performance degradation due to unresponsive hosts. Copyright © 2005 John Wiley & Sons, Ltd. [source]

Practical implementation of multichannel adaptive filters based on FTF and AP algorithms for active control

INTERNATIONAL JOURNAL OF ADAPTIVE CONTROL AND SIGNAL PROCESSING, Issue 2-3 2005
Alberto González
Abstract In this paper, multichannel affine projection (AP) algorithms and fast transversal filters (FTF) are introduced for active noise control. A comparative practical study of the mentioned algorithms with the filtered-X LMS (F-XLMS) and the recursive least squares (RLS) is presented for multichannel systems. This study is based on simulations using real data and is mainly focused on: their computational cost and memory load, their convergence properties, their stability and their ability to create quiet zones around listener ears. Simulations show that algorithms based on FTF exhibit a good trade-off between computational cost and convergence speed. On the other hand, those based on RLS are slightly faster but they present higher computational load and stability problems in their practical implementation. It has also been observed that algorithms based on low order AP algorithms present less computational cost than the FTF-based ones but a slightly slower convergence speed. Therefore these algorithms show a desirable behaviour and versatility for practical applications. Finally, results obtained in a real-time multichannel system validate the use of AP algorithms in practical applications as an alternative to the classical multichannel F-XLMS since they provide meaningful attenuation levels, lower convergence time and similar computational cost. Additionally, as simulations indicated, AP algorithm performance can be easily improved increasing its projection order and using fast versions. Copyright © 2004 John Wiley & Sons, Ltd. [source]

Extension of efficient predictive control to the nonlinear case

INTERNATIONAL JOURNAL OF ROBUST AND NONLINEAR CONTROL, Issue 5 2005
M. Bacic
Abstract The combined use of the closed-loop paradigm, an augmented autonomous state space formulation, partial invariance, local affine difference inclusion, and polytopic invariance are deployed in this paper to propose an NMPC algorithm which, unlike earlier algorithms that have to tackle online a nonlinear non-convex optimization problem, requires the solution of a simple QP. The proposed algorithm is shown to outperform earlier algorithms in respect of size of region of attraction and online computational load. Conversely, for comparable computational loads, the proposed algorithm outperforms earlier algorithms in terms of optimality of dynamic performance. Copyright © 2005 John Wiley & Sons, Ltd. [source]

Multiparameter models for performance analysis of UASB reactors

JOURNAL OF CHEMICAL TECHNOLOGY & BIOTECHNOLOGY, Issue 8 2008
C M Narayanan
Abstract BACKGROUND: UASB (upflow anaerobic sludge blanket) bioreactors have the distinct advantage that they do not demand support particles and provide a high rate of bioconversion even with high strength feedstocks. Although apparently simple in construction, the performance analysis of these reactors involves a high degree of mathematical complexity. Most simulation models reported in the literature are rudimentary in nature as they involve gross approximations. In the present paper, two multiparameter simulation packages are presented that make no simplifying assumptions and hence are more rigorous in nature. RESULTS: The first package assumes the sludge bed to be a plug-flow reactor (PFR) and the sludge blanket to be an ideal continuous stirred tank reactor (CSTR). The second package equates the reactor to a plug flow dispersion reactor (PFDR), the axial dispersion coefficient however being a function of axial distance. The three phase nature of the sludge blanket has been considered and the variation of gas velocity in the axial direction has been taken into account. Three different kinetic equations have been considered. Resistance to diffusion of substrate into sludge granules has been accounted for by incorporating appropriately defined effectiveness factors. The applicability of simulation packages developed has been ascertained by comparing with real-life data collected from industrial/pilot plant/laboratory UASB reactors. The maximum deviation observed is ± 15%. CONCLUSIONS: Although the software packages developed have high computational load, their applicability has been successfully ascertained and they may be recommended for design and installation of industrial UASB reactors and also for the rating of existing installations. Copyright © 2008 Society of Chemical Industry [source]

Incorporation of deMon2k as a new parallel quantum mechanical code for the PUPIL system

JOURNAL OF COMPUTATIONAL CHEMISTRY, Issue 14 2010
Oscar Bertran
Abstract The PUPIL system is a combination of software and protocols for the systematic linkage and interoperation of molecular dynamics and quantum mechanics codes to perform QM/MD (sometimes called QM/MM) calculations. The Gaussian03 and Amber packages were added to the PUPIL suite recently. However, efficient parallel QM codes are critical because calculation of the QM forces is the overwhelming majority of the computational load. Here we report details of incorporation of the deMon2k density functional suite as a new parallel QM code. An additional motivation is to add a highly optimized, purely DFT code. We illustrate with a demonstration study of the influence of perchlorate as a dopant ion of the poly(3,4-ethylenedioxythiophene) conducting polymer in explicit acetonitrile solvent using Amber and deMon2k. We discuss unanticipated requirements for use of a scheme for semi-empirical correction of Kohn-Sham eigenvalues to give physically meaningful one-electron gap energies. We provide comparison of both geometric parameters and electronic properties for nondoped and doped systems. We also present results comparing deMon2k and Gaussian03 calculation of forces for a short sequence of steps. We discuss briefly some difficult problems of quantum zone SCF convergence for the anionically doped system. The difficulties seem to be caused by well-know deficiencies in simple approximate exchange-correlation functionals. © 2010 Wiley Periodicals, Inc. J Comput Chem, 2010 [source]

Optimal Representative Blocks for the Efficient Tracking of a Moving Object

JOURNAL OF FIELD ROBOTICS (FORMERLY JOURNAL OF ROBOTIC SYSTEMS), Issue 3 2004
SangJoo Kim
Optimal representative blocks are proposed for an efficient tracking of a moving object and it is verified experimentally by using a mobile robot with a pan-tilt camera. The key idea comes from the fact that when the image size of a moving object is shrunk in an image frame according to the distance between the camera of mobile robot and the moving object, the tracking performance of a moving object can be improved by shrinking the size of representative blocks according to the object image size. Motion estimation using edge detection (ED) and block-matching algorithm (BMA) are often used in the case of moving object tracking by vision sensors. However, these methods often miss the real-time vision data since these schemes suffer from the heavy computational load. To overcome this problem and to improve the tracking performance, the optimal representative block that can reduce a lot of data to be computed is defined and optimized by changing the size of the representative block according to the size of object in the image frame. The proposed algorithm is verified experimentally by using a mobile robot with a two degree-of-freedom active camera. © 2004 Wiley Periodicals, Inc. [source]

Approximate dynamic programming based optimal control applied to an integrated plant with a reactor and a distillation column with recycle

AICHE JOURNAL, Issue 4 2009
Thidarat Tosukhowong
Abstract An approximate dynamic programming (ADP) method has shown good performance in solving optimal control problems in many small-scale process control applications. The offline computational procedure of ADP constructs an approximation of the optimal "cost - to - go" function, which parameterizes the optimal control policy with respect to the state variable. With the approximate "cost - to - go" function computed, a multistage optimization problem that needs to be solved online at every sample time can be reduced to a single-stage optimization, thereby significantly lessening the real-time computational load. Moreover, stochastic uncertainties can be addressed relatively easily within this framework. Nonetheless, the existing ADP method requires excessive offline computation when applied to a high-dimensional system. A case study of a reactor and a distillation column with recycle was used to illustrate this issue. Then, several ways were proposed to reduce the computational load so that the ADP method can be applied to high-dimensional integrated plants. The results showed that the approach is much more superior to NMPC in both deterministic and stochastic cases. © 2009 American Institute of Chemical Engineers AIChE J, 2009 [source]

Computational relaxed TP model transformation: restricting the computation to subspaces of the dynamic model,

ASIAN JOURNAL OF CONTROL, Issue 5 2009
Szabolcs Nagy
Abstract The tensor-product (TP) model transformation is a recently proposed numerical method capable of transforming linear parameter varying state-space models to the higher order singular value decomposition (HOSVD) based canonical form of polytopic models. It is also capable of generating various types of convex TP models, a type of polytop models, for linear matrix inequality based controller design. The crucial point of the TP model transformation is that its computational load exponentially explodes with the dimensionality of the parameter vector of the parameter-varying state-space model. In this paper we propose a modified TP model transformation that leads to considerable reduction of the computation. The key idea of the method is that instead of transforming the whole system matrix at once in the whole parameter space, we decompose the problem and perform the transformation element wise and restrict the computation to the subspace where the given element of the model varies. The modified TP model transformation can readily be executed in higher dimensional cases when the original TP model transformation fails. The effectiveness of the new method is illustrated with numerical examples. Copyright © 2009 John Wiley and Sons Asia Pte Ltd and Chinese Automatic Control Society [source]