CI TE

2.0
U nle a shing Possibilit ie s

ANGLE OF TRAJECTORY CALCULATOR USING ITERATIVE METHODS

Submitted by:
Leader:
Custodio, Jirom Nikko Z.
Members:
Magadia, Lee France A.
Perez, John Airon A.
Vergara, John Preache B.

Submitted to:
Marife A. Rosales, MSEE
T4D – NumMeth

November 5, 2018
CI TE

2.0
U nle a shing Possibilit ie s

TABLE OF CONTENTS

I. Introduction 1
II. Objectives 3
III. Project Description 4
IV. Project Operation 5
V. Problem Statement 7
VI. Calculations 9
VII. Flowchart 24
VIII. Algorithm 30
IX. Graphical User Interface 35
X. Project Simulation 63
XI. Conclusions 68
XII. Recommendations 70
Bibliography 71
Appendices 72
CI TE

2.0
U nle a shing Possibilit ie s

LIST OF TABLES
Table No. Title Page
1 Computations Using Bisection 13
2 Computations Using False Position 15
3 Computations Using Fixed-Point 17
4 Computations Using Newton-Raphson 18
5 Computations Using Secant Method 23
CI TE

2.0
U nle a shing Possibilit ie s

LIST OF FIGURES
Figure No. Title Page
1 The Diagram of the Problem 7
2 Main Flowchart of the GUI Application 24
3 Flowchart of the Bisection Method 25
4 Flowchart of the False-Position Method 26
5 Flowchart of the Fixed Point Method 27
6 Flowchart of the Newton-Raphson Method 28
7 Flowchart of the Secant Method 29
8 Home Page 35
9 Login Window 36
10 Login Error Window 36
11 Register Window 37
12 Status Window 37
13 Main Page Window 38
14 Graph Window: Section Size 39
15 Graph Window: Full Size 40
16 Problem Window 41
17 About Window 42
18 Bisection Definition Window 43
19 False-Position Definition Window 44
20 Fixed-Point Definition Window 45
21 Newton-Raphson Definition Window 46
22 Secant Definition Window 47
23 Theory Window 48
24 Projectile Definition 49
CI TE

2.0
U nle a shing Possibilit ie s

Figure No. Title Page

25 Characteristics of Projectile 49
26 Horizontal and Vertical Displacement 50
27 Laws Governing Projectile Motion 50
28 Help Window: Features 51
29 Help Window: Graph 52
30 Help Window: Extensions 52
31 Help Window: Open File 53
32 Help Window: Save File 53
33 Select Window 54
34 Bisection Iterative Method Window 55
35 Bisection Table 56
36 False Position Iterative Method Window 57
37 False Position Table 57
38 Fixed-Point Iterative Method Window 58
39 Fixed-Point Table 58
40 Newton-Raphson Iterative Method Window 59
41 Newton-Raphson Table 59
42 Secant Iterative Method Window 60
43 Secant Table 60
44 Saved Files Window 61
45 Sample Saved File 62
46 Bisection Input 63
47 Bisection Tabulated Results 63
48 False Position Input 64
49 False Position Tabulated Results 64
50 Fixed-Point Input 65
51 Fixed-Point Tabulated Results 65
CI TE

2.0
U nle a shing Possibilit ie s

Figure No. Title Page

52 Newton-Raphson Input 66
53 Newton-Raphson Tabulated Results 66
54 Secant Input 67
55 Secant Tabulated Results 67
CI TE

2.0
U nle a shing Possibilit ie s

LIST OF APPENDICES
Appendix Title Page
A Home Page 72
B Login 77
C Register 82
D Main Page 87
E Graph 91
F Saved Files 96
G Iterative Method 107
H Table 114
I Select a Method 117
CI TE

2.0
U nle a shing Possibilit ie s

I. INTRODUCTION

Several method of solving equations have emerged and invented throughout the
span of continuous exploration on properties of functions. Solving equations are first
introduced to us using algebraic methods – including substitution method and elimination
method, even in matrices form. Other algebraic methods that can be executed include
the quadratic formula and factorization. These methods are then categorized as Direct
Method of solving equations as they give the exact value of all the roots directly in a finite
number of steps. However, when these methods are not successful, we use the concept
of Numerical Methods.

Numerical methods are used to approximate solutions of complicated problems,

equations when exact solutions cannot be determined via algebraic methods, so that the
solution consists of only arithmetic operations; addition, subtraction, and multiplication.
They establish iterative approximations of different methods that converge to the exact
root of a function. Under equations with nonlinear properties, these numerical methods
are categorized as Iterative Methods. In this case, therefore, the root of the function must
be approached using the principle of these methods of solving starting from an initial
guess point – the closest possible point to the solution – and arrives asymptotically at the
solution through iterative process.

Iterative Methods are best suited for computer programs to solve an equation. It is
based on the concept of successive approximation, which can be further subdivided as:
(a) Bracketing Method – where two initial points are determined which encloses the root
between these boundaries (i.e., Bracketing Method, False Position Method); and (b)
Open-End Method – where an initial guess point is brought closer to the root using
different properties (i.e., Newton-Raphson Method, Secant Method, Fixed-Point Iteration
Method).

With the introduction of MATLAB by MathWorks and its capability to perform

advanced and complex mathematical operations, the process of Numerical Methods are

1
CI TE

2.0
U nle a shing Possibilit ie s

applicable and could be utilized using a graphical user interface to interactively perform
and solve a given function intended.

2
CI TE

2.0
U nle a shing Possibilit ie s

II. OBJECTIVES

The general objective of the study is to create and design a Graphical User
Interface (GUI) that can solve a nonlinear problem and display the solution using direct
and indirect methods by combination of individual Matrix Laboratory (MATLAB) .m files.
1. To evaluate the functionality of the Graphical User Interface (GUI).
2. To construct a MATLAB file that solves a nonlinear problem using Iterative
Methods specifically the Bisection, False-Position, Fixed-Point, Newton-Raphson
and Secant Method.
3. To tabulate the results of the Iterative Methods.
4. To create a GUI that can perform registration and login of the users of the
application.
5. To enable the users to save their activities in their account.
6. To project the graphical representation of the problem.

3
CI TE

2.0
U nle a shing Possibilit ie s

III. PROJECT DESCRIPTION

The constructed Graphical User Interface (GUI) is intended to produce an application

that can solve the selected nonlinear system. Even though nonlinear solutions can be
calculated manually, it consumes much effort and time especially for complicated
problems.
Primarily, the GUI is composed of individual GUIs for each nonlinear method whether
direct or indirect. The indirect method used were Bisection, False-Position, Fixed-Point,
Newton-Raphson and Secant Iterative Methods. These GUIs were compiled into one
application which when it was ran, the GUI will display a home window which the user are
required to register and login to the application/GUI. The main page that displays proceed
button, graph button, theory button, about button, the saved files button and the given
problem.
For the proceed button, it is composed of different methods in solving the given
problem. Each GUI for every method display its own meaning, the solve button, the back
button and the exit button. Also, the GUI for each method has a display of the table and
graph of the solution for the problem given.
Lastly, the application is composed with an about button, containing the meaning,
use, advantages and disadvantages of each method in solving the problem, a theory
button which shows the meaning, theory and laws in solving the problem, a graph button
which contains the graph of the given problem, a saved files button where all the files
made saved so the has the easier access to view it, exit button that will stop or close the
GUI, a homepage that contains the main problem of the nonlinear system.

