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

Size: px
Start display at page:

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

Transcription

1

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

3

4 i ( ) 2 (1) ANSI (2) 2 (3) Web (4) C 2 Web 2 Windows 7 CPad for Boland C++ Compiler Ver ( ) C BASIC

5 ii ( ) 2 ( ) ( ) C C C (1) C ANSI (2) C BASIC C C C (3) BASIC GNUPLOT (4) C Sun Solaris 2.6 gcc (GNU C version 2.8.1) ( 5 5 )

6 iii C 2 ( ) ( 1 ) ( ) (1) (2) (3) BASIC (4) (5) ( ) N88BASIC

7 iv

8 v LU

9 vi

10 1 f(x) = O 1 O 2 O 3 O 1 1 m 3 m O 3 O 1 3 O 2 2 O O 2 x [m] π πx3 = 4 π(3 x)3 3 x 3 3x 2 + 9x 8 = 0 (1.1) x 3 f(x) = 0

11 f(x) [a, b] f(a) f(b) a b c f(c) = 0 (a < c < b) (1.1) 2 (1.1) f(x) f(x) = x 3 3x 2 + 9x 8 f(x) x x 1.2 f(1) = 1 < 0 f(2) = 6 > 0 [1, 2] f(x) = f(1.5) f(1.5) = > 0 f(1) < 0 f(1.5) > 0 [1, 1.5] [1, 2] 1.2

12 [1, 1.5] f(1.25) f(1.25) = 0.51 > 0 [1, 1.25] f(x) f(1.125) = 0.24 < 0, 4 : [1.125, 1.25] f(1.1875) = 0.13 > 0, 5 : [1.125, ] f( ) = 0.05 < 0, 6 : [ , ] f( ) = 0.03 > 0, 7 : [ , ] f( ) = 0.01 < 0, 8 : [ , ] f( ) = 0.01 > 0, 9 : [ , ] f( ) = > 0, 10 : [ , ] f( ) = < 0, 11 : [ , ] f( ) = < 0, 12 : [ , ] f( ) = < 0, 13 : [ , ] f( ) = < 0, 14 : [ , ] f( ) = > 0, 15 : [ , ] 8 x = 1.16 x = x = 1.16 x mm 15 x = x = O 2 1 m 16 cm 6 mm 2 f(x) = 0 f(x) f(x) a 1, b 1, (a 1 < b 1 ) [a 1, b 1 ] a 1 b 1 2 c 1 f(c 1 ) f(c 1 ) = 0 c 1 ( ) f(c 1 ) [a 1, c 1 ] [c 1, b 1 ] ( )

13 f(a 1 ) f(c 1 ) [a 1, c 1 ] 2 [a 1, c 1 ] ( 1.3(a))f(a 1 ) f(c 1 ) f(c 1 ) f(b 1 ) [c 1, b 1 ] ( 1.3(b)) 2 [c 1, b 1 ] 2 [a 2, b 2 ] [a 2, b 2 ] 3 [a 3, b 3 ] ( 1.4) 2 1.1

14 /* ************************************************* */ 2 /* 2 nibun.c */ 3 /* ************************************************* */ 4 # include < stdio.h> 5 /* ** ** */ 6 # define FNF (x) (x*x*x - 3* x*x + 9* x - 8) 7 int main ( void ) 8 { double a, b, c; 9 int k; 10 char z, zz; 11 while ( 1 ) { 12 printf ("f(a)*f(b)<0 a, b "); 13 printf (" \n\n"); 14 printf (" 1 [ a,b] a="); 15 scanf ("%lf%c",&a,& zz ); 16 printf (" 1 [ a,b] b="); 17 scanf ("%lf%c",&b,& zz ); 18 printf ("\ n (y/n)"); 19 scanf ("%c%c",&z,& zz ); 20 if(z == n ) continue ; 21 if ((z == y )&&( a < b )&&( FNF (a ) * FNF (b ) < 0)) 22 break ; 23 else { 24 printf ("\na >b f(a)*f(b ) >=0 \ n"); 25 printf (" \n"); 26 printf (" \n"); 27 scanf ("%c",&z ); continue ; 28 } 29 } 30 k = 0; 31 printf (" A B B-A\n"); 32 /* ** * * */ 33 while ( b - a >= ) { 34 k = k + 1; 35 printf ("%4d %8.5 lf %8.5 lf %8.5 lf\n",k,a,b,b-a); 36 /* a,b a,b */ 37 c = ( a + b ) / 2.0; 38 if ( FNF (a ) * FNF (c ) > 0 ) a = c; 39 else b = c; 40 if (( k % 10) == 0) { 41 printf ("\ n \n"); 42 printf (" (y/n ): "); 43 scanf ("%c%c",&z,& zz ); 44 if(z == n ) { 45 printf ("\ n \n" ); break ; 46 } else if( z == y ) 47 printf (" A B B-A\n"); 48 else { z = n ; break ; }

15 } 50 } 51 if(z!= n ) { 52 printf ("\n %3 d \ n",k); 53 printf ("\ n = %10.6 lf\n", (a+b )/2.0); 54 } 55 return 0; 56 } 1.2 (1.1) x 3 3x 2 + 9x 8 = 0 (1.1 ) f(x) [1, 2] f (x) = 3x 2 6x + 9 = 3(x 1) 2 + 6, f (x) = 6x 6 (1, 2) f (x) > 0 f (x) > 0 y = f(x) [1, 2] y = f(x) (2, 6) x x 1 x 1 1 (x 1, f(x 1 )) x x 2 (x 2, f(x 2 )) x x 3 x 1, x 2, x 3,, x n,

16

17 L = , [ U b ] = b = t [1, 0.4, , ] U b Ux = b u = , z = , y = , x = LU (2.4) (2.5) (1) 2x 4y + 6z = 1 (2) 2x + 8y + 2z 3w = 2 x + 7y 8z = 0 4x + 6y 2z w = 1 x + y 2z = 3 2x 4y 2z w = 3 x 5y + 2z + w = 2 (3) 2x + 7y z + 5u 3w = 6 x 4y + 2z u + 6w = 1 3x + y 9z 2u + w = 2 10x 2y 5z + 8u 7w = 4 4x + 3y + 12z 4u 2w =

