Numerical Solution of Deformation Equations. in Homotopy Analysis Method

Similar documents
An Improved Isogeometric Analysis Using the Lagrange Multiplier Method

Scheduling with Integer Time Budgeting for Low-Power Optimization

Solitary and Traveling Wave Solutions to a Model. of Long Range Diffusion Involving Flux with. Stability Analysis

Hermite Splines in Lie Groups as Products of Geodesics

Modeling Local Uncertainty accounting for Uncertainty in the Data

Report #1 Example. Semester

NUMERICAL SOLVING OPTIMAL CONTROL PROBLEMS BY THE METHOD OF VARIATIONS

An Application of the Dulmage-Mendelsohn Decomposition to Sparse Null Space Bases of Full Row Rank Matrices

A General Algorithm for Computing Distance Transforms in Linear Time

Sum of Linear and Fractional Multiobjective Programming Problem under Fuzzy Rules Constraints

Parallelism for Nested Loops with Non-uniform and Flow Dependences

Feature Reduction and Selection

Multilevel Iterative Methods

Boundary layer and mesh refinement effects on aerodynamic performances of horizontal axis wind turbine (HAWT)

A New Approach For the Ranking of Fuzzy Sets With Different Heights

A CLASS OF TRANSFORMED EFFICIENT RATIO ESTIMATORS OF FINITE POPULATION MEAN. Department of Statistics, Islamia College, Peshawar, Pakistan 2

MECHANICAL ANALYSIS OF 2D-BRAZED JOINT USING A NEW HYBRID MAX- FEM MODEL

Review of approximation techniques

Support Vector Machines. CS534 - Machine Learning

Range images. Range image registration. Examples of sampling patterns. Range images and range surfaces

A simple piecewise cubic spline method for approximation of highly nonlinear data

KFUPM. SE301: Numerical Methods Topic 8 Ordinary Differential Equations (ODEs) Lecture (Term 101) Section 04. Read

OBJECT TRACKING BY ADAPTIVE MEAN SHIFT WITH KERNEL BASED CENTROID METHOD

For instance, ; the five basic number-sets are increasingly more n A B & B A A = B (1)

The Research of Support Vector Machine in Agricultural Data Classification

Solving Route Planning Using Euler Path Transform

S1 Note. Basis functions.

Solving two-person zero-sum game by Matlab

Proper Choice of Data Used for the Estimation of Datum Transformation Parameters

Classifier Selection Based on Data Complexity Measures *

Machine Learning: Algorithms and Applications

2x x l. Module 3: Element Properties Lecture 4: Lagrange and Serendipity Elements

A Binarization Algorithm specialized on Document Images and Photos

Smoothing Spline ANOVA for variable screening

Analysis of Continuous Beams in General

Using BESO method to optimize the shape and reinforcement of the underground openings

Learning the Kernel Parameters in Kernel Minimum Distance Classifier

Traditional Discretisation Methods. Finite Difference Finite Element Finite Volume

A Five-Point Subdivision Scheme with Two Parameters and a Four-Point Shape-Preserving Scheme

CS434a/541a: Pattern Recognition Prof. Olga Veksler. Lecture 15

Mathematics 256 a course in differential equations for engineering students

An Optimal Algorithm for Prufer Codes *

A Fast Content-Based Multimedia Retrieval Technique Using Compressed Data

An Optimal Algorithm to Find a Minimum 2-neighbourhood Covering Set on Cactus Graphs

A combined test for randomness of spatial distribution of composite microstructures

Support Vector Machines

An Accurate Evaluation of Integrals in Convex and Non convex Polygonal Domain by Twelve Node Quadrilateral Finite Element Method

POWER-OF-2 BOUNDARIES

Image Contrast Gain Control by Linear Neighbourhood Embedding

Structure from Motion

Obstacle Avoidance by Using Modified Hopfield Neural Network

TECHNICAL TRANSACTIONS 7/2017 CZASOPISMO TECHNICZNE 7/2017 MECHANICS

