第1章

Size: px
Start display at page:

Download "第1章"

Transcription

1

2

3 Windows

4 1

5 2

6 3

7 4

8 5

9 6

10 7

11 8

12 n x, y i 0,1,, n 1 i i y P x ) i 0, 1,, n 1 n 1 i ( i ( x x1)( x x2 ) ( x xn ) f (x) y0 ( x x )( x x ) ( x x ) ( x x0 )( x x1 ) ( x xn 1) ( x x )( x x ) ( x x ) n 2 0 n 0 1 n ( x x )( x x ) ( x x 0 2 n 1 ( x1 x0 )( x1 x2 ) ( x1 xn ) n n1 y n ) y n n x x j yi i j xi x 0 0 j i j x, y x y 9

13 x x, f x ), f ( x ),, f ( ) f ( x 1 ) f ( x 1) 0, 1, x n 1 n ( 0 1 x n s(x) f x ) c1 ( x x ) c2 ( x x ) c3 ( x x ) ( i i i i i i i xi x xi i 0, 1,, ni 2 c, c2 c3 ck 1i i i i h i 0,, n i 2 h x i i 1 x i,, d i 1,, n 2 i i i 10

14 i i i i i h h h, 1 1 i d i, i i i i i i i i h y y h y y h h , n 0 d d 1 n 0 d , ) ( 6 d n x f h y y h ) ( 6 n n n n n h y y x f h n n n n n M M M M n n d d d d M i i M ck i 0 i 2, 1,, i n i c2 i i c M 3, 2 i i i i c h M M 1, i i i i i i i h c h c h y y y x, 11

15 ( x, y0 ), ( x1, y1),, ( x n 1, yn 1) y ax b 0 y ax b n 2 S ( yi axi b) ( i 0, 1,, n i 1) i0 a, b S a b S S 2 2 axi bxi xi yi a S 2a x i b yi b 12

16 a b i n x y a n i i i i x y i i 2 x 2 x i i i i y a x i i i b n i x, y x, y y 0. 85x x y 13

17 x y 5 y (1 2 x 5 x 5 ) 14

18 n 1 15

19 16

20 17

21 18

22 19

23 20

24 double lagrange (double nx[][50], double ny[][50], int n[], double x, int a) { } int i, j; double fx = 0, sum = 0; for (i = 0; i < n[a]; i++) { fx = ny[a][i]; for (j = 0; j < n[a]; j++) { if (i!= j) fx = fx (x - nx[a][j]) / } } sum += fx; (nx[a][i] - nx[a][j]); return (sum); j i y 21

25 double spline (double nx[][50], double ny[][50], int n[], double x, int a) { int i; double p, s; double h[1000], d[1000], f[1000], e[1000], u[1000], m[1000], end[2], c1[1000], c2[1000], c3[1000]; for (i = 0; i < n[a] - 1; i++) h[i] = nx[a][i + 1] - nx[a][i]; f[0] = 1; e[n[a] - 1] = 1; for (i = 1; i < n[a] - 1; i++) { f[i] = h[i] / (h[i - 1] + h[i]); e[i] = 1 - f[i]; u[i] = 6 / (h[i - 1] + h[i]) ((ny[a][i + 1] - ny[a][i]) / h[i] - (ny[a][i] - ny[a][i - 1]) / h[i - 1]); } for (i = 0; i < n[a]; i++) d[i] = 2; end[0] = 0; end[1] = 0; u[0] = 6 / h[0] ((ny[i][1] - ny[i][0]) / h[0] - end[0]); u[n[a] - 1] = 6 / h[n[a] - 2] (end[1] - (ny[a][n[a] - 1] - ny[a][n[a] - 2]) / h[n[a] - 2]); for (i = 0; i < n[a] - 1; i++) { } p = e[i + 1] / d[i]; d[i + 1] -= p f[i]; u[i + 1] -= p u[i]; 22

26 } u[n[a] - 1] /= d[n[a] -1]; for (i = n[a] - 2; i >= 0; i--) { u[i] = (u[i] - f[i] u[i + 1]) / d[i]; } for (i = 0; i < n[a]; i++) { } m[i] = u[i]; for (i = 0; i < n[a] - 1; i++) { c2[i] = m[i] / 2; c3[i] = (m[i+1] - m[i]) / (6 h[i]); c1[i] = (ny[a][i+1] - ny[a][i]) / h[i] - c2[i] h[i] - c3[i] h[i] h[i]; if ((x >= nx[a][i]) && (x <= nx[a][i + 1])) { s = ny[a][i] + c1[i] (x - nx[a][i]) + c2[i] (x - nx[a][i]) (x - nx[a][i]) + } } c3[i] (x - nx[a][i]) (x - nx[a][i]) (x - nx[a][i]); return (s); c1, c2 c3 i i i y 23

27 double lsq1(double nx[][50], double ny[][50], int n[], int c) { double a, b, A=0, B=0, C=0, D=0; int i; or (i = 0; i < n[c]; i++) { A += nx[c][i] ny[c][i]; B += nx[c][i]; C += ny[c][i]; D += nx[c][i] nx[c][i]; a = (n[c] A - B C) / (n[c] D - B B); b = (C - a B) / n[c]; return (a);//lsq2 b } b a a b 24

28

29

30

31 28

32 29

33 30

34 31

35 32

36 33

37 34

38 //{{NO_DEPENDENCIES}} // Microsoft Developer Studio generated include file. // Used by riso.rc // #define IDC_COMBO #define IDC_COMBO

39 #define IDC_EDIT #define IDC_EDIT #define IDC_xa #define IDC_xa #define IDC_ya #define IDC_ya #define IDC_xb #define IDC_xb #define IDC_yb #define IDC_yb #define IDC_xc #define IDC_xc #define IDC_yc #define IDC_yc #define IDC_xd #define IDC_xd #define IDC_yd #define IDC_yd #define IDC_xe #define IDC_xe #define IDC_ye #define IDC_ye #define GRAPH #define DEL #define VERSION

40 #define SAVEBMP #define NEWFILE #define FILEOPEN #define SAVENAMEFILE #define SAVEFILE #define SETPRINTER #define PRINT #define EXIT #define SETGRAPH #define SETGRAPH #define SETGRAPH #define SETGRAPH #define SETGRAPH // Next default values for new objects // #ifdef APSTUDIO_INVOKED #ifndef APSTUDIO_READONLY_SYMBOLS #define _APS_NEXT_RESOURCE_VALUE 125 #define _APS_NEXT_COMMAND_VALUE #define _APS_NEXT_CONTROL_VALUE 1269 #define _APS_NEXT_SYMED_VALUE 101 #endif #endif 37

41 38

42 39

43 40

44 41

45 42

46 43

47 44

48 45

49 46

50 47

51 48

52 49

53 50

54 51

55 52

56 53

57 54

58 55

59 56

60 57

61 58

62 59

63 60

64 61

65 62

66 63

67 64

68 65

69 66

70 67

71 68

72 69

73 70

74 71

75 72

76 73

77 74

78 75

79 76

80 77

81 78

82 79

83 80

02

02 54 163116831 02 1 168 54 158 53 162 53 148 52 152 52 10,000 0 40,000 30,000 20,000 50,000 70,000 60,000 1,000 500 1,500 2,000 0 2,500 3,000 4,000 3,500 4,500 168 54 158 53 162 53 148 52 152 52 03 52148

More information

1 5 13 4 1 41 1 411 1 412 2 413 3 414 3 415 4 42 6 43 LU 7 431 LU 10 432 11 433 LU 11 44 12 441 13 442 13 443 SOR ( ) 14 444 14 445 15 446 16 447 SOR 16 448 16 45 17 4 41 n x 1,, x n a 11 x 1 + a 1n x

More information

Gauss

Gauss 15 1 LU LDL T 6 : 1g00p013-5 1 6 1.1....................................... 7 1.2.................................. 8 1.3.................................. 8 2 Gauss 9 2.1.....................................

More information

C 2 / 21 1 y = x 1.1 lagrange.c 1 / Laglange / 2 #include <stdio.h> 3 #include <math.h> 4 int main() 5 { 6 float x[10], y[10]; 7 float xx, pn, p; 8 in

C 2 / 21 1 y = x 1.1 lagrange.c 1 / Laglange / 2 #include <stdio.h> 3 #include <math.h> 4 int main() 5 { 6 float x[10], y[10]; 7 float xx, pn, p; 8 in C 1 / 21 C 2005 A * 1 2 1.1......................................... 2 1.2 *.......................................... 3 2 4 2.1.............................................. 4 2.2..............................................

More information

関数のグラフを描こう

関数のグラフを描こう L05(2010-05-07) 1 2 hig3.net ( ) L05(2010-05-07) 1 / 16 #i n c l u d e double f ( double x ) ; i n t main ( void ){ i n t n ; i n t nmax=10; double x ; double s =0.0; } x = 1.0; s=s+x ;

More information

コンピュータ概論

コンピュータ概論 4.1 For Check Point 1. For 2. 4.1.1 For (For) For = To Step (Next) 4.1.1 Next 4.1.1 4.1.2 1 i 10 For Next Cells(i,1) Cells(1, 1) Cells(2, 1) Cells(10, 1) 4.1.2 50 1. 2 1 10 3. 0 360 10 sin() 4.1.2 For

More information

資料

資料 PC PC C VMwareをインストールする Tips: VmwareFusion *.vmx vhv.enable = TRUE Tips: Windows Hyper-V -rwxr-xr-x 1 masakazu staff 8552 7 29 13:18 a.out* -rw------- 1 masakazu staff 8552 7 29

More information

C による数値計算法入門 ( 第 2 版 ) 新装版 サンプルページ この本の定価 判型などは, 以下の URL からご覧いただけます. このサンプルページの内容は, 新装版 1 刷発行時のものです.

C による数値計算法入門 ( 第 2 版 ) 新装版 サンプルページ この本の定価 判型などは, 以下の URL からご覧いただけます.  このサンプルページの内容は, 新装版 1 刷発行時のものです. C による数値計算法入門 ( 第 2 版 ) 新装版 サンプルページ この本の定価 判型などは, 以下の URL からご覧いただけます. http://www.morikita.co.jp/books/mid/009383 このサンプルページの内容は, 新装版 1 刷発行時のものです. i 2 22 2 13 ( ) 2 (1) ANSI (2) 2 (3) Web http://www.morikita.co.jp/books/mid/009383

More information

PC Windows 95, Windows 98, Windows NT, Windows 2000, MS-DOS, UNIX CPU

PC Windows 95, Windows 98, Windows NT, Windows 2000, MS-DOS, UNIX CPU 1. 1.1. 1.2. 1 PC Windows 95, Windows 98, Windows NT, Windows 2000, MS-DOS, UNIX CPU 2. 2.1. 2 1 2 C a b N: PC BC c 3C ac b 3 4 a F7 b Y c 6 5 a ctrl+f5) 4 2.2. main 2.3. main 2.4. 3 4 5 6 7 printf printf

More information

20169 3 4 5003 n=3,000 61.8% 38.2% n=3,000 20 7.3% 30 21.3% 40 34.8% 50 36.6% n=3,000 3.0% 2.0% 1.5% 12.1% 14.0% 41.4% 25.9% n=3,000 37.7% % 24.8% 28.8% 1.9% 3.1% 0.2% n=3,000 500 64.0% 500 1,000 31.3%

More information

FX ) 2

FX ) 2 (FX) 1 1 2009 12 12 13 2009 1 FX ) 2 1 (FX) 2 1 2 1 2 3 2010 8 FX 1998 1 FX FX 4 1 1 (FX) () () 1998 4 1 100 120 1 100 120 120 100 20 FX 100 100 100 1 100 100 100 1 100 1 100 100 1 100 101 101 100 100