18 (1) x + 3y 2z = 2 3x 2y + z = 0 2x + y 3z = 1 (2) 3y + 2z + u = 7 3x + 2y 3z = 1 x + 2y 3z + 2u = 3 3x + 4y + z + 2u = ( 2.2) 2.5 (1) (2) (3) (1) x + y z = 0 (2) 2x 2y z = 0 (3) 5x + 2y 6z = 0 x 3y 2z = 0 4x + y 5z = 0 6x + 2y + 3z = 0 x + 2y 2z = 0 2x 2y + 2z = 0 x + 6y 6z = { (1) 2x + y 4z + 5u = 1 (2) 2x 6y + 4z = 0 3x + y 2z + u = 3 x + 3y 2z = 0 3x 9y + 6z = 0 (3) x + y z = 2 (4) 2x 2y z = 12 5x + 2y 6z = 5 x 3y 2z = 19 (5) (7) 4x + y 5z = 3 x + 2y 2z = 2 2x 2y + 2z = 3 x + 6y 6z = 1 (6) 6x + 2y + 3z = 16 x + y + z = 1 2x + y 2z = 3 x y + 2z = 0 3x y + 2z = 2 x + y 2z = 2 x 1 + 2x 2 x 4 + x 6 7x 7 = 4 x 1 + 3x 2 x 3 + 3x 4 + 2x 5 + 3x 7 = 3 3x 1 + 7x 2 + x 3 + 2x 4 + 4x 5 + 3x 6 6x 7 = 13 x 1 + 2x 2 + x 4 + 4x 5 + 3x 6 11x 7 = P Q R 3 A B C A 1 kg P 1 kg Q 1 kg R 2 kg B 1 kg P 2 kg Q 3 kg R 2 kg C 1 kg P 1 kg Q 2 kg R 3 kg A B C 1 kg

19 120 f(x, y) dy dx = f(x, y), y(x 0) = y 0 y(x) 1 f(x, y) y(x) x 0, x 1, x 2,, x n y(x 0 ), y(x 1 ), y(x 2 ),, y(x n ) dy dx = f(x, y), y(x 0) = y 0 (7.1) x 1 = x 0 + h y 1 y(x 0 + h) y(x 0 + h) = y(x 0 ) + y (x 0 )h + 1 2! y (x 0 )h 2 + (7.2) (7.1) y (x 0 ) = f(x 0, y 0 ) f(x 0, y 0 ) y(x 1 ) y 1 (7.2) 2 y 1 = y 0 + f(x 0, y 0 )h x 1 h x 2 y(x 2 ) = y(x 1 + h) y 2 x 1 y 1 y 2 = y 1 + f(x 1, y 1 )h x x n = x 0 + nh y(x n ) y n (Euler)

20 dy dx = f(x, y), y(x 0) = y 0 h x n = x 0 + nh y(x n ) y n y n = y n 1 + f(x n 1, y n 1 )h, (n = 1, 2, ) (7.2) h 1 h x n = x 0 + nh y(x n ) y n 7.1 y = y 12x + 3, y(0) = 1 h = 0.1 y 1, y 2, y 3, y 4, y 5, y 6, y 7, y 8, y 9, y 10 0 x 1

21 122 7 x j y j f(x, y) hf(x, y) x j y j f(x, y) hf(x, y) y = 12x 8e x + 9 x = y(0.1) = , y(0.5) = , y(1.0) = (7.2) h O(h n ) n h k h 0 k/h n c( ) k = O(h n ) ( c = 0 ) O(h n ) + O(h n ) = O(h n ), ho(h n ) = O(h n+1 ) 0 < n < m O(h n ) + O(h m ) = O(h n ) (7.3) y(x) C n+1 y(x) y(x 0 + h) = y(x 0 ) + y (x 0 )h + 1 2! y (x 0 )h n! y(n) (x 0 )h n + O(h n+1 ) f(x, y) y f(a, b + h) = f(a, b) + O(h) (7.4) y(x 0 +h) h n y(x 0 +h) h n y(x 0 ) = y 0 y (x 0 ) = y 0 y (x 0 ) = y 0

22 h 2 y(x 0 + h) = y 0 + y 0h + 1 2! y 0 h 2 + O(h 3 ) (7.5) (7.5) y 0 = f(x 0, y 0 ) y 0 y 0 f(x, y) (7.5) h 2 f(x, y) y = y(x 0 + h) y(x 0 ) = hy (x 0 + θh), (0 < θ < 1) y (x 0 + θh) θ = 0 θ = 1 θ = 0 y hy (x 0 ) θ = 1 y hy (x 0 + h) y h 2 αhy (x 0 ) + βhy (x 0 + h) α β y h 2 αhy (x 0 ) + βhy (x 0 + h) = αhy (x 0 ) + βh{y (x 0 ) + y (x 0 )h + O(h 2 )} = (α + β)hy 0 + βh 2 y 0 + O(h 3 ) (7.5) α + β = 1, β = 1 2, α = 1 2, β = 1 2 y = 1 2 hy (x 0 ) hy (x 0 + h) + O(h 3 ) k 1 = hy (x 0 ) = hf(x 0, y 0 ) (7.6) (7.5) (7.4) hy (x 0 + h) = hf(x 0 + h, y(x 0 + h)) = hf(x 0 + h, y(x 0 ) + y (x 0 )h + O(h 2 )) = hf(x 0 + h, y 0 + k 1 + O(h 2 )) = hf(x 0 + h, y 0 + k 1 ) + O(h 3 ) k 2 = hf(x 0 + h, y 0 + k 1 ) (7.7)

23 124 7 y = 1 2 k k 2 + O(h 3 ) k = 1 2 (k 1 + k 2 ), y 1 = y 0 + k (7.8) y(x 0 + h) = y 1 + O(h 3 ) y 1 h 2 y 2 x 1 y ( ) y 1 (7.6) (7.7) (7.8) k 1 = hf(x 1, y 1 ), k 2 = hf(x 1 + h, y 1 + k 1 ), k = 1 2 (k 1 + k 2 ) y 2 = y 1 + k y 3 y 4 (Runge-Kutta) dy dx = f(x, y), y(x 0) = y 0 h x n = x 0 + nh y n y n+1 y n+1 = y n + k, (n = 0, 1, 2, ) k k 1 = hf(x n, y n ), k 2 = hf(x n + h, y n + k 1 ), k = 1 2 (k 1 + k 2 ) x j y j k j k x j y j x j y j

24 /* ************************************************* */ 2 /* 2 rungekt2.c */ 3 /* ************************************************* */ 4 # include <stdio.h> 5 double fnf ( double x, double y) 6 { return ( y * x + 3.0); } 7 int main ( void ) 8 { int i; 9 double x, y, h, k1, k2, k; 10 char zz; 11 printf (" 2 \ n\n"); 12 printf ("dy/dx = y * x "); 13 printf ("\n\ n \n"); 14 scanf ("%c",&zz ); 15 printf (" X Y\n"); 16 x = 0.0; y = 1.0; h = 0.1; 17 printf (" %10.6 lf %10.6 lf\n",x,y); 18 for (i =1; i <=20; i ++) { 19 k1 = h * fnf (x,y); 20 k2 = h * fnf (x+h,y+k1 ); 21 k = ( k1 + k2 ) / 2.0; 22 x = x + h; 23 y = y + k; 24 printf (" %10.6 lf %10.6 lf\n",x,y); 25 } 26 return 0; 27 } 2 h 4 4 ( [17]) dy dx = f(x, y), y(x 0) = y 0 h x n = x 0 + nh y n y n+1 = y n + k, (n = 0, 1, 2, ) k

25

26 171 (2-1) (2-1) (1) (2) (3) cm 1.5 t = x 1 = b 1 a 21 x 1 + x 2 = b 2 x 1 = b 1 j a 31 x 1 + a 32 x 2 + x 3 = b 3,. x j = b j a jk x k. k=1 a n1 x 1 + a n2 x a n,n 1 x n 1 + x n = b n (j = 2, 3,, n) 2.2 (1) x = 1.8 y = 1 z = 1.1 (2) x = y = z = w = (3) x = y = z = u = w = (1) x = y = z = (2) x = 2 y = 1 z = 3 u = (2-1) (1) (2) 2.6 (2-2) (1) x = t 1 (2) x = t (t ) (3) (3) x = t s t x 1

27 (1) x = s t 13 0 (2) x = s 1 + t (3) x = s 1 (4) x = t 3 (5) (6) x = s 1 (7) x = 8 + r 2 + s 1 + t x = 11 3, y = 1 3, z = 5 79 kg, (1) = 40 (2) (3) = = (1) = (2) =

28

29 LU (1 ) ( ) () 166

30 179 [a 1, a 2,, a n ] 10 a 1 a a n [a ij ] a ij i j 11 t a a 12 t A A 75 A 1 A 22 A A 37 n a j a 1 a 2 a n 45 j=1 L k (x) n j=1 j k x x j x k x j 45 f[x 0, x 1 ] 1 49 f[x 0, x 1, x 2 ] 2 49 f[x 0, x 1,, x n ] n 50 C n n 51 ( ) n n 56 nc j 58 ( n j ) 58 T n (x) n 82 ζ 0, ζ 1, ζ 2,, ζ n T n+1 (x) 87 P n (x) n 90 H n (k) 104 O(h n ) h n ( ) 122 x x 149

31 C n DE h n LU n n n

32 x

33

x h = (b a)/n [x i, x i+1 ] = [a+i h, a+ (i + 1) h] A(x i ) A(x i ) = h 2 {f(x i) + f(x i+1 ) = h {f(a + i h) + f(a + (i + 1) h), (2) 2 a b n A(x i )

x h = (b a)/n [x i, x i+1 ] = [a+i h, a+ (i + 1) h] A(x i ) A(x i ) = h 2 {f(x i) + f(x i+1 ) = h {f(a + i h) + f(a + (i + 1) h), (2) 2 a b n A(x i ) 1 f(x) a b f(x)dx = n A(x i ) (1) ix [a, b] n i A(x i ) x i 1 f(x) [a, b] n h = (b a)/n y h = (b-a)/n y = f (x) h h a a+h a+2h a+(n-1)h b x 1: 1 x h = (b a)/n [x i, x i+1 ] = [a+i h, a+ (i + 1) h] A(x

More information

微分積分 サンプルページ この本の定価 判型などは, 以下の URL からご覧いただけます. このサンプルページの内容は, 初版 1 刷発行時のものです.

微分積分 サンプルページ この本の定価 判型などは, 以下の URL からご覧いただけます.   このサンプルページの内容は, 初版 1 刷発行時のものです. 微分積分 サンプルページ この本の定価 判型などは, 以下の URL からご覧いただけます. ttp://www.morikita.co.jp/books/mid/00571 このサンプルページの内容は, 初版 1 刷発行時のものです. i ii 014 10 iii [note] 1 3 iv 4 5 3 6 4 x 0 sin x x 1 5 6 z = f(x, y) 1 y = f(x)

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

A

A A05-132 2010 2 11 1 1 3 1.1.......................................... 3 1.2..................................... 3 1.3..................................... 3 2 4 2.1............................... 4 2.2

More information

医系の統計入門第 2 版 サンプルページ この本の定価 判型などは, 以下の URL からご覧いただけます. このサンプルページの内容は, 第 2 版 1 刷発行時のものです.

医系の統計入門第 2 版 サンプルページ この本の定価 判型などは, 以下の URL からご覧いただけます.   このサンプルページの内容は, 第 2 版 1 刷発行時のものです. 医系の統計入門第 2 版 サンプルページ この本の定価 判型などは, 以下の URL からご覧いただけます. http://www.morikita.co.jp/books/mid/009192 このサンプルページの内容は, 第 2 版 1 刷発行時のものです. i 2 t 1. 2. 3 2 3. 6 4. 7 5. n 2 ν 6. 2 7. 2003 ii 2 2013 10 iii 1987

More information

<4D F736F F D B B83578B6594BB2D834A836F815B82D082C88C60202E646F63>

<4D F736F F D B B83578B6594BB2D834A836F815B82D082C88C60202E646F63> 電気電子数学入門 サンプルページ この本の定価 判型などは, 以下の URL からご覧いただけます. http://www.morikita.co.jp/books/mid/073471 このサンプルページの内容は, 初版 1 刷発行当時のものです. i 14 (tool) [ ] IT ( ) PC (EXCEL) HP() 1 1 4 15 3 010 9 ii 1... 1 1.1 1 1.

More information

1 28 6 12 7 1 7.1...................................... 2 7.1.1............................... 2 7.1.2........................... 2 7.2...................................... 3 7.3...................................

More information

A

A A 2563 15 4 21 1 3 1.1................................................ 3 1.2............................................. 3 2 3 2.1......................................... 3 2.2............................................

More information

18 ( ) I II III A B C(100 ) 1, 2, 3, 5 I II A B (100 ) 1, 2, 3 I II A B (80 ) 6 8 I II III A B C(80 ) 1 n (1 + x) n (1) n C 1 + n C

18 ( ) I II III A B C(100 ) 1, 2, 3, 5 I II A B (100 ) 1, 2, 3 I II A B (80 ) 6 8 I II III A B C(80 ) 1 n (1 + x) n (1) n C 1 + n C 8 ( ) 8 5 4 I II III A B C( ),,, 5 I II A B ( ),, I II A B (8 ) 6 8 I II III A B C(8 ) n ( + x) n () n C + n C + + n C n = 7 n () 7 9 C : y = x x A(, 6) () A C () C P AP Q () () () 4 A(,, ) B(,, ) C(,,

More information

さくらの個別指導 ( さくら教育研究所 ) A a 1 a 2 a 3 a n {a n } a 1 a n n n 1 n n 0 a n = 1 n 1 n n O n {a n } n a n α {a n } α {a

さくらの個別指導 ( さくら教育研究所 ) A a 1 a 2 a 3 a n {a n } a 1 a n n n 1 n n 0 a n = 1 n 1 n n O n {a n } n a n α {a n } α {a ... A a a a 3 a n {a n } a a n n 3 n n n 0 a n = n n n O 3 4 5 6 n {a n } n a n α {a n } α {a n } α α {a n } a n n a n α a n = α n n 0 n = 0 3 4. ()..0.00 + (0.) n () 0. 0.0 0.00 ( 0.) n 0 0 c c c c c

More information

/* do-while */ #include <stdio.h> #include <math.h> int main(void) double val1, val2, arith_mean, geo_mean; printf( \n ); do printf( ); scanf( %lf, &v

/* do-while */ #include <stdio.h> #include <math.h> int main(void) double val1, val2, arith_mean, geo_mean; printf( \n ); do printf( ); scanf( %lf, &v 1 http://www7.bpe.es.osaka-u.ac.jp/~kota/classes/jse.html kota@fbs.osaka-u.ac.jp /* do-while */ #include #include int main(void) double val1, val2, arith_mean, geo_mean; printf( \n );

More information

newmain.dvi

newmain.dvi 数論 サンプルページ この本の定価 判型などは, 以下の URL からご覧いただけます. http://www.morikita.co.jp/books/mid/008142 このサンプルページの内容は, 第 2 版 1 刷発行当時のものです. Daniel DUVERNEY: THÉORIE DES NOMBRES c Dunod, Paris, 1998, This book is published

More information

I. Backus-Naur BNF S + S S * S S x S +, *, x BNF S (parse tree) : * x + x x S * S x + S S S x x (1) * x x * x (2) * + x x x (3) + x * x + x x (4) * *

I. Backus-Naur BNF S + S S * S S x S +, *, x BNF S (parse tree) : * x + x x S * S x + S S S x x (1) * x x * x (2) * + x x x (3) + x * x + x x (4) * * 2015 2015 07 30 10:30 12:00 I. I VI II. III. IV. a d V. VI. 80 100 60 1 I. Backus-Naur BNF S + S S * S S x S +, *, x BNF S (parse tree) : * x + x x S * S x + S S S x x (1) * x x * x (2) * + x x x (3) +

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

: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

2 P.S.P.T. P.S.P.T. wiki 26

2 P.S.P.T. P.S.P.T. wiki  26 P.S.P.T. C 2011 4 10 2 P.S.P.T. P.S.P.T. wiki p.s.p.t.since1982@gmail.com http://www23.atwiki.jp/pspt 26 3 2 1 C 8 1.1 C................................................ 8 1.1.1...........................................

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

<4D F736F F D B B BB2D834A836F815B82D082C88C602E646F63>

<4D F736F F D B B BB2D834A836F815B82D082C88C602E646F63> 入門モーター工学 サンプルページ この本の定価 判型などは, 以下の URL からご覧いただけます. http://www.morikita.co.jp/books/mid/074351 このサンプルページの内容は, 初版 1 刷発行当時のものです. 10 kw 21 20 50 2 20 IGBT IGBT IGBT 21 (1) 1 2 (2) (3) ii 20 2013 2 iii iv...

More information

Excel ではじめる数値解析 サンプルページ この本の定価 判型などは, 以下の URL からご覧いただけます. このサンプルページの内容は, 初版 1 刷発行時のものです.

Excel ではじめる数値解析 サンプルページ この本の定価 判型などは, 以下の URL からご覧いただけます.   このサンプルページの内容は, 初版 1 刷発行時のものです. Excel ではじめる数値解析 サンプルページ この本の定価 判型などは, 以下の URL からご覧いただけます. http://www.morikita.co.jp/books/mid/009631 このサンプルページの内容は, 初版 1 刷発行時のものです. Excel URL http://www.morikita.co.jp/books/mid/009631 i Microsoft Windows

More information

I. Backus-Naur BNF : N N 0 N N N N N N 0, 1 BNF N N 0 11 (parse tree) 11 (1) (2) (3) (4) II. 0(0 101)* (

I. Backus-Naur BNF : N N 0 N N N N N N 0, 1 BNF N N 0 11 (parse tree) 11 (1) (2) (3) (4) II. 0(0 101)* ( 2016 2016 07 28 10:30 12:00 I. I VI II. III. IV. a d V. VI. 80 100 60 1 I. Backus-Naur BNF : 11011 N N 0 N N 11 1001 N N N N 0, 1 BNF N N 0 11 (parse tree) 11 (1) 1100100 (2) 1111011 (3) 1110010 (4) 1001011

More information

最新耐震構造解析 ( 第 3 版 ) サンプルページ この本の定価 判型などは, 以下の URL からご覧いただけます. このサンプルページの内容は, 第 3 版 1 刷発行時のものです.

最新耐震構造解析 ( 第 3 版 ) サンプルページ この本の定価 判型などは, 以下の URL からご覧いただけます.   このサンプルページの内容は, 第 3 版 1 刷発行時のものです. 最新耐震構造解析 ( 第 3 版 ) サンプルページ この本の定価 判型などは, 以下の URL からご覧いただけます. http://www.morikita.co.jp/books/mid/052093 このサンプルページの内容は, 第 3 版 1 刷発行時のものです. i 3 10 3 2000 2007 26 8 2 SI SI 20 1996 2000 SI 15 3 ii 1 56 6

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

x () g(x) = f(t) dt f(x), F (x) 3x () g(x) g (x) f(x), F (x) (3) h(x) = x 3x tf(t) dt.9 = {(x, y) ; x, y, x + y } f(x, y) = xy( x y). h (x) f(x), F (x

x () g(x) = f(t) dt f(x), F (x) 3x () g(x) g (x) f(x), F (x) (3) h(x) = x 3x tf(t) dt.9 = {(x, y) ; x, y, x + y } f(x, y) = xy( x y). h (x) f(x), F (x [ ] IC. f(x) = e x () f(x) f (x) () lim f(x) lim f(x) x + x (3) lim f(x) lim f(x) x + x (4) y = f(x) ( ) ( s46). < a < () a () lim a log xdx a log xdx ( ) n (3) lim log k log n n n k=.3 z = log(x + y ),

More information

ma22-9 u ( v w) = u v w sin θê = v w sin θ u cos φ = = 2.3 ( a b) ( c d) = ( a c)( b d) ( a d)( b c) ( a b) ( c d) = (a 2 b 3 a 3 b 2 )(c 2 d 3 c 3 d

ma22-9 u ( v w) = u v w sin θê = v w sin θ u cos φ = = 2.3 ( a b) ( c d) = ( a c)( b d) ( a d)( b c) ( a b) ( c d) = (a 2 b 3 a 3 b 2 )(c 2 d 3 c 3 d A 2. x F (t) =f sin ωt x(0) = ẋ(0) = 0 ω θ sin θ θ 3! θ3 v = f mω cos ωt x = f mω (t sin ωt) ω t 0 = f ( cos ωt) mω x ma2-2 t ω x f (t mω ω (ωt ) 6 (ωt)3 = f 6m ωt3 2.2 u ( v w) = v ( w u) = w ( u v) ma22-9

More information

A/B (2010/10/08) Ver kurino/2010/soft/soft.html A/B

A/B (2010/10/08) Ver kurino/2010/soft/soft.html A/B A/B (2010/10/08) Ver. 1.0 kurino@math.cst.nihon-u.ac.jp http://edu-gw2.math.cst.nihon-u.ac.jp/ kurino/2010/soft/soft.html 2010 10 8 A/B 1 2010 10 8 2 1 1 1.1 OHP.................................... 1 1.2.......................................

More information

error_g1.eps

error_g1.eps Runge-Kutta Method Runge-Kutta Method x n+ = x n +hf(t n x n ) dx dt dx x(t+h) x(t) (t) = lim dt h h t = t n h > dx dt (t x(t n +h) x(t n ) n) = lim x(t n+) x(t n ) h h h x = f(tx) x(t n+ ) x(t n ) f(t

More information

...J......1803.QX

...J......1803.QX 5 7 9 11 13 15 17 19 21 23 45-1111 48-2314 1 I II 100,000 80,000 60,000 40,000 20,000 0 272,437 80,348 82,207 81,393 82,293 83,696 84,028 82,232 248,983 80,411 4,615 4,757 248,434 248,688 76,708 6,299

More information

II A A441 : October 02, 2014 Version : Kawahira, Tomoki TA (Kondo, Hirotaka )

II A A441 : October 02, 2014 Version : Kawahira, Tomoki TA (Kondo, Hirotaka ) II 214-1 : October 2, 214 Version : 1.1 Kawahira, Tomoki TA (Kondo, Hirotaka ) http://www.math.nagoya-u.ac.jp/~kawahira/courses/14w-biseki.html pdf 1 2 1 9 1 16 1 23 1 3 11 6 11 13 11 2 11 27 12 4 12 11

More information

i

i 14 i ii iii iv v vi 14 13 86 13 12 28 14 16 14 15 31 (1) 13 12 28 20 (2) (3) 2 (4) (5) 14 14 50 48 3 11 11 22 14 15 10 14 20 21 20 (1) 14 (2) 14 4 (3) (4) (5) 12 12 (6) 14 15 5 6 7 8 9 10 7

More information

<4D F736F F D B B BB2D834A836F815B82D082C88C60202D B2E646F63>

<4D F736F F D B B BB2D834A836F815B82D082C88C60202D B2E646F63> 例題で学ぶはじめての塑性力学 サンプルページ この本の定価 判型などは, 以下の URL からご覧いただけます. http://www.morikita.co.jp/books/mid/066721 このサンプルページの内容は, 初版 1 刷発行当時のものです. http://www.morikita.co.jp/support/ 03 3817 5670 FAX 03 3815 8199 i 1

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

(1) (2) (1) (2) 2 3 {a n } a 2 + a 4 + a a n S n S n = n = S n

(1) (2) (1) (2) 2 3 {a n } a 2 + a 4 + a a n S n S n = n = S n . 99 () 0 0 0 () 0 00 0 350 300 () 5 0 () 3 {a n } a + a 4 + a 6 + + a 40 30 53 47 77 95 30 83 4 n S n S n = n = S n 303 9 k d 9 45 k =, d = 99 a d n a n d n a n = a + (n )d a n a n S n S n = n(a + a n

More information

.1 z = e x +xy y z y 1 1 x 0 1 z x y α β γ z = αx + βy + γ (.1) ax + by + cz = d (.1') a, b, c, d x-y-z (a, b, c). x-y-z 3 (0,

.1 z = e x +xy y z y 1 1 x 0 1 z x y α β γ z = αx + βy + γ (.1) ax + by + cz = d (.1') a, b, c, d x-y-z (a, b, c). x-y-z 3 (0, .1.1 Y K L Y = K 1 3 L 3 L K K (K + ) 1 1 3 L 3 K 3 L 3 K 0 (K + K) 1 3 L 3 K 1 3 L 3 lim K 0 K = L (K + K) 1 3 K 1 3 3 lim K 0 K = 1 3 K 3 L 3 z = f(x, y) x y z x-y-z.1 z = e x +xy y 3 x-y ( ) z 0 f(x,

More information

i

i i 3 4 4 7 5 6 3 ( ).. () 3 () (3) (4) /. 3. 4/3 7. /e 8. a > a, a = /, > a >. () a >, a =, > a > () a > b, a = b, a < b. c c n a n + b n + c n 3c n..... () /3 () + (3) / (4) /4 (5) m > n, a b >, m > n,

More information

I, II 1, A = A 4 : 6 = max{ A, } A A 10 10%

I, II 1, A = A 4 : 6 = max{ A, } A A 10 10% 1 2006.4.17. A 3-312 tel: 092-726-4774, e-mail: hara@math.kyushu-u.ac.jp, http://www.math.kyushu-u.ac.jp/ hara/lectures/lectures-j.html Office hours: B A I ɛ-δ ɛ-δ 1. 2. A 1. 1. 2. 3. 4. 5. 2. ɛ-δ 1. ɛ-n

More information

untitled

untitled 23 12 10 12:55 ~ 18:45 KKR Tel0557-85-2000 FAX0557-85-6604 12:55~13:00 13:00~13:38 I 1) 13:00~13:12 2) 13:13~13:25 3) 13:26~13:38 13:39~14:17 II 4) 13:39~13:51 5) 13:52 ~ 14:04 6) 14:05 ~ 14:17 14:18 ~

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

d dt A B C = A B C d dt x = Ax, A 0 B 0 C 0 = mm 0 mm 0 mm AP = PΛ P AP = Λ P A = ΛP P d dt x = P Ax d dt (P x) = Λ(P x) d dt P x =

d dt A B C = A B C d dt x = Ax, A 0 B 0 C 0 = mm 0 mm 0 mm AP = PΛ P AP = Λ P A = ΛP P d dt x = P Ax d dt (P x) = Λ(P x) d dt P x = 3 MATLAB Runge-Kutta Butcher 3. Taylor Taylor y(x 0 + h) = y(x 0 ) + h y (x 0 ) + h! y (x 0 ) + Taylor 3. Euler, Runge-Kutta Adams Implicit Euler, Implicit Runge-Kutta Gear y n+ y n (n+ ) y n+ y n+ y n+

More information

Microsoft PowerPoint - 4.pptx

Microsoft PowerPoint - 4.pptx while 文 (1) 繰り返しの必要性 while の形式と動作 繰り返しにより平 根を求める ( 演習 ) 繰り返しにより 程式の解を求める ( 課題 ) Hello. をたくさん表示しよう Hello. を画面に 3 回表示するには, 以下で OK. #include int main() { printf("hello. n"); printf("hello. n");

More information

1 2 3 4 5 6 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 () - 1 - - 2 - - 3 - - 4 - - 5 - 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57

More information

x(t) + t f(t, x) = x(t) + x (t) t x t Tayler x(t + t) = x(t) + x (t) t + 1 2! x (t) t ! x (t) t 3 + (15) Eular x t Teyler 1 Eular 2 Runge-Kutta

x(t) + t f(t, x) = x(t) + x (t) t x t Tayler x(t + t) = x(t) + x (t) t + 1 2! x (t) t ! x (t) t 3 + (15) Eular x t Teyler 1 Eular 2 Runge-Kutta 6 Runge-KuttaEular Runge-Kutta Runge-Kutta A( ) f(t, x) dx dt = lim x(t + t) x(t) t 0 t = f(t, x) (14) t x x(t) t + dt x x(t + dt) Euler 7 t 1 f(t, x(t)) x(t) + f(t + dt, x(t + dt))dt t + dt x(t + dt)

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 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

P05.ppt

P05.ppt 2 1 list0415.c forfor #include int i, j; for (i = 1; i

More information

z f(z) f(z) x, y, u, v, r, θ r > 0 z = x + iy, f = u + iv C γ D f(z) f(z) D f(z) f(z) z, Rm z, z 1.1 z = x + iy = re iθ = r (cos θ + i sin θ) z = x iy

z f(z) f(z) x, y, u, v, r, θ r > 0 z = x + iy, f = u + iv C γ D f(z) f(z) D f(z) f(z) z, Rm z, z 1.1 z = x + iy = re iθ = r (cos θ + i sin θ) z = x iy f f x, y, u, v, r, θ r > = x + iy, f = u + iv C γ D f f D f f, Rm,. = x + iy = re iθ = r cos θ + i sin θ = x iy = re iθ = r cos θ i sin θ x = + = Re, y = = Im i r = = = x + y θ = arg = arctan y x e i =

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

: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 2017 2017 08 03 10:30 12:00 I. I VI II. III. IV. a d V. VI. 80 100 60 1 I. Backus-Naur BNF X [ S ] a S S ; X X X, S [, a, ], ; BNF X (parse tree) (1) [a;a] (2) [[a]] (3) [a;[a]] (4) [[a];a] : [a] X 2 222222

More information

1 I

1 I 1 I 3 1 1.1 R x, y R x + y R x y R x, y, z, a, b R (1.1) (x + y) + z = x + (y + z) (1.2) x + y = y + x (1.3) 0 R : 0 + x = x x R (1.4) x R, 1 ( x) R : x + ( x) = 0 (1.5) (x y) z = x (y z) (1.6) x y =

More information

I, II 1, 2 ɛ-δ 100 A = A 4 : 6 = max{ A, } A A 10

I, II 1, 2 ɛ-δ 100 A = A 4 : 6 = max{ A, } A A 10 1 2007.4.13. A 3-312 tel: 092-726-4774, e-mail: hara@math.kyushu-u.ac.jp, http://www.math.kyushu-u.ac.jp/ hara/lectures/lectures-j.html Office hours: B A I ɛ-δ ɛ-δ 1. 2. A 0. 1. 1. 2. 3. 2. ɛ-δ 1. ɛ-n

More information

I y = f(x) a I a x I x = a + x 1 f(x) f(a) x a = f(a + x) f(a) x (11.1) x a x 0 f(x) f(a) f(a + x) f(a) lim = lim x a x a x 0 x (11.2) f(x) x

I y = f(x) a I a x I x = a + x 1 f(x) f(a) x a = f(a + x) f(a) x (11.1) x a x 0 f(x) f(a) f(a + x) f(a) lim = lim x a x a x 0 x (11.2) f(x) x 11 11.1 I y = a I a x I x = a + 1 f(a) x a = f(a +) f(a) (11.1) x a 0 f(a) f(a +) f(a) = x a x a 0 (11.) x = a a f (a) d df f(a) (a) I dx dx I I I f (x) d df dx dx (x) [a, b] x a ( 0) x a (a, b) () [a,

More information

D xy D (x, y) z = f(x, y) f D (2 ) (x, y, z) f R z = 1 x 2 y 2 {(x, y); x 2 +y 2 1} x 2 +y 2 +z 2 = 1 1 z (x, y) R 2 z = x 2 y

D xy D (x, y) z = f(x, y) f D (2 ) (x, y, z) f R z = 1 x 2 y 2 {(x, y); x 2 +y 2 1} x 2 +y 2 +z 2 = 1 1 z (x, y) R 2 z = x 2 y 5 5. 2 D xy D (x, y z = f(x, y f D (2 (x, y, z f R 2 5.. z = x 2 y 2 {(x, y; x 2 +y 2 } x 2 +y 2 +z 2 = z 5.2. (x, y R 2 z = x 2 y + 3 (2,,, (, 3,, 3 (,, 5.3 (. (3 ( (a, b, c A : (x, y, z P : (x, y, x

More information

,. Black-Scholes u t t, x c u 0 t, x x u t t, x c u t, x x u t t, x + σ x u t, x + rx ut, x rux, t 0 x x,,.,. Step 3, 7,,, Step 6., Step 4,. Step 5,,.

,. Black-Scholes u t t, x c u 0 t, x x u t t, x c u t, x x u t t, x + σ x u t, x + rx ut, x rux, t 0 x x,,.,. Step 3, 7,,, Step 6., Step 4,. Step 5,,. 9 α ν β Ξ ξ Γ γ o δ Π π ε ρ ζ Σ σ η τ Θ θ Υ υ ι Φ φ κ χ Λ λ Ψ ψ µ Ω ω Def, Prop, Th, Lem, Note, Remark, Ex,, Proof, R, N, Q, C [a, b {x R : a x b} : a, b {x R : a < x < b} : [a, b {x R : a x < b} : a,

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

1 4 1 ( ) ( ) ( ) ( ) () 1 4 2

1 4 1 ( ) ( ) ( ) ( ) () 1 4 2 7 1995, 2017 7 21 1 2 2 3 3 4 4 6 (1).................................... 6 (2)..................................... 6 (3) t................. 9 5 11 (1)......................................... 11 (2)

More information

ルベーグ積分 サンプルページ この本の定価 判型などは, 以下の URL からご覧いただけます. このサンプルページの内容は, 初版 1 刷発行時のものです.

ルベーグ積分 サンプルページ この本の定価 判型などは, 以下の URL からご覧いただけます.   このサンプルページの内容は, 初版 1 刷発行時のものです. ルベーグ積分 サンプルページ この本の定価 判型などは, 以下の URL からご覧いただけます. http://www.morikita.co.jp/books/mid/005431 このサンプルページの内容は, 初版 1 刷発行時のものです. Lebesgue 1 2 4 4 1 2 5 6 λ a

More information

main

main 14 1. 12 5 main 1.23 3 1.230000 3 1.860867 1 2. 1988 1925 1911 1867 void JPcalendar(int x) 1987 1 64 1 1 1 while(1) Ctrl C void JPcalendar(int x){ if (x > 1988) printf(" %d %d \n", x, x-1988); else if(x

More information

r 1 m A r/m i) t ii) m i) t B(t; m) ( B(t; m) = A 1 + r ) mt m ii) B(t; m) ( B(t; m) = A 1 + r ) mt m { ( = A 1 + r ) m } rt r m n = m r m n B

r 1 m A r/m i) t ii) m i) t B(t; m) ( B(t; m) = A 1 + r ) mt m ii) B(t; m) ( B(t; m) = A 1 + r ) mt m { ( = A 1 + r ) m } rt r m n = m r m n B 1 1.1 1 r 1 m A r/m i) t ii) m i) t Bt; m) Bt; m) = A 1 + r ) mt m ii) Bt; m) Bt; m) = A 1 + r ) mt m { = A 1 + r ) m } rt r m n = m r m n Bt; m) Aert e lim 1 + 1 n 1.1) n!1 n) e a 1, a 2, a 3,... {a n

More information

2 2 MATHEMATICS.PDF 200-2-0 3 2 (p n ), ( ) 7 3 4 6 5 20 6 GL 2 (Z) SL 2 (Z) 27 7 29 8 SL 2 (Z) 35 9 2 40 0 2 46 48 2 2 5 3 2 2 58 4 2 6 5 2 65 6 2 67 7 2 69 2 , a 0 + a + a 2 +... b b 2 b 3 () + b n a

More information

: 1g99p038-8

: 1g99p038-8 16 17 : 1g99p038-8 1 3 1.1....................................... 4 1................................... 5 1.3.................................. 5 6.1..................................... 7....................................

More information

£Ã¥×¥í¥°¥é¥ß¥ó¥°ÆþÌç (2018) - Â裵²ó ¨¡ À©¸æ¹½Â¤¡§¾ò·ïʬ´ô ¨¡

£Ã¥×¥í¥°¥é¥ß¥ó¥°ÆþÌç (2018) - Â裵²ó  ¨¡ À©¸æ¹½Â¤¡§¾ò·ïʬ´ô ¨¡ (2018) 2018 5 17 0 0 if switch if if ( ) if ( 0) if ( ) if ( 0) if ( ) (0) if ( 0) if ( ) (0) ( ) ; if else if ( ) 1 else 2 if else ( 0) 1 if ( ) 1 else 2 if else ( 0) 1 if ( ) 1 else 2 (0) 2 if else

More information

/ 2 n n n n x 1,..., x n 1 n 2 n R n n ndimensional Euclidean space R n vector point R n set space R n R n x = x 1 x n y = y 1 y n distance dx,

/ 2 n n n n x 1,..., x n 1 n 2 n R n n ndimensional Euclidean space R n vector point R n set space R n R n x = x 1 x n y = y 1 y n distance dx, 1 1.1 R n 1.1.1 3 xyz xyz 3 x, y, z R 3 := x y : x, y, z R z 1 3. n n x 1,..., x n x 1. x n x 1 x n 1 / 2 n n n n x 1,..., x n 1 n 2 n R n n ndimensional Euclidean space R n vector point 1.1.2 R n set

More information

2009 I 2 II III 14, 15, α β α β l 0 l l l l γ (1) γ = αβ (2) α β n n cos 2k n n π sin 2k n π k=1 k=1 3. a 0, a 1,..., a n α a

2009 I 2 II III 14, 15, α β α β l 0 l l l l γ (1) γ = αβ (2) α β n n cos 2k n n π sin 2k n π k=1 k=1 3. a 0, a 1,..., a n α a 009 I II III 4, 5, 6 4 30. 0 α β α β l 0 l l l l γ ) γ αβ ) α β. n n cos k n n π sin k n π k k 3. a 0, a,..., a n α a 0 + a x + a x + + a n x n 0 ᾱ 4. [a, b] f y fx) y x 5. ) Arcsin 4) Arccos ) ) Arcsin

More information

1

1 1 1 7 1.1.................................. 11 2 13 2.1............................ 13 2.2............................ 17 2.3.................................. 19 3 21 3.1.............................

More information

i

i 009 I 1 8 5 i 0 1 0.1..................................... 1 0.................................................. 1 0.3................................. 0.4........................................... 3

More information

n=1 1 n 2 = π = π f(z) f(z) 2 f(z) = u(z) + iv(z) *1 f (z) u(x, y), v(x, y) f(z) f (z) = f/ x u x = v y, u y = v x

n=1 1 n 2 = π = π f(z) f(z) 2 f(z) = u(z) + iv(z) *1 f (z) u(x, y), v(x, y) f(z) f (z) = f/ x u x = v y, u y = v x n= n 2 = π2 6 3 2 28 + 4 + 9 + = π2 6 2 f(z) f(z) 2 f(z) = u(z) + iv(z) * f (z) u(x, y), v(x, y) f(z) f (z) = f/ x u x = v y, u y = v x f x = i f y * u, v 3 3. 3 f(t) = u(t) + v(t) [, b] f(t)dt = u(t)dt

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

フリーソフトでつくる音声認識システム ( 第 2 版 ) サンプルページ この本の定価 判型などは, 以下の URL からご覧いただけます. このサンプルページの内容は, 第 2 版 1 刷発行時のものです.

フリーソフトでつくる音声認識システム ( 第 2 版 ) サンプルページ この本の定価 判型などは, 以下の URL からご覧いただけます.   このサンプルページの内容は, 第 2 版 1 刷発行時のものです. フリーソフトでつくる音声認識システム ( 第 2 版 ) サンプルページ この本の定価 判型などは, 以下の URL からご覧いただけます. http://www.morikita.co.jp/books/mid/084712 このサンプルページの内容は, 第 2 版 1 刷発行時のものです. i 2007 10 1 Scilab 2 2017 2 1 2 1 ii 2 web 2007 9 iii

More information

() x + y + y + x dy dx = 0 () dy + xy = x dx y + x y ( 5) ( s55906) 0.7. (). 5 (). ( 6) ( s6590) 0.8 m n. 0.9 n n A. ( 6) ( s6590) f A (λ) = det(a λi)

() x + y + y + x dy dx = 0 () dy + xy = x dx y + x y ( 5) ( s55906) 0.7. (). 5 (). ( 6) ( s6590) 0.8 m n. 0.9 n n A. ( 6) ( s6590) f A (λ) = det(a λi) 0. A A = 4 IC () det A () A () x + y + z = x y z X Y Z = A x y z ( 5) ( s5590) 0. a + b + c b c () a a + b + c c a b a + b + c 0 a b c () a 0 c b b c 0 a c b a 0 0. A A = 7 5 4 5 0 ( 5) ( s5590) () A ()

More information

() n C + n C + n C + + n C n n (3) n C + n C + n C 4 + n C + n C 3 + n C 5 + (5) (6 ) n C + nc + 3 nc n nc n (7 ) n C + nc + 3 nc n nc n (

() n C + n C + n C + + n C n n (3) n C + n C + n C 4 + n C + n C 3 + n C 5 + (5) (6 ) n C + nc + 3 nc n nc n (7 ) n C + nc + 3 nc n nc n ( 3 n nc k+ k + 3 () n C r n C n r nc r C r + C r ( r n ) () n C + n C + n C + + n C n n (3) n C + n C + n C 4 + n C + n C 3 + n C 5 + (4) n C n n C + n C + n C + + n C n (5) k k n C k n C k (6) n C + nc

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 1, 1 2, 1 3, 1 4,, 1 n, n n {a n } n a n α {a n } α {a n } α lim n an = α n a n α α {a n } {a n } {a n } 1. a n = 2 n {a n } 2, 4, 8, 16,

春期講座 ~ 極限 1 1, 1 2, 1 3, 1 4,, 1 n, n n {a n } n a n α {a n } α {a n } α lim n an = α n a n α α {a n } {a n } {a n } 1. a n = 2 n {a n } 2, 4, 8, 16, 春期講座 ~ 極限 1 1, 1 2, 1 3, 1 4,, 1 n, n n {a n } n a n α {a n } α {a n } α lim an = α n a n α α {a n } {a n } {a n } 1. a n = 2 n {a n } 2, 4, 8, 16, 32, n a n {a n } {a n } 2. a n = 10n + 1 {a n } lim an

More information

(1) (2) (3) (4) HB B ( ) (5) (6) (7) 40 (8) (9) (10)

(1) (2) (3) (4) HB B ( ) (5) (6) (7) 40 (8) (9) (10) 2017 12 9 4 1 30 4 10 3 1 30 3 30 2 1 30 2 50 1 1 30 2 10 (1) (2) (3) (4) HB B ( ) (5) (6) (7) 40 (8) (9) (10) (1) i 23 c 23 0 1 2 3 4 5 6 7 8 9 a b d e f g h i (2) 23 23 (3) 23 ( 23 ) 23 x 1 x 2 23 x

More information

i ii iii iv v vi vii ( ー ー ) ( ) ( ) ( ) ( ) ー ( ) ( ) ー ー ( ) ( ) ( ) ( ) ( ) 13 202 24122783 3622316 (1) (2) (3) (4) 2483 (1) (2) (3) (4) (5) (6) (7) (8) (9) (10) (11) 11 11 2483 13

More information

2014 S hara/lectures/lectures-j.html r 1 S phone: ,

2014 S hara/lectures/lectures-j.html r 1 S phone: , 14 S1-1+13 http://www.math.kyushu-u.ac.jp/ hara/lectures/lectures-j.html r 1 S1-1+13 14.4.11. 19 phone: 9-8-4441, e-mail: hara@math.kyushu-u.ac.jp Office hours: 1 4/11 web download. I. 1. ϵ-δ 1. 3.1, 3..

More information

応用数学III-4.ppt

応用数学III-4.ppt III f x ( ) = 1 f x ( ) = P( X = x) = f ( x) = P( X = x) =! x ( ) b! a, X! U a,b f ( x) =! " e #!x, X! Ex (!) n! ( n! x)!x! " x 1! " x! e"!, X! Po! ( ) n! x, X! B( n;" ) ( ) ! xf ( x) = = n n!! ( n

More information

z f(z) f(z) x, y, u, v, r, θ r > 0 z = x + iy, f = u + iv C γ D f(z) f(z) D f(z) f(z) z, Rm z, z 1.1 z = x + iy = re iθ = r (cos θ + i sin θ) z = x iy

z f(z) f(z) x, y, u, v, r, θ r > 0 z = x + iy, f = u + iv C γ D f(z) f(z) D f(z) f(z) z, Rm z, z 1.1 z = x + iy = re iθ = r (cos θ + i sin θ) z = x iy z fz fz x, y, u, v, r, θ r > z = x + iy, f = u + iv γ D fz fz D fz fz z, Rm z, z. z = x + iy = re iθ = r cos θ + i sin θ z = x iy = re iθ = r cos θ i sin θ x = z + z = Re z, y = z z = Im z i r = z = z

More information

262014 3 1 1 6 3 2 198810 2/ 198810 2 1 3 4 http://www.pref.hiroshima.lg.jp/site/monjokan/ 1... 1... 1... 2... 2... 4... 5... 9... 9... 10... 10... 10... 10... 13 2... 13 3... 15... 15... 15... 16 4...

More information

I ASCII ( ) NUL 16 DLE SP P p 1 SOH 17 DC1! 1 A Q a q STX 2 18 DC2 " 2 B R b

I ASCII ( ) NUL 16 DLE SP P p 1 SOH 17 DC1! 1 A Q a q STX 2 18 DC2  2 B R b I 4 003 4 30 1 ASCII ( ) 0 17 0 NUL 16 DLE SP 0 @ P 3 48 64 80 96 11 p 1 SOH 17 DC1! 1 A Q a 33 49 65 81 97 113 q STX 18 DC " B R b 34 50 66 8 98 114 r 3 ETX 19 DC3 # 3 C S c 35 51 67 83 99 115 s 4 EOT

More information

211 kotaro@math.titech.ac.jp 1 R *1 n n R n *2 R n = {(x 1,..., x n ) x 1,..., x n R}. R R 2 R 3 R n R n R n D D R n *3 ) (x 1,..., x n ) f(x 1,..., x n ) f D *4 n 2 n = 1 ( ) 1 f D R n f : D R 1.1. (x,

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

漸化式のすべてのパターンを解説しましたー高校数学の達人・河見賢司のサイト

漸化式のすべてのパターンを解説しましたー高校数学の達人・河見賢司のサイト https://www.hmg-gen.com/tuusin.html https://www.hmg-gen.com/tuusin1.html 1 2 OK 3 4 {a n } (1) a 1 = 1, a n+1 a n = 2 (2) a 1 = 3, a n+1 a n = 2n a n a n+1 a n = ( ) a n+1 a n = ( ) a n+1 a n {a n } 1,

More information

II Time-stamp: <05/09/30 17:14:06 waki> ii

II Time-stamp: <05/09/30 17:14:06 waki> ii II waki@cc.hirosaki-u.ac.jp 18 1 30 II Time-stamp: ii 1 1 1.1.................................................. 1 1.2................................................... 3 1.3..................................................

More information

provider_020524_2.PDF

provider_020524_2.PDF 1 1 1 2 2 3 (1) 3 (2) 4 (3) 6 7 7 (1) 8 (2) 21 26 27 27 27 28 31 32 32 36 1 1 2 2 (1) 3 3 4 45 (2) 6 7 5 (3) 6 7 8 (1) ii iii iv 8 * 9 10 11 9 12 10 13 14 15 11 16 17 12 13 18 19 20 (2) 14 21 22 23 24

More information

A/B (2018/10/19) Ver kurino/2018/soft/soft.html A/B

A/B (2018/10/19) Ver kurino/2018/soft/soft.html A/B A/B (2018/10/19) Ver. 1.0 kurino@math.cst.nihon-u.ac.jp http://edu-gw2.math.cst.nihon-u.ac.jp/ kurino/2018/soft/soft.html 2018 10 19 A/B 1 2018 10 19 2 1 1 1.1 OHP.................................... 1

More information

II R n k +1 v 0,, v k k v 1 v 0,, v k v v 0,, v k R n 1 a 0,, a k a 0 v 0 + a k v k v 0 v k k k v 0,, v k σ k σ dimσ = k 1.3. k

II R n k +1 v 0,, v k k v 1 v 0,, v k v v 0,, v k R n 1 a 0,, a k a 0 v 0 + a k v k v 0 v k k k v 0,, v k σ k σ dimσ = k 1.3. k II 231017 1 1.1. R n k +1 v 0,, v k k v 1 v 0,, v k v 0 1.2. v 0,, v k R n 1 a 0,, a k a 0 v 0 + a k v k v 0 v k k k v 0,, v k σ kσ dimσ = k 1.3. k σ {v 0,...,v k } {v i0,...,v il } l σ τ < τ τ σ 1.4.

More information

1 1.1 C 2 1 double a[ ][ ]; 1 3x x3 ( ) malloc() malloc 2 #include <stdio.h> #include

1 1.1 C 2 1 double a[ ][ ]; 1 3x x3 ( ) malloc() malloc 2 #include <stdio.h> #include 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() malloc 2 #include #include #include enum LENGTH = 10 ; int

More information

II (No.2) 2 4,.. (1) (cm) (2) (cm) , (

II (No.2) 2 4,.. (1) (cm) (2) (cm) , ( II (No.1) 1 x 1, x 2,..., x µ = 1 V = 1 k=1 x k (x k µ) 2 k=1 σ = V. V = σ 2 = 1 x 2 k µ 2 k=1 1 µ, V σ. (1) 4, 7, 3, 1, 9, 6 (2) 14, 17, 13, 11, 19, 16 (3) 12, 21, 9, 3, 27, 18 (4) 27.2, 29.3, 29.1, 26.0,

More information

koji07-02.dvi

koji07-02.dvi 007 I II III 1,, 3, 4, 5, 6, 7 5 4 1 ε-n 1 ε-n ε-n ε-n. {a } =1 a ε N N a a N= a a

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

( ) ( ) 30 ( ) 27 [1] p LIFO(last in first out, ) (push) (pup) 1

( ) ( ) 30 ( ) 27 [1] p LIFO(last in first out, ) (push) (pup) 1 () 2006 2 27 1 10 23 () 30 () 27 [1] p.97252 7 2 2.1 2.1.1 1 LIFO(last in first out, ) (push) (pup) 1 1: 2.1.2 1 List 4-1(p.100) stack[] stack top 1 2 (push) (pop) 1 2 void stack push(double val) val stack

More information

2010 II / y = e x y = log x = log e x 2. ( e x ) = e x 3. ( ) log x = 1 x 1.2 Warming Up 1 u = log a M a u = M a 0

2010 II / y = e x y = log x = log e x 2. ( e x ) = e x 3. ( ) log x = 1 x 1.2 Warming Up 1 u = log a M a u = M a 0 2010 II 6 10.11.15/ 10.11.11 1 1 5.6 1.1 1. y = e x y = log x = log e x 2. e x ) = e x 3. ) log x = 1 x 1.2 Warming Up 1 u = log a M a u = M a 0 log a 1 a 1 log a a a r+s log a M + log a N 1 0 a 1 a r

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

…J…−†[†E…n…‘†[…hfi¯„^‚ΛžfiüŒå

…J…−†[†E…n…‘†[…hfi¯„^‚ΛžfiüŒå takuro.onishi@gmail.com II 2009 6 11 [A] D B A B A B A B DVD y = 2x + 5 x = 3 y = 11 x = 5 y = 15. Google Web (2 + 3) 5 25 2 3 5 25 Windows Media Player Media Player (typed lambda calculus) (computer

More information

No2 4 y =sinx (5) y = p sin(2x +3) (6) y = 1 tan(3x 2) (7) y =cos 2 (4x +5) (8) y = cos x 1+sinx 5 (1) y =sinx cos x 6 f(x) = sin(sin x) f 0 (π) (2) y

No2 4 y =sinx (5) y = p sin(2x +3) (6) y = 1 tan(3x 2) (7) y =cos 2 (4x +5) (8) y = cos x 1+sinx 5 (1) y =sinx cos x 6 f(x) = sin(sin x) f 0 (π) (2) y No1 1 (1) 2 f(x) =1+x + x 2 + + x n, g(x) = 1 (n +1)xn + nx n+1 (1 x) 2 x 6= 1 f 0 (x) =g(x) y = f(x)g(x) y 0 = f 0 (x)g(x)+f(x)g 0 (x) 3 (1) y = x2 x +1 x (2) y = 1 g(x) y0 = g0 (x) {g(x)} 2 (2) y = µ

More information

178 5 I 1 ( ) ( ) 10 3 13 3 1 8891 8 3023 6317 ( 10 1914 7152 ) 16 5 1 ( ) 6 13 3 13 3 8575 3896 8 1715 779 6 (1) 2 7 4 ( 2 ) 13 11 26 12 21 14 11 21

178 5 I 1 ( ) ( ) 10 3 13 3 1 8891 8 3023 6317 ( 10 1914 7152 ) 16 5 1 ( ) 6 13 3 13 3 8575 3896 8 1715 779 6 (1) 2 7 4 ( 2 ) 13 11 26 12 21 14 11 21 I 178 II 180 III ( ) 181 IV 183 V 185 VI 186 178 5 I 1 ( ) ( ) 10 3 13 3 1 8891 8 3023 6317 ( 10 1914 7152 ) 16 5 1 ( ) 6 13 3 13 3 8575 3896 8 1715 779 6 (1) 2 7 4 ( 2 ) 13 11 26 12 21 14 11 21 4 10 (

More information