Home About us Contact
|
Home About us Contact | ||
|
|
||
Efficient Scheme (efficient + scheme)
Selected AbstractsSLICE-S: A Semi-Lagrangian Inherently Conserving and Efficient scheme for transport problems on the SphereTHE QUARTERLY JOURNAL OF THE ROYAL METEOROLOGICAL SOCIETY, Issue 602 2004Mohamed Zerroukat Abstract The Semi-Lagrangian Inherently Conserving and Efficient (SLICE) scheme developed for Cartesian geometry is generalized to spherical geometry. The spherical version, SLICE-S, is similarly based on a Control Volume approach and multiple sweeps of a one-dimensional O(,s4) (where s is the spherical distance) conservative remapping algorithm along Eulerian latitudes, then along Lagrangian longitudes. The resulting conservative scheme requires no restriction on either the polar meridional or zonal Courant numbers. SLICE-S is applied to the standard problems of solid-body rotation and deformational flow, and results are compared with those of a standard non-conservative and other published conservative semi-Lagrangian schemes. In addition to mass conservation, and consistent with the performance of SLICE, the present scheme is competitive in terms of accuracy and efficiency. © Crown copyright, 2004. Royal Meteorological Society [source] ParCYCLIC: finite element modelling of earthquake liquefaction response on parallel computersINTERNATIONAL JOURNAL FOR NUMERICAL AND ANALYTICAL METHODS IN GEOMECHANICS, Issue 12 2004Jun Peng Abstract This paper presents the computational procedures and solution strategy employed in ParCYCLIC, a parallel non-linear finite element program developed based on an existing serial code CYCLIC for the analysis of cyclic seismically-induced liquefaction problems. In ParCYCLIC, finite elements are employed within an incremental plasticity, coupled solid,fluid formulation. A constitutive model developed for simulating liquefaction-induced deformations is a main component of this analysis framework. The elements of the computational strategy, designed for distributed-memory message-passing parallel computer systems, include: (a) an automatic domain decomposer to partition the finite element mesh; (b) nodal ordering strategies to minimize storage space for the matrix coefficients; (c) an efficient scheme for the allocation of sparse matrix coefficients among the processors; and (d) a parallel sparse direct solver. Application of ParCYCLIC to simulate 3-D geotechnical experimental models is demonstrated. The computational results show excellent parallel performance and scalability of ParCYCLIC on parallel computers with a large number of processors. Copyright © 2004 John Wiley & Sons, Ltd. [source] Solution of clamped rectangular plate problemsINTERNATIONAL JOURNAL FOR NUMERICAL METHODS IN BIOMEDICAL ENGINEERING, Issue 10 2004Robert L. Taylor Abstract In this brief note, we present an efficient scheme for determining very accurate solutions to the clamped rectangular plate problem. The method is based upon the classical double cosine series expansion and an exploitation of the Sherman,Morrison,Woodbury formula. If the cosine expansion involves M terms and N terms in the two plate axes directions, then the classical method for this problem involves solving a system of (MN) × (MN) equations. Our proposal reduces the problem down to a system of well-conditioned N × N equations (or M × M when M < N). Numerical solutions for rectangular plates with various side ratios are presented and compared to the solution generated via Hencky's method. Corrections to classical results and additional digits for use in finite-element convergence studies are given. As an application example, these are used to show the rate of convergence for thin plate finite-element solutions computed using the Bogner,Fox,Schmit element. Copyright © 2004 John Wiley & Sons, Ltd. [source] Imposition of essential boundary conditions by displacement constraint equations in meshless methodsINTERNATIONAL JOURNAL FOR NUMERICAL METHODS IN BIOMEDICAL ENGINEERING, Issue 3 2001Xiong Zhang Abstract One of major difficulties in the implementation of meshless methods is the imposition of essential boundary conditions as the approximations do not pass through the nodal parameter values. As a consequence, the imposition of essential boundary conditions in meshless methods is quite awkward. In this paper, a displacement constraint equations method (DCEM) is proposed for the imposition of the essential boundary conditions, in which the essential boundary conditions is treated as a constraint to the discrete equations obtained from the Galerkin methods. Instead of using the methods of Lagrange multipliers and the penalty method, a procedure is proposed in which unknowns are partitioned into two subvectors, one consisting of unknowns on boundary ,u, and one consisting of the remaining unknowns. A simplified displacement constraint equations method (SDCEM) is also proposed, which results in a efficient scheme with sufficient accuracy for the imposition of the essential boundary conditions in meshless methods. The present method results in a symmetric, positive and banded stiffness matrix. Numerical results show that the accuracy of the present method is higher than that of the modified variational principles. The present method is a exact method for imposing essential boundary conditions in meshless methods, and can be used in Galerkin-based meshless method, such as element-free Galerkin methods, reproducing kernel particle method, meshless local Petrov,Galerkin method. Copyright © 2001 John Wiley & Sons, Ltd. [source] Error resilient data transport in sensor network applications: A generic perspective,INTERNATIONAL JOURNAL OF CIRCUIT THEORY AND APPLICATIONS, Issue 2 2009Rachit Agarwal Abstract The error recovery problem in wireless sensor networks is studied from a generic resource-constrained energy-optimization perspective. To characterize the features of error recovery schemes that suit the majority of applications, an energy model is developed and inferences are drawn based on a suitable performance metric. For applications that require error control coding, an efficient scheme is proposed based on an interesting observation related to shortened Reed,Solomon (RS) codes for packet reliability. It is shown that multiple instances (,) of RS codes defined on a smaller alphabet combined with interleaving results in smaller resource usage, while the performance exceeds the benefits of a shortened RS code defined over a larger alphabet. In particular, the proposed scheme can have an error correction capability of up to , times larger than that of the conventional RS scheme without changing the rate of the code with much lower power, timing and memory requirements. Implementation results show that such a scheme is 43% more power efficient compared with the RS scheme with the same code rate. Besides, such an approach results in 46% faster computations and 53% reduction in memory requirements. Copyright © 2008 John Wiley & Sons, Ltd. [source] Adaptive zone routing protocol for ad hoc network nodes with non-uniform mobilitiesINTERNATIONAL JOURNAL OF COMMUNICATION SYSTEMS, Issue 9 2003Xiaofeng Zhang Abstract In recent years, a variety of new routing protocols for mobile ad hoc wireless NETworks (MANETs) have been developed. Performance evaluation and comparison of many of these routing protocols have been performed using detailed simulation models. Zone routing protocol (ZRP) is one of these routing protocols, which is a hybrid routing protocol that proactively maintains routing information for a local neighbourhood (routing zone), while reactively acquiring routes to destinations beyond the routing zone. The studies on ZRP have assumed homogeneous scenarios where all mobile nodes have uniform mobility and are statistically identical, lacking the studies on heterogeneous scenarios where mobile nodes move with non-uniform mobilities in the same network. In this paper, we study the performance of ZRP in such scenarios. We propose an efficient scheme for ZRP to adapt to the non-uniform mobilities scenario and study its performance for different mobility scenarios, network loads and network sizes. Copyright © 2003 John Wiley & Sons, Ltd. [source] Studies on some singular potentials in quantum mechanicsINTERNATIONAL JOURNAL OF QUANTUM CHEMISTRY, Issue 6 2005Amlan K. RoyArticle first published online: 10 MAY 200 Abstract A simple methodology is suggested for the efficient calculation of certain central potentials having singularities. The generalized pseudospectral method used in this work facilitates nonuniform and optimal spatial discretization. Applications have been made to calculate the energies, densities, and expectation values for two singular potentials of physical interest, viz., (i) the harmonic potential plus inverse quartic and sextic perturbation and (ii) the Coulomb potential with a linear and quadratic term for a broad range of parameters. The first 10 states belonging to a maximum of ,, = 8 and 5 for (i) and (ii) have been computed with good accuracy and compared with the most accurate available literature data. The calculated results are in excellent agreement, especially in light of the difficulties encountered in these potentials. Some new states are reported here for the first time. This offers a general and efficient scheme for calculating these and other similar potentials of physical and mathematical interest in quantum mechanics accurately. © 2005 Wiley Periodicals, Inc. Int J Quantum Chem, 2005 [source] An efficient evaluation of the Green's functions for periodic structures in multilayered mediaMICROWAVE AND OPTICAL TECHNOLOGY LETTERS, Issue 11 2009W. Zhuang Abstract An efficient scheme is presented to calculate the periodic structure in planar multilayered media. The slowly converging series for the periodic Green's function is accelerated using the Ewald's method combined with Shank transformation and the computational time is significantly reduced compared with the direct spectral summation. Numerical examples are given to demonstrate the efficiency of the proposed method. © 2009 Wiley Periodicals, Inc. Microwave Opt Technol Lett 51: 2639,2643, 2009; Published online in Wiley InterScience (www.interscience.wiley.com). DOI 10.1002/mop.24696 [source] Impedance matrix generation by using the fast matrix generation techniqueMICROWAVE AND OPTICAL TECHNOLOGY LETTERS, Issue 1 2009Soon Jae Kwon Abstract The computation of impedance matrix for layered structures is time-consuming because each element requires the evaluation of quadruple integrals. To increase the efficiency, we propose a technique referred to as the fast matrix generation. In this method, conventional and rigorous numerical methods are still used for generating the impedance matrix elements that are associated with the near-field interactions, whereas a more efficient scheme is employed where the separation distance between basis and testing functions exceeds a threshold value. A significant saving in computation time, sometimes over 90%, can be achieved via the application of this approach, as is demonstrated by numerical results for a number of typical microwave circuits. © 2008 Wiley Periodicals, Inc. Microwave Opt Technol Lett 51: 204,213, 2009; Published online in Wiley InterScience (www.interscience.wiley.com). DOI 10.1002/mop.24015 [source] Maximizing residual flow under an arc destructionNETWORKS: AN INTERNATIONAL JOURNAL, Issue 4 2001Y. P. Aneja Abstract In this paper, we consider two problems related to single-commodity flows on a directed network. In the first problem, for a given s , t flow, if an arc is destroyed, all the flow that is passing through that arc is destroyed. What is left flowing from s to t is the residual flow. The objective is to determine a flow pattern such that the residual flow is maximized. We provide a strongly polynomial algorithm for this problem, called the maximum residual flow problem, and consider various extensions of this basic model. In the second problem, known as the "most vital arc" problem, the objective is to remove an arc so that the maximal flow on the residual network is as small as possible. Results are also derived which help implement an efficient scheme for solving this problem. © 2001 John Wiley & Sons, Inc. [source] An efficient scheme for minimax solutions of multiple linear-quadratic controlOPTIMAL CONTROL APPLICATIONS AND METHODS, Issue 6 2005Wan-Lung Ng Abstract Optimal control is one of the most important methodologies for studies of dynamic systems in many areas of sciences, engineering and economics. Minimax optimal control is a special topic in the general framework of multiple optimal control problems. Minimax optimal control can be considered as a dynamic game with multiple players under the same system. In this paper, we develop a fast search for a minimax solution of multiple linear-quadratic control problems. The algorithm improves the existing solution scheme by adjusting the multiple weighting coefficients in each iteration and also including updates for step-size control. Copyright © 2005 John Wiley & Sons, Ltd. [source] Physically based two-moment bulkwater parametrization for warm-cloud microphysicsTHE QUARTERLY JOURNAL OF THE ROYAL METEOROLOGICAL SOCIETY, Issue 596 2004Jen-Ping Chen Abstract A two-moment bulkwater parametrization scheme for warm-cloud microphysics is developed via statistical analyses of results from a detailed parcel model. This computationally efficient scheme is quite accurate and produces bulkwater properties which resemble the results from a fully explicit microphysical model. It responds sensitively to the effect of aerosol types on the cloud drop number concentration and the timing of rain initiation. Diagnostic formulae are also provided for the group fall velocity, number and mass sedimentation fluxes, the radar reflectivity factor, and the effective radii of cloud drops and raindrops. This physically sound and easy to use parametrization scheme could be useful in improving the microphysical representation in regional- and cloud-scale models. Copyright © 2004 Royal Meteorological Society [source] | |||||||||||||||||||