4
CI TE

2.0
U nle a shing Possibilit ie s

IV. PROJECT OPERATION

The application starts with a home page which gives the option to the user whether to
login, exit or see the problem of concern. Once the user has chosen a button, the window
will redirect to the chosen path. The Login page is a simple searching type of program
which searches for a file in the computer with the similar username and password. First,
the program will search for a folder with the similar name as the inputted username.
Afterwards, it will open the folder and read the mat file inside it. The mat file contains the
password of the user. The program, then, will compare the inputted password to the string
contained inside the mat file. Once the passwords matches, the program will proceed to
the main menu. However, in cases where the program is not able to find the folder of the
user or the password mismatches, a toast will appear that will recommend to try again or
to register.

In the Registration Window, the program will be asking for a username, password and
Full Name of the user. It will not require any other information such as birthdate, age and
etc. since it will not be needed in the program and are irrelevant to the project. Once
satisfied, the program will create a folder in the user’s computer containing the information
safe in a mat file format. These information can be used to access the application.

The Main Page contains different buttons for different functions of the program and a
greetings that welcomes the user using his/ her full name. The specific paths that can be
accessed with this window are the Graph, the Problem, the Theory governing the
problem, the Definitions About the different iterative method, the Help, the Saved Files
and the Iteration Method Calculator.

The different calculators to solve the given problem uses iterative methods such as
the Bisection, False-Position, Fixed-Point, Newton-Raphson and Secant Method. Each
has an individual window that can display the root and the approximation error.
Furthermore, each window contains extensions such as the Graph, the Problem and the

5
CI TE

2.0
U nle a shing Possibilit ie s

Table. These extensions can help in visualizing the calculation and to get the initial
approximation.

The Graph window depicts to setups. The first setup shows a section of the graph with
a horizontal axes limited to ten divisions. Using sliders, the user can adjust which part of
the graph he/she wants to see. Meanwhile, once the Full Size button is clicked, the axes
will depict the whole size of the graph.

The Table window will show the whole iteration result done by the program.
Underneath the table, there is an option to save the data generated. A filename will be
asked from the user before clicking the save button. Once saved, there would be a mat
file created inside the account/folder of the user.

To access the saved files, the user should proceed to the main page and then click
the Saved Files button. Then, it will redirect to the Saved Window. The window will require
the user to select the iterative method of desire and then the window will show the files
saved in the user’s account. The user has to option to open or delete the file.

6
CI TE

2.0
U nle a shing Possibilit ie s

V. PROBLEM STATEMENT

Range of a Projectile Motion System

Kilauea in Hawaii is the world’s most continuously active volcano. Very active
volcanoes characteristically eject red hot rocks and lava rather than smoke and ash.
Suppose a large rock is ejected from the volcano with a speed of 25.0 m/s with a range
of 71 m. Having the rock ejected at an altitude of 20.0 m, identify the angle of trajectory
in degrees.

Figure 1. The Diagram of the Problem

Formula:

Where:

 d is the total horizontal distance travelled by the projectile.

 v is the velocity at which the projectile is launched

7
CI TE

2.0
U nle a shing Possibilit ie s

 g is the gravitational acceleration — usually taken to be 9.81 m/s2 (32 f/s2) near the
Earth's surface
 θ is the angle at which the projectile is launched
 y0 is the initial height of the projectile

Given:

v = 25 m/s

g= 9.8 m/s2

y0 = 20 m

d= 71 m

Substitute the given to the formula:

(252 ) 2(9.8)(20.0)
71 = (1 + √1 + ) 𝑠𝑖𝑛2𝜃
2(9.8) 252 𝑠𝑖𝑛2 𝜃

(252 ) 2(9.8)(20.0)
0= (1 + √1 + ) 𝑠𝑖𝑛2𝜃 − 71
2(9.8) 252 𝑠𝑖𝑛2 𝜃

Working Equation

(252 ) 2(9.8)(20.0)
𝑓(𝑥) = (1 + √1 + ) 𝑠𝑖𝑛2𝜃 − 71
2(9.8) 252 𝑠𝑖𝑛2 𝜃

8
CI TE

2.0
U nle a shing Possibilit ie s

VI. CALCULATIONS

Solving for the True Value:

(252 ) 2(9.8)(20.0)
71 = (1 + √1 + ) 𝑠𝑖𝑛2𝜃
2(9.8) 252 𝑠𝑖𝑛2 𝜃

(252 ) 2(9.8)(20.0)
0= (1 + √1 + ) 𝑠𝑖𝑛2𝜃 − 71
2(9.8) 252 𝑠𝑖𝑛2 𝜃

Ѳ =18.72001354
TV=18.72001354° ------ True Value
TV=55.54798168°

Solving using Bisection Method:

For 1st iteration

XL=18
Xu=19
𝑥𝑈 +𝑥𝐿
Xr= 2

Xr=18.5
For XL=18

(252 ) 2(9.8)(20.0)
f(𝑋𝐿 ) = (1 + √1 + ) 𝑠𝑖𝑛2(18) − 71
2(9.8) 252 𝑠𝑖𝑛2 (18)

f(XL)=-0.6940182914
For Xr=18.5

(252 ) 2(9.8)(20.0)
f(𝑋𝑟 ) = (1 + √1 + ) 𝑠𝑖𝑛2(18.5) − 71
2(9.8) 252 𝑠𝑖𝑛2 (18.5)

f(Xr)=-0.2104932777
f(XL) f(Xr)=( -0.6940182914)( -0.2104932777)

9
CI TE

2.0
U nle a shing Possibilit ie s

f(XL) f(Xr)=0.1460861849
Ea%=------
For 2nd Iteration
f(XL) f(Xr)>0; XL= Xr
XL=18.5; Xu=19
𝑥𝑈 +𝑥𝐿
Xr= 2

Xr=18.75
For XL=18.5:

(252 ) 2(9.8)(20.0)
f(𝑋𝐿 ) = (1 + √1 + ) 𝑠𝑖𝑛2(18.5) − 71
2(9.8) 252 𝑠𝑖𝑛2 (18.5)

f(XL)=-0.2104932777
For Xr =18.75:

(252 ) 2(9.8)(20.0)
f(𝑋𝑟 ) = (1 + √1 + ) 𝑠𝑖𝑛2(18.75) − 71
2(9.8) 252 𝑠𝑖𝑛2 (18.75)