A. General Type- Fzzy Clsterng There are two knds of type- fzzy sets whch are often sed n clsterng algorthms: 1) nterval and ) general. In nterval typ

APPLICATION OF MULTIVARIATE LOSS FUNCTION FOR ASSESSMENT OF THE QUALITY OF TECHNOLOGICAL PROCESS MANAGEMENT

Cracking of the Merkle Hellman Cryptosystem Using Genetic Algorithm

Cluster Analysis of Electrical Behavior

12/2/2009. Announcements. Parametric / Non-parametric. Case-Based Reasoning. Nearest-Neighbor on Images. Nearest-Neighbor Classification

b * -Open Sets in Bispaces

Type-2 Fuzzy Non-uniform Rational B-spline Model with Type-2 Fuzzy Data

CS 534: Computer Vision Model Fitting

Network Coding as a Dynamical System

Scientific Computing Tool

K-means and Hierarchical Clustering

Angle-Independent 3D Reconstruction. Ji Zhang Mireille Boutin Daniel Aliaga

Multiobjective fuzzy optimization method

VERTICAL NETWORK ADJUSTMENT USING FUZZY GOAL PROGRAMMING

Intra-Parametric Analysis of a Fuzzy MOLP

Meta-heuristics for Multidimensional Knapsack Problems

On Some Entertaining Applications of the Concept of Set in Computer Science Course

Finding of Service Centers in Gis Described by Second Kind Fuzzy Graphs

Μέθοδος Πολυπλέγματoς (Multigrid)

Constrained Robust Model Predictive Control Based on Polyhedral Invariant Sets by Off-line Optimization

A Newton-Type Method for Constrained Least-Squares Data-Fitting with Easy-to-Control Rational Curves

The official electronic file of this thesis or dissertation is maintained by the University Libraries on behalf of The Graduate School at Stony Brook

User Authentication Based On Behavioral Mouse Dynamics Biometrics

The Research of Ellipse Parameter Fitting Algorithm of Ultrasonic Imaging Logging in the Casing Hole

SENSITIVITY ANALYSIS WITH UNSTRUCTURED FREE MESH GENERATORS IN 2-D AND 3-D SHAPE OPTIMIZATION.

Hybrid Method of Biomedical Image Segmentation

Skew Angle Estimation and Correction of Hand Written, Textual and Large areas of Non-Textual Document Images: A Novel Approach

Fast Computation of Shortest Path for Visiting Segments in the Plane

A Simple and Efficient Goal Programming Model for Computing of Fuzzy Linear Regression Parameters with Considering Outliers

NURBS curve method Taylor's launch type of interpolation arithmetic Wan-Jun Zhang1,2,3,a, Shan-Ping Gao1,b Xi-Yan Cheng 1,c &Feng Zhang2,d

ON SOME ENTERTAINING APPLICATIONS OF THE CONCEPT OF SET IN COMPUTER SCIENCE COURSE

Classification / Regression Support Vector Machines

Cubic Spline Interpolation for. Petroleum Engineering Data

Projection-Based Performance Modeling for Inter/Intra-Die Variations

NAG Fortran Library Chapter Introduction. G10 Smoothing in Statistics

Term Weighting Classification System Using the Chi-square Statistic for the Classification Subtask at NTCIR-6 Patent Retrieval Task

Helsinki University Of Technology, Systems Analysis Laboratory Mat Independent research projects in applied mathematics (3 cr)

SENSITIVITY ANALYSIS IN LINEAR PROGRAMMING USING A CALCULATOR

VISUALIZATION OF FREE FORM SURFACES BY A RAY TRACING METHOD BRĪVAS FORMAS VIRSMU VIZUALIZĀCIJA AR STARU TRASĒŠANAS METODI

AMath 483/583 Lecture 21 May 13, Notes: Notes: Jacobi iteration. Notes: Jacobi with OpenMP coarse grain

The Shortest Path of Touring Lines given in the Plane

Load-Balanced Anycast Routing

SVM-based Learning for Multiple Model Estimation

