38 views

Uploaded by Vincent Machatsch

Computations assignment. Report for one of the algorithms

- Super Eta Report
- Materials Selection - Car Engine head
- my FEA project
- CFD
- A Hybrid System of SOM and RBF for Recognizing Human Activity from Video
- Extended Finite Element Method for Moving Discontinuities
- Cfd Tut Sedan
- Lecture 08
- Super Resolution
- Mitchell Machine Learning
- 5.4 Security Constrained Optimal Power Flow
- Linear Vector Quantization neural network
- Devoir 1
- Equlization
- Prob
- Eigenfaces vs Fisher Faces Presentation
- chapter6_gradfree.pdf
- Optimisation and Its Applications
- EC6312 SET1.pdf
- Game AI

You are on page 1of 2

Descent and write a MATLAB program, using the algorithm 9.1 from the MECH2450 textbook as a guide. By implementing this ) method, we were to find the local minimum of the function ( with a starting [ ] point .

Method: The method used was to implement the Method of Steepest Descent algorithm from the text book. This method, used to find the minimum of a function, does this by repeatedly computing the minima of a function g(t) of a single variable t, as follows: Assume that the function f(x,y) has a minimum at a value . Firstly we choose a starting point, x. Then we look for the local minimum to this point, along the straight line in the direction of ( ), which is the direction of steepest descent. That is, we found the value of t and the point ( ) ( ) ( ( )) has a minimum. The value of z(t) is then used as a new approximation to original starting point, x, is replaced by . ( ), at which the function,

In general terms, this method works quite well with this problem. A limitation though, is that it will never converge to true answer, in this case [0 0]. It will always work to just to the limits of the convergence tolerance, and then, depending on the initial starting point, give a value. I.e. if the tolerance is 1e-20, it will return values: x1=3.758981e-021 and x2=-8.353292e-022, where these are not equal to zero, just outside of the tolerance. Also another downside to this method, is that the closer it gets the answer, the slower it converges, it seems to zigzag as the gradients point nearly orthogonally to the shortest direction the minimum.

For the given initial points and a tolerance of 1e-10, the algorithm converged after 34 iterations, with the values, x1=4.359501e-011 and x2=2.179751e-011.

The figure shows the results when the program is run. init_g is the initial starting point and the function result displayed, is the original given function from the problem statement, with the determined values for x1 and x2.

It seemed that the starting point could have quite an effect on if and how the algorithm converged. This was probably due to different local minima being evaluated. I had, at first, a problem with implementing the separate functions of the gradient, t, and the initial function, as I was unsure, how to populate them with the respective values for the starting point, yet after a lot of trial and error, I was able to solve this problem. A major issue in writing this code, was finding an appropriate tolerance, and a corresponding maximum iteration value, without impacting on the speed of the program, or the desired accuracy of the result. Conclusion Conclusively, the Method of Steepest descent, in this case, finds the local minimum closest to the starting point, successfully, if only within a certain tolerance. The actual local minimum, in this case, lies at x1=0, and x2=0. My code found the minimum to be x1=4.359501e-011 and x2=2.179751e-011, with a tolerance of 1e-20.

- Super Eta ReportUploaded byJoel Forbes
- Materials Selection - Car Engine headUploaded byJoel Forbes
- my FEA projectUploaded byvijayan m g
- CFDUploaded bypavan_joshi_5
- A Hybrid System of SOM and RBF for Recognizing Human Activity from VideoUploaded byInternational Journal of Engineering Research & Management
- Extended Finite Element Method for Moving DiscontinuitiesUploaded bytiroual
- Cfd Tut SedanUploaded byItalo Adotti
- Lecture 08Uploaded byBabisIgglezos
- Super ResolutionUploaded byNeeraj Kumar
- Mitchell Machine LearningUploaded byManjunath Yadav
- 5.4 Security Constrained Optimal Power FlowUploaded byMohammedSaadaniHassani
- Linear Vector Quantization neural networkUploaded byDenny Hermawanto
- Devoir 1Uploaded byMelania Nitu
- EqulizationUploaded byprakashrout
- ProbUploaded byJagritiKumari
- Eigenfaces vs Fisher Faces PresentationUploaded byMarian Moise
- chapter6_gradfree.pdfUploaded byVinayak Rao
- Optimisation and Its ApplicationsUploaded bysunsrin
- EC6312 SET1.pdfUploaded byManju Nathan
- Game AIUploaded byJincy Jacob
- Modelos cuantitativosUploaded bySelene Quishpe
- BwtSort.cUploaded byKasf
- SolutionsHW3Uploaded byReza Mazlooman
- CSE L-2,T-1 (2016-2017)Uploaded byNa Thaka
- Report_Convex approximations in stochastic programming by semidefinite programmingUploaded byYa-Mi Chen
- The Newton Raphson Method_2017Uploaded byNajwaAinayaZawaid
- MCSE004 Dec2013 SolutionUploaded byajay
- ReadmeUploaded byMuhammad Faheem
- laporan sementara psd #7.docxUploaded byAndri Nura Utami
- assignment no 1.docxUploaded byAhmad Shah

- 2012011601405940337Uploaded bySiva Kumar
- DSP-LAB-08Uploaded byUsama Ahmed
- pdfjoiner(3).pdfUploaded byMahaveer Suthar
- Implementation of Deblocking Filter for Reducing the Blocking ArtifactsUploaded byInternational Journal of Innovative Science and Research Technology
- mtech 2nd semsyllabusUploaded byShaik Kareemulla
- [IJCST-V4I4P28]:Mrs. M.Kavitha, Ms.S.T.Tamil SelviUploaded byEighthSenseGroup
- lec6Uploaded bypkubasov
- 4. Questions on Frequency Analysis of Signals and SystemsUploaded bykibrom atsbha
- Solution of Ordinary Differential Equations by fourth order Runge-Kutta methods - Excel SpreadsheetUploaded byrodwellhead
- ds question bankUploaded bydivskapatel04
- Introduction to Data Mining-Sources.docxUploaded bydmmart
- Paper-2-2014Uploaded byirjmss
- Tangent BugUploaded byervaulu
- fft4Uploaded byHaris Siraj
- 4-solutions-clrs-22Uploaded byAbdullah Simpson
- ece3084su14hw02Uploaded byJay Mehta
- MATLAB algorithmsUploaded byVishnu Sadasivan
- Avr2011_classUploaded byमेनसन लाखेमरू
- A novel image edge detection algorithm based on neutrosophic setUploaded byMia Amalia
- Online Subspace Identification Methods for MIMO ModelUploaded byandres3510
- 1dwtUploaded byhamid.ece9524
- 10 Mathematics %2520polynomials Impq 1Uploaded bymahak_kyna
- hashmeUploaded bydragzillacar
- 2.0 Discrete Convolution BEE3213Uploaded bypokcikhensem
- Algo Quiz 1Uploaded bysld;fksa
- Evolutionary Algorithms PDFUploaded byAdam
- NASA.uplinkOrange.pdfUploaded bypathmakerpk
- Test 1 Summer 2002Uploaded byMazin Alahmadi
- Lecture Finite DifferenceUploaded bykanuni41
- Meshfree MethodsUploaded byRajdatta Joshi