f(Xr)=0.02857924297
f(XL) f(Xr)=( -0.2104932777)(0.02857924297)
f(XL) f(Xr)=-0.006015738
For Ea%:
CA − PV
Ea% = | | 𝑥100
CA
−0.006015738 − 0.1460861849
Ea% = | | 𝑥100
−0.006015738
Ea%=1.333333333333
Same Procedures were done for 3rd to 11th iterations. Results are listed on the
table below.

10
CI TE

2.0
U nle a shing Possibilit ie s

Bisection Method

Using XL=18 and Xu=19 at 0.05% Ea

Table 1. Computations Using Bisectio

n xL xu xr f(xL)f(xr) Ea %
1 18 19 18.5 0.146086184930 ----------------------
2 18.5 19 18.75 -0.00601573852 1.333333333333
3 18.5 18.75 18.625 0.019097848251 0.671140939597
4 18.625 18.75 18.6875 0.002814196366 0.334448160535
5 18.6875 18.75 18.71875 0.000037370649 0.166944908180
6 18.71875 18.75 18.734375 -0.00001649496 0.083402835696
7 18.71875 18.734375 18.7265625 -0.00000752276 0.041718815186

Solution is x=18.734375 at iteration n=7 with approximation error of

Ea=0.041718815186%

Solving using False-Position Method

For 1st iteration
XL = 18;
Xu=19;

(252 ) 2(9.8)(20.0)
71 = (1 + √1 + ) 𝑠𝑖𝑛2𝜃
2(9.8) 252 𝑠𝑖𝑛2 𝜃

(252 ) 2(9.8)(20.0)
𝑓(𝑋𝐿) = (1 + √1 + ) 𝑠𝑖𝑛2(18) − 71
2(9.8) 252 𝑠𝑖𝑛2 (18)

𝑓(𝑋𝐿) = −0.6940182914

11
CI TE

2.0
U nle a shing Possibilit ie s

Xu = 19;

(252 ) 2(9.8)(20.0)
71 = (1 + √1 + ) 𝑠𝑖𝑛2𝜃
2(9.8) 252 𝑠𝑖𝑛2 𝜃

(252 ) 2(9.8)(20.0)
𝑓(𝑋𝑢) = (1 + √1 + ) 𝑠𝑖𝑛2(19) − 71
2(9.8) 252 𝑠𝑖𝑛2 (19)

𝑓(𝑋𝑢) = 0.2658093909

𝑓(𝑋𝑢)(𝑋𝐿−𝑋𝑢)
If = 𝑋𝑢 − ;
𝑓(𝑋𝐿)−𝑓(𝑋𝑢)

(0.2658093909)(18 − 19)
𝑋𝑟 = 19 −
−0.6940182914 − 0.2658093909

𝑋𝑟 = 18.72306551

𝑋𝑟 = 18.72306551;

(252 ) 2(9.8)(20.0)
71 = (1 + √1 + ) 𝑠𝑖𝑛2𝜃
2(9.8) 252 𝑠𝑖𝑛2 𝜃

(252 ) 2(9.8)(20.0)
𝑓(𝑋𝑟) = (1 + √1 + ) 𝑠𝑖𝑛2(18.72306551) − 71
2(9.8) 25 𝑠𝑖𝑛2 (18.72306551)
2

𝑓(𝑋𝑟) = 0.002909958

12
CI TE

2.0
U nle a shing Possibilit ie s

𝑓(𝑋𝐿)𝑓(𝑋𝑟) = (−0.6940182914)(0.002909958)

𝑓(𝑋𝐿)𝑓(𝑋𝑟) = −0.002019564

Ea(%) = --------------- since it is the 1st iteration.

f(XL)f(Xr)<0 ; Xr = Xu

For 2nd iteration

XL = 18;

(252 ) 2(9.8)(20.0)
71 = (1 + √1 + ) 𝑠𝑖𝑛2𝜃
2(9.8) 252 𝑠𝑖𝑛2 𝜃

(252 ) 2(9.8)(20.0)
𝑓(𝑋𝐿) = (1 + √1 + ) 𝑠𝑖𝑛2(18) − 71
2(9.8) 252 𝑠𝑖𝑛2 (18)

𝑓(𝑋𝐿) = −0.6940182914

Xu = 18.72306551;

(252 ) 2(9.8)(20.0)
71 = (1 + √1 + ) 𝑠𝑖𝑛2𝜃
2(9.8) 252 𝑠𝑖𝑛2 𝜃

13
CI TE

2.0
U nle a shing Possibilit ie s

(252 ) 2(9.8)(20.0)
𝑓(𝑋𝑢) = (1 + √1 + ) 𝑠𝑖𝑛2(18.72306551) − 71
2(9.8) 252 𝑠𝑖𝑛2 (18.72306551)

𝑓(𝑋𝑢) = 0.002909958

𝑓(𝑋𝑢)(𝑋𝐿−𝑋𝑢)
If = 𝑋𝑢 − ;
𝑓(𝑋𝐿)−𝑓(𝑋𝑢)

(0.002909958)(18 − 18.72306551)
𝑋𝑟 = 18.72306551 −
−0.6940182914 − 0.002909958

𝑋𝑟 = 18.72004642

𝑋𝑟 = 18.72004642;

(252 ) 2(9.8)(20.0)
71 = (1 + √1 + ) 𝑠𝑖𝑛2𝜃
2(9.8) 252 𝑠𝑖𝑛2 𝜃

(252 ) 2(9.8)(20.0)
𝑓(𝑋𝑟) = (1 + √1 + ) 𝑠𝑖𝑛2(18.72004642) − 71
2(9.8) 252 𝑠𝑖𝑛2 (18.72004642)

𝑓(𝑋𝑟) = 0.000031352

𝑓(𝑋𝐿)𝑓(𝑋𝑟) = (−0.6940182914)(0.000031352)

𝑓(𝑋𝐿)𝑓(𝑋𝑟) = −0.000021759
18.72004642−18.72306551
Ea(%) = 𝑥100%
18.72004642
Ea(%) = 0.016127594

f(XL)f(Xr)<0 ; Xr = Xu

14
CI TE

2.0
U nle a shing Possibilit ie s

False position
Using XL=18 and Xu=19 at 0.05% Ea

Table 2. Computations Using False Position

n xL xu xr f(xr) f(xL)f(xr) Ea%
1 18 19 18.7230655 0.00290995 -0.00201956 ----------------------
2 18 18.7230655 18.72004641 0.00003135 -0.00002175 0.016127587225

Solution is x=18.7230655at iteration n=2 with approximation error of

Ea=0.016127587225%

Solving using Fixed-Point Method:

71
sin−1
(𝑣 2 ) 2(𝑔)(𝑦)
(1 + √1 + 2 2 )
2(𝑔) 𝑣 𝑠𝑖𝑛 𝜃
𝜃=
2