More information

【知事入れ版】270804_鳥取県人口ビジョン素案

【知事入れ版】270804_鳥取県人口ビジョン素案 7 6 5 4 3 2 1 65 1564 14 192 193 194 195 196 197 198 199 2 21 22 23 24 1.65 1,4 1.6 1,2 1.55 1, 1.45 6 1.5 8 1.4 4 1.35 1.3 2 27 28 29 21 211 212 213 214 6 5 4 3 2 1 213 218 223 228 233 238 243 248 253

More information

Excel97関数編

Excel97関数編 Excel97 SUM Microsoft Excel 97... 1... 1... 1... 2... 3... 3... 4... 5... 6... 6... 7 SUM... 8... 11 Microsoft Excel 97 AVERAGE MIN MAX SUM IF 2 RANK TODAY ROUND COUNT INT VLOOKUP 1/15 Excel A B C A B

More information

スライド 1

スライド 1 数値解析 2019 年度前期第 13 週 [7 月 11 日 ] 静岡大学創造科学技術大学院情報科学専攻工学部機械工学科計測情報講座 三浦憲二郎 講義アウトライン [7 月 11 日 ] 関数近似と補間 最小 2 乗近似による関数近似 ラグランジュ補間 T.Kanai, U.Tokyo 関数近似 p.116 複雑な関数を簡単な関数で近似する 関数近似 閉区間 [a,b] で定義された関数 f(x)

