921 resultados para Point interpolation method
Resumo:
This paper relates to the importance of impact of the chosen bottle-point method when conducting ion exchange equilibria experiments. As an illustration, potassium ion exchange with strong acid cation resin was investigated due to its relevance to the treatment of various industrial effluents and groundwater. The “constant mass” bottle-point method was shown to be problematic in that depending upon the resin mass used the equilibrium isotherm profiles were different. Indeed, application of common equilibrium isotherm models revealed that the optimal fit could be with either the Freundlich or Temkin equations, depending upon the conditions employed. It could be inferred that the resin surface was heterogeneous in character, but precise conclusions regarding the variation in the heat of sorption were not possible. Estimation of the maximum potassium loading was also inconsistent when employing the “constant mass” method. The “constant concentration” bottle-point method illustrated that the Freundlich model was a good representation of the exchange process. The isotherms recorded were relatively consistent when compared to the “constant mass” approach. Unification of all the equilibrium isotherm data acquired was achieved by use of the Langmuir Vageler expression. The maximum loading of potassium ions was predicted to be at least 116.5 g/kg resin.
Resumo:
Careful study of various aspects presented in the note reveals basic fallacies in the concept and final conclusions.The Authors claim to have presented a new method of determining C-v. However, the note does not contain a new method. In fact, the method proposed is an attempt to generate settlement vs. time data using only two values of (t,8). The Authors have used a rectangular hyperbola method to determine C-v from the predicated 8- t data. In this context, the title of the paper itself is misleading and questionable. The Authors have compared C-v values predicated with measured values, both of them being the results of the rectangular hyperbola method.
Resumo:
Today finite element method is a well established tool in engineering analysis and design. Though there axe many two and three dimensional finite elements available, it is rare that a single element performs satisfactorily in majority of practical problems. The present work deals with the development of 4-node quadrilateral element using extended Lagrange interpolation functions. The classical univariate Lagrange interpolation is well developed for 1-D and is used for obtaining shape functions. We propose a new approach to extend the Lagrange interpolation to several variables. When variables axe more than one the method also gives the set of feasible bubble functions. We use the two to generate shape function for the 4-node arbitrary quadrilateral. It will require the incorporation of the condition of rigid body motion, constant strain and Navier equation by imposing necessary constraints. The procedure obviates the need for isoparametric transformation since interpolation functions are generated for arbitrary quadrilateral shapes. While generating the element stiffness matrix, integration can be carried out to the accuracy desired by dividing the quadrilateral into triangles. To validate the performance of the element which we call EXLQUAD4, we conduct several pathological tests available in the literature. EXLQUAD4 predicts both stresses and displacements accurately at every point in the element in all the constant stress fields. In tests involving higher order stress fields the element is assured to converge in the limit of discretisation. A method thus becomes available to generate shape functions directly for arbitrary quadrilateral. The method is applicable also for hexahedra. The approach should find use for development of finite elements for use with other field equations also.
Resumo:
Real-time simulation of deformable solids is essential for some applications such as biological organ simulations for surgical simulators. In this work, deformable solids are approximated to be linear elastic, and an easy and straight forward numerical technique, the Finite Point Method (FPM), is used to model three dimensional linear elastostatics. Graphics Processing Unit (GPU) is used to accelerate computations. Results show that the Finite Point Method, together with GPU, can compute three dimensional linear elastostatic responses of solids at rates suitable for real-time graphics, for solids represented by reasonable number of points.
Resumo:
Real-time simulation of deformable solids is essential for some applications such as biological organ simulations for surgical simulators. In this work, deformable solids are approximated to be linear elastic, and an easy and straight forward numerical technique, the Finite Point Method (FPM), is used to model three dimensional linear elastostatics. Graphics Processing Unit (GPU) is used to accelerate computations. Results show that the Finite Point Method, together with GPU, can compute three dimensional linear elastostatic responses of solids at rates suitable for real-time graphics, for solids represented by reasonable number of points.
Resumo:
By using the kernel function of the smoothed particle hydrodynamics (SPH) and modification of statistical volumes of the boundary points and their kernel functions, a new version of smoothed point method is established for simulating elastic waves in solid. With the simplicity of SPH kept, the method is easy to handle stress boundary conditions, especially for the transmitting boundary condition. A result improving by de-convolution is also proposed to achieve high accuracy under a relatively large smooth length. A numerical example is given and compared favorably with the analytical solution.
Resumo:
A global numerical model for shallow water flows on the cubed-sphere grid is proposed in this paper. The model is constructed by using the constrained interpolation profile/multi-moment finite volume method (CIP/MM FVM). Two kinds of moments, i.e. the point value (PV) and the volume-integrated average (VIA) are defined and independently updated in the present model by different numerical formulations. The Lax-Friedrichs upwind splitting is used to update the PV moment in terms of a derivative Riemann problem, and a finite volume formulation derived by integrating the governing equations over each mesh element is used to predict the VIA moment. The cubed-sphere grid is applied to get around the polar singularity and to obtain uniform grid spacing for a spherical geometry. Highly localized reconstruction in CIP/MM FVM is well suited for the cubed-sphere grid, especially in dealing with the discontinuity in the coordinates between different patches. The mass conservation is completely achieved over the whole globe. The numerical model has been verified by Williamson's standard test set for shallow water equation model on sphere. The results reveal that the present model is competitive to most existing ones. (C) 2008 Elsevier Inc. All rights reserved.
Resumo:
This work shows the method developed to solve the wheel-rail contact problem via a look-up table with a three-dimensional elastic model. This method enables introduction of the two contact point effect on vehicle movement using three-dimensional analysis of surfaces including the influence of the angle of attack. This work presents several dynamic simulations and studies the impact that the introduction of the two contact points on three dimensions has on wear indexes and derailment risk against traditional bidimensional analysis. Furthermore, it studies advantages and disadvantages of using a look-up table against an on-line resolution of the problem.
Resumo:
The convective--diffusion equation is of primary importance in such fields as fluid dynamics and heat transfer hi the numerical methods solving the convective-diffusion equation, the finite volume method can use conveniently diversified grids (structured and unstructured grids) and is suitable for very complex geometry The disadvantage of FV methods compared to the finite difference method is that FV-methods of order higher than second are more difficult to develop in three-dimensional cases. The second-order central scheme (2cs) offers a good compromise among accuracy, simplicity and efficiency, however, it will produce oscillatory solutions when the grid Reynolds numbers are large and then very fine grids are required to obtain accurate solution. The simplest first-order upwind (IUW) scheme satisfies the convective boundedness criteria, however. Its numerical diffusion is large. The power-law scheme, QMCK and second-order upwind (2UW) schemes are also often used in some commercial codes. Their numerical accurate are roughly consistent with that of ZCS. Therefore, it is meaningful to offer higher-accurate three point FV scheme. In this paper, the numerical-value perturbational method suggested by Zhi Gao is used to develop an upwind and mixed FV scheme using any higher-order interpolation and second-order integration approximations, which is called perturbational finite volume (PFV) scheme. The PFV scheme uses the least nodes similar to the standard three-point schemes, namely, the number of the nodes needed equals to unity plus the face-number of the control volume. For instanc6, in the two-dimensional (2-D) case, only four nodes for the triangle grids and five nodes for the Cartesian grids are utilized, respectively. The PFV scheme is applied on a number of 1-D problems, 2~Dand 3-D flow model equations. Comparing with other standard three-point schemes, The PFV scheme has much smaller numerical diffusion than the first-order upwind (IUW) scheme, its numerical accuracy are also higher than the second-order central scheme (2CS), the power-law scheme (PLS), the QUICK scheme and the second-order upwind(ZUW) scheme.
Resumo:
A new high-order finite volume method based on local reconstruction is presented in this paper. The method, so-called the multi-moment constrained finite volume (MCV) method, uses the point values defined within single cell at equally spaced points as the model variables (or unknowns). The time evolution equations used to update the unknowns are derived from a set of constraint conditions imposed on multi kinds of moments, i.e. the cell-averaged value and the point-wise value of the state variable and its derivatives. The finite volume constraint on the cell-average guarantees the numerical conservativeness of the method. Most constraint conditions are imposed on the cell boundaries, where the numerical flux and its derivatives are solved as general Riemann problems. A multi-moment constrained Lagrange interpolation reconstruction for the demanded order of accuracy is constructed over single cell and converts the evolution equations of the moments to those of the unknowns. The presented method provides a general framework to construct efficient schemes of high orders. The basic formulations for hyperbolic conservation laws in 1- and 2D structured grids are detailed with the numerical results of widely used benchmark tests. (C) 2009 Elsevier Inc. All rights reserved.
Resumo:
In a paper published in 1961, L. Cesari [1] introduces a method which extends certain earlier existence theorems of Cesari and Hale ([2] to [6]) for perturbation problems to strictly nonlinear problems. Various authors ([1], [7] to [15]) have now applied this method to nonlinear ordinary and partial differential equations. The basic idea of the method is to use the contraction principle to reduce an infinite-dimensional fixed point problem to a finite-dimensional problem which may be attacked using the methods of fixed point indexes.
The following is my formulation of the Cesari fixed point method:
Let B be a Banach space and let S be a finite-dimensional linear subspace of B. Let P be a projection of B onto S and suppose Г≤B such that pГ is compact and such that for every x in PГ, P-1x∩Г is closed. Let W be a continuous mapping from Г into B. The Cesari method gives sufficient conditions for the existence of a fixed point of W in Г.
Let I denote the identity mapping in B. Clearly y = Wy for some y in Г if and only if both of the following conditions hold:
(i) Py = PWy.
(ii) y = (P + (I - P)W)y.
Definition. The Cesari fixed paint method applies to (Г, W, P) if and only if the following three conditions are satisfied:
(1) For each x in PГ, P + (I - P)W is a contraction from P-1x∩Г into itself. Let y(x) be that element (uniqueness follows from the contraction principle) of P-1x∩Г which satisfies the equation y(x) = Py(x) + (I-P)Wy(x).
(2) The function y just defined is continuous from PГ into B.
(3) There are no fixed points of PWy on the boundary of PГ, so that the (finite- dimensional) fixed point index i(PWy, int PГ) is defined.
Definition. If the Cesari fixed point method applies to (Г, W, P) then define i(Г, W, P) to be the index i(PWy, int PГ).
The three theorems of this thesis can now be easily stated.
Theorem 1 (Cesari). If i(Г, W, P) is defined and i(Г, W, P) ≠0, then there is a fixed point of W in Г.
Theorem 2. Let the Cesari fixed point method apply to both (Г, W, P1) and (Г, W, P2). Assume that P2P1=P1P2=P1 and assume that either of the following two conditions holds:
(1) For every b in B and every z in the range of P2, we have that ‖b=P2b‖ ≤ ‖b-z‖
(2)P2Г is convex.
Then i(Г, W, P1) = i(Г, W, P2).
Theorem 3. If Ω is a bounded open set and W is a compact operator defined on Ω so that the (infinite-dimensional) Leray-Schauder index iLS(W, Ω) is defined, and if the Cesari fixed point method applies to (Ω, W, P), then i(Ω, W, P) = iLS(W, Ω).
Theorems 2 and 3 are proved using mainly a homotopy theorem and a reduction theorem for the finite-dimensional and the Leray-Schauder indexes. These and other properties of indexes will be listed before the theorem in which they are used.
Resumo:
An implementation of the inverse vector Jiles-Atherton model for the solution of non-linear hysteretic finite element problems is presented. The implementation applies the fixed point method with differential reluctivity values obtained from the Jiles-Atherton model. Differential reluctivities are usually computed using numerical differentiation, which is ill-posed and amplifies small perturbations causing large sudden increases or decreases of differential reluctivity values, which may cause numerical problems. A rule based algorithm for conditioning differential reluctivity values is presented. Unwanted perturbations on the computed differential reluctivity values are eliminated or reduced with the aim to guarantee convergence. Details of the algorithm are presented together with an evaluation of the algorithm by a numerical example. The algorithm is shown to guarantee convergence, although the rate of convergence depends on the choice of algorithm parameters. © 2011 IEEE.