Case1:
𝑑
sin−1
(𝑣 2 ) 2(𝑔)(𝑦)
(1 + √1 + 2 2 )
2(𝑔) 𝑣 𝑠𝑖𝑛 𝜃
𝜃=
2

Solution:

71
sin−1
(252 ) 2(9.8)(20)
(1 + √1 + )
2(9.8) 252 𝑠𝑖𝑛2 𝜃
𝜃𝑖+1 =
2

The function converges

 At 𝜃𝟎 = 18º:

15
CI TE

2.0
U nle a shing Possibilit ie s

71
sin−1
(252 ) 2(9.8)(20)
(1 + √1 + )
2(9.8) 252 𝑠𝑖𝑛2 (18º)
𝜃𝑖+1 =
2

71
sin−1
396
31.5657 (1 + √1 + )
625𝑠𝑖𝑛2 (18º)
𝜃𝑖+1 =
2
71
sin−1
31.5657(1 + √7.6351 )
𝜃𝑖+1 =
2
71
sin−1 118.7871
𝜃𝑖+1 =
2

36.7059
𝜃𝑖+1 =
2

𝜃𝑖+1 = 18.20600228
 At 𝜃𝟏 = 18.20600228

71
sin−1
(252 ) 2(9.8)(20)
(1 + √1 + )
2(9.8) 25 𝑠𝑖𝑛2 (18.20600228º)
2

𝜃𝑖+1 =
2
𝜃𝑖+1 = 18.35431983

*Ea = [(18.35431983–18.20600228) / 18.35431983] * 100% = 0.8080797947%

 At 𝜃𝟐 = 18.35431983
71
sin−1
(252 ) 2(9.8)(20)
(1 + √1 + )
2(9.8) 252 𝑠𝑖𝑛2 (18.20600228º)
𝜃𝑖+1 =
2

16
CI TE

2.0
U nle a shing Possibilit ie s

𝜃𝑖+1 = 18.46047982

Ea = [(18.46047982- 18.35431983) / 18.46047982] * 100% = 0.5750662552%

Same procedures were done for the other iterarations.

Fixed Point Iteration

Using xi=18 at Es=0.05%

Table 3. Computations Using Fixed-Point

n xi Ea% Et%
0 18 ----------- 2.74578467
1 18.20600228 1.131507493 2.74578467
2 18.35431983 0.80807982 1.95349061
3 18.46047983 0.57506626 0. 1.38639704
4 18.53614546 0.40820588 0.98220056
5 18.5899142 0.28923608 0.6949746
6 18.6280411 0.20467477 0.4913054
7 18.6550355 0.14470299 0.34710468
8 18.67412736 0.10223699 0.24511829
9 18.68761987 0.07220024 0.17304299
10 18.69715009 0.05097154 0.12213371
11 18.70387906 0.03597633 0.08618839

Solving Using Newton Raphson:

Using xi=18, Es=0.05% and
392
(2𝜃) (3125√ )
625(𝑠𝑖𝑛𝜃)2 3125 20 sin(2𝜃) 𝑐𝑜𝑠(𝜃) 392
𝑓 ′ (𝑥𝑖) = 2 cos + − √ +1
98 98 ((𝑠𝑖𝑛𝜃)^3) 625(𝑠𝑖𝑛𝜃)^2

where;
𝑓(𝑥𝑖)
xi+1=𝑥𝑖 −
𝑓′(𝑥𝑖)

17
CI TE

2.0
U nle a shing Possibilit ie s

Table 4. Computations Using Newton-Raphson

n xi Ea(%) Et(%)
0 18 ------ 3.779795678346
1 18.012435277229 0.06903717925 3.779795678346
2 18.024657882416 0.067810469781 3.714504031198
3 18.036671385278 0.066605986248 3.650329382837
4 18.048479297713 0.065423309299 3.587252973146
5 18.060085074669 0.064262028158 3.525256346214
6 18.071492115011 0.063121740417 3.464321345725
7 18.082703762373 0.062002051846 3.4044301104
8 18.093723305997 0.060902576199 3.345565069517
9 18.104553981563 0.05982293503 3.287708938469
10 18.115198972008 0.058762757514 3.230844714401
11 18.125661408333 0.057721680269 3.174955671893
12 18.135944370398 0.056699347193 3.12002535871
13 18.146050887710 0.055695409291 3.066037591605
14 18.155983940195 0.054709524519 3.012976452177
15 18.165746458965 0.053741357626 2.960826282792
16 18.175341327069 0.052790580003 2.909571682556
17 18.184771380239 0.051856869533 2.859197503343
18 18.194039407620 0.050939910449 2.809688845875
19 18.203148152498 0.050039393194 2.761031055867
20 18.212100313008 0.049155014281 2.713209720211

18
CI TE

2.0
U nle a shing Possibilit ie s

Solving Using Secant Method:

For 1st iteration
For xi=1

(252 ) 2(9.8)(20.0)
f(𝑥𝑖 ) = (1 + √1 + ) 𝑠𝑖𝑛2(1) − 71
2(9.8) 252 𝑠𝑖𝑛2 (1)

f(xi)=-19.3749381
For xi-1=0.1

(252 ) 2(9.8)(20.0)
f(𝑥𝑖−1 ) = (1 + √1 + ) 𝑠𝑖𝑛2(1) − 71
2(9.8) 252 𝑠𝑖𝑛2 (1)

f(xi-1)=-20.3810180
For xi+1:
f(𝑥𝑖 )(𝑥𝑖−1 − 𝑥𝑖 )
f(𝑥𝑖+1 ) = 𝑥𝑖 −
f(𝑥𝑖−1 ) − f(𝑥𝑖 )
(−19.3749381)(0.1 − 1)
f(𝑥𝑖+1 ) = 1 −
−20.3810180 − (−19.3749381)
xi+1=18.33206706
For Ea%=--------------
For Et%:
Tv − Av
Et% = | | 𝑥100
Tv
18.72001354 − 18.33206706
Et% = | | 𝑥100
18.72001354
Et%=2.072363433399
For the 2nd iteration
xi+1= xi

19
CI TE

2.0
U nle a shing Possibilit ie s

For xi=18.33206706

(252 ) 2(9.8)(20.0)
f(𝑥𝑖 ) = (1 + √1 + ) 𝑠𝑖𝑛2(18.33206706) − 71
2(9.8) 252 𝑠𝑖𝑛2 (18.33206706)

f(xi)=-0.3721019498
For xi-1=1:

(252 ) 2(9.8)(20.0)
f(𝑥𝑖−1 ) = (1 + √1 + ) 𝑠𝑖𝑛2(1) − 71
2(9.8) 252 𝑠𝑖𝑛2 (1)

f(xi-1)=-19.3749381