More information

新・明解C言語 実践編

新・明解C言語 実践編 第 1 章 見 21 1-1 見えないエラー 見 List 1-1 "max2x1.h" a, b max2 List 1-1 chap01/max2x1.h max2 "max2x1.h" #define max2(a, b) ((a) > (b)? (a) : (b)) max2 List 1-2 List 1-2 chap01/max2x1test.c max2 #include

More information

1 4 2 EP) (EP) (EP)

1 4 2 EP) (EP) (EP) 2003 2004 2 27 1 1 4 2 EP) 5 3 6 3.1.............................. 6 3.2.............................. 6 3.3 (EP)............... 7 4 8 4.1 (EP).................... 8 4.1.1.................... 18 5 (EP)

More information

( ) ( ) ( ) i (i = 1, 2,, n) x( ) log(a i x + 1) a i > 0 t i (> 0) T i x i z n z = log(a i x i + 1) i=1 i t i ( ) x i t i (i = 1, 2, n) T n x i T i=1 z = n log(a i x i + 1) i=1 x i t i (i = 1, 2,, n) n

More information

sim98-8.dvi

sim98-8.dvi 8 12 12.1 12.2 @u @t = @2 u (1) @x 2 u(x; 0) = (x) u(0;t)=u(1;t)=0fort 0 1x, 1t N1x =1 x j = j1x, t n = n1t u(x j ;t n ) Uj n U n+1 j 1t 0 U n j =1t=(1x) 2 = U n j+1 0 2U n j + U n j01 (1x) 2 (2) U n+1

More information

P06.ppt

