|
METHODS ... 112
CHPATER 6 OPEN METHODS ... 133
CHPATER 7 ROOTS OF POLYNOMIALS ... 160
CHPATER 8 CASE STUDIES : ROOTS OF EQUATIONS ... 187
EPILOGUE : PARTTWO ... 212
PART THREE LINEAR ALGEBRAIC EQUATIONS ... 217
CHPATER 9 GAUSS ELIMINATION ... 231
CHPATER 10 LU DECOMPOSITION AND MATRIX INVE
|
|
|
.0)*w[9]+(1.97-1.9)/(2.0-1.9)*w[10];
printf("w(1.97) = %f y(1.97) = %f error = %f\n",y3,y(1.97),y3-y(1.97));
}
float f(float w, float t){
return 2*w/t+t*t*exp(t);
}
float y(float t){
return t*t*(exp(t)-exp(1));
}
Result
/*
This program is Euler's Method for exercise 5.2.10
y' = exp(-0.06*pi*t)*(1.20
|
|
|
in(){
int i, N = 10;
float t;
float w[11];
w[0] = 0;
for(i=0 ; i<N ; i++){
t = h*i +1;
w[i+1] = w[i]+ h*Taylor4(w[i],t);
}
for(i=0 ; i<=N ; i++){
t = 1 + h*i;
printf("w(%1.1f) = %f y(%1.1f) = %f error = %f\n",t,w[i], t, y(t), y(t)-w[i]);
}
}
float Taylor4(float w, float t){
return 2*w/t+t*t*e
|
|
|
method at p0=-3 , p1=-2
for the value of x with x^3 + 3x^2 - 1 = 0
*/
#include<stdio.h>
#include<math.h>
#define TOL 0.0001
float f(float x);
float absol(float x);
main()
{
int n;
float p0, p1, p2;
n = 1;
p0 = -3;
p1 = -2;
p2 = 0;
while(absol(p1-p0)>=TOL)
{
p2 = p1 - f(p1)*(p1-p0)/(f
|
|
|
method at a=0 , b=pi/2
for the value of x with x - cos(x) = 0
*/
#include<stdio.h>
#include<math.h>
#define TOL 0.0001
#define pi 3.141592
float f(float x);
int sgn(float x);
float absol(float x);
main()
{
int n;
float a, b, p1, p2;
n = 1;
p1 = a = 0;
p2 = b = pi/2;
while(absol(p2-p1)>
|
|
 |
with a complicated shape is divided into elements. But the FEM has the inherent shortcomings of numerical methods that rely on meshes or elements that are connected together by nodes in a properly predefined manner. Because of that, the idea of getting rid of the elements and meshes in the process o
|
|
메뉴펼치기