For xi+1:
f(𝑥𝑖 )(𝑥𝑖−1 − 𝑥𝑖 )
f(𝑥𝑖+1 ) = 𝑥𝑖 −
f(𝑥𝑖−1 ) − f(𝑥𝑖 )
(−0.3721019498)(1 − 18.33206706)
f(𝑥𝑖+1 ) = 18.33206706 −
−19.3749381 − (−0.3721019498)
xi+1= 18.67145303
For Ea%:
CA − PV
Ea% = | | 𝑥100
CA
18.67145303 − 18.33206706
Ea% = | | 𝑥100
18.67145303
Ea%=1.817674151221
For Et%:
Tv − Av
Et% = | | 𝑥100
Tv
18.72001354 − 18.67145303
Et% = | | 𝑥100
18.72001354

Et%=0.259404409068

20
CI TE

2.0
U nle a shing Possibilit ie s

For the 3rd iteration

xi+1= xi
For xi=18.67145303:

(252 ) 2(9.8)(20.0)
f(𝑥𝑖 ) = (1 + √1 + ) 𝑠𝑖𝑛2(18.67145303) − 71
2(9.8) 252 𝑠𝑖𝑛2 (18.67145303)

f(xi)=-0.04633768797
For xi-1=18.33206706:

(252 ) 2(9.8)(20.0)
f(𝑥𝑖−1 ) = (1 + √1 + ) 𝑠𝑖𝑛2(18.33206706) − 71
2(9.8) 25 𝑠𝑖𝑛2 (18.33206706)
2

f(xi-1)= -0.3721019498
For xi+1:
f(𝑥𝑖 )(𝑥𝑖−1 − 𝑥𝑖 )
f(𝑥𝑖+1 ) = 𝑥𝑖 −
f(𝑥𝑖−1 ) − f(𝑥𝑖 )
(−0.04633768797)(18.33206706 − 18.67145303 )
f(𝑥𝑖+1 ) = 18.67145303 −
−0.3721019498 − (−0.04633768797)
xi+1= 18.71973412
For Ea%:
CA − PV
Ea% = | | 𝑥100
CA
18.71973412 − 18.67145303
Ea% = | | 𝑥100
18.71973412
Ea%=0.257884676760
For Et%:
Tv − Av
Et% = | | 𝑥100
Tv
18.72001354 − 18.71973412
Et% = | | 𝑥100
18.72001354

21
CI TE

2.0
U nle a shing Possibilit ie s

Et%=0.001523661598

For the 4th iteration

xi+1= xi
For xi=18.71973412:

(252 ) 2(9.8)(20.0)
f(𝑥𝑖 ) = (1 + √1 + ) 𝑠𝑖𝑛2(18.71973412) − 71
2(9.8) 25 𝑠𝑖𝑛2 (18.71973412)
2

f(xi)=-0.266427534x10-3
For xi-1=18.67145303:

(252 ) 2(9.8)(20.0)
f(𝑥𝑖−1 ) = (1 + √1 + ) 𝑠𝑖𝑛2(18.67145303) − 71
2(9.8) 252 𝑠𝑖𝑛2 (18.67145303)

f(xi-1)=-0.04633768797
For xi+1:
f(𝑥𝑖 )(𝑥𝑖−1 − 𝑥𝑖 )
f(𝑥𝑖+1 ) = 𝑥𝑖 −
f(𝑥𝑖−1 ) − f(𝑥𝑖 )
(−0.266427534x10 − 3)(18.67145303 − 18.71973412 )
f(𝑥𝑖+1 ) = 18.71973412 −
−0.04633768797 − (−0.266427534x10 − 3)
xi+1= 18.72001333
For Ea%:
CA − PV
Ea% = | | 𝑥100
CA
18.72001333 − 18.71973412
Ea% = | | 𝑥100
18.72001333
Ea%=0.001522499833
For Et%:

22
CI TE

2.0
U nle a shing Possibilit ie s

Tv − Av
Et% = | | 𝑥100
Tv
18.72001354 − 18.72001333
Et% = | | 𝑥100
18.72001354

Et%=0.000001161782

Secant Method

Using xi-1=0.1 and xi=1 at Es=0.05.

Table 5. Computations Using Secant

n xi-1 xi xi+1 Ea% Et%
1 0.1 1 18.33206682467 2.072363433399

2 1 18.33206682467 18.671452999499 1.817674151221 0.259404409068

3 18.33206682467 18.671452999499 18.719728310343 0.257884676760 0.001523661598

4 18.671452999499 18.719728310343 18.720013322514 0.001522499833 0.000001161782

23
CI TE

2.0
U nle a shing Possibilit ie s

VII. FLOWCHART
The following are the flowchart representation of algorithms used in the application.

Figure 2. Main Flowchart of the GUI Application

24
CI TE

2.0
U nle a shing Possibilit ie s

Figure 3. Flowchart of the Bisection Method

25
CI TE

2.0
U nle a shing Possibilit ie s

Figure 4. Flowchart of the False-Position Method

26
CI TE

2.0
U nle a shing Possibilit ie s

Figure 5. Flowchart of the Fixed Point Method

27
CI TE

2.0
U nle a shing Possibilit ie s

Figure 6. Flowchart of the Newton-Raphson Method

28
CI TE

2.0
U nle a shing Possibilit ie s

Figure 7. Flowchart of the Secant Method

29
CI TE

2.0
U nle a shing Possibilit ie s

VIII. ALGORITHM

The following are the algorithm used in creating the GUI application. These includes
the Iterative methods used for calculations.

Main GUI Application

1. Start
2. Open the Home Page
3. Open Problem when about is clicked. Return to Step 2.
4. Proceed to Step 34 when Exit is clicked.
5. Open Login and Proceed to Step 6 when Login is clicked.
6. Proceed to Step 9 when user has valid account.
7. Create Account in Register.
8. Return to Step 6.
9. Open Main Page.
10. Open Graph when Graph is clicked. Return to Step 9.
11. Open Problem when Problem is clicked. Return to Step 9.
12. Open About when About is Clicked. Return to Step 9.
13. Open Theory when Theory is clicked. Return to Step 9.
14. Open Help when Help is clicked. Return to Step 9.
15. Open Saved Files Window when Saved Files is clicked. Proceed to Step 19.
16. Proceed to Step 34 when Exit is clicked.
17. Open Select of method when Proceed is clicked. Proceed to Step 23.
18. Return to Step 9.
19. Choose file.
20. Open file when Open is clicked.
21. Delete file when Delete is clicked.
22. Return to Step 9.
23. Choose Method.
24. Open Method window.
25. Input Approximation.
26. Solve the problem.
27. Proceed to Step 34 when Exit is clicked.
28. Return to Step 9 when Back is clicked.
29. Open Table Window when clicked. Proceed to Step 31.
30. Return to Step 24.
31. Show tabulated results.
32. Save results when Save is clicked.

30
CI TE

2.0
U nle a shing Possibilit ie s

33. Return to Step 24.