P06.ppt p.130 p.198 p.208 2 1 double weight[num]; double min, max; min = max = weight[0]; for( i= 1; i < NUM; i++ ) if ( weight[i] > max ) max = weight[i]: if ( weight[i] < min ) min = weight[i]: weight 3 maxof(a,

More information

31, 21% 24, 17% 8, 5% 23, 16% 24, 16% 91, 62% 19, 13% 39, 27% 33, 23% 73 48 57 51 31 1 9 13.0% 7.4% 5.3% 12.5% 17.1% 13.2% 17.9% 4.5% 36.4% 56.5% 40.7% 36.8% 50.0% 67.1% 56.3% 65.8% 75.0% 26.0% 37.0%

More information

37 27.0% 26 19.0% 74 54.0% 9 6.4% 13 9.2% 28 19.9% 26 18.4% 37 26.2%. 24 17.0% 99 69 75 59 39 1 6 4.5% 1.4% 7.7% 2.9% 25.0% 17.9% 20.8% 50.0% 41.7% 47.0% 51.4% 54.3% 61.5% 57.1% 55.6% 42.4% 50.0% 58.3%

More information

% 32.3 DI DI

% 32.3 DI DI 2011 7 9 28.1 41.4 30.5 35.8 31.9% 32.3 DI 18.2 2.4 8.1 3.5 DI 9.4 32.2 0.0 25.9 2008 1 3 2 3 34.8 65.2 46.753.8 1 2 8.82.9 43.1 10 3 DI 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25

More information

2 DI 28 7 1 37 28 4 18 27 11 21 5 2 26 4 5 1 15 2 25 3 35 4 17 7 5 48 76 31 47 17 2 92 12 2 2 4 6 8 1 12 1 2 4 1 12 13 18 19 3 42 57 57 1 2 3 4 5 6 1 1 1 3 4 4 5 5 5.5 1 1.5 2 2.5 3 3.5 4 4.5 5

More information

3 DI 29 7 1 5 6 575 11 751, 13 1,1,25 6 1,251,5 2 1,51,75 1,752, 1 2,2,25 2,252,5 2,53, 3,3,5 3,5 5 1 15 2 25 3 5 6 575 12 751, 21 1,1,25 27 1,251,5 9 1,51,75 1,752, 1 2,2,25 2 2,252,5 2,53, 2 3,3,5

More information

無印良品のスキンケア

無印良品のスキンケア 2 3 4 5 P.22 P.10 P.18 P.14 P.24 Na 6 7 P.10 P.22 P.14 P.18 P.24 8 9 1701172 1,400 1701189 1,000 1081267 1,600 1701257 2,600 1125923 450 1081250 1,800 1125916 650 1081144 1,800 1081229 1,500 Na 1701240

More information

新コンフィギュレータのフレームワークについて

新コンフィギュレータのフレームワークについて : 2007 12 7 6: 2009 5 9 TOPPERS 1.... 4 1.1... 4 1.2 TOPPERS... 4 2.... 4 2.1... 4 3.... 8 4.... 9 4.1... 9 4.2... 10 4.3... 10 4.3.1... 11 4.3.2 INCLUDE... 11 4.3.3 C... 12 4.4 API... 14 4.2.1 API...

More information

double float

double float 2015 3 13 1 2 2 3 2.1.......................... 3 2.2............................. 3 3 4 3.1............................... 4 3.2 double float......................... 5 3.3 main.......................

More information

‚æ4›ñ

‚æ4›ñ ( ) ( ) ( ) A B C D E F G H I J K L M N O P Q R S T U V W X Y Z a b c d e f g h i j k l m n o p q r s t u v w x y z 0 1 2 3 4 5 6 7 8 9 (OUS) 9 26 1 / 28 ( ) ( ) ( ) A B C D Z a b c d z 0 1 2 9 (OUS) 9

More information

橡Taro9-生徒の活動.PDF

橡Taro9-生徒の活動.PDF 3 1 4 1 20 30 2 2 3-1- 1 2-2- -3- 18 1200 1 4-4- -5- 15 5 25 5-6- 1 4 2 1 10 20 2 3-7- 1 2 3 150 431 338-8- 2 3 100 4 5 6 7 1-9- 1291-10 - -11 - 10 1 35 2 3 1866 68 4 1871 1873 5 6-12 - 1 2 3 4 1 4-13

More information

dicutil1_5_2.book

dicutil1_5_2.book Kabayaki for Windows Version 1.5.2 ...1...1 1...3...3 2...5...5...5...7...7 3...9...9...9...10...10...11...12 1 2 Kabayaki ( ) Kabayaki Kabayaki ( ) Kabayaki Kabayaki Kabayaki 1 2 1 Kabayaki ( ) ( ) CSV

More information

Microsoft Word - C.....u.K...doc

Microsoft Word - C.....u.K...doc C uwêííôöðöõ Ð C ÔÖÐÖÕ ÐÊÉÌÊ C ÔÖÐÖÕÊ C ÔÖÐÖÕÊ Ç Ê Æ ~ if eíè ~ for ÒÑÒ ÌÆÊÉÉÊ ~ switch ÉeÍÈ ~ while ÒÑÒ ÊÍÍÔÖÐÖÕÊ ~ 1 C ÔÖÐÖÕ ÐÊÉÌÊ uê~ ÏÒÏÑ Ð ÓÏÖ CUI Ô ÑÊ ÏÒÏÑ ÔÖÐÖÕÎ d ÈÍÉÇÊ ÆÒ Ö ÒÐÑÒ ÊÔÎÏÖÎ d ÉÇÍÊ

More information

USB 0.6 https://duet.doshisha.ac.jp/info/index.jsp 2 ID TA DUET 24:00 DUET XXX -YY.c ( ) XXX -YY.txt() XXX ID 3 YY ID 5 () #define StudentID 231

USB 0.6 https://duet.doshisha.ac.jp/info/index.jsp 2 ID TA DUET 24:00 DUET XXX -YY.c ( ) XXX -YY.txt() XXX ID 3 YY ID 5 () #define StudentID 231 0 0.1 ANSI-C 0.2 web http://www1.doshisha.ac.jp/ kibuki/programming/resume p.html 0.3 2012 1 9/28 0 [ 01] 2 10/5 1 C 2 3 10/12 10 1 2 [ 02] 4 10/19 3 5 10/26 3 [ 03] 6 11/2 3 [ 04] 7 11/9 8 11/16 4 9 11/30

More information

C¥×¥í¥°¥é¥ß¥ó¥° ÆþÌç

C¥×¥í¥°¥é¥ß¥ó¥° ÆþÌç C (3) if else switch AND && OR (NOT)! 1 BMI BMI BMI = 10 4 [kg]) ( [cm]) 2 bmi1.c Input your height[cm]: 173.2 Enter Input your weight[kg]: 60.3 Enter Your BMI is 20.1. 10 4 = 10000.0 1 BMI BMI BMI = 10

More information

[] x < T f(x), x < T f(x), < x < f(x) f(x) f(x) f(x + nt ) = f(x) x < T, n =, 1,, 1, (1.3) f(x) T x 2 f(x) T 2T x 3 f(x), f() = f(t ), f(x), f() f(t )

[] x < T f(x), x < T f(x), < x < f(x) f(x) f(x) f(x + nt ) = f(x) x < T, n =, 1,, 1, (1.3) f(x) T x 2 f(x) T 2T x 3 f(x), f() = f(t ), f(x), f() f(t ) 1 1.1 [] f(x) f(x + T ) = f(x) (1.1), f(x), T f(x) x T 1 ) f(x) = sin x, T = 2 sin (x + 2) = sin x, sin x 2 [] n f(x + nt ) = f(x) (1.2) T [] 2 f(x) g(x) T, h 1 (x) = af(x)+ bg(x) 2 h 2 (x) = f(x)g(x)

More information

joho12.ppt

joho12.ppt n φ 1 (x),φ 2 (x),,φ n (x) (x i, f i ) Q n c 1,,c n (,f k ) q n = c i φ i (x) x Q n i=1 c 1 = 0 c 1 n ( c 1 ) = q n f k 2 Q n ( c 1 ) = q 2 2 n ( ) 2 f k q n ( ) + f k Q n c 1 = c 1 q n 2 q n( ) q n q