Announcements. Supervised Learning

Brave New World Pseudocode Reference

A new paradigm of fuzzy control point in space curve

Machine Learning. Support Vector Machines. (contains material adapted from talks by Constantin F. Aliferis & Ioannis Tsamardinos, and Martin Law)

A MOVING MESH APPROACH FOR SIMULATION BUDGET ALLOCATION ON CONTINUOUS DOMAINS

Transcription:

Appled Mathematcal Scences, Vol. 6, 2012, no. 8, 357 367 Nmercal Solton of Deformaton Eqatons n Homotopy Analyss Method J. Izadan and M. MohammadzadeAttar Department of Mathematcs, Faclty of Scences, Mashhad Branch, Islamc Azad Unversty, Mashhad, Iran M. Jall Department of Mathematcs, Neyshabr Branch, Islamc Azad Unversty, Neyshabr, Iran Jall.maryam@yahoo.com Abstract In ths paper, we consder the homtopy analyss method (HAM) for solvng nonlnear ordnary dfferental eqaton wth bondary condtons. The partal sm of solton seres s determned sng fnte dfference method and spectral method. These methods are sed for solvng deformaton eqaton. For mprovng the rate of convergence, we apply the methods of Marnca and N-Wang. The reslts are compared wth fnte dfference method and spectral method. Unlke HAM, these methods don t need convergence control parameter. Nmercal eperments show effcency and performance of proposed methods. Keywords: Homotopy analyss method, Deformaton eqaton, Spectral method, Fnte dfference method 1 Introdcton Ordnary dfferental eqatons wth bondary condtons (BVP) are very mportant n varos domans of scences and engneerng. In most cases, t s very complcated to acheve analytc soltons of these eqatons. Nmercal fnte dfference methods and spectral methods can be sed for solvng certan types of these problems wth applyng nonlnear eqaton solvers as Newton's methods

358 J. Izadan, M. MohammadzadeAttar and M. Jall [7,8], bt these technqes are vald only for weakly nonlnear problems. Recently, homotopy analyss method (HAM) has been sccessflly appled to varos types of these problems. In 2003, Lao pblshed the book [1] n whch he smmarzed the basc deas of the homotopy analyss method and gave the detals of hs approach both n the theory and on a large nmber of practcal eamples and n a seres of papers [2-4,9], he developed HAM. Homotopy seres solton s depended to convergence control parameter. For nstance Lao has sed the fnctonal seres that ther coeffcents are the control parameters. These parameters can be sed for acceleratng the convergence of soltons seres, or fndng a homotopy seres that s convergent for certan vale of homotopy parameters. Some athors lke Marnca et al. [5], Yabshta et al. [10], and N et al. [6] have consdered the optmzaton convergence control parameters that can be obtaned by mnmzng the sqare resdal error. In ths paper, the known methods lke fnte dfference method and spectral method are appled to solvng deformaton eqaton, net, Marnca, and N-Wang methods are sed to mnmze the task of determnng the solton, and these two methods are compared by presentng some nmercal eperments. Ths paper s organzed as follows. In secton 2 the basc dea of HAM s presented. In the secton 3 the applcaton of fnte dfference and Chebyshev collocaton method for solvng deformaton eqaton s descrbed. In secton 4 Marnca and N-Wang methods are combned wth nmercal methods of secton 3, net n the secton 5 the nmercal reslts are presented. The reslts of Marnca and N- Wang methods are compared for two bondary vale problems. Fnally, we dscss and analyse the reslts. 2 The basc dea of HAM for solvng BVP We consder the followng bondary vale problems:,,,,,, where s a nonlnear dfferental operator of second order, s ndependent varable and s an nknown fncton. For ths problem the homotopy eqaton can be wrtten as follows :,,, where,,, s an embeddng parameter, s an ntal gess of, s lnear dfferental operator of second order, and, s the homotopy seres,