34. End
Bisection
1. Start
2. Let
(252 ) 2(9.8)(20.0)
𝑓(𝑥) = (1 + √1 + ) 𝑠𝑖𝑛2𝜃 − 71
2(9.8) 252 𝑠𝑖𝑛2 𝜃

3. Input X Lower and X Upper

4. Substitute X Lower and X Upper to function f(x) and let them be f(X Lower) and
f(X Upper)
5. Obtain the product of f(X Lower) and f(X Upper)
6. Evaluate the product
7. Proceed to Step 25 when product is greater than 0
8. Let n=1
9. Substitute X Lower to the function f(x) and let it be f(X Lower)
10. Compute for Xr where Xr=(X Lower+X Upper)/2
11. Compute for approximation Error where Ea=(Xr-Xr old)/Xr *100 when n is not
equal to 1.
12. Evaluate Ea
13. Proceed to Step 24 when Ea is less than or equal to 0.05
14. Substitute Xr to the function f(x) and let it be f(Xr)
15. Obtain the product of f(X Lower) and f(Xr)
16. Record n, X Lower, X Upper, Xr, f(X Lower)*f(Xr) and Ea
17. Evaluate the product
18. Proceed to Step 24 when product is equal to 0
19. Replace X Lower with Xr when product is greater than 0
20. Replace X Upper with Xr when product is less than 0
21. Let Xr old=Xr
22. Let n=n+1
23. Return to Step 8
24. Root is Xr
25. End

31
CI TE

2.0
U nle a shing Possibilit ie s

False Position
1. Start
2. Let
(252 ) 2(9.8)(20.0)
𝑓(𝑥) = (1 + √1 + ) 𝑠𝑖𝑛2𝜃 − 71
2(9.8) 252 𝑠𝑖𝑛2 𝜃

3. Input X Lower and X Upper