More information

01_OpenMP_osx.indd

01_OpenMP_osx.indd OpenMP* / 1 1... 2 2... 3 3... 5 4... 7 5... 9 5.1... 9 5.2 OpenMP* API... 13 6... 17 7... 19 / 4 1 2 C/C++ OpenMP* 3 Fortran OpenMP* 4 PC 1 1 9.0 Linux* Windows* Xeon Itanium OS 1 2 2 WEB OS OS OS 1 OS

More information

68 A mm 1/10 A. (a) (b) A.: (a) A.3 A.4 1 1

68 A mm 1/10 A. (a) (b) A.: (a) A.3 A.4 1 1 67 A Section A.1 0 1 0 1 Balmer 7 9 1 0.1 0.01 1 9 3 10:09 6 A.1: A.1 1 10 9 68 A 10 9 10 9 1 10 9 10 1 mm 1/10 A. (a) (b) A.: (a) A.3 A.4 1 1 A.1. 69 5 1 10 15 3 40 0 0 ¾ ¾ É f Á ½ j 30 A.3: A.4: 1/10

More information

2/ 土 :30 11:20 似通った科目名がありますので注意してください. 受験許可されていない科目を解答した場合は無効 整理番号と科目コードは受験許可証とよく照合し正確に記入

2/ 土 :30 11:20 似通った科目名がありますので注意してください. 受験許可されていない科目を解答した場合は無効 整理番号と科目コードは受験許可証とよく照合し正確に記入 2/ 土 28 9 10 10:30 11:20 似通った科目名がありますので注意してください. 受験許可されていない科目を解答した場合は無効 整理番号と科目コードは受験許可証とよく照合し正確に記入 30 10 11 12 00011 00016 01101 02607 02703 (1) AB AB 100 cm 2 3.00 cm 2 9.80 m/s 2 AB A B A 10.0 kg A

More information

TEX American Mathematical Society PostScript Adobe Systems Incorporated

TEX American Mathematical Society PostScript Adobe Systems Incorporated P A D manual ( pad2ps 3.1j ) (seiichi@muraoka.info.waseda.ac.jp) 1996 11 2 TEX American Mathematical Society PostScript Adobe Systems Incorporated pad2ps PAD PAD (Problem Analysis Diagram) C 1 2 PAD PAD

More information

joho09.ppt

joho09.ppt s M B e E s: (+ or -) M: B: (=2) e: E: ax 2 + bx + c = 0 y = ax 2 + bx + c x a, b y +/- [a, b] a, b y (a+b) / 2 1-2 1-3 x 1 A a, b y 1. 2. a, b 3. for Loop (b-a)/ 4. y=a*x*x + b*x + c 5. y==0.0 y (y2)

More information

, = = 7 6 = 42, =

, = = 7 6 = 42, = http://www.ss.u-tokai.ac.jp/~mahoro/2016autumn/alg_intro/ 1 1 2016.9.26, http://www.ss.u-tokai.ac.jp/~mahoro/2016autumn/alg_intro/ 1.1 1 214 132 = 28258 2 + 1 + 4 1 + 3 + 2 = 7 6 = 42, 4 + 2 = 6 2 + 8

More information

1: *2 W, L 2 1 (WWL) 4 5 (WWL) W (WWL) L W (WWL) L L 1 2, 1 4, , 1 4 (cf. [4]) 2: 2 3 * , , = , 1

1: *2 W, L 2 1 (WWL) 4 5 (WWL) W (WWL) L W (WWL) L L 1 2, 1 4, , 1 4 (cf. [4]) 2: 2 3 * , , = , 1 I, A 25 8 24 1 1.1 ( 3 ) 3 9 10 3 9 : (1,2,6), (1,3,5), (1,4,4), (2,2,5), (2,3,4), (3,3,3) 10 : (1,3,6), (1,4,5), (2,2,6), (2,3,5), (2,4,4), (3,3,4) 6 3 9 10 3 9 : 6 3 + 3 2 + 1 = 25 25 10 : 6 3 + 3 3

More information

PowerPoint Presentation

PowerPoint Presentation p.130 p.198 p.208 2 double weight[num]; double min, max; min = max = weight[0]; for( i= 1; i i < NUM; i++ ) ) if if ( weight[i] > max ) max = weight[i]: if if ( weight[i] < min ) min = weight[i]: weight

More information

スライド 1

スライド 1 数値解析 平成 24 年度前期第 13 週 [7 月 11 日 ] 静岡大学創造科学技術大学院情報科学専攻工学部機械工学科計測情報講座 三浦憲二郎 講義アウトライン [7 月 11 日 ] 関数近似と補間 最小 2 乗近似による関数近似 ラグランジュ補間 形状処理工学の基礎 点列からの曲線の生成 T.Kanai, U.Tokyo 関数近似 p.116 複雑な関数を簡単な関数で近似する関数近似 閉区間

More information

NEXT 1 2 3 1 2 3 4 5 6 1 2 1 2 1 1 1 1 2 3 1 2 3 4 5 6 1 2 3 4 1 2 3 4 5 6 1 2 3 4 5 1 2 3 1 1 2 1 2 3 4 5 6 7 1 2 3 1 2 1 2 3 4 5 6 7 8 9 1 1 1 2 1 2 1 2 3 4 5 6 1 2

More information

c-all.dvi

c-all.dvi III(994) (994) from PSL (9947) & (9922) c (99,992,994,996) () () 2 3 4 (2) 2 Euler 22 23 Euler 24 (3) 3 32 33 34 35 Poisson (4) 4 (5) 5 52 ( ) 2 Turbo 2 d 2 y=dx 2 = y y = a sin x + b cos x x = y = Fortran

More information

