Search results for: iteration method
7960 Variational Iteration Method for the Solution of Boundary Value Problems
Authors: Olayiwola M.O., Gbolagade A .W., Akinpelu F. O.
In this work, we present a reliable framework to solve boundary value problems with particular significance in solid mechanics. These problems are used as mathematical models in deformation of beams. The algorithm rests mainly on a relatively new technique, the Variational Iteration Method. Some examples are given to confirm the efficiency and the accuracy of the method.
Keywords: Variational iteration method, boundary value problems, convergence, restricted variation.Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 1957
7959 A Contractor Iteration Method Using Eigenpairs for Positive Solutions of Nonlinear Elliptic Equation
Authors: Hailong Zhu, Zhaoxiang Li, Kejun Zhuang
By means of Contractor Iteration Method, we solve and visualize the Lane-Emden(-Fowler) equation Δu + up = 0, in Ω, u = 0, on ∂Ω. It is shown that the present method converges quadratically as Newton’s method and the computation of Contractor Iteration Method is cheaper than the Newton’s method.
Keywords: Positive solutions, newton's method, contractor iteration method, Eigenpairs.Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 1251
7958 Variational Iteration Method for Solving Systems of Linear Delay Differential Equations
Authors: Sara Barati, Karim Ivaz
In this paper, using a model transformation approach a system of linear delay differential equations (DDEs) with multiple delays is converted to a non-delayed initial value problem. The variational iteration method (VIM) is then applied to obtain the approximate analytical solutions. Numerical results are given for several examples involving scalar and second order systems. Comparisons with the classical fourth-order Runge-Kutta method (RK4) verify that this method is very effective and convenient.
Keywords: Variational iteration method, delay differential equations, multiple delays, Runge-Kutta method.Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 2347
7957 On Algebraic Structure of Improved Gauss-Seidel Iteration
Authors: O. M. Bamigbola, A. A. Ibrahim
Analysis of real life problems often results in linear systems of equations for which solutions are sought. The method to employ depends, to some extent, on the properties of the coefficient matrix. It is not always feasible to solve linear systems of equations by direct methods, as such the need to use an iterative method becomes imperative. Before an iterative method can be employed to solve a linear system of equations there must be a guaranty that the process of solution will converge. This guaranty, which must be determined apriori, involve the use of some criterion expressible in terms of the entries of the coefficient matrix. It is, therefore, logical that the convergence criterion should depend implicitly on the algebraic structure of such a method. However, in deference to this view is the practice of conducting convergence analysis for Gauss- Seidel iteration on a criterion formulated based on the algebraic structure of Jacobi iteration. To remedy this anomaly, the Gauss- Seidel iteration was studied for its algebraic structure and contrary to the usual assumption, it was discovered that some property of the iteration matrix of Gauss-Seidel method is only diagonally dominant in its first row while the other rows do not satisfy diagonal dominance. With the aid of this structure we herein fashion out an improved version of Gauss-Seidel iteration with the prospect of enhancing convergence and robustness of the method. A numerical section is included to demonstrate the validity of the theoretical results obtained for the improved Gauss-Seidel method.
Keywords: Linear system of equations, Gauss-Seidel iteration, algebraic structure, convergence.Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 2757
7956 An Analytical Method to Analysis of Foam Drainage Problem
Authors: A. Nikkar, M. Mighani
In this study, a new reliable technique use to handle the foam drainage equation. This new method is resulted from VIM by a simple modification that is Reconstruction of Variational Iteration Method (RVIM). The drainage of liquid foams involves the interplay of gravity, surface tension, and viscous forces. Foaming occurs in many distillation and absorption processes. Results are compared with those of Adomian’s decomposition method (ADM).The comparisons show that the Reconstruction of Variational Iteration Method is very effective and overcome the difficulty of traditional methods and quite accurate to systems of non-linear partial differential equations.
Keywords: Reconstruction of Variational Iteration Method (RVIM), Foam drainage, nonlinear partial differential equation.Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 1704
7955 A New Approximate Procedure Based On He’s Variational Iteration Method for Solving Nonlinear Hyperbolic Wave Equations
Authors: Jinfeng Wang, Yang Liu, Hong Li
In this article, we propose a new approximate procedure based on He’s variational iteration method for solving nonlinear hyperbolic equations. We introduce two transformations q = ut and σ = ux and formulate a first-order system of equations. We can obtain the approximation solution for the scalar unknown u, time derivative q = ut and space derivative σ = ux, simultaneously. Finally, some examples are provided to illustrate the effectiveness of our method.
Keywords: Hyperbolic wave equation, Nonlinear, He’s variational iteration method, TransformationsProcedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 1975
7954 Analytical Solutions of Kortweg-de Vries(KdV) Equation
Authors: Foad Saadi, M. Jalali Azizpour, S.A. Zahedi
Abstract:The objective of this paper is to present a comparative study of Homotopy Perturbation Method (HPM), Variational Iteration Method (VIM) and Homotopy Analysis Method (HAM) for the semi analytical solution of Kortweg-de Vries (KdV) type equation called KdV. The study have been highlighted the efficiency and capability of aforementioned methods in solving these nonlinear problems which has been arisen from a number of important physical phenomenon.
Keywords: Variational Iteration Method (VIM), HomotopyPerturbation Method (HPM), Homotopy Analysis Method (HAM), KdV Equation.Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 2195
7953 Development Partitioning Intervalwise Block Method for Solving Ordinary Differential Equations
Authors: K.H.Khairul Anuar, K.I.Othman, F.Ishak, Z.B.Ibrahim, Z.Majid
Abstract:Solving Ordinary Differential Equations (ODEs) by using Partitioning Block Intervalwise (PBI) technique is our aim in this paper. The PBI technique is based on Block Adams Method and Backward Differentiation Formula (BDF). Block Adams Method only use the simple iteration for solving while BDF requires Newtonlike iteration involving Jacobian matrix of ODEs which consumes a considerable amount of computational effort. Therefore, PBI is developed in order to reduce the cost of iteration within acceptable maximum error
Keywords: Adam Block Method, BDF, Ordinary Differential Equations, Partitioning Block IntervalwiseProcedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 1532
7952 Iteration Acceleration for Nonlinear Coupled Parabolic-Hyperbolic System
Authors: Xia Cui, Guang-wei Yuan, Jing-yan Yue
A Picard-Newton iteration method is studied to accelerate the numerical solution procedure of a class of two-dimensional nonlinear coupled parabolic-hyperbolic system. The Picard-Newton iteration is designed by adding higher-order terms of small quantity to an existing Picard iteration. The discrete functional analysis and inductive hypothesis reasoning techniques are used to overcome difficulties coming from nonlinearity and coupling, and theoretical analysis is made for the convergence and approximation properties of the iteration scheme. The Picard-Newton iteration has a quadratic convergent ratio, and its solution has second order spatial approximation and first order temporal approximation to the exact solution of the original problem. Numerical tests verify the results of the theoretical analysis, and show the Picard-Newton iteration is more efficient than the Picard iteration.
Keywords: Nonlinearity, iterative acceleration, coupled parabolic hyperbolic system, quadratic convergence, numerical analysis.Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 1444
7951 A Kernel Classifier using Linearised Bregman Iteration
Authors: K. A. D. N. K Wimalawarne
Abstract:In this paper we introduce a novel kernel classifier based on a iterative shrinkage algorithm developed for compressive sensing. We have adopted Bregman iteration with soft and hard shrinkage functions and generalized hinge loss for solving l1 norm minimization problem for classification. Our experimental results with face recognition and digit classification using SVM as the benchmark have shown that our method has a close error rate compared to SVM but do not perform better than SVM. We have found that the soft shrinkage method give more accuracy and in some situations more sparseness than hard shrinkage methods.
Keywords: Compressive sensing, Bregman iteration, Generalisedhinge loss, sparse, kernels, shrinkage functionsProcedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 1256
7950 Numerical Algorithms for Solving a Type of Nonlinear Integro-Differential Equations
Authors: Shishen Xie
In this article two algorithms, one based on variation iteration method and the other on Adomian's decomposition method, are developed to find the numerical solution of an initial value problem involving the non linear integro differantial equation where R is a nonlinear operator that contains partial derivatives with respect to x. Special cases of the integro-differential equation are solved using the algorithms. The numerical solutions are compared with analytical solutions. The results show that these two methods are efficient and accurate with only two or three iterations
Keywords: variation iteration method, decomposition method, nonlinear integro-differential equationsProcedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 1824
7949 Vibration of a Beam on an Elastic Foundation Using the Variational Iteration Method
Authors: Desmond Adair, Kairat Ismailov, Martin Jaeger
Modelling of Timoshenko beams on elastic foundations has been widely used in the analysis of buildings, geotechnical problems, and, railway and aerospace structures. For the elastic foundation, the most widely used models are one-parameter mechanical models or two-parameter models to include continuity and cohesion of typical foundations, with the two-parameter usually considered the better of the two. Knowledge of free vibration characteristics of beams on an elastic foundation is considered necessary for optimal design solutions in many engineering applications, and in this work, the efficient and accurate variational iteration method is developed and used to calculate natural frequencies of a Timoshenko beam on a two-parameter foundation. The variational iteration method is a technique capable of dealing with some linear and non-linear problems in an easy and efficient way. The calculations are compared with those using a finite-element method and other analytical solutions, and it is shown that the results are accurate and are obtained efficiently. It is found that the effect of the presence of the two-parameter foundation is to increase the beam’s natural frequencies and this is thought to be because of the shear-layer stiffness, which has an effect on the elastic stiffness. By setting the two-parameter model’s stiffness parameter to zero, it is possible to obtain a one-parameter foundation model, and so, comparison between the two foundation models is also made.
Keywords: Timoshenko beam, variational iteration method, two-parameter elastic foundation model.Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 806
7948 Investigation of a Transition from Steady Convection to Chaos in Porous Media Using Piecewise Variational Iteration Method
Authors: Mohamed M. Mousa, Aidarkhan Kaltayev Shahwar F. Ragab
In this paper, a new dependable algorithm based on an adaptation of the standard variational iteration method (VIM) is used for analyzing the transition from steady convection to chaos for lowto-intermediate Rayleigh numbers convection in porous media. The solution trajectories show the transition from steady convection to chaos that occurs at a slightly subcritical value of Rayleigh number, the critical value being associated with the loss of linear stability of the steady convection solution. The VIM is treated as an algorithm in a sequence of intervals for finding accurate approximate solutions to the considered model and other dynamical systems. We shall call this technique as the piecewise VIM. Numerical comparisons between the piecewise VIM and the classical fourth-order Runge–Kutta (RK4) numerical solutions reveal that the proposed technique is a promising tool for the nonlinear chaotic and nonchaotic systems.
Keywords: Variational iteration method, free convection, Chaos, Lorenz equations.Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 1414
7947 A Fully Implicit Finite-Difference Solution to One Dimensional Coupled Nonlinear Burgers’ Equations
Authors: Vineet K. Srivastava, Mukesh K. Awasthi, Mohammad Tamsir
A fully implicit finite-difference method has been proposed for the numerical solutions of one dimensional coupled nonlinear Burgers’ equations on the uniform mesh points. The method forms a system of nonlinear difference equations which is to be solved at each iteration. Newton’s iterative method has been implemented to solve this nonlinear assembled system of equations. The linear system has been solved by Gauss elimination method with partial pivoting algorithm at each iteration of Newton’s method. Three test examples have been carried out to illustrate the accuracy of the method. Computed solutions obtained by proposed scheme have been compared with analytical solutions and those already available in the literature by finding L2 and L∞ errors.
Keywords: Burgers’ equation, Implicit Finite-difference method, Newton’s method, Gauss elimination with partial pivoting.Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 5799
7946 Comparison of Newton Raphson and Gauss Seidel Methods for Power Flow Analysis
Authors: H. Abaali, T. Talbi, R.Skouri
This paper presents a comparative study of the Gauss Seidel and Newton-Raphson polar coordinates methods for power flow analysis. The effectiveness of these methods are evaluated and tested through a different IEEE bus test system on the basis of number of iteration, computational time, tolerance value and convergence.
Keywords: Convergence time, Gauss-Seidel Method, Newton-Raphson Method, number of iteration, power flow analysis.Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 2284
7945 An Efficient Backward Semi-Lagrangian Scheme for Nonlinear Advection-Diffusion Equation
Authors: Soyoon Bak, Sunyoung Bu, Philsu Kim
In this paper, a backward semi-Lagrangian scheme combined with the second-order backward difference formula is designed to calculate the numerical solutions of nonlinear advection-diffusion equations. The primary aims of this paper are to remove any iteration process and to get an efficient algorithm with the convergence order of accuracy 2 in time. In order to achieve these objects, we use the second-order central finite difference and the B-spline approximations of degree 2 and 3 in order to approximate the diffusion term and the spatial discretization, respectively. For the temporal discretization, the second order backward difference formula is applied. To calculate the numerical solution of the starting point of the characteristic curves, we use the error correction methodology developed by the authors recently. The proposed algorithm turns out to be completely iteration free, which resolves the main weakness of the conventional backward semi-Lagrangian method. Also, the adaptability of the proposed method is indicated by numerical simulations for Burgers’ equations. Throughout these numerical simulations, it is shown that the numerical results is in good agreement with the analytic solution and the present scheme offer better accuracy in comparison with other existing numerical schemes.
Keywords: Semi-Lagrangian method, Iteration free method, Nonlinear advection-diffusion equation.Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 2341
7944 Some Results on Preconditioned Modified Accelerated Overrelaxation Method
Authors: Guangbin Wang, Deyu Sun, Fuping Tan
In this paper, we present new preconditioned modified accelerated overrelaxation (MAOR) method for solving linear systems. We compare the spectral radii of the iteration matrices of the preconditioned and the original methods. The comparison results show that the preconditioned MAOR method converges faster than the MAOR method whenever the MAOR method is convergent. Finally, we give one numerical example to confirm our theoretical results.
Keywords: preconditioned, MAOR method, linear system, convergence, comparison.Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 1479
7943 Convergence of a One-step Iteration Scheme for Quasi-asymptotically Nonexpansive Mappings
Authors: Safeer Hussain Khan
In this paper, we use a one-step iteration scheme to approximate common fixed points of two quasi-asymptotically nonexpansive mappings. We prove weak and strong convergence theorems in a uniformly convex Banach space. Our results generalize the corresponding results of Yao and Chen  to a wider class of mappings while extend those of Khan, Abbas and Khan  to an improved one-step iteration scheme without any condition and improve upon many others in the literature.
Keywords: One-step iteration scheme, asymptotically quasi non expansive mapping, common fixed point, condition (a'), weak and strong convergence.Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 1327
7942 Mathematical Reconstruction of an Object Image Using X-Ray Interferometric Fourier Holography Method
Authors: M. K. Balyan
The main principles of X-ray Fourier interferometric holography method are discussed. The object image is reconstructed by the mathematical method of Fourier transformation. The three methods are presented – method of approximation, iteration method and step by step method. As an example the complex amplitude transmission coefficient reconstruction of a beryllium wire is considered. The results reconstructed by three presented methods are compared. The best results are obtained by means of step by step method.
Keywords: Dynamical diffraction, hologram, object image, X-ray holography.Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 1130
7941 Proximal Parallel Alternating Direction Method for Monotone Structured Variational Inequalities
In this paper, we focus on the alternating direction method, which is one of the most effective methods for solving structured variational inequalities(VI). In fact, we propose a proximal parallel alternating direction method which only needs to solve two strongly monotone sub-VI problems at each iteration. Convergence of the new method is proved under mild assumptions. We also present some preliminary numerical results, which indicate that the new method is quite efficient.
Keywords: structured variational inequalities, proximal point method, global convergenceProcedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 1206
7940 An Analytical Solution for Vibration of Elevator Cables with Small Bending Stiffness
Authors: R. Mirabdollah Yani, E. Darabi
Responses of the dynamical systems are highly affected by the natural frequencies and it has a huge impact on design and operation of high-rise and high-speed elevators. In the present paper, the variational iteration method (VIM) is employed to investigate better understanding the dynamics of elevator cable as a single-degree-of-freedom (SDOF) swing system. Comparisons made among the results of the proposed closed-form analytical solution, the traditional numerical iterative time integration solution, and the linearized governing equations confirm the accuracy and efficiency of the proposed approach. Furthermore, based on the results of the proposed closed-form solution, the linearization errors in calculating the natural frequencies in different cases are discussed.
Keywords: variational iteration method (VIM), cable vibration, closed-form solutionProcedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 2193
7939 Periodic Storage Control Problem
Authors: Ru-Shuo Sheu, Han-Hsin Chou, Te-Shyang Tan
Abstract:Considering a reservoir with periodic states and different cost functions with penalty, its release rules can be modeled as a periodic Markov decision process (PMDP). First, we prove that policy- iteration algorithm also works for the PMDP. Then, with policy- iteration algorithm, we obtain the optimal policies for a special aperiodic reservoir model with two cost functions under large penalty and give a discussion when the penalty is small.
Keywords: periodic Markov decision process, periodic state, policy-iteration algorithm.Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 1141
7938 Weak Convergence of Mann Iteration for a Hybrid Pair of Mappings in a Banach Space
Authors: Alemayehu Geremew Negash
We prove the weak convergence of Mann iteration for a hybrid pair of maps to a common fixed point of a selfmap f and a multivalued f nonexpansive mapping T in Banach space E.
Keywords: Common fixed point, Mann iteration, Multivalued mapping, weak convergence.Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 1507
7937 Managing Iterations in Product Design and Development
Authors: K. Aravindhan, Trishit Bandyopadhyay, Mahesh Mehendale, Supriya Kumar De
The inherent iterative nature of product design and development poses significant challenge to reduce the product design and development time (PD). In order to shorten the time to market, organizations have adopted concurrent development where multiple specialized tasks and design activities are carried out in parallel. Iterative nature of work coupled with the overlap of activities can result in unpredictable time to completion and significant rework. Many of the products have missed the time to market window due to unanticipated or rather unplanned iteration and rework. The iterative and often overlapped processes introduce greater amounts of ambiguity in design and development, where the traditional methods and tools of project management provide less value. In this context, identifying critical metrics to understand the iteration probability is an open research area where significant contribution can be made given that iteration has been the key driver of cost and schedule risk in PD projects. Two important questions that the proposed study attempts to address are: Can we predict and identify the number of iterations in a product development flow? Can we provide managerial insights for a better control over iteration? The proposal introduces the concept of decision points and using this concept intends to develop metrics that can provide managerial insights into iteration predictability. By characterizing the product development flow as a network of decision points, the proposed research intends to delve further into iteration probability and attempts to provide more clarity.
Keywords: Decision Points, Iteration, Product Design, Rework.Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 2068
7936 IPSO Based UPFC Robust Output Feedback Controllers for Damping of Low Frequency Oscillations
Authors: A. Safari, H. Shayeghi, H. A. Shayanfar
On the basis of the linearized Phillips-Herffron model of a single-machine power system, a novel method for designing unified power flow controller (UPFC) based output feedback controller is presented. The design problem of output feedback controller for UPFC is formulated as an optimization problem according to with the time domain-based objective function which is solved by iteration particle swarm optimization (IPSO) that has a strong ability to find the most optimistic results. To ensure the robustness of the proposed damping controller, the design process takes into account a wide range of operating conditions and system configurations. The simulation results prove the effectiveness and robustness of the proposed method in terms of a high performance power system. The simulation study shows that the designed controller by Iteration PSO performs better than Classical PSO in finding the solution.
Keywords: UPFC, IPSO, output feedback Controller.Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 1330
7935 Automatic Iterative Methods for the Multivariate Solution of Nonlinear Algebraic Equations
Authors: Rafat Alshorman, Safwan Al-Shara', I. Obeidat
Abstract:Most real world systems express themselves formally as a set of nonlinear algebraic equations. As applications grow, the size and complexity of these equations also increase. In this work, we highlight the key concepts in using the homotopy analysis method as a methodology used to construct efficient iteration formulas for nonlinear equations solving. The proposed method is experimentally characterized according to a set of determined parameters which affect the systems. The experimental results show the potential and limitations of the new method and imply directions for future work.
Keywords: Nonlinear Algebraic Equations, Iterative Methods, Homotopy Analysis Method.Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 1769
7934 Steepest Descent Method with New Step Sizes
Authors: Bib Paruhum Silalahi, Djihad Wungguli, Sugi Guritman
Abstract:Steepest descent method is a simple gradient method for optimization. This method has a slow convergence in heading to the optimal solution, which occurs because of the zigzag form of the steps. Barzilai and Borwein modified this algorithm so that it performs well for problems with large dimensions. Barzilai and Borwein method results have sparked a lot of research on the method of steepest descent, including alternate minimization gradient method and Yuan method. Inspired by previous works, we modified the step size of the steepest descent method. We then compare the modification results against the Barzilai and Borwein method, alternate minimization gradient method and Yuan method for quadratic function cases in terms of the iterations number and the running time. The average results indicate that the steepest descent method with the new step sizes provide good results for small dimensions and able to compete with the results of Barzilai and Borwein method and the alternate minimization gradient method for large dimensions. The new step sizes have faster convergence compared to the other methods, especially for cases with large dimensions.
Keywords: Convergence, iteration, line search, running time, steepest descent, unconstrained optimization.Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 2834
7933 A Calibration Approach towards Reducing ASM2d Parameter Subsets in Phosphorus Removal Processes
Abstract:A novel calibration approach that aims to reduce ASM2d parameter subsets and decrease the model complexity is presented. This approach does not require high computational demand and reduces the number of modeling parameters required to achieve the ASMs calibration by employing a sensitivity and iteration methodology. Parameter sensitivity is a crucial factor and the iteration methodology enables refinement of the simulation parameter values. When completing the iteration process, parameters values are determined in descending order of their sensitivities. The number of iterations required is equal to the number of model parameters of the parameter significance ranking. This approach was used for the ASM2d model to the evaluated EBPR phosphorus removal and it was successful. Results of the simulation provide calibration parameters. These included YPAO, YPO4, YPHA, qPHA, qPP, μPAO, bPAO, bPP, bPHA, KPS, YA, μAUT, bAUT, KO2 AUT, and KNH4 AUT. Those parameters were corresponding to the experimental data available.
Keywords: ASM2d, calibration approach, iteration methodology, sensitivity, phosphorus removalProcedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 2267
7932 An Approximate Solution of the Classical Van der Pol Oscillator Coupled Gyroscopically to a Linear Oscillator Using Parameter-Expansion Method
Authors: Mohammad Taghi Darvishi, Samad Kheybari
In this article, we are dealing with a model consisting of a classical Van der Pol oscillator coupled gyroscopically to a linear oscillator. The major problem is analyzed. The regular dynamics of the system is considered using analytical methods. In this case, we provide an approximate solution for this system using parameter-expansion method. Also, we find approximate values for frequencies of the system. In parameter-expansion method the solution and unknown frequency of oscillation are expanded in a series by a bookkeeping parameter. By imposing the non-secularity condition at each order in the expansion the method provides different approximations to both the solution and the frequency of oscillation. One iteration step provides an approximate solution which is valid for the whole solution domain.
Keywords: Parameter-expansion method, classical Van der Pol oscillator.Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 1737
7931 Adomian’s Decomposition Method to Functionally Graded Thermoelastic Materials with Power Law
Authors: Hamdy M. Youssef, Eman A. Al-Lehaibi
This paper presents an iteration method for the numerical solutions of a one-dimensional problem of generalized thermoelasticity with one relaxation time under given initial and boundary conditions. The thermoelastic material with variable properties as a power functional graded has been considered. Adomian’s decomposition techniques have been applied to the governing equations. The numerical results have been calculated by using the iterations method with a certain algorithm. The numerical results have been represented in figures, and the figures affirm that Adomian’s decomposition method is a successful method for modeling thermoelastic problems. Moreover, the empirical parameter of the functional graded, and the lattice design parameter have significant effects on the temperature increment, the strain, the stress, the displacement.
Keywords: Adomian, Decomposition Method, Generalized Thermoelasticity, algorithm, empirical parameter, lattice design.Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 385