Nmercal solton of deformaton eqatons 359 That s assmed to be convergent on [0,1]. It easly dedces that!,. (3) When 1, t holds,, (4) that s a solton of (2), and conseqently the solton of (1), see [1]. The ntal gess satsfes two bondary condtons of (1), see [1,2,4]. Referrng the homotopy lteratre [1-4], one can fnd the deformaton eqatons of order m s fond as follows: where and, m 1, (5)!,,,,,, 1, Then, the eqaton (5) s a second order lnear ODEs wth bondary condtons,, By acceptng s a solton of,,,, The homotopy seres solton (4) can be determned step by step by solvng followng lnear problem :, (6) In fact, one can only comptes partal sm of seres solton. However, n general these eqatons are solved analytcally or wth pade homotopy method [1]. In these methods the control parameters are sed to garantee convergence of homotopy seres, for more nformaton, the reader s refered the approprate lteratre. Ths partal sm can be determned nmercally by solvng (6), wth a proper nmercal method. Here the fnte dfference method and the spectral method are appled to solve deformaton eqaton.

360 J. Izadan, M. MohammadzadeAttar and M. Jall 3 Nmercal solton of deformaton eqaton 3.1 Fnte dfference method Consder a partton of [a,b], as follows:,,,,...,, and take (for smplcty), by omttng the trncaton error, eqaton (6) yelds :,,,,, (7) where,,,,,,, Now by applyng bondary condtons, we have a lnear system of eqatons that can be solved by one of sted methods. Then we have an appromaton of on [a,b]. By repeatng M-tmes ths procedre, fnally we obtan an appromaton of partal sm of seres solton: where,. 3.2 Spectral method, Another method that can be sed for solvng deformaton eqatons, s spectral method wth Chebyshev ponts. Here, we consder an appromaton of, that s solton of deformaton eqaton (5) as gven:, (8) where s Lagrange polynomals, and, 0,1,2,, are Chebyshev ponts [8]. If we denote, for =0,1,2,,n and, then (8) can be wrtten as:, By twce dfferentaton the eqaton (9) wth respect to, we have,

Nmercal solton of deformaton eqatons 361. Or by sng the spectral dfferentaton matr D = ( d j ) n+ 1, n+ 1 see[7,8], we have,,,,,,. By sbstttng these dervatves n deformaton eqaton, a lnear system of (n+1) eqatons wth (n-1) nknowns,,,,, s obtaned:, (10),,, The ntal solton s consdered as followng :,,, that can be easly transformed to [-1,1] by a lnear transformaton to se Chebyshev ponts. For, the bondary condtons are sed. Then (7) s redced to a lnear system wth n-1 nknowns that can be easly solved. One knows that the coeffcent matr of ths system s not sparse, however regardng the spectral precson of method ths matr can be of an acceptable order [8]. 4 Fndng optmal control parameters To have a solton seres that s convergent for q=1, sometmes we need to apply convergence control parameters. In sch cases sng the so called h-crve can be sefl for determnng the convergence control parameter [4]. However there are the methods that allow s to fnd the control parameter by a mnmzaton process. Here we apply two methods to compte comptng optmal control parameters de to Marnca and N-Wang [6]. For ths prpose one chooses the followng zero-th order deformaton eqaton (or homotopy eqaton): where,,,.