Version C 1 2 3 4 5 1 2 3 4 5 6 7 8 9 0 A 1 2 1 3 4 5 1 1 2 1 1 1 2 4 5 6 7 8 3 1 2 C a b c d e f g A A B C B a b c d e f g 3 4 4 5 6 7 8 1 2 a b 1 2 a b 1 2 1 2 5 4 1 23 5 6 6 a b 1 2 e c d 3

More information

1.2 y + P (x)y + Q(x)y = 0 (1) y 1 (x), y 2 (x) y 1 (x), y 2 (x) (1) y(x) c 1, c 2 y(x) = c 1 y 1 (x) + c 2 y 2 (x) 3 y 1 (x) y 1 (x) e R P (x)dx y 2

1.2 y + P (x)y + Q(x)y = 0 (1) y 1 (x), y 2 (x) y 1 (x), y 2 (x) (1) y(x) c 1, c 2 y(x) = c 1 y 1 (x) + c 2 y 2 (x) 3 y 1 (x) y 1 (x) e R P (x)dx y 2 1 1.1 R(x) = 0 y + P (x)y + Q(x)y = R(x)...(1) y + P (x)y + Q(x)y = 0...(2) 1 2 u(x) v(x) c 1 u(x)+ c 2 v(x) = 0 c 1 = c 2 = 0 c 1 = c 2 = 0 2 0 2 u(x) v(x) u(x) u (x) W (u, v)(x) = v(x) v (x) 0 1 1.2

More information

2008 ( 13 ) C LAPACK 2008 ( 13 )C LAPACK p. 1

2008 ( 13 ) C LAPACK 2008 ( 13 )C LAPACK p. 1 2008 ( 13 ) C LAPACK LAPACK p. 1 Q & A Euler http://phase.hpcc.jp/phase/mppack/long.pdf KNOPPIX MT (Mersenne Twister) SFMT., ( ) ( ) ( ) ( ). LAPACK p. 2 C C, main Asir ( Asir ) ( ) (,,...), LAPACK p.

More information

13 Student Software TI-Nspire CX CAS TI Web TI-Nspire CX CAS Student Software ( ) 1 Student Software 37 Student Software Nspire Nspire Nspir

13 Student Software TI-Nspire CX CAS TI Web TI-Nspire CX CAS Student Software ( ) 1 Student Software 37 Student Software Nspire Nspire Nspir 13 Student Software TI-Nspire CX CAS TI Web TI-Nspire CX CAS Student Software ( ) 1 Student Software 37 Student Software 37.1 37.1 Nspire Nspire Nspire 37.1: Student Software 13 2 13 Student Software esc

More information

¥×¥í¥°¥é¥ß¥ó¥°±é½¬I Exercise on Programming I [1zh] ` `%%%`#`&12_`__~~~ alse

¥×¥í¥°¥é¥ß¥ó¥°±é½¬I  Exercise on Programming I [1zh] ` `%%%`#`&12_`__~~~alse I Exercise on Programming I http://bit.ly/oitprog1 1, 2 of 14 ( RD S ) I 1, 2 of 14 1 / 44 Ruby Ruby ( RD S ) I 1, 2 of 14 2 / 44 7 5 9 2 9 3 3 2 6 5 1 3 2 5 6 4 7 8 4 5 2 7 9 6 4 7 1 3 ( RD S ) I 1, 2

More information

スライド 1

スライド 1 数値解析 平成 29 年度前期第 14 週 [7 月 10 日 ] 静岡大学工学研究科機械工学専攻ロボット 計測情報分野創造科学技術大学院情報科学専攻 三浦憲二郎 期末試験 7 月 31 日 ( 月 ) 9 10 時限 A : 佐鳴会議室 B : 佐鳴ホール 講義アウトライン [7 月 10 日 ] 関数近似と補間 最小 2 乗近似による関数近似 ( 復習 ) ラグランジュ補間 形状処理工学の基礎

More information

XMPによる並列化実装2

XMPによる並列化実装2 2 3 C Fortran Exercise 1 Exercise 2 Serial init.c init.f90 XMP xmp_init.c xmp_init.f90 Serial laplace.c laplace.f90 XMP xmp_laplace.c xmp_laplace.f90 #include int a[10]; program init integer

More information

[1] #include<stdio.h> main() { printf("hello, world."); return 0; } (G1) int long int float ± ±

[1] #include<stdio.h> main() { printf(hello, world.); return 0; } (G1) int long int float ± ± [1] #include printf("hello, world."); (G1) int -32768 32767 long int -2147483648 2147483647 float ±3.4 10 38 ±3.4 10 38 double ±1.7 10 308 ±1.7 10 308 char [2] #include int a, b, c, d,

More information

untitled

untitled H8/300,H8S,H8SX [H8S,H8/300 Tool Chain Ver6.2.0.0] #define Inline static inline //************************************************** Inline char sil_and_mem(char *mem,char and) return (*((volatile

More information

プリント

プリント 1 2 3 4 End 1 2 End End 5 6 NEW PIN NEW PIN 1 1 PIN CONF 2 PIN 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53

More information

O(N) ( ) log 2 N

O(N) ( ) log 2 N 2005 11 21 1 1.1 2 O(N) () log 2 N 1.2 2 1 List 3-1 List 3-3 List 3-4? 3 3.1 3.1.1 List 2-1(p.70) 1 1 10 1 3.1.2 List 3-1(p.70-71) 1 1 2 1 2 2 1: 1 3 3.1.3 1 List 3-1(p.70-71) 2 #include stdlib.h

More information

ax 2 + bx + c = n 8 (n ) a n x n + a n 1 x n a 1 x + a 0 = 0 ( a n, a n 1,, a 1, a 0 a n 0) n n ( ) ( ) ax 3 + bx 2 + cx + d = 0 4

