main.dvi

main.dvi

y () 5 C Fortran () Fortran 32bit 64bit 2 0 1 2 1 1bit bit 3 0 0 2 1 3 0 1 2 1 bit bit byte 8bit 1byte 3 0 10010011 2 1 3 0 01001011 2 1 byte Fortran A A 8byte double presicion y ( REAL*8) A 64bit 4byte

(Jacobi Gauss-Seidel SOR ) 1. (Theory of Iteration Method) Jacobi Gauss-Seidel SOR 2. Jacobi (Jacobi s Iteration Method) Jacobi 3. Gauss-Seide

03 9 (Jacobi Gauss-Seidel SOR (Theory of Iteration Method Jacobi Gauss-Seidel SOR Jacobi (Jacobi s Iteration Method Jacobi 3 Gauss-Seidel (Gauss-Seidel Method Gauss-Seidel 4 SOR (SOR Method SOR 9 Ax =

untitled

1 1 Ax = b A R m m A b R m x R m A shift-and invert Lanczos - LU CG A = LU LU Ly = b Ux = y A LU A A = LL T 1 LU b,, Vol. 11, No. 4, pp. 14 18 (2006). x * x (0), x (1), x (2), A Ap A # x (n+1) = Cx (n)

IV (2)

COMPUTATIONAL FLUID DYNAMICS (CFD) IV (2) The Analysis of Numerical Schemes (2) 11. Iterative methods for algebraic systems Reima Iwatsu, e-mail : iwatsu@cck.dendai.ac.jp Winter Semester 2007, Graduate

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)

all.dvi

fortran 1996 4 18 2007 6 11 2012 11 12 1 3 1.1..................................... 3 1.2.............................. 3 2 fortran I 5 2.1 write................................ 5 2.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

1F90/kouhou_hf90.dvi

Fortran90 3 33 1 2 Fortran90 FORTRAN 1956 IBM IBM704 FORTRAN(FORmula TRANslation ) 1965 FORTRAN66 1978 FORTRAN77 1991 Fortran90 Fortran90 Fortran Fortran90 6 Fortran90 77 90 90 Fortran90 [ ] Fortran90

numb.dvi

11 Poisson kanenko@mbkniftycom alexeikanenko@docomonejp http://wwwkanenkocom/ , u = f, ( u = u+f u t, u = f t ) 1 D R 2 L 2 (D) := {f(x,y) f(x,y) 2 dxdy < )} D D f,g L 2 (D) (f,g) := f(x,y)g(x,y)dxdy (L

Microsoft Word - 03-数値計算の基礎.docx

δx f x 0 + δ x n=0 a n = f ( n) ( x 0 ) n δx n f x x=0 sin x = x x3 3 + x5 5 x7 7 +... x ( ) = a n δ x n ( ) = sin x ak = (-mod(k,2))**(k/2) / fact_k 10 11 I = f x dx a ΔS = f ( x)h I = f a h I = h b (

A S- hara/lectures/lectures-j.html r A = A 5 : 5 = max{ A, } A A A A B A, B A A A %

A S- http://www.math.kyushu-u.ac.jp/ hara/lectures/lectures-j.html r A S- 3.4.5. 9 phone: 9-8-444, e-mail: hara@math.kyushu-u.ac.jp, http://www.math.kyushu-u.ac.jp/ hara/lectures/lectures-j.html Office

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

untitled

II(c) 1 October. 21, 2009 1 CS53 yamamoto@cs.kobe-u.ac.jp 3 1 7 1.1 : : : : : : : : : : : : : : : : : : : : : : 7 1.2 : : : : : : : : : : : : : : : : 8 1.2.1 : : : : : : : : : : : : : : : : : : : 8 1.2.2

(Basic Theory of Information Processing) Fortran Fortan Fortan Fortan 1

(Basic Theory of Information Processing) Fortran Fortan Fortan Fortan 1 17 Fortran Formular Tranlator Lapack Fortran FORTRAN, FORTRAN66, FORTRAN77, FORTRAN90, FORTRAN95 17.1 A Z ( ) 0 9, _, =, +, -, *,

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

, 1 ( f n (x))dx d dx ( f n (x)) 1 f n (x)dx d dx f n(x) lim f n (x) = [, 1] x f n (x) = n x x 1 f n (x) = x f n (x) = x 1 x n n f n(x) = [, 1] f n (x

1 1.1 4n 2 x, x 1 2n f n (x) = 4n 2 ( 1 x), 1 x 1 n 2n n, 1 x n n 1 1 f n (x)dx = 1, n = 1, 2,.. 1 lim 1 lim 1 f n (x)dx = 1 lim f n(x) = ( lim f n (x))dx = f n (x)dx 1 ( lim f n (x))dx d dx ( lim f d

< 1 > (1) f 0 (a) =6a ; g 0 (a) =6a 2 (2) y = f(x) x = 1 f( 1) = 3 ( 1) 2 =3 ; f 0 ( 1) = 6 ( 1) = 6 ; ( 1; 3) 6 x =1 f(1) = 3 ; f 0 (1) = 6 ; (1; 3)

< 1 > (1) f 0 (a) =6a ; g 0 (a) =6a 2 (2) y = f(x) x = 1 f( 1) = 3 ( 1) 2 =3 ; f 0 ( 1) = 6 ( 1) = 6 ; ( 1; 3) 6 x =1 f(1) = 3 ; f 0 (1) = 6 ; (1; 3) 6 y = g(x) x = 1 g( 1) = 2 ( 1) 3 = 2 ; g 0 ( 1) =

OpenMP (1) 1, 12 1 UNIX (FUJITSU GP7000F model 900), 13 1 (COMPAQ GS320) FUJITSU VPP5000/64 1 (a) (b) 1: ( 1(a))

OpenMP (1) 1, 12 1 UNIX (FUJITSU GP7000F model 900), 13 1 (COMPAQ GS320) FUJITSU VPP5000/64 1 (a) (b) 1: ( 1(a)) E-mail: {nanri,amano}@cc.kyushu-u.ac.jp 1 ( ) 1. VPP Fortran[6] HPF[3] VPP Fortran 2. MPI[5]

卓球の試合への興味度に関する確率論的分析

17 i 1 1 1.1..................................... 1 1.2....................................... 1 1.3..................................... 2 2 5 2.1................................ 5 2.2 (1).........................

3. :, c, ν. 4. Burgers : t + c x = ν 2 u x 2, (3), ν. 5. : t + u x = ν 2 u x 2, (4), c. 2 u t 2 = c2 2 u x 2, (5) (1) (4), (1 Navier Stokes,., ν. t +

B: 2016 12 2, 9, 16, 2017 1 6 1,.,,,,.,.,,,., 1,. 1. :, ν. 2. : t = ν 2 u x 2, (1), c. t + c x = 0, (2). e-mail: iwayama@kobe-u.ac.jp,. 1 3. :, c, ν. 4. Burgers : t + c x = ν 2 u x 2, (3), ν. 5. : t +

[ ] x f(x) F = f(x) F(x) f(x) f(x) f(x)dx A p.2/29

A p./29 [ ] x f(x) F = f(x) F(x) f(x) f(x) f(x)dx A p.2/29 [ ] x f(x) F = f(x) F(x) f(x) f(x) f(x)dx [ ] F(x) f(x) C F(x) + C f(x) A p.2/29 [ ] x f(x) F = f(x) F(x) f(x) f(x) f(x)dx [ ] F(x) f(x) C F(x)

4 2016 3 8 2.,. 2. Arakawa Jacobin., 2 Adams-Bashforth. Re = 80, 90, 100.. h l, h/l, Kármán, h/l 0.28,, h/l.., (2010), 46.2., t = 100 t = 2000 46.2 < Re 46.5. 1 1 4 2 6 2.1............................

高等学校学習指導要領

高等学校学習指導要領

3. :, c, ν. 4. Burgers : u t + c u x = ν 2 u x 2, (3), ν. 5. : u t + u u x = ν 2 u x 2, (4), c. 2 u t 2 = c2 2 u x 2, (5) (1) (4), (1 Navier Stokes,.,

B:,, 2017 12 1, 8, 15, 22 1,.,,,,.,.,,,., 1,. 1. :, ν. 2. : u t = ν 2 u x 2, (1), c. u t + c u x = 0, (2), ( ). 1 3. :, c, ν. 4. Burgers : u t + c u x = ν 2 u x 2, (3), ν. 5. : u t + u u x = ν 2 u x 2,

all.dvi

29 4 Green-Lagrange,,.,,,,,,.,,,,,,,,,, E, σ, ε σ = Eε,,.. 4.1? l, l 1 (l 1 l) ε ε = l 1 l l (4.1) F l l 1 F 30 4 Green-Lagrange Δz Δδ γ = Δδ (4.2) Δz π/2 φ γ = π 2 φ (4.3) γ tan γ γ,sin γ γ ( π ) γ tan

untitled

20010916 22;1017;23;20020108;15;20; 1 N = {1, 2, } Z + = {0, 1, 2, } Z = {0, ±1, ±2, } Q = { p p Z, q N} R = { lim a q n n a n Q, n N; sup a n < } R + = {x R x 0} n = {a + b 1 a, b R} u, v 1 R 2 2 R 3

u τ = 2 u x 2 u(x, 0) = max[e ( 2r σ 2 1)x/2 e ( 2r σ 2 +1)x/2, 0] lim u(x, τ) = x lim u(x, τ) =0 x 1 u(x, τ) V (S, t) V = E 1 2 (1+k) S 1 2 (1 k) e 1

14 6 24 1 1, Black Scholes Black Scholes Black Scholes Black Scholes Black Scholes ( ) (1 ) Black Scholes Black Scholes Black Scholes C t + 1 2 σ2 S 2 2 C C + rs rc =0, (1) S2 S C(0,t)=0, C(S, t) S as

2012年度HPCサマーセミナー_多田野.pptx

! CCS HPC! I " tadano@cs.tsukuba.ac.jp" " 1 " " " " " " " 2 3 " " Ax = b" " " 4 Ax = b" A = a 11 a 12... a 1n a 21 a 22... a 2n...... a n1 a n2... a nn, x = x 1 x 2. x n, b = b 1 b 2. b n " " 5 Gauss LU

橡固有値セミナー2_棚橋改.PDF

1 II. 2003 5 14 2... Arnoldi. Lanczos. Jacobi-Davidson . 3 4 Ax = x A A Ax = Mx M: M 5 Householder ln ln-1 0 l3 0 l2 l1 6 Lanczos Lanczos, 1950 Arnoldi Arnoldi, 1951 Hessenberg Jacobi-Davidson Sleijpen

演習1

神戸市立工業高等専門学校電気工学科 / 電子工学科専門科目 数値解析 2019.5.10 演習 1 山浦剛 (tyamaura@riken.jp) 講義資料ページ http://r-ccs-climate.riken.jp/members/yamaura/numerical_analysis.html Fortran とは? Fortran(= FORmula TRANslation ) は 1950

n 第1章　章立ての部分は、書式(PC入門大見出し)を使います

FORTRAN FORTRAN FORTRAN ) DO DO IF IF FORTRAN FORTRAN(FORmula TRANslator)1956 IBM FORTRAN IV FORTRAN77 Fortran90 FORTRAN77 FORTRAN FORTARN IF, DO C UNIX FORTRAN PASCAL COBOL PL/I BASIC Lisp PROLOG Lisp

2005 2006.2.22-1 - 1 Fig. 1 2005 2006.2.22-2 - Element-Free Galerkin Method (EFGM) Meshless Local Petrov-Galerkin Method (MLPGM) 2005 2006.2.22-3 - 2 MLS u h (x) 1 p T (x) = [1, x, y]. (1) φ(x) 0.5 φ(x)

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

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

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

1 8, : 8.1 1, 2 z = ax + by + c ax by + z c = a b +1 x y z c = 0, (0, 0, c), n = ( a, b, 1). f = n i=1 a ii x 2 i + i<j 2a ij x i x j = ( x, A x), f =

1 8, : 8.1 1, z = ax + by + c ax by + z c = a b +1 x y z c = 0, (0, 0, c), n = ( a, b, 1). f = a ii x i + i

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

- II

- II- - -.................................................................................................... 3.3.............................................. 4 6...........................................

1W II K =25 A (1) office(a439) (2) A4 etc. 12:00-13:30 Cafe David 1 2 TA appointment Cafe D

1W II K200 : October 6, 2004 Version : 1.2, kawahira@math.nagoa-u.ac.jp, http://www.math.nagoa-u.ac.jp/~kawahira/courses.htm TA M1, m0418c@math.nagoa-u.ac.jp TA Talor Jacobian 4 45 25 30 20 K2-1W04-00

CPU Levels in the memory hierarchy Level 1 Level 2... Increasing distance from the CPU in access time Level n Size of the memory at each level 1: 2.2

FFT 1 Fourier fast Fourier transform FFT FFT FFT 1 FFT FFT 2 Fourier 2.1 Fourier FFT Fourier discrete Fourier transform DFT DFT n 1 y k = j=0 x j ω jk n, 0 k n 1 (1) x j y k ω n = e 2πi/n i = 1 (1) n DFT

2 8 BASIC (4) WWW Taylor BASIC 1 2 ( ) 2 ( ) ( ) ( ) (A.2.1 ) 1

2 8 BASIC (4) 203 6 5 WWW http://www.math.meiji.ac.jp/~mk/syori2-203/ Taylor BASIC 2 ( ) 2 ( ) ( ) ( ) 2 (A.2. ) 6B 2 2. f a f(x) = f (n) (a) n! (x a) n = f(a)+f (a)(x a)+ f (a) 2 (x a) 2 + + f (n) (a)

(2-1) x, m, 2 N(m, 2 ) x REAL*8 FUNCTION NRMDST (X, M, V) X,M,V REAL*8 x, m, 2 X X N(0,1) f(x) standard-norm.txt normdist1.f x=0, 0.31, 0.5

2007/5/14 II II agata@k.u-tokyo.a.jp 0. 1. x i x i 1 x i x i x i x x+dx f(x)dx f(x) f(x) + 0 f ( x) dx = 1 (Probability Density Funtion 2 ) (normal distribution) 3 1 2 2 ( x m) / 2σ f ( x) = e 2πσ x m

f : R R f(x, y) = x + y axy f = 0, x + y axy = 0 y 直線 x+y+a=0 に漸近し 原点で交叉する美しい形をしている x +y axy=0 X+Y+a=0 o x t x = at 1 + t, y = at (a > 0) 1 + t f(x, y

017 8 10 f : R R f(x) = x n + x n 1 + 1, f(x) = sin 1, log x x n m :f : R n R m z = f(x, y) R R R R, R R R n R m R n R m R n R m f : R R f (x) = lim h 0 f(x + h) f(x) h f : R n R m m n M Jacobi( ) m n

三石貴志.indd

流通科学大学論集 - 経済 情報 政策編 - 第 21 巻第 1 号,23-33(2012) SIRMs SIRMs Fuzzy fuzzyapproximate approximatereasoning reasoningusing using Lukasiewicz Łukasiewicz logical Logical operations Operations Takashi Mitsuishi

no35.dvi

p.16 1 sin x, cos x, tan x a x a, a>0, a 1 log a x a III 2 II 2 III III [3, p.36] [6] 2 [3, p.16] sin x sin x lim =1 ( ) [3, p.42] x 0 x ( ) sin x e [3, p.42] III [3, p.42] 3 3.1 5 8 *1 [5, pp.48 49] sin

num2.dvi

kanenko@mbk.nifty.com http://kanenko.a.la9.jp/ 16 32...... h 0 h = ε () 0 ( ) 0 1 IEEE754 (ieee754.c Kerosoft Ltd.!) 1 2 : OS! : WindowsXP ( ) : X Window xcalc.. (,.) C double 10,??? 3 :, ( ) : BASIC,

S I. dy fx x fx y fx + C 3 C dy fx 4 x, y dy v C xt y C v e kt k > xt yt gt [ v dt dt v e kt xt v e kt + C k x v + C C k xt v k 3 r r + dr e kt S dt d

S I.. http://ayapin.film.s.dendai.ac.jp/~matuda /TeX/lecture.html PDF PS.................................... 3.3.................... 9.4................5.............. 3 5. Laplace................. 5....

f(x) = x (1) f (1) (2) f (2) f(x) x = a y y = f(x) f (a) y = f(x) A(a, f(a)) f(a + h) f(x) = A f(a) A x (3, 3) O a a + h x 1 f(x) x = a

3 3.1 3.1.1 A f(a + h) f(a) f(x) lim f(x) x = a h 0 h f(x) x = a f 0 (a) f 0 (a) = lim h!0 f(a + h) f(a) h = lim x!a f(x) f(a) x a a + h = x h = x a h 0 x a 3.1 f(x) = x x = 3 f 0 (3) f (3) = lim h 0 (

num3.dvi

kanenko@mbk.nifty.com http://kanenko.a.la9.jp/ ,, ( ) Taylor. ( 1) i )x 2i+1 sinx = (2i+1)! i=0 S=0.0D0 T=X; /* */ DO 100 I=1,N S=S+T /* */ T=-T*X*X/(I+I+2)/(I+I+3) /* */ 100 CONTINUE. S=S+(-1)**I*X**(2*i+1)/KAIJO(2*I+1).

I ( ) 1 de Broglie 1 (de Broglie) p λ k h Planck ( Js) p = h λ = k (1) h 2π : Dirac k B Boltzmann ( J/K) T U = 3 2 k BT

I (008 4 0 de Broglie (de Broglie p λ k h Planck ( 6.63 0 34 Js p = h λ = k ( h π : Dirac k B Boltzmann (.38 0 3 J/K T U = 3 k BT ( = λ m k B T h m = 0.067m 0 m 0 = 9. 0 3 kg GaAs( a T = 300 K 3 fg 07345

1 Abstract 2 3 n a ax 2 + bx + c = 0 (a 0) (1) ( x + b ) 2 = b2 4ac 2a 4a 2 D = b 2 4ac > 0 (1) 2 D = 0 D < 0 x + b 2a = ± b2 4ac 2a b ± b 2

1 Abstract n 1 1.1 a ax + bx + c = 0 (a 0) (1) ( x + b ) = b 4ac a 4a D = b 4ac > 0 (1) D = 0 D < 0 x + b a = ± b 4ac a b ± b 4ac a b a b ± 4ac b i a D (1) ax + bx + c D 0 () () (015 8 1 ) 1. D = b 4ac

5 Armitage x 1,, x n y i = 10x i + 3 y i = log x i {x i } {y i } 1.2 n i i x ij i j y ij, z ij i j 2 1 y = a x + b ( cm) x ij (i j )

5 Armitage. x,, x n y i = 0x i + 3 y i = log x i x i y i.2 n i i x ij i j y ij, z ij i j 2 y = a x + b 2 2. ( cm) x ij (i j ) (i) x, x 2 σ 2 x,, σ 2 x,2 σ x,, σ x,2 t t x * (ii) (i) m y ij = x ij /00 y

S I. dy fx x fx y fx + C 3 C vt dy fx 4 x, y dy yt gt + Ct + C dt v e kt xt v e kt + C k x v k + C C xt v k 3 r r + dr e kt S Sr πr dt d v } dt k e kt

S I. x yx y y, y,. F x, y, y, y,, y n http://ayapin.film.s.dendai.ac.jp/~matuda n /TeX/lecture.html PDF PS yx.................................... 3.3.................... 9.4................5..............

Motivation Roots of Equations Direct Search, Bisection Methods Regula Falsi, Secant Methods Newton-Raphson Method Zeros of Polynomials (Horner s, Mull

Motivation Roots of Equations Direct Search, Bisection Methods Regula Falsi, Secant Methods Newton-Raphson Method Zeros of Polynomials (Horner s, Muller s methods) EigenValue Analysis ITCS 4133/5133: Introduction

II 2 II

II 2 II 2005 yugami@cc.utsunomiya-u.ac.jp 2005 4 1 1 2 5 2.1.................................... 5 2.2................................. 6 2.3............................. 6 2.4.................................

2 4 BASIC (4) WWW BASIC 1 2 ( ) ( ) 1.2 3B 5 14 ( ) ( ) 3 1 1

2 4 BASIC (4 2007 5 8 WWW http://www.math.meiji.ac.jp/~mk/syori2-2007/ BASIC 2 (. (5 5 3.2 3B 5 4 ( 5 5 5 2 ( 3 ( PAINT PAINT ( MAT PLOT AREA.3 : MAT PLOT AREA PAINT ( BASIC (.3. MAT PLOT AREA REM testmatplotarea.bas

. (.8.). t + t m ü(t + t) + c u(t + t) + k u(t + t) = f(t + t) () m ü f. () c u k u t + t u Taylor t 3 u(t + t) = u(t) + t! u(t) + ( t)! = u(t) + t u(

3 8. (.8.)............................................................................................3.............................................4 Nermark β..........................................

genron-3

" ( K p( pasals! ( kg / m 3 " ( K! v M V! M / V v V / M! 3 ( kg / m v ( v "! v p v # v v pd v ( J / kg p ( $ 3! % S $ ( pv" 3 ( ( 5 pv" pv R" p R!" R " ( K ( 6 ( 7 " pv pv % p % w ' p% S & $ p% v ( J /

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

並列計算の数理とアルゴリズム サンプルページ この本の定価 判型などは, 以下の URL からご覧いただけます. このサンプルページの内容は, 初版 1 刷発行時のものです.

並列計算の数理とアルゴリズム サンプルページ この本の定価 判型などは, 以下の URL からご覧いただけます. http://www.morikita.co.jp/books/mid/080711 このサンプルページの内容は, 初版 1 刷発行時のものです. Calcul scientifique parallèle by Frédéric Magoulès and François-Xavier

9 5 ( α+ ) = (α + ) α (log ) = α d = α C d = log + C C 5. () d = 4 d = C = C = 3 + C 3 () d = d = C = C = 3 + C 3 =

5 5. 5.. A II f() f() F () f() F () = f() C (F () + C) = F () = f() F () + C f() F () G() f() G () = F () 39 G() = F () + C C f() F () f() F () + C C f() f() d f() f() C f() f() F () = f() f() f() d =

- 2 -

- 1 - - 2 - - 3 - - 4 - - 5 - - 6 - - 7 - - 8 - - 9 - A) B) C) D) E) F) - 10 - G) H) I) J) P - 11 - 001 1,416,0003/4 1,062,000 002 100,000 50,00023 1,150,000 2,100,000 200,000+ 100,0000.9 1,600,000 JA

1. 1 BASIC PC BASIC BASIC BASIC Fortran WS PC (1.3) 1 + x 1 x = x = (1.1) 1 + x = (1.2) 1 + x 1 = (1.

Section Title Pages Id 1 3 7239 2 4 7239 3 10 7239 4 8 7244 5 13 7276 6 14 7338 7 8 7338 8 7 7445 9 11 7580 10 10 7590 11 8 7580 12 6 7395 13 z 11 7746 14 13 7753 15 7 7859 16 8 7942 17 8 Id URL http://km.int.oyo.co.jp/showdocumentdetailspage.jsp?documentid=

微分積分 サンプルページ この本の定価 判型などは, 以下の 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)

Microsoft Word - 資料 (テイラー級数と数値積分).docx

δx δx n x=0 sin x = x x3 3 + x5 5 x7 7 +... x ak = (-mod(k,2))**(k/2) / fact_k ( ) = a n δ x n f x 0 + δ x a n = f ( n) ( x 0 ) n f ( x) = sin x n=0 58 I = b a ( ) f x dx ΔS = f ( x)h I = f a h h I = h

1 1 1 1 1 1 2 f z 2 C 1, C 2 f 2 C 1, C 2 f(c 2 ) C 2 f(c 1 ) z C 1 f f(z) xy uv ( u v ) = ( a b c d ) ( x y ) + ( p q ) (p + b, q + d) 1 (p + a, q + c) 1 (p, q) 1 1 (b, d) (a, c) 2 3 2 3 a = d, c = b

2 H23 BioS (i) data d1; input group patno t sex censor; cards;

H BioS (i) data d1; input group patno t sex censor; cards; 0 1 0 0 0 0 1 0 1 1 0 4 4 0 1 0 5 5 1 1 0 6 5 1 1 0 7 10 1 0 0 8 15 0 1 0 9 15 0 1 0 10 4 1 0 0 11 4 1 0 1 1 5 1 0 1 1 7 0 1 1 14 8 1 0 1 15 8

OHP.dvi

0 7 4 0000 5.. 3. 4. 5. 0 0 00 Gauss PC 0 Gauss 3 Gauss Gauss 3 4 4 4 4 3 4 4 4 4 3 4 4 4 4 3 4 4 4 4 u [] u [3] u [4] u [4] P 0 = P 0 (),3,4 (,), (3,), (4,) 0,,,3,4 3 3 3 3 4 4 4 4 0 3 6 6 0 6 3 6 0 6

1 Ricci V, V i, W f : V W f f(v ) = Imf W ( ) f : V 1 V k W 1

1 Ricci V, V i, W f : V W f f(v = Imf W ( f : V 1 V k W 1 {f(v 1,, v k v i V i } W < Imf > < > f W V, V i, W f : U V L(U; V f : V 1 V r W L(V 1,, V r ; W L(V 1,, V r ; W (f + g(v 1,, v r = f(v 1,, v r

. p.1/34

. p.1/34 (Optimization) (Mathematical Programming),,. p.2/34 1 1.1 1.2 1.3 2 2.1 2.2 2.3 2.4 2.5 3 4 5. p.3/34 1 1.1 1.2 1.3 2 2.1 2.2 2.3 2.4 2.5 3 4 5. p.4/34 4x + 2y 6, 2x + y 6, x 0, y 0 x, yx + yx,

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

: : : : ) ) 1. d ij f i e i x i v j m a ij m f ij n x i =

1 1980 1) 1 2 3 19721960 1965 2) 1999 1 69 1980 1972: 55 1999: 179 2041999: 210 211 1999: 211 3 2003 1987 92 97 3) 1960 1965 1970 1985 1990 1995 4) 1. d ij f i e i x i v j m a ij m f ij n x i = n d ij

IDRstab(s, L) GBiCGSTAB(s, L) 2. AC-GBiCGSTAB(s, L) Ax = b (1) A R n n x R n b R n 2.1 IDR s L r k+1 r k+1 = b Ax k+1 IDR(s) r k+1 = (I ω k A)(r k dr

1 2 IDR(s) GBiCGSTAB(s, L) IDR(s) IDRstab(s, L) GBiCGSTAB(s, L) Verification of effectiveness of Auto-Correction technique applied to preconditioned iterative methods Keiichi Murakami 1 Seiji Fujino 2

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

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

1 1.1 Excel Excel Excel log 1, log 2, log 3,, log 10 e = ln 10 log cm 1mm 1 10 =0.1mm = f(x) f(x) = n

1 1.1 Excel Excel Excel log 1, log, log,, log e.7188188 ln log 1. 5cm 1mm 1 0.1mm 0.1 4 4 1 4.1 fx) fx) n0 f n) 0) x n n! n + 1 R n+1 x) fx) f0) + f 0) 1! x + f 0)! x + + f n) 0) x n + R n+1 x) n! 1 .

ii : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : 27 (1) Excel : : : : : : : : : : : : : : : : : : : : : :

i 2006. 4. 11 Excel JMP 0 1 1 (ICC) 2 1.1 2 : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : 2 (1) : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : :

Collatzの問題　（数学/数理科学セレクト１）

/ AICHI UNIVERSITY OF EDUCATION A { z = x + iy 0.100

x, y x 3 y xy 3 x 2 y + xy 2 x 3 + y 3 = x 3 y xy 3 x 2 y + xy 2 x 3 + y 3 = 15 xy (x y) (x + y) xy (x y) (x y) ( x 2 + xy + y 2) = 15 (x y)

x, y x 3 y xy 3 x 2 y + xy 2 x 3 + y 3 = 15 1 1977 x 3 y xy 3 x 2 y + xy 2 x 3 + y 3 = 15 xy (x y) (x + y) xy (x y) (x y) ( x 2 + xy + y 2) = 15 (x y) ( x 2 y + xy 2 x 2 2xy y 2) = 15 (x y) (x + y) (xy

°ÌÁê¿ô³ØII

July 14, 2007 Brouwer f f(x) = x x f(z) = 0 2 f : S 2 R 2 f(x) = f( x) x S 2 3 3 2 - - - 1. X x X U(x) U(x) x U = {U(x) x X} X 1. U(x) A U(x) x 2. A U(x), A B B U(x) 3. A, B U(x) A B U(x) 4. A U(x),

untitled

I 9 MPI (II) 2012 6 14 .. MPI. 1-3 sum100.f90 4 istart=myrank*25+1 iend=(myrank+1)*25 0 1 2 3 mpi_recv 3 isum1 1 isum /tmp/120614/sum100_4.f90 program sum100_4 use mpi implicit none integer :: i,istart,iend,isum,isum1,ip

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

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,

1 Edward Waring Lagrange n {(x i, y i )} n i=1 x i p i p i (x j ) = δ ij P (x) = p i p i (x) = n y i p i (x) (1) i=1 n j=1 j i x x j x i x j (2) Runge

Edwrd Wring Lgrnge n {(x i, y i )} n x i p i p i (x j ) = δ ij P (x) = p i p i (x) = n y i p i (x) () n j= x x j x i x j (2) Runge [] [2] = ξ 0 < ξ < ξ n = b [, b] [ξ i, ξ i ] y = /( + 25x 2 ) 5 2,, 0,,

1 R n (x (k) = (x (k) 1,, x(k) n )) k 1 lim k,l x(k) x (l) = 0 (x (k) ) 1.1. (i) R n U U, r > 0, r () U (ii) R n F F F (iii) R n S S S = { R n ; r > 0

III 2018 11 7 1 2 2 3 3 6 4 8 5 10 ϵ-δ http://www.mth.ngoy-u.c.jp/ ymgmi/teching/set2018.pdf http://www.mth.ngoy-u.c.jp/ ymgmi/teching/rel2018.pdf n x = (x 1,, x n ) n R n x 0 = (0,, 0) x = (x 1 ) 2 +

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

TCSE4~5

II. T = 1 m!! U = mg!(1 cos!) E = T + U! E U = T E U! m U,E mg! U = mg!(1! cos)! < E < mg! mg! < E! L = T!U = 1 m!! mg!(1! cos) d L! L = L = L m!, =!mg!sin m! + mg!sin = d =! g! sin & g! d =! sin ! = v

( ) a C n ( R n ) R a R C n. a C n (or R n ) a 0 2. α C( R ) a C n αa = α a 3. a, b C n a + b a + b ( ) p 8..2 (p ) a = [a a n ] T C n p n a

9 8 m n mn N.J.Nigham, Accuracy and Stability of Numerical Algorithms 2nd ed., (SIAM) x x = x2 + y 2 = x + y = max( x, y ) x y x () (norm) (condition number) 8. R C a, b C a b 0 a, b a = a 0 0 0 n C n

106 4 4.1 1 25.1 25.4 20.4 17.9 21.2 23.1 26.2 1 24 12 14 18 36 42 24 10 5 15 120 30 15 20 10 25 35 20 18 30 12 4.1 7 min. z = 602.5x 1 + 305.0x 2 + 2

105 4 0 1? 1 LP 0 1 4.1 4.1.1 (intger programming problem) 1 0.5 x 1 = 447.7 448 / / 2 1.1.2 1. 2. 1000 3. 40 4. 20 106 4 4.1 1 25.1 25.4 20.4 17.9 21.2 23.1 26.2 1 24 12 14 18 36 42 24 10 5 15 120 30

1 (1) ( i ) 60 (ii) 75 (iii) 315 (2) π ( i ) (ii) π (iii) 7 12 π ( (3) r, AOB = θ 0 < θ < π ) OAB A 2 OB P ( AB ) < ( AP ) (4) 0 < θ < π 2 sin θ

1 (1) ( i ) 60 (ii) 75 (iii) 15 () ( i ) (ii) 4 (iii) 7 1 ( () r, AOB = θ 0 < θ < ) OAB A OB P ( AB ) < ( AP ) (4) 0 < θ < sin θ < θ < tan θ 0 x, 0 y (1) sin x = sin y (x, y) () cos x cos y (x, y) 1 c

(2016 2Q H) [ ] R 2 2 P = (a, b), Q = (c, d) Q P QP = ( ) a c b d (a c, b d) P = (a, b) O P ( ) a p = b P = (a, b) p = ( ) a b R 2 {( ) } R 2 x = x, y

(2016 2Q H) [ ] R 2 2 P = (a, b), Q = (c, d) Q P QP = a c b d (a c, b d) P = (a, b) O P a p = b P = (a, b) p = a b R 2 { } R 2 x = x, y R y 2 a p =, c q = b d p + a + c q = b + d q p P q a p = c R c b

OpenMP¤òÍѤ¤¤¿ÊÂÎó·×»»¡Ê£²¡Ë

2013 5 30 (schedule) (omp sections) (omp single, omp master) (barrier, critical, atomic) program pi i m p l i c i t none integer, parameter : : SP = kind ( 1. 0 ) integer, parameter : : DP = selected real

A

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

, x R, f (x),, df dx : R R,, f : R R, f(x) ( ).,, f (a) d f dx (a), f (a) d3 f dx 3 (a),, f (n) (a) dn f dx n (a), f d f dx, f d3 f dx 3,, f (n) dn f

,,,,.,,,. R f : R R R a R, f(a + ) f(a) lim 0 (), df dx (a) f (a), f(x) x a, f (a), f(x) x a ( ). y f(a + ) y f(x) f(a+) f(a) f(a + ) f(a) f(a) x a 0 a a + x 0 a a + x y y f(x) 0 : 0, f(a+) f(a)., f(x)

x y x-y σ x + τ xy + X σ y B = + τ xy + Y B = S x = σ x l + τ xy m S y = σ y m + τ xy l σ x σ y τ xy X B Y B S x S y l m δu δv [ ( σx δu + τ )

1 8 6 No-tension 1. 1 1.1................................ 1 1............................................ 5.1 - [B].................................. 5................................. 6.3..........................................

08 p Boltzmann I P ( ) principle of equal probability P ( ) g ( )g ( 0 ) (4 89) (4 88) eq II 0 g ( 0 ) 0 eq Taylor eq (4 90) g P ( ) g ( ) g ( 0

08 p. 8 4 k B log g() S() k B : Boltzmann T T S k B g g heat bath, thermal reservoir... 4. I II II System I System II II I I 0 + 0 const. (4 85) g( 0 ) g ( )g ( ) g ( )g ( 0 ) (4 86) g ( )g ( 0 ) 0 (4

演習2

神戸市立工業高等専門学校電気工学科 / 電子工学科専門科目 数値解析 2017.6.2 演習 2 山浦剛 (tyamaura@riken.jp) 講義資料ページ h t t p://clim ate.aic s. riken. jp/m embers/yamaura/num erical_analysis. html 曲線の推定 N 次多項式ラグランジュ補間 y = p N x = σ N x x

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