4. Substitute X Lower and X Upper to function f(x) and let them be f(X Lower) and
f(X Upper)
5. Obtain the product of f(X Lower) and f(X Upper)
6. Evaluate the product
7. Proceed to Step 25 when product is greater than 0
8. Let n=1
9. Substitute X Lower and X Upper to the function f(x) and let them be f(X Lower)
and f(X Upper)
10. Compute for Xr where Xr=X Upper-[(f(X Upper)(X Lower-X Upper)/(f(X Lower)-
f(XUpper))]
11. Compute for approximation Error where Ea=(Xr-Xr old)/Xr *100 when n is not
equal to 1.
12. Evaluate Ea
13. Substitute Xr to the function f(x) and let it be f(Xr)
14. Obtain the product of f(X Lower) and f(Xr)
15. Record n, X Lower, X Upper, Xr, f(X Lower)*f(Xr) and Ea
16. Proceed to Step 24 when Ea is less than or equal to 0.05
17. Evaluate the product
18. Proceed to Step 24 when product is equal to 0
19. Replace X Lower with Xr when product is greater than 0
20. Replace X Upper with Xr when product is less than 0
21. Let Xr old=Xr
22. Let n=n+1
23. Return to Step 8
24. Root is Xr
25. End

32
CI TE

2.0
U nle a shing Possibilit ie s

Fixed Point
1. Start
2. Input Initial Guess and let it be xi
3. Let True Value be TV=18.72001354°
4. Let n=0
5. Let Approximation Error be Ea=(xi –xi old)/xi *100 when n is not equal to 0
6. Let True Error be Et=(TV-xi)/TV *100
7. Record n, xi, Ea and Et
8. Evaluate Ea
9. Proceed to Step 14 when Ea is less than or equal to 0.05
10. Let xi old=xi
11. Substitute xi to 𝜃 and let
71
sin−1
(252 ) 2(9.8)(20)
(1 + √1 + )
2(9.8) 252 𝑠𝑖𝑛2 𝜃
𝑥𝑖 =
2

12. Let n=n+1

13. Return to Step 5
14. Root is Xi
15. End
Newton Raphson
1. Start
2. Input Initial Guess and let it be xi
3. Let True Value be TV=18.72001354°
4. Let n=0
5. Let Approximation Error be Ea=(xi –xi old)/xi *100 when n is not equal to 0
6. Let True Error be Et=(TV-xi)/TV *100
7. Record n, xi, Ea and Et
8. Evaluate Ea
9. Proceed to Step 15 when Ea is less than or equal to 0.05
10. Let xi old=xi
11. Substitute xi to 𝜃 and let
(252 ) 2(9.8)(20.0)
𝑓(𝑥𝑖) = (1 + √1 + ) 𝑠𝑖𝑛2𝜃 − 71 and
2(9.8) 252 𝑠𝑖𝑛2 𝜃

33
CI TE

2.0
U nle a shing Possibilit ie s

392
(2𝜃) (3125√ )
625(𝑠𝑖𝑛𝜃)2 3125 20 sin(2𝜃) 𝑐𝑜𝑠(𝜃) 392
𝑓 ′ (𝑥𝑖) = 2 cos + − √ +1
98 98 ((𝑠𝑖𝑛𝜃)^3) 625(𝑠𝑖𝑛𝜃)^2

12. Let xi=xi-(f(xi)/f’(xi))

13. Let n=n+1
14. Return to Step 5
15. Root is Xi
16. End
Secant
1. Start
2. Input xi-1 and xi
3. Let
(252 ) 2(9.8)(20.0)
𝑓(𝑥) = (1 + √1 + ) 𝑠𝑖𝑛2𝜃 − 71
2(9.8) 252 𝑠𝑖𝑛2 𝜃

4. Let n=1
5. Substitute xi-1 and xi to f(x) and let it be f(xi-1) and f(xi) respectively
6. Let xi+1=xi-[ (f(xi)( xi-1-xi))/( f(xi-1)-f(xi))]
7. Let Approximation Error be Ea=|( xi+1 –xi)/ xi+1 |*100 when n is not equal to 1
8. Let True Error be Et=|(TV- xi-1)/TV *100|
9. Record n, xi-1, xi, xi+1, Ea and Et
10. Proceed to Step 15 when Ea is less than or equal to 0.05
11. Let xi-1=xi
12. Let xi= xi+1
13. Let n=n+1
14. Return to Step 5
15. The root is xi+1
16. End

34
CI TE

2.0
U nle a shing Possibilit ie s

IX. GRAPHICAL USER INTERFACE

The following pictures are the Graphical User Interface Layout.

Figure 8. Home Page

The Login Button enables the users to proceed to the application. The About
Button depicts the problem or the nonlinear system that the group has chosen. Lastly, the
Exit Button is for closing the application.

35
CI TE

2.0
U nle a shing Possibilit ie s

Figure 9. Login Window

The Login Window regulates the access to the application. To access a specific
account, the user should input the correct password for a certain username.

Figure 10. Login Error Window

The Login Error Window serves as a toast to indicate the invalidity of the username
and password used. This window will either recommend the user to try again or register
himself/herself.

36
CI TE

2.0
U nle a shing Possibilit ie s

Figure 11. Register Window

The Register Window enables a user to create an account to access the
application. It only requires three information since information such as age and birth date
are irrelevant to the application and will not help in its functionality.

Figure 12. Status Window

37
CI TE

2.0
U nle a shing Possibilit ie s

Figure 13. Main Page Window

The Main Page Window contains the buttons which lead to the different functions
of the application. It also greets the user using his/her full name that he/she encoded in
the Register Window.

To use the different iterative methods, the user should click the proceed button.
Meanwhile, since the application has the capability to save the user’s result, one can see
the saved results by clicking the Saved Files Button.

38
CI TE

2.0
U nle a shing Possibilit ie s

Figure 14. Graph Window: Section Size

The Graph Window is generated whenever the user clicked the Graph button in
the Main Page Window or in any Iterative Method Window. This Window will show the
graph of the chosen nonlinear system. This will help the user to see the approximated
root of the equation.

The Graph window has the capability to show the specific section of the graph.
The Horizontal section is limited to 10 divisions but can be adjusted to which part of the
graph using the sliders. The user has also the option to see the whole graph by clicking
the Full Size Button.

39
CI TE

2.0
U nle a shing Possibilit ie s

Figure 15. Graph Window: Full Size

Figure 15 shows the Graph Window after clicking the Full Size Button. The
horizontal and vertical sections changes accordingly.

40
CI TE

2.0
U nle a shing Possibilit ie s

Figure 16. Problem Window

The Problem Window shows the group’s selected problem. It also contains the
diagram of the problem and the mathematical representation. True Values are also given
for reference.

41
CI TE

2.0
U nle a shing Possibilit ie s

Figure 17. About Window

The About Window contains the buttons of different Iterative methods that leads to
their definitions.

42
CI TE

2.0
U nle a shing Possibilit ie s

Figure 18. Bisection Definition Window

43
CI TE

2.0
U nle a shing Possibilit ie s

Figure 19. False-Position Definition Window

44
CI TE

2.0
U nle a shing Possibilit ie s

Figure 20. Fixed-Point Definition Window

45
CI TE

2.0
U nle a shing Possibilit ie s

Figure 21. Newton-Raphson Definition Window

46
CI TE

2.0
U nle a shing Possibilit ie s

Figure 22. Secant Definition Window

47
CI TE

2.0
U nle a shing Possibilit ie s

Figure 23. Theory Window

The Theory Window contains the Law and concept governing the problem of the
group’s choice. These concepts are specifically about Projectile Motion and Newton’s
Laws of Motion.

48
CI TE

2.0
U nle a shing Possibilit ie s

Figure 24. Projectile Definition

Figure 25. Characteristics of Projectile

49
CI TE

2.0
U nle a shing Possibilit ie s

Figure 26. Horizontal and Vertical Displacement

Figure 27. Laws Governing Projectile Motion

50
CI TE

2.0
U nle a shing Possibilit ie s

Figure 28. Help Window: Features

The Help Window can show the features of the application. This includes what the
application can offer to the user.

51
CI TE

2.0
U nle a shing Possibilit ie s

Figure 29. Help Window: Graph

Figure 30. Help Window: Extensions

52
CI TE

2.0
U nle a shing Possibilit ie s

Figure 31. Help Window: Open File

Figure 32. Help Window: Save File

53
CI TE

2.0
U nle a shing Possibilit ie s

Figure 33. Select Window

The Select Window enables the user to choose an Iterative Method. Once the user
has chosen a method, he/ she will be redirected to the Iterative Method Window.

54
CI TE

2.0
U nle a shing Possibilit ie s

Figure 34. Bisection Iterative Method Window

All Iterative Windows has the extensions below. This extensions will help the users
to visualize the results and choose valid approximations.

55
CI TE

2.0
U nle a shing Possibilit ie s

Figure 35. Bisection Table

All Iterative Method Tables has the capability to show the iterations used in the
computations. Likewise, it has also the capability to save results by inputting a chosen file
name and clicking the save button,

56
CI TE

2.0
U nle a shing Possibilit ie s

Figure 36. False Position Iterative Method Window

Figure 37. False Position Table

57
CI TE

2.0
U nle a shing Possibilit ie s

Figure 38. Fixed-Point Iterative Method Window

Figure 39. Fixed-Point Table

58
CI TE

2.0
U nle a shing Possibilit ie s

Figure 40. Newton-Raphson Iterative Method Window

Figure 41. Newton-Raphson Table

59
CI TE

2.0
U nle a shing Possibilit ie s

’
Figure 42. Secant Iterative Method Window

Figure 43. Secant Table

60
CI TE

2.0
U nle a shing Possibilit ie s

Figure 44. Saved Files Window

The Saved Files Window enables the users to see the files they have saved
throughout the use of the application. They also have the capability to open and delete
these files by choosing the filename and pressing the button.

61
CI TE

2.0
U nle a shing Possibilit ie s

Figure 45. Sample Saved Files

Figure 45 shows a sample of the saved files in the users account under the method
of Bisection.

62
CI TE

2.0
U nle a shing Possibilit ie s

X. PROJECT SIMULATION

The following are the simulation of the application using the similar inputs used in the
computation to validate its functionality.

Figure 46. Bisection Input

Figure 47. Bisection Tabulated Results

63
CI TE

2.0
U nle a shing Possibilit ie s

Figure 48. False Position Input

Figure 49. False Position Tabulated Results

64
CI TE

2.0
U nle a shing Possibilit ie s

Figure 50. Fixed-Point Input

Figure 51. Fixed-Point Tabulated Results

65
CI TE

2.0
U nle a shing Possibilit ie s

Figure 52. Newton-Raphson Input

Figure 53. Newton-Raphson Tabulated Results

66
CI TE

2.0
U nle a shing Possibilit ie s

Figure 54. Secant Input

Figure 55. Secant Tabulated Results

67
CI TE

2.0
U nle a shing Possibilit ie s

XI. CONCLUSIONS

Therefore, this paper concluded that numerical methods serve as a critical strand
on solving mathematical functions. Numerical methods are also effective in solving for
boundary value problems of nonlinear differential equations. In this paper, we applied five
numerical methods: Bisection Method and False Position Method for Indirect Bracketing
Methods, and Newton-Raphson Method, Secant Method and Fixed-Point Iteration
Method for the Indirect Open-End Methods of solving nonlinear equations; however, there
are several other iterative methods that are applicable in the said set of problem equations
and functions to take a closer look onto. The main results of this paper can be highlighted
into two different areas: the effectiveness of an indirect methods in solving nonlinear
equations in terms of approximation errors and number of iterations used, and its
application on a graphical user interface (GUI) for an interactive way of showing and
solving nonlinear equations.
With regards to the effectiveness of the said numerical methods, it can be
summarized that a numerical method with a higher rate of convergence may reach the
solution of a function in less iterations in comparison to another method with a slower
convergence. For example, Newton-Raphson method converges more quickly or than the
bracketing methods. The implication of this would be that given the exact same nonlinear
equation, Newton-Raphson method would arrive at the solution of F=0 in less iterations
compared to any bracketing method. In significance to this, though it is more efficient to
use these type of mehods, open-end methods are not always applicable in any kind of
equations and/or functions. Given this, these numerical methods are all efficient with
given restrictions.
The second key result from this paper, is the application of these numerical
methods in a given specific equation and utilize it using a graphical user interface (GUI)
using MATLAB as an efficient process of its implementation. Having MATLAB’s advanced
and complex learning system and the group’s sufficient coding and programming
capability, the said numerical methods are employed and are expressed in a language
68
CI TE

2.0
U nle a shing Possibilit ie s

understandable by a computer system and then interpreted back to a user using its
graphical user interface (GUI) feature.
After all the material examined in this paper, it can be concluded that numerical
methods are a key component in the area of nonlinear mathematics, and utilizing a
computer system’s user interface bids an efficient process.

69
CI TE

2.0
U nle a shing Possibilit ie s

XII. RECOMMENDATIONS
After the complete execution of the project, the proponents recommend the following
for further improvements in the project:

 Having a persistent and a step-by-step plan guide earlier before working on the
project/GUI to have a smooth flow on working.
 Familiarizing one’s self on the content especially with the methods on how they will
be coded and solved in MatLab.
 Starting on the hard part and main content of the GUI, specifically on the codes of
each method to have an ease if it will be finished first.
 Errors can’t be avoided and if it occurs, don’t hesitate to ask or approach others’
opinion even on the professor itself. PowerPoint’s and online articles can also
provide help to the proponents.
 In coding, it is appropriate to run first the codes after completing or troubleshooting
it to be instantly checked if there is still problems occurring to minimize the time
that will be wasted.
 In designing the GUI, it is efficient to have less and only the required GUI symbols
to result on inserting less codes. On the other hand, if the designer knows well
about MatLab and can handle such more and complicated GUI symbols or design,
it is also appropriate to apply it to the project to be more attractive and better GUI.
 After completing all the requirements and finishing the GUI, run again the program
starting from the beginning or assigned front/first GUI in the project.
 The GUI should be user-friendly built to be easily understand by the proponents
and the professor.

70
CI TE

2.0
U nle a shing Possibilit ie s

BIBLIOGRAPHY
Atkinson, K.E. (1978). An Introduction to Numerical Analysis. Nonlinear Systems of
Equations (pp. 88-95). Canada: John Wiley & Sons.

Burden, R.L., Faires, J.D (2005). Numerical Analysis. Numerical Solutions of Nonlinear
Systems of Equations, (pp. 597-640). Belmount: Thomson Brooks/Cole.

Burden, R. L., and Faires, J. D. 2011. Numerical Analysis. Brooks/Cole.

Esch, Louis et al., (2005). Numerical Method for Solving Nonlinear Equations. Hoboken,
New Jersey. John Wiley & Sons Ltd.
Kincaid, D. R., and Cheney, E. W. 2008. Numerical Mathematics and Computing.
Cengage Learning.
Opentextbc.(n.d.). Projectile Motion. Retieved September 29, 2018 from
https://opentextbc. ca/physicstestbook2/chapter/projectile-motion/

https://nyln.org/bisection-method-pros-and-cons-list
https://brainly.in/question/2518988
https://homepage.divms.uiowa.edu/~atkinson/ftp/ENA_Materials/Overheads/sec_3-
3.pdf
http://epoch.uwaterloo.ca/syde312/open_methods/page3.htm
https://studylib.net/doc/5711577/advantages-of-newton

71
CI TE

2.0
U nle a shing Possibilit ie s

APPENDICES
A. Home Page

72
CI TE

2.0
U nle a shing Possibilit ie s

73
CI TE

2.0
U nle a shing Possibilit ie s

74
CI TE

2.0
U nle a shing Possibilit ie s

75
CI TE

2.0
U nle a shing Possibilit ie s

76
CI TE

2.0
U nle a shing Possibilit ie s

B. Login

77
CI TE

2.0
U nle a shing Possibilit ie s

78
CI TE

2.0
U nle a shing Possibilit ie s

79
CI TE

2.0
U nle a shing Possibilit ie s

80
CI TE

2.0
U nle a shing Possibilit ie s

81
CI TE

2.0
U nle a shing Possibilit ie s

C. Register

82
CI TE

2.0
U nle a shing Possibilit ie s

83
CI TE

2.0
U nle a shing Possibilit ie s

84
CI TE

2.0
U nle a shing Possibilit ie s

85
CI TE

2.0
U nle a shing Possibilit ie s

86
CI TE

2.0
U nle a shing Possibilit ie s

D. Main Page

87
CI TE

2.0
U nle a shing Possibilit ie s

88
CI TE

2.0
U nle a shing Possibilit ie s

89
CI TE

2.0
U nle a shing Possibilit ie s

90
CI TE

2.0
U nle a shing Possibilit ie s

E. Graph

91
CI TE

2.0
U nle a shing Possibilit ie s

92
CI TE

2.0
U nle a shing Possibilit ie s

93
CI TE

2.0
U nle a shing Possibilit ie s

94
CI TE

2.0
U nle a shing Possibilit ie s

95
CI TE

2.0
U nle a shing Possibilit ie s

F. Saved Files

96
CI TE

2.0
U nle a shing Possibilit ie s

97
CI TE

2.0
U nle a shing Possibilit ie s

98
CI TE

2.0
U nle a shing Possibilit ie s

99
CI TE

2.0
U nle a shing Possibilit ie s

100
CI TE

2.0
U nle a shing Possibilit ie s

101
CI TE

2.0
U nle a shing Possibilit ie s

102
CI TE

2.0
U nle a shing Possibilit ie s

103
CI TE

2.0
U nle a shing Possibilit ie s

104
CI TE

2.0
U nle a shing Possibilit ie s

105
CI TE

2.0
U nle a shing Possibilit ie s

106
CI TE

2.0
U nle a shing Possibilit ie s

G. Iterative Method

107
CI TE

2.0
U nle a shing Possibilit ie s

108
CI TE

2.0
U nle a shing Possibilit ie s

109
CI TE

2.0
U nle a shing Possibilit ie s

110
CI TE

2.0
U nle a shing Possibilit ie s

111
CI TE

2.0
U nle a shing Possibilit ie s

112
CI TE

2.0
U nle a shing Possibilit ie s

113
CI TE

2.0
U nle a shing Possibilit ie s

H. Table

114
CI TE

2.0
U nle a shing Possibilit ie s

115
CI TE

2.0
U nle a shing Possibilit ie s

116
CI TE

2.0
U nle a shing Possibilit ie s

I. Select a Method

117
CI TE

2.0
U nle a shing Possibilit ie s

118
CI TE

2.0
U nle a shing Possibilit ie s

119