ax 2 + bx + c = n 8 (n ) a n x n + a n 1 x n a 1 x + a 0 = 0 ( a n, a n 1,, a 1, a 0 a n 0) n n ( ) ( ) ax 3 + bx 2 + cx + d = 0 4 20 20.0 ( ) 8 y = ax 2 + bx + c 443 ax 2 + bx + c = 0 20.1 20.1.1 n 8 (n ) a n x n + a n 1 x n 1 + + a 1 x + a 0 = 0 ( a n, a n 1,, a 1, a 0 a n 0) n n ( ) ( ) ax 3 + bx 2 + cx + d = 0 444 ( a, b, c, d

More information

Informatics 2010.key

Informatics 2010.key http://math.sci.hiroshima-u.ac.jp/ ~ryo/lectures/informatics2010/ 1 2 C ATM etc. etc. (Personal Computer) 3 4 Input Output Device Central Processing Unit I/O CPU Memory 5 6 (CPU),,... etc. C, Java, Fortran...

More information

Smalltalk_

Smalltalk_ DLLCC VisualWorks C Mac OS SSK-LampControl/ VisualWorksWithJun SSK-LampControl.h include SSK SSK FileBrowser SSK-LampControl.st FIle in SSK-LampControl File in SSK File in ( Smalltalk.SSK) ( C ) Controller

More information

untitled

untitled 186 17 100160250 1 10.1 55 2 18.5 6.9 100 38 17 3.2 17 8.4 45 3.9 53 1.6 22 7.3 100 2.3 31 3.4 47 OR OR 3 1.20.76 63.4 2.16 4 38,937101,118 17 17 17 5 1,765 1,424 854 794 108 839 628 173 389 339 57 6 18613

More information

untitled

untitled 1. 3 14 2. 1 12 9 7.1 3. 5 10 17 8 5500 4. 6 11 5. 1 12 101977 1 21 45.31982.9.4 79.71996 / 1997 89.21983 41.01902 6. 7 5 10 2004 30 16.8 37.5 3.3 2004 10.0 7.5 37.0 2004 8. 2 7 9. 6 11 46 37 25 55 10.

More information

1 1.1 C 2 1 double a[ ][ ]; 1 3x x3 ( ) malloc() 2 double *a[ ]; double 1 malloc() dou

1 1.1 C 2 1 double a[ ][ ]; 1 3x x3 ( ) malloc() 2 double *a[ ]; double 1 malloc() dou 1 1.1 C 2 1 double a[ ][ ]; 1 3x3 0 1 3x3 ( ) 0.240 0.143 0.339 0.191 0.341 0.477 0.412 0.003 0.921 1.2 malloc() 2 double *a[ ]; double 1 malloc() double 1 malloc() free() 3 #include #include

More information

C 2 2.1? 3x 2 + 2x + 5 = 0 (1) 1

C 2 2.1? 3x 2 + 2x + 5 = 0 (1) 1 2006 7 18 1 2 C 2 2.1? 3x 2 + 2x + 5 = 0 (1) 1 2 7x + 4 = 0 (2) 1 1 x + x + 5 = 0 2 sin x x = 0 e x + x = 0 x = cos x (3) x + 5 + log x? 0.1% () 2.2 p12 3 x 3 3x 2 + 9x 8 = 0 (4) 1 [ ] 1/3 [ 2 1 ( x 1

More information

:30 12:00 I. I VI II. III. IV. a d V. VI

:30 12:00 I. I VI II. III. IV. a d V. VI 2018 2018 08 02 10:30 12:00 I. I VI II. III. IV. a d V. VI. 80 100 60 1 I. Backus-Naur BNF N N y N x N xy yx : yxxyxy N N x, y N (parse tree) (1) yxyyx (2) xyxyxy (3) yxxyxyy (4) yxxxyxxy N y N x N yx

More information

新・明解C言語 ポインタ完全攻略

新・明解C言語 ポインタ完全攻略 2 1-1 1-1 /* 1-1 */ 1 int n = 100; int *p = &n; printf(" n %d\n", n); /* n int */ printf("*&n %d\n", *&n); /* *&n int */ printf(" p %p\n", p); /* p int * */ printf("&*p %p\n", &*p); /* &*p int * */ printf("sizeof(n)

More information

QR

QR 1 7 16 13 1 13.1 QR...................................... 2 13.1.1............................................ 2 13.1.2..................................... 3 13.1.3 QR........................................

More information

comment.dvi

comment.dvi ( ) (sample1.c) (sample1.c) 2 2 Nearest Neighbor 1 (2D-class1.dat) 2 (2D-class2.dat) (2D-test.dat) 3 Nearest Neighbor Nearest Neighbor ( 1) 2 1: NN 1 (sample1.c) /* -----------------------------------------------------------------

More information

RHEA key

RHEA key 2 P (k, )= k e k! 3 4 Probability 0.4 0.35 0.3 0.25 Poisson ( λ = 1) Poisson (λ = 3) Poisson ( λ = 10) Poisson (λ = 20) Poisson ( λ = 30) Gaussian (µ = 1, s = 1) Gaussian ( µ = 3, s = 3) Gaussian (µ =

More information

n Y 1 (x),..., Y n (x) 1 W (Y 1 (x),..., Y n (x)) 0 W (Y 1 (x),..., Y n (x)) = Y 1 (x)... Y n (x) Y 1(x)... Y n(x) (x)... Y n (n 1) (x) Y (n 1)

n Y 1 (x),..., Y n (x) 1 W (Y 1 (x),..., Y n (x)) 0 W (Y 1 (x),..., Y n (x)) = Y 1 (x)... Y n (x) Y 1(x)... Y n(x) (x)... Y n (n 1) (x) Y (n 1) D d dx 1 1.1 n d n y a 0 dx n + a d n 1 y 1 dx n 1 +... + a dy n 1 dx + a ny = f(x)...(1) dk y dx k = y (k) a 0 y (n) + a 1 y (n 1) +... + a n 1 y + a n y = f(x)...(2) (2) (2) f(x) 0 a 0 y (n) + a 1 y

More information

#define N1 N+1 double x[n1] =.5, 1., 2.; double hokan[n1] = 1.65, 2.72, 7.39 ; double xx[]=.2,.4,.6,.8,1.2,1.4,1.6,1.8; double lagrng(double xx); main

#define N1 N+1 double x[n1] =.5, 1., 2.; double hokan[n1] = 1.65, 2.72, 7.39 ; double xx[]=.2,.4,.6,.8,1.2,1.4,1.6,1.8; double lagrng(double xx); main =1= (.5, 1.65), (1., 2.72), (2., 7.39).2,.4,.6,.8, 1., 1.2, 1.4, 1.6 1 1: x.2 1.4128.4 1.5372.6 1.796533.8 2.198 1.2 3.384133 1.4 4.1832 1.6 5.1172 8 7 6 5 y 4 3 2 1.5 1 1.5 2 x 1: /* */ #include

More information

2012 A, N, Z, Q, R, C

2012 A, N, Z, Q, R, C 2012 A, N, Z, Q, R, C 1 2009 9 2 2011 2 3 2012 9 1 2 2 5 3 11 4 16 5 22 6 25 7 29 8 32 1 1 1.1 3 1 1 1 1 1 1? 3 3 3 3 3 3 3 1 1, 1 1 + 1 1 1+1 2 2 1 2+1 3 2 N 1.2 N (i) 2 a b a 1 b a < b a b b a a b (ii)

More information

超初心者用

超初心者用 3 1999 10 13 1. 2. hello.c printf( Hello, world! n ); cc hello.c a.out./a.out Hello, world printf( Hello, world! n ); 2 Hello, world printf n printf 3. ( ) int num; num = 100; num 100 100 num int num num

More information

Java (5) 1 Lesson 3: x 2 +4x +5 f(x) =x 2 +4x +5 x f(10) x Java , 3.0,..., 10.0, 1.0, 2.0,... flow rate (m**3/s) "flow

Java (5) 1 Lesson 3: x 2 +4x +5 f(x) =x 2 +4x +5 x f(10) x Java , 3.0,..., 10.0, 1.0, 2.0,... flow rate (m**3/s) flow Java (5) 1 Lesson 3: 2008-05-20 2 x 2 +4x +5 f(x) =x 2 +4x +5 x f(10) x Java 1.1 10 10 0 1.0 2.0, 3.0,..., 10.0, 1.0, 2.0,... flow rate (m**3/s) "flowrate.dat" 10 8 6 4 2 0 0 5 10 15 20 25 time (s) 1 1

More information

untitled

untitled C C 2 C 3 C 4 C 5 C 6 C 7 C 8 C 9 C 10 C 11 C 12 C 13 A V1 V2 B V2 V1 B A A B V1 V2 2 A B A B A B C 14 A B 2 B A V2 A B 2 V1 C 15 C 16 C 17 #ifdef #endif C 18 C 19 A B B C C A A B C A C 20 C 21 C 22 A

More information

2017 p vs. TDGL 4 Metropolis Monte Carlo equation of continuity s( r, t) t + J( r, t) = 0 (79) J s flux (67) J (79) J( r, t) = k δf δs s( r,

2017 p vs. TDGL 4 Metropolis Monte Carlo equation of continuity s( r, t) t + J( r, t) = 0 (79) J s flux (67) J (79) J( r, t) = k δf δs s( r, 27 p. 47 7 7. vs. TDGL 4 Metropolis Monte Carlo equation of continuity s( r, t) t + J( r, t) = (79) J s flux (67) J (79) J( r, t) = k δf δs s( r, t) t = k δf δs (59) TDGL (8) (8) k s t = [ T s s 3 + ξ

More information

he T N/ N/

he T N/ N/ 6.000 1.000 0.800 0.000 0.500 1.500 3.000 1.200 0.000 0.000 0.000 0.000 0.000-0.100 he 1.500 T 0.100 1.50 0.00 2 24.5 N/ 3 18.0 N/ 3 28.0 18.7 18.7 14.0 14.0 X() 20.000 Y() 0.000 (kn/2) 10.000 0.000 kn

More information

Taro-最大値探索法の開発(公開版

Taro-最大値探索法の開発(公開版 最大値探索法の開発 0. 目次 1. 開発過程 1 目標 1 : 4 個のデータの最大値を求める 目標 2 : 4 個のデータの最大値を求める 改良 : 多数のデータに対応するため 配列を使う 目標 3 : n 個のデータの最大値を求める 改良 : コードを簡潔に記述するため for 文を使う 目標 4 : n 個のデータの最大値を求める 改良 : プログラムをわかりやすくするため 関数を使う 目標

More information

1 (bit ) ( ) PC WS CPU IEEE754 standard ( 24bit) ( 53bit)

1 (bit ) ( ) PC WS CPU IEEE754 standard ( 24bit) ( 53bit) GNU MP BNCpack tkouya@cs.sist.ac.jp 2002 9 20 ( ) Linux Conference 2002 1 1 (bit ) ( ) PC WS CPU IEEE754 standard ( 24bit) ( 53bit) 10 2 2 3 4 5768:9:; = %? @BADCEGFH-I:JLKNMNOQP R )TSVU!" # %$ & " #

More information

body.dvi

body.dvi ..1 f(x) n = 1 b n = 1 f f(x) cos nx dx, n =, 1,,... f(x) sin nx dx, n =1,, 3,... f(x) = + ( n cos nx + b n sin nx) n=1 1 1 5 1.1........................... 5 1.......................... 14 1.3...........................

More information