362 J. Izadan, M. MohammadzadeAttar and M. Jall Then the homotopy solton s the fncton of,, we can determne, sch that,, can be appromated by a partal sm of small order (,,,,. For determnng more precse appromate solton one note that for the eact solton (),the followng eqatons s satsfed:,,,,,, Then to fnd of a good appromate solton, each mst become very small. Ths we defne as [6],the followng fncton,,,, (11) Where s M-th partal sm of seres solton. In method of Marnca, one mnmze (11) to fnd an optmal appromaton of at end of M-th step of comptng, =1,2,,M n method of N-wang n every step one mnmzes a fncton of one varable that s defned by,,,,, where,,, have been determned, n prevos step. For more nformaton see [4,6]. These two methods are appled for two nonlnear eamples and ther reslts are compared n the net secton. 5 Nmercal eperments In ths secton we present the nmercal reslts for fnte dfference method and spectral method, then Marnca method and N-Wang method are appled to two bondary vale problems, Compter codes have been prepared by sng MATLAB 7.6.(2008) wth a PC of model Pentm IV. Denotes and are appromate solton and eact solton n, respectvely, and n 1 2 2 N ( % ) = ( ( N( ( )) ) = % 0. 5.1 Eample Followng lnear dfferental eqaton s consdered :,,, sbject to the bondary condtons (1),, wth.

Nmercal solton of deformaton eqatons 363 We know that the eact solton s, the program has eected wth M=20 and n=40. Nmercal reslts are shown n table 5.1 and 5.2. The graph of solton s presented n fg. 5.1. Table 5.1. The reslts of ftnte dfference method for M=20 and n=40. -1 0.008484089 10 0.008482089 10 0-0.5 0.0044665 10-0.00329488 10 1.170599 10 0 0.012962 10 0.01 10 2.962307 10 0.5 0.129219 10 0.124298 10 4.920621 10 1 1.492546 10 1.492546 10 0 CPU Tme 2.03 s Table 5.2. The reslts of spectral method for M=20 and n=40. -1 0.0084820 10 0.008420 10 0-0.7071 0.0050946 10 0.0050856 10 0.897315 10 0 0.0100166 10 0.01 10 1.6623 10 0.7071 0.34793652 10 0.347927 10 0.89731 10 1 1.492546 10 1.492546 10 0 CPU Tme 1132.65 s Fg 5.1. The reslts of fnte dfference method for m=20 and n=40. 5.2 Eample We consder a nonlnear dfferental eqaton: sbject to bondary condtons,

364 J. Izadan, M. MohammadzadeAttar and M. Jall The eact solton s nknown. For M=20 and n=40, nmercal reslts are presented n table 5.2 and 5.3. The graph of solton s presented n fg. 5.2. Table 5.3. The reslts of fnte dfference method for M=20 and n=40. 0 0 0.25-0.174064 0.5-0.31091 0.75-0.418099 1-0.5 CPU Tme 1.67 s 3.6552 Table 5.4. The reslts of spectral method for M=20 and n=40. 0 0 0.1464-0.10708756 0.5-0.3109205 0.8535-0.45490788 1-0.5 CPU Tme 1059.54 s 1.10102 Fg 5.2. The reslt of fnte dfference method for M=20 and n=40. 5.3 Eample In ths part the reslts of the two prevos eamples sng spectral method and N-Wang method s presented n tables 5.5 and 5.6, then the comparson of these methods are accomplshed n tables 5.8.

Nmercal solton of deformaton eqatons 365 Table 5.5 The reslts of Marnca method for eample(1) M=4 and n=20. -1 0.008484089 10 0.008482089 10 0-0.89 0.00626277 10-0.00626277 10-0.003429 10-0.309 0.00308616 10 0.00086401 10-0.236328 10 0.309 0.0478369 10 0.0047837 10-0.2109929 10 0.809 0.5772479 10 0.5772480 10-0.143959 10 1 1.492546 10 1.492546 10 0 CPU Tme 18.84 s Ma of relatve error 10 Table 5.6. The reslts of N-Wang method eample(1) M=4 and n=20. -1 0.0084820 10 0.008420 10 0-0.809 0.00066254 10 0.0066277 10 0.37977 10-0.309 0.00393946 10 0.003086401 10 0.853065 10 0.309 0.0486103 10 0.047837164 10 0.773184 10 0.809 0.5774929 10 0.57724808 10 0.244865 10 1 1.492546 10 1.492546 10 0 CPU Tme 14.24 s Ma of relatve error 10 table 5.7. The reslts of Marnca method for eample (2) M=7 and n=20. 0 0-0.95491-0.0715797 0.3455-0.23022744 0.654-0.380337978 0.904-0.471501207 1-0.5 CPU Tme 3907.02 2.8280008 10 Table 5.8. The reslts of N-Wang method for for eample (2) M=7 and n=20. 0 0 0.0954-0.071579 0.3454-0.2302288 0.6545-0.38033 0.9045-0.471501 1-0.5 CPU Tme 32.78 s 3.420761 10

366 J. Izadan, M. MohammadzadeAttar and M. Jall Table 5.9. Comparson N Wang and Marnca reslts for eample (1) n=20and m=1,2,,10. Marnca N Wang M CPU Tme CPU Tme 1-1.449 6.54 5/96252 9.043 2-0.48387 10 8.098 0/8954003 8.228 3-0.53378 10 11.31 0.611957 10 11.59 4-0.43144710 14.847 0.89122 10 14.721 5 0.245746 10 18.619 0.2552 10 18.731 6 0.158028 10 23.01 7 0.17988 10 27.44 8 0.47841 10 44.43 9 0.454179 10 38.098 10 0.477314 10 43.896 table 5.10 Comparson N Wang and Marnca reslts for eample(2) n=20 and m=1,2,,10. Marnca N Wang M CPU Tme CPU Tme 1 0.215787 6.431 0.23329 5.195 2 0.05003 20.722 0.0639155 8.35 3 0.011816 92.763 0.0171344 12.016 4 0.002751 356.43 0.595502 10 16.078 5 6.3775 10 1193.01 0.207005 10 21.64 6 1.4687 10 2480.66 7.04243 10 26.499 7 6.5759 10 3907.06 2.4362 10 32.781 8 5.70934 10 6693.34 8.706254 10 39.75 9 3.813234 10 119343.05 3.098704 10 49.02 10 7.03955 10 21432.84 3.098704 10 57.83 () n table 5.9 denote that eecton of program was not sccessfl becase of memory overflow. 6 Conclson and Dscsson In ths paper, HAM s mplemented to solve the nonlnear ODE s wth bondary condtons. For solvng deformaton eqaton, we appled fnte dfference method and spectral method. The reslts show that the spectral method s more accrate, bt t s tme consmng. The fnte dfference reslts are satsfactory. The comparson of methods Marnca and N-Wang show that the latter s more rapd, and more precse n majorty of cases, bt for certan problem s not stable. Marnca method s tme consmng bt t s more precse.

Nmercal solton of deformaton eqatons 367 References [1] Lao S.J., Beyond pertrbaton: ntrodcton to the homotopy analyss method. Boca Raton: Chapman & Hall / CRC Press; (2003). [2] Lao S.J., On The Homotopy Analyss method for Non-Lnear Problems, Appl. Math. Compt. 147 (2004) 499-513. [3] Lao S.J., Tan Y., A general approach to obtan seres soltons of nonlnear dfferental eqatons. Stdes n Appled Mathematcs, 119 (2007) 297-354. [4] Lao S.J., Notes on the homotopy analyss method: Some defntons and theorems, Commn. Nonlnear Sc. Nmer. Smlat. 14 (2009) 983-997. [5] Marnca V., Hersan N., et al., An optmal homotopy asymptotc method appled to the steady flow of a forth-grade fld past a poros plate, Appled Mathematcs Letters, 22 (2009) 245-251. [6] N Zh., Wang, Ch., A One-Step Optmal Homotopy Analyss Method for Nonlnear Dfferental Eqaton, Commn. Nonlnear Sc. Nmer. Smlat. 1 (2010) 2026 2036. [7] Stoer J., Bblrsch R., Introdcton to Nmercal Analyss, Sprnger Verlag, (1983). [8] Trefethen N., Spectral methods n Matlab SIAM ed., Phladelpha, (2000). [9] W YY., Cheng KF., Homotopy solton for nonlnear dfferental eqatons n wave propagaton problems. Wave Moton 46 (2009) 1 14. [10] Yabshta K., Yamashta M., Tsbo K., An analytc solton of projectle moton wth the qadratc resstance law sng the homotopy analyss method, J. Phys. A: Math. Theor. 40 (2007) 8403-8416. Receved: Jne, 2011