Skip to content
Projects
Groups
Snippets
Help
Loading...
Help
Support
Keyboard shortcuts
?
Submit feedback
Contribute to GitLab
Sign in
Toggle navigation
U
uva
Project overview
Project overview
Details
Activity
Releases
Repository
Repository
Files
Commits
Branches
Tags
Contributors
Graph
Compare
Issues
0
Issues
0
List
Boards
Labels
Milestones
Merge Requests
0
Merge Requests
0
CI / CD
CI / CD
Pipelines
Jobs
Schedules
Analytics
Analytics
CI / CD
Repository
Value Stream
Wiki
Wiki
Members
Members
Collapse sidebar
Close sidebar
Activity
Graph
Create a new issue
Jobs
Commits
Issue Boards
Open sidebar
Taddeüs Kroes
uva
Commits
0c91e4d7
Commit
0c91e4d7
authored
Feb 28, 2011
by
Taddeüs Kroes
Browse files
Options
Browse Files
Download
Email Patches
Plain Diff
Finished ass3.
parent
2f7c9750
Changes
4
Show whitespace changes
Inline
Side-by-side
Showing
4 changed files
with
14 additions
and
11 deletions
+14
-11
modsim/ass2/newton_raphson.h
modsim/ass2/newton_raphson.h
+4
-5
modsim/ass2/q3.c
modsim/ass2/q3.c
+8
-4
modsim/ass2/q4.c
modsim/ass2/q4.c
+1
-1
modsim/ass2/regula_falsi.h
modsim/ass2/regula_falsi.h
+1
-1
No files found.
modsim/ass2/newton_raphson.h
View file @
0c91e4d7
#include "func_ptr.h"
#define MAX_STEPS 1000
double
newton_raphson
(
func_ptr
f
,
func_ptr
df
,
double
x_start
,
unsigned
int
*
steps
)
{
double
newton_raphson
(
func_ptr
f
,
func_ptr
df
,
double
x_start
,
double
epsilon
,
unsigned
int
*
steps
,
unsigned
int
max_steps
)
{
double
x
=
x_start
,
last_x
=
x
-
1
;
for
(
*
steps
=
0
;
x
!=
last_x
;
(
*
steps
)
++
)
{
if
(
*
steps
==
MAX_STEPS
)
for
(
*
steps
=
0
;
fabs
(
x
-
last_x
)
>=
epsilon
;
(
*
steps
)
++
)
{
if
(
*
steps
==
max_steps
)
return
NAN
;
last_x
=
x
;
...
...
modsim/ass2/q3.c
View file @
0c91e4d7
...
...
@@ -3,6 +3,7 @@
#include <math.h>
#include "bisec.h"
#include "newton_raphson.h"
#include "regula_falsi.h"
#define EPSILON 1e-11
...
...
@@ -17,11 +18,14 @@ double df(double x) {
int
main
(
void
)
{
unsigned
int
steps
;
printf
(
"Square root of 2 using bisection method:
%.11
f (%d steps)
\n
"
,
bisec
(
&
f
,
1
.
4
,
1
.
5
,
EPSILON
,
&
steps
),
steps
);
printf
(
"Square root of 2 using bisection method:
%.20
f (%d steps)
\n
"
,
bisec
(
&
f
,
1
,
2
,
EPSILON
,
&
steps
),
steps
);
printf
(
"Square root of 2 using newton_raphson method: %.11f (%d steps)
\n
"
,
newton_raphson
(
&
f
,
&
df
,
1
.
4
,
&
steps
),
steps
);
printf
(
"Square root of 2 using Newton-Raphson method: %.20f (%d steps)
\n
"
,
newton_raphson
(
&
f
,
&
df
,
1
.
4
,
EPSILON
,
&
steps
,
100000
),
steps
);
printf
(
"Square root of 2 using the Regula Falsi method: %.20f (%d steps)
\n
"
,
regula_falsi
(
&
f
,
1
,
2
,
EPSILON
,
&
steps
,
100000
),
steps
);
return
0
;
}
modsim/ass2/q4.c
View file @
0c91e4d7
...
...
@@ -38,7 +38,7 @@ int main(void) {
unsigned
int
steps
;
double
root
;
if
(
!
isnan
(
root
=
newton_raphson
(
&
f2
,
&
df2
,
1000000
,
&
steps
))
)
if
(
!
isnan
(
root
=
newton_raphson
(
&
f2
,
&
df2
,
1000000
,
EPSILON
,
&
steps
,
100000
))
)
printf
(
"f2: %.11f (%d steps)
\n
"
,
root
,
steps
);
else
printf
(
"f2: could not find a root after %d steps
\n
"
,
steps
);
...
...
modsim/ass2/regula_falsi.h
View file @
0c91e4d7
...
...
@@ -2,7 +2,7 @@
#include "func_ptr.h"
double
regula_falsi
(
func_ptr
f
,
double
s
,
double
t
,
double
e
,
int
*
steps
,
int
m
)
{
int
*
steps
,
unsigned
int
m
)
{
int
n
,
side
=
0
;
double
r
,
fr
,
fs
=
f
(
s
),
ft
=
f
(
t
);
...
...
Write
Preview
Markdown
is supported
0%
Try again
or
attach a new file
Attach a file
Cancel
You are about to add
0
people
to the discussion. Proceed with caution.
Finish editing this message first!
Cancel
Please
register
or
sign in
to comment