差分法入門テキスト(第1講)
|
|
- このか ありはら
- 5 years ago
- Views:
Transcription
1
2
3
4 Edmund Gunter W.Schickrd Blise Pscl Isc Newton Gottfried W. Leibniz Chrles Bbbge IBM Jcgurd Howrd H. Aiken IBM 944 Mrk H. Hollerith IBM 943 J. Mnchly & J. P. Eckert Aberdeen ENI AC (Electronic Numericl Integrtor nd Clcultor ) IBM 60, 60, 650 UNIVAC EDVAC FORTRAN IBM TOSBAC 500 4
5 Apple II 8k 980 ALGOL Algorithmic Lnguge BASIC COBOL PL/I 950 $0, $ MFLOPS FLOPS M GFLOPS G , TFLOPS T IBM IBM CRAY-YMP
6
7 ( f x) x x x f '( x) 0 f ( x + h) f ( x ) = (3.) h h 0 0 f '( x0 ) lim 0 h f ( x0 + h) f ( x0) f '( x0) = (3.) h h B A (3.) (3.) y y= f() x B A h x 0 x0 + h x h x = x 0 x = x 0
8 x = x h x= x 0 f ( x0) f ( x0 h) f '( x0) = h f ( x0+ h) f ( x0 h) f '( x0) = h f( x0 + h) x= x 0 3 h h f( x0 + h) = f( x0) + f '( x0) h+ f ''( x0) + f '''( x0) +...! 3! f '( x ) 0 f( x0 + h) f( x0) h h f '( x0) = f ''( x0) f '''( x0) +... h! 3! f( x0 + h) f( x0) = + Oh ( ) h Oh ( ) h Oh ( ) f( x0 h) x= x 0 3 h h f( x0 h) = f( x0) f '( x0) h+ f ''( x0) f '''( x0) +...! 3! h Oh ( ) 0
9 3 h f '''( x0) f ( x0 + h) f ( x0 h) = hf '( x0) ! f ( x + h) f ( x h) '( ) = + ( ) h 0 0 f x0 Oh h f '( x0 + h/) f '( x0 h/) f ''( x0) = h f( x0 + h) f( x0) f( x0) f( x0 h) = h h h f( x0 + h) f ( x0) + f( x0 h) = h h f
10 () () k (3) c V = x y z ( xyz,, ) z f x x f y y (x, y, z) z f y y+ y f x x+ x x y
11 ρ m= ρ V= ρ x y z (4.) (3) u H = c m u = ρc x y z u (4.) H u = ρc x y z qxyzt (,,, ) qxyzt (,,, ) (4.3) x y z (4.4) (),() x y z x x, yz, f u = k y z (4.5) x x, yz, x x x, yz, y z x x+, yz, f u = k y z (4.6) x x x+, yz, x x+, yz, u u u u k y z + k y z k x z + k x z x x y y x x x x+ y y y y+ u u k x y + k x y z z z z z z+ (4.7)
12 (4.3) (4.4) (4.7) u ρc x y z = qxyzt (,,, ) x y z u u u u + k y z + k x z (4.8) x x x x x + x y y y y y+ y u u k x y z z z z z + z ρc x y z x, y, z 0 0 u u u u κ = κ + + qxyzt (,,, ) + t x y z k (4.9) κ = k cρ
13 u u u u u x xy y x y Axy (, ) + Bxy (, ) + Cxy (, ) + Dxy (, ) + Exy (, ) + Fxyu (, ) = Gxy (, ) B 4AC > 0 B 4AC = 0 B 4AC < 0 Lplce (5.) Φ x Φ y + = 0 (5.) Poisson Φ + + q = 0 x Φ y (5.3) B 4AC = 0 4 = 4 < 0 u u = κ t x (5.4) B 4AC = 0 4 κ 0= 0
14 u u = c t x (5.5) (5.)
15 u u = κ t x (6.) u u u u + u ( x) n+ n n n n i i i+ i i = κ (6.) u u u u + u n+ n n+ n+ n+ i i i+ i i = κ ( x) (6.3) u n+ t=(n+) t i x=i x t x (6.) (6.3)
16 (6.) (6.3) t t n+ n n+ n i- i i+ i- i i+
17 7. x + x + x = b( = ) x + x + x = b( = ) x + x + x = b( = ) (7.) x x + x + x = (7.) x (7.) 3 x + x + x = x + x + x = (7.3) (7.) x x + x = ( ) x + ( ) x = ( ) x + ( ) x = (7.4)
18 (7.4) =, =, = () () 3 () =, =, = () () 3 () (7.5) x + x + x = x + x = () () () x + x = () () () (7.6) () 0 (7.6) () (7.6) x + = (7.7) () () 3 4 x () 3 () (7.6) x3 (7.7) () 3 x + x = (7.8) () () () () 3 () () 3 3 () (7.6) ( ) x = (7.9) () () () () 3 () () () () = = (7.0) () () () () () 3 () () () , () ()
19 x + x + x = x + x = () () () x = () () (7.) x, x, x 3 x () 34 3 = () 33 x = ( x ) () () () (7.) x = ( x x ) (7.) (7.3) () () () = () () () (7.4) ()
20 () () () = () () () () () () 3 () () () 34 3 () (7.5) (7.) x n, n+ n, n+ n n nn nn, + (7.6) n, n+ () () () () 0 3 n, n+ () () () n 3, n+ ( n ) ( n ) nn nn, + (7.7) LU
21 7. 7. (0) Ax= b x. = Ax b A A = A + A A n 3 n = , A = n, n nn n n nn, (7.8) A Α Α (0) (0) Ax b x = A A = nn (7.9) (0) x b b b n x = A b =,,, (7.0) nn (0) T
22 () (0) x x Ax + Ax = b (7.) () (0) () (0) x = A b A Ax (7.) ( k ) ( k = ) x A b A Ax (7.3) ( ) x k i b x = x ( j i) (7.4) ( ) n k i ( k ) i ij ii ii j= SOR
23 Lplce Φ + = 0 x Φ y (8.) Lplce Φi+, j Φ ij, +Φi, j Φij, + Φ ij, +Φij, + = 0 x y ( ) ( ) (8.) Φ ( Φ x + i x, y + j y) ij, 0 0 j + Φ ij+, j Φ i, j Φ ij, Φ i +, j j Φ ij, j i i i i + i +
24 Φ +Φ +Φ +Φ i+, j+ i, j+ i+, j i, j ( ) ( ) ( ) ( ) ( ) ( ) ( ) ( ) x 5 y 5 x y ( Φ +Φ ) + Φ +Φ x y x y + + 0Φ = 0 ij, ( ) i+, j i, j ij, + ij, O( x, y ) O( x 4, y 4 ) x, y Φ ij, ( i = 0,, ie; j = 0,,, je ) Φ ij, ( i = 0,, ie; j = 0,,, je ) Φ Φ n
25 u u = κ (9.) t x 9. u u u u + u n+ n n n n i i i+ i i = κ ( x) (9.) O(, x ) 9. Lsonen Method Lsonen(949) ui ui ui ui + ui = κ x n+ n n+ n+ n+ + ( ) (9.3) O(, x ) Lsonen
26 9.3 Richrdson Method Richrdson Method(90), x + ui ui ui ui + ui = κ x n n n n n + ( ) (9.4) Forsythe & Wsow(960) 9.4 DuFort-Frnkel Method Lepfrog n n+ n Richrdson Method u ( u + u )/ i i i u u u u u + u n+ n n n+ n n i i i+ i i i = κ ( x) (9.5) DuFort & Frnkel(953) Lepfrog O(, x ) 9.5 Crnk-Nicolson Method Crnk & Nicolson(947) u u ( u u + u ) + ( u u + u ) n+ n n n n n+ n+ n+ i i i+ i i i+ i i = κ ( x) (9.6)
27 Crnk-Nicolson Scheme O(, x ) n + n u + i n n ui n u i + n n u i i i i + n + n u + i n u + i n u + i+ n n ui n n u u i i + i i i +
28 u = c t u x (0.) c u u + c = 0 ( c > 0) t x (0.) (0.) (0.) (0.) c (0.) (0.) (0.) 0. Euler n+ n n n ui ui ui+ ui + c = 0 x (0.3) u u u u n+ n n n i i + c i+ i = 0 x (0.4) O(, x) O(, x ) (0.3) (0.4)
29 0. Upwind Difference Method Euler c c u u u u x n+ n n n i i + c i i = 0 (0.5) O(, x) 0.3 Lx Method Euler (0.4) n n n ui ( ui+ + ui )/ Lx Method(954) u ( u + u ) n+ n n i i+ i n n ui+ ui + c = 0 x (0.6) 0.4 Euler u u u u n+ n n + n+ i i i+ i + c = 0 x (0.7) O(, x )
30 0.5 Lep Frog Method Lep Frog Method Lep Frog Method u u u u x n+ n n n i i + c i+ i = 0 (0.8) 0.6 Lw-Wendroff Method Lx-Wendroff Method Tylor n+ n u u ui = ui + t + t + O t t 3 ( ) ( ) (0.9) u = c u, u = c u t x t x (0.0) (0.9) + u u i x x 3 n n u = u c t + c ( t) + O ( ) i (0.) u u x x Lx-Wendroff + ( ) ( ) ( x) n n c n n c n n n i = i i+ i + i+ i + i ( ) u u u u u u u x (0.)
31 0.7 Lx-Wendroff Method Lx-Wendroff n+ / / ( n n ui+ ui+ + ui ) n n ui+ ui + c = 0 / x (0.3) n+ n n+ / n+ / ui ui ui+ ui + c = x / / 0 (0.4) i + / Lep Frog Method Lx-Wendroff Method Lx-Wendroff Method 0.8 McCormck Method McCormck Method(969) McCormck Method Lx-Wendroff Method i + / / i ( ) x n+ n n n ui = ui c ui+ ui (0.5)
32 n+ n n+ n+ n+ ui = ui + ui c ( ui ui ) x (0.6) n u + i n+ n+ u McCormck Method Lx-Wendroff
33 988. C.R G.D Ching-Jen Chen Computtionl Methods in Fluids nd Het Trnsfer, Lecture Note, Deprtment of Mechnicl Engineering, The University of Iow,
34 (3.0) Oh ( ) u u = κ t x u 0 = 0 u 0 =.0 ui( i=,,...,9) 6. (6.3) u u + c = 0 t x McCormck Method Lx-Wendroff Method
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 informationII
II 16 16.0 2 1 15 x α 16 x n 1 17 (x α) 2 16.1 16.1.1 2 x P (x) P (x) = 3x 3 4x + 4 369 Q(x) = x 4 ax + b ( ) 1 P (x) x Q(x) x P (x) x P (x) x = a P (a) P (x) = x 3 7x + 4 P (2) = 2 3 7 2 + 4 = 8 14 +
More informationnumb.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
More information1 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
More information17 ( :52) α ω 53 (2015 ) 2 α ω 55 (2017 ) 2 1) ) ) 2 2 4) (α β) A ) 6) A (5) 1)
3 3 1 α ω 53 (2015 ) 2 α ω 55 (2017 ) 2 1) 2000 2) 5 2 3 4 2 3 5 3) 2 2 4) (α β) 2 3 4 5 20 A 12 20 5 5 5) 6) 5 20 12 5 A (5) 1) Évariste Galois(1811-1832) 2) Joseph-Louis Lagrange(1736-1813) 18 3),Niels
More information.3. (x, x = (, u = = 4 (, x x = 4 x, x 0 x = 0 x = 4 x.4. ( z + z = 8 z, z 0 (z, z = (0, 8, (,, (8, 0 3 (0, 8, (,, (8, 0 z = z 4 z (g f(x = g(
06 5.. ( y = x x y 5 y 5 = (x y = x + ( y = x + y = x y.. ( Y = C + I = 50 + 0.5Y + 50 r r = 00 0.5Y ( L = M Y r = 00 r = 0.5Y 50 (3 00 0.5Y = 0.5Y 50 Y = 50, r = 5 .3. (x, x = (, u = = 4 (, x x = 4 x,
More information6.1 (P (P (P (P (P (P (, P (, P.
(011 30 7 0 ( ( 3 ( 010 1 (P.3 1 1.1 (P.4.................. 1 1. (P.4............... 1 (P.15.1 (P.16................. (P.0............3 (P.18 3.4 (P.3............... 4 3 (P.9 4 3.1 (P.30........... 4 3.
More informationn (1.6) i j=1 1 n a ij x j = b i (1.7) (1.7) (1.4) (1.5) (1.4) (1.7) u, v, w ε x, ε y, ε x, γ yz, γ zx, γ xy (1.8) ε x = u x ε y = v y ε z = w z γ yz
1 2 (a 1, a 2, a n ) (b 1, b 2, b n ) A (1.1) A = a 1 b 1 + a 2 b 2 + + a n b n (1.1) n A = a i b i (1.2) i=1 n i 1 n i=1 a i b i n i=1 A = a i b i (1.3) (1.3) (1.3) (1.1) (ummation convention) a 11 x
More information_0212_68<5A66><4EBA><79D1>_<6821><4E86><FF08><30C8><30F3><30DC><306A><3057><FF09>.pdf
More information
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............................
More information) Binary Cubic Forms / 25
2016 5 2 ) Binary Cubic Forms 2016 5 2 1 / 25 1 2 2 2 3 2 3 ) Binary Cubic Forms 2016 5 2 2 / 25 1.1 ( ) 4 2 12 = 5+7, 16 = 5+11, 36 = 7+29, 1.2 ( ) p p+2 3 5 5 7 11 13 17 19, 29 31 41 43 ) Binary Cubic
More informationA
A 2563 15 4 21 1 3 1.1................................................ 3 1.2............................................. 3 2 3 2.1......................................... 3 2.2............................................
More information6.1 (P (P (P (P (P (P (, P (, P.101
(008 0 3 7 ( ( ( 00 1 (P.3 1 1.1 (P.3.................. 1 1. (P.4............... 1 (P.15.1 (P.15................. (P.18............3 (P.17......... 3.4 (P................ 4 3 (P.7 4 3.1 ( P.7...........
More informationall.dvi
72 9 Hooke,,,. Hooke. 9.1 Hooke 1 Hooke. 1, 1 Hooke. σ, ε, Young. σ ε (9.1), Young. τ γ G τ Gγ (9.2) X 1, X 2. Poisson, Poisson ν. ν ε 22 (9.) ε 11 F F X 2 X 1 9.1: Poisson 9.1. Hooke 7 Young Poisson G
More informationII 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(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 =
More informationuntitled
F(r)=QE(r) Q ρ( r ') 3 E= ke 3 ( r r ') d r ' V r r' () Er () = Fr Q E E x y Ez ρ = x y z ε E E z y Ex E E z y Ex =, =, = y z z x x y A A x y Az diva = x y z A A z y A A x A z y Ax rot A =,, y z z x 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,,.
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 informationII 2 3.,, A(B + C) = AB + AC, (A + B)C = AC + BC. 4. m m A, m m B,, m m B, AB = BA, A,, I. 5. m m A, m n B, AB = B, A I E, 4 4 I, J, K
II. () 7 F 7 = { 0,, 2, 3, 4, 5, 6 }., F 7 a, b F 7, a b, F 7,. (a) a, b,,. (b) 7., 4 5 = 20 = 2 7 + 6, 4 5 = 6 F 7., F 7,., 0 a F 7, ab = F 7 b F 7. (2) 7, 6 F 6 = { 0,, 2, 3, 4, 5 },,., F 6., 0 0 a F
More information2010 2011 3 25 1 2 1.1 Malthus................................... 2 1.2 logistic.................................... 3 2 5 2.1 Lotoka-Volterra.............................. 5 2.2 Lotka-Volterra.......................
More informationII No.01 [n/2] [1]H n (x) H n (x) = ( 1) r n! r!(n 2r)! (2x)n 2r. r=0 [2]H n (x) n,, H n ( x) = ( 1) n H n (x). [3] H n (x) = ( 1) n dn x2 e dx n e x2
II No.1 [n/] [1]H n x) H n x) = 1) r n! r!n r)! x)n r r= []H n x) n,, H n x) = 1) n H n x) [3] H n x) = 1) n dn x e dx n e x [4] H n+1 x) = xh n x) nh n 1 x) ) d dx x H n x) = H n+1 x) d dx H nx) = nh
More informationii 3.,. 4. F. ( ), ,,. 8.,. 1. (75% ) (25% ) =7 24, =7 25, =7 26 (. ). 1.,, ( ). 3.,...,.,.,.,.,. ( ) (1 2 )., ( ), 0., 1., 0,.
(1 C205) 4 10 (2 C206) 4 11 (2 B202) 4 12 25(2013) http://www.math.is.tohoku.ac.jp/~obata,.,,,..,,. 1. 2. 3. 4. 5. 6. 7. 8. 1., 2007 ( ).,. 2. P. G., 1995. 3. J. C., 1988. 1... 2.,,. ii 3.,. 4. F. ( ),..
More informationuntitled
yoshi@image.med.osaka-u.ac.jp http://www.image.med.osaka-u.ac.jp/member/yoshi/ II Excel, Mathematica Mathematica Osaka Electro-Communication University (2007 Apr) 09849-31503-64015-30704-18799-390 http://www.image.med.osaka-u.ac.jp/member/yoshi/
More information20169 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 information5 n P j j (P i,, P k, j 1) 1 n n ) φ(n) = n (1 1Pj [ ] φ φ P j j P j j = = = = = n = φ(p j j ) (P j j P j 1 j ) P j j ( 1 1 P j ) P j j ) (1 1Pj (1 1P
p P 1 n n n 1 φ(n) φ φ(1) = 1 1 n φ(n), n φ(n) = φ()φ(n) [ ] n 1 n 1 1 n 1 φ(n) φ() φ(n) 1 3 4 5 6 7 8 9 1 3 4 5 6 7 8 9 1 4 5 7 8 1 4 5 7 8 10 11 1 13 14 15 16 17 18 19 0 1 3 4 5 6 7 19 0 1 3 4 5 6 7
More informationm dv = mg + kv2 dt m dv dt = mg k v v m dv dt = mg + kv2 α = mg k v = α 1 e rt 1 + e rt m dv dt = mg + kv2 dv mg + kv 2 = dt m dv α 2 + v 2 = k m dt d
m v = mg + kv m v = mg k v v m v = mg + kv α = mg k v = α e rt + e rt m v = mg + kv v mg + kv = m v α + v = k m v (v α (v + α = k m ˆ ( v α ˆ αk v = m v + α ln v α v + α = αk m t + C v α v + α = e αk m
More information( ) f a, b n f(b) = f(a) + f (a)(b a) + + f (n 1) (a) (n 1)! (b a)n 1 + R n, R n = b a f (n) (b t)n 1 (t) (n 1)! dt. : R n = b a f (n) (b t
5 1 1.1 ) f, b n fb) = f) + f )b ) + + f n 1) ) n 1)! b )n 1 + R n, R n = f n) b t)n 1 t) n 1)! dt. : R n = f n) b t)n 1 t) n 1)! dt ] b b b t)n 1 + n 1)! = f n 1) b )n 1 ) + R n 1. n 1)! R n = [f n 1)
More informationN N 1,, N 2 N N N N N 1,, N 2 N N N N N 1,, N 2 N N N 8 1 6 3 5 7 4 9 2 1 12 13 8 15 6 3 10 4 9 16 5 14 7 2 11 7 11 23 5 19 3 20 9 12 21 14 22 1 18 10 16 8 15 24 2 25 4 17 6 13 8 1 6 3 5 7 4 9 2 1 12 13
More information微分積分 サンプルページ この本の定価 判型などは, 以下の 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 informationall.dvi
38 5 Cauchy.,,,,., σ.,, 3,,. 5.1 Cauchy (a) (b) (a) (b) 5.1: 5.1. Cauchy 39 F Q Newton F F F Q F Q 5.2: n n ds df n ( 5.1). df n n df(n) df n, t n. t n = df n (5.1) ds 40 5 Cauchy t l n mds df n 5.3: t
More information9. 05 L x P(x) P(0) P(x) u(x) u(x) (0 < = x < = L) P(x) E(x) A(x) P(L) f ( d EA du ) = 0 (9.) dx dx u(0) = 0 (9.2) E(L)A(L) du (L) = f (9.3) dx (9.) P
9 (Finite Element Method; FEM) 9. 9. P(0) P(x) u(x) (a) P(L) f P(0) P(x) (b) 9. P(L) 9. 05 L x P(x) P(0) P(x) u(x) u(x) (0 < = x < = L) P(x) E(x) A(x) P(L) f ( d EA du ) = 0 (9.) dx dx u(0) = 0 (9.2) E(L)A(L)
More information表紙
A B,BW C Rc No. h Rc C 2 3 4 M2 M3 M4 M5 M6 25 3.2 6.8 3.5 6.4 2.8 2.7 2.4 9.1 15.5 21.6 28.0 34.4 35 41 40 50 60 80 100 120 140 160 180 200 240 4.8 10.2 5.2 10.1 4.3 4.1 3.8 14.23 24.36 34.1 44.2 54.3
More informationall.dvi
5,, Euclid.,..,... Euclid,.,.,, e i (i =,, ). 6 x a x e e e x.:,,. a,,. a a = a e + a e + a e = {e, e, e } a (.) = a i e i = a i e i (.) i= {a,a,a } T ( T ),.,,,,. (.),.,...,,. a 0 0 a = a 0 + a + a 0
More information1 No.1 5 C 1 I III F 1 F 2 F 1 F 2 2 Φ 2 (t) = Φ 1 (t) Φ 1 (t t). = Φ 1(t) t = ( 1.5e 0.5t 2.4e 4t 2e 10t ) τ < 0 t > τ Φ 2 (t) < 0 lim t Φ 2 (t) = 0
1 No.1 5 C 1 I III F 1 F 2 F 1 F 2 2 Φ 2 (t) = Φ 1 (t) Φ 1 (t t). = Φ 1(t) t = ( 1.5e 0.5t 2.4e 4t 2e 10t ) τ < 0 t > τ Φ 2 (t) < 0 lim t Φ 2 (t) = 0 0 < t < τ I II 0 No.2 2 C x y x y > 0 x 0 x > b a dx
More informationii
ii iii 1 1 1.1..................................... 1 1.2................................... 3 1.3........................... 4 2 9 2.1.................................. 9 2.2...............................
More information( )/2 hara/lectures/lectures-j.html 2, {H} {T } S = {H, T } {(H, H), (H, T )} {(H, T ), (T, T )} {(H, H), (T, T )} {1
( )/2 http://www2.math.kyushu-u.ac.jp/ hara/lectures/lectures-j.html 1 2011 ( )/2 2 2011 4 1 2 1.1 1 2 1 2 3 4 5 1.1.1 sample space S S = {H, T } H T T H S = {(H, H), (H, T ), (T, H), (T, T )} (T, H) S
More informationhousoku.dvi
: 1 :, 2002 07 14 1 3 11 3 12 : 3 13 : 5 14 6 141 6 142 8 143 8 144 8 145 9 2 10 21 10 : 2 22 11 23 11 24 11 A : 12 B 14 C 15 ( ) ( ) ( ),, (,, ) 2,, : 1 3 1 11 (t),, ρv 0 (1) t (t) ( A ) ( ) ρ (t) t +ρ
More information0.6 A = ( 0 ),. () A. () x n+ = x n+ + x n (n ) {x n }, x, x., (x, x ) = (0, ) e, (x, x ) = (, 0) e, {x n }, T, e, e T A. (3) A n {x n }, (x, x ) = (,
[ ], IC 0. A, B, C (, 0, 0), (0,, 0), (,, ) () CA CB ACBD D () ACB θ cos θ (3) ABC (4) ABC ( 9) ( s090304) 0. 3, O(0, 0, 0), A(,, 3), B( 3,, ),. () AOB () AOB ( 8) ( s8066) 0.3 O xyz, P x Q, OP = P Q =
More informationMacdonald, ,,, Macdonald. Macdonald,,,,,.,, Gauss,,.,, Lauricella A, B, C, D, Gelfand, A,., Heckman Opdam.,,,.,,., intersection,. Macdona
Macdonald, 2015.9.1 9.2.,,, Macdonald. Macdonald,,,,,.,, Gauss,,.,, Lauricella A, B, C, D, Gelfand, A,., Heckman Opdam.,,,.,,., intersection,. Macdonald,, q., Heckman Opdam q,, Macdonald., 1 ,,. Macdonald,
More informationac b 0 r = r a 0 b 0 y 0 cy 0 ac b 0 f(, y) = a + by + cy ac b = 0 1 ac b = 0 z = f(, y) f(, y) 1 a, b, c 0 a 0 f(, y) = a ( ( + b ) ) a y ac b + a y
01 4 17 1.. y f(, y) = a + by + cy + p + qy + r a, b, c 0 y b b 1 z = f(, y) z = a + by + cy z = p + qy + r (, y) z = p + qy + r 1 y = + + 1 y = y = + 1 6 + + 1 ( = + 1 ) + 7 4 16 y y y + = O O O y = y
More information直交座標系の回転
b T.Koama x l x, Lx i ij j j xi i i i, x L T L L, L ± x L T xax axx, ( a a ) i, j ij i j ij ji λ λ + λ + + λ i i i x L T T T x ( L) L T xax T ( T L T ) A( L) T ( LAL T ) T ( L AL) λ ii L AL Λ λi i axx
More informationuntitled
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)
More information1 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
More information: : : : ) ) 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
More information( 12 ( ( ( ( Levi-Civita grad div rot ( ( = 4 : 6 3 1 1.1 f(x n f (n (x, d n f(x (1.1 dxn f (2 (x f (x 1.1 f(x = e x f (n (x = e x d dx (fg = f g + fg (1.2 d dx d 2 dx (fg = f g + 2f g + fg 2... d n n
More information6. Euler x
...............................................................................3......................................... 4.4................................... 5.5......................................
More information( ) x y f(x, y) = ax
013 4 16 5 54 (03-5465-7040) nkiyono@mail.ecc.u-okyo.ac.jp hp://lecure.ecc.u-okyo.ac.jp/~nkiyono/inde.hml 1.. y f(, y) = a + by + cy + p + qy + r a, b, c 0 y b b 1 z = f(, y) z = a + by + cy z = p + qy
More informationNo δs δs = r + δr r = δr (3) δs δs = r r = δr + u(r + δr, t) u(r, t) (4) δr = (δx, δy, δz) u i (r + δr, t) u i (r, t) = u i x j δx j (5) δs 2
No.2 1 2 2 δs δs = r + δr r = δr (3) δs δs = r r = δr + u(r + δr, t) u(r, t) (4) δr = (δx, δy, δz) u i (r + δr, t) u i (r, t) = u i δx j (5) δs 2 = δx i δx i + 2 u i δx i δx j = δs 2 + 2s ij δx i δx j
More information‚åŁÎ“·„´Šš‡ðŠp‡¢‡½‹âfi`fiI…A…‰…S…−…Y…•‡ÌMarkovŸA“½fiI›ð’Í
Markov 2009 10 2 Markov 2009 10 2 1 / 25 1 (GA) 2 GA 3 4 Markov 2009 10 2 2 / 25 (GA) (GA) L ( 1) I := {0, 1} L f : I (0, ) M( 2) S := I M GA (GA) f (i) i I Markov 2009 10 2 3 / 25 (GA) ρ(i, j), i, j I
More informationII 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.................................
More information2005
20 30 8 3 190 60 A,B 67,2000 98 20 23,600 100 60 10 20 1 3 2 1 2 1 12 1 1 ( ) 340 20 20 30 50 50 ( ) 6 80 5 65 17 21 5 5 12 35 1 5 20 3 3,456,871 2,539,950 916,921 18 10 29 5 3 JC-V 2 ( ) 1 17 3 1 6
More information2 1 Introduction (1.1.2) Logistic ث Malthus (1.1.3) (( ) ث)( ) α = ( ) ( + ) [Verhulst 1845] 0 ( ) ( + ) lim ( ) = 0 t (1.1.4) (( ) ث)( ) α = ( ) Logi
1 1 Introduction 1.1 ( ) ( ) Malthus ( ) (1.1.1) ( ) α = ( ) ( + ) 0 ( ) ( + ) lim ( ) = 0 t ( ) α = ( ) αt م = ( ) ( ) = ( 0 ) 0 (1.1.2) αt م 0 = ( ) (1.1.1) ( ) ( α + (1 = ( + ) = 0 1 ( ( ) 2... ) geometric
More informationwebkaitou.dvi
( c Akir KANEKO) ).. m. l s = lθ m d s dt = mg sin θ d θ dt = g l sinθ θ l θ mg. d s dt xy t ( d x dt, d y dt ) t ( mg sin θ cos θ, sin θ sin θ). (.) m t ( d x dt, d y dt ) = t ( mg sin θ cos θ, mg sin
More informationi I II I II II IC IIC I II ii 5 8 5 3 7 8 iii I 3........................... 5......................... 7........................... 4........................ 8.3......................... 33.4...................
More informationkoji07-01.dvi
2007 I II III 1, 2, 3, 4, 5, 6, 7 5 10 19 (!) 1938 70 21? 1 1 2 1 2 2 1! 4, 5 1? 50 1 2 1 1 2 2 1?? 2 1 1, 2 1, 2 1, 2, 3,... 3 1, 2 1, 3? 2 1 3 1 2 1 1, 2 2, 3? 2 1 3 2 3 2 k,l m, n k,l m, n kn > ml...?
More information統計学のポイント整理
.. September 17, 2012 1 / 55 n! = n (n 1) (n 2) 1 0! = 1 10! = 10 9 8 1 = 3628800 n k np k np k = n! (n k)! (1) 5 3 5 P 3 = 5! = 5 4 3 = 60 (5 3)! n k n C k nc k = npk k! = n! k!(n k)! (2) 5 3 5C 3 = 5!
More informationuntitled
20 7 1 22 7 1 1 2 3 7 8 9 10 11 13 14 15 17 18 19 21 22 - 1 - - 2 - - 3 - - 4 - 50 200 50 200-5 - 50 200 50 200 50 200 - 6 - - 7 - () - 8 - (XY) - 9 - 112-10 - - 11 - - 12 - - 13 - - 14 - - 15 - - 16 -
More informationuntitled
19 1 19 19 3 8 1 19 1 61 2 479 1965 64 1237 148 1272 58 183 X 1 X 2 12 2 15 A B 5 18 B 29 X 1 12 10 31 A 1 58 Y B 14 1 25 3 31 1 5 5 15 Y B 1 232 Y B 1 4235 14 11 8 5350 2409 X 1 15 10 10 B Y Y 2 X 1 X
More informationad bc A A A = ad bc ( d ) b c a n A n A n A A det A A ( ) a b A = c d det A = ad bc σ {,,,, n} {,,, } {,,, } {,,, } ( ) σ = σ() = σ() = n sign σ sign(
I n n A AX = I, YA = I () n XY A () X = IX = (YA)X = Y(AX) = YI = Y X Y () XY A A AB AB BA (AB)(B A ) = A(BB )A = AA = I (BA)(A B ) = B(AA )B = BB = I (AB) = B A (BA) = A B A B A = B = 5 5 A B AB BA A
More informationEGunGPU
Super Computing in Accelerator simulations - Electron Gun simulation using GPGPU - K. Ohmi, KEK-Accel Accelerator Physics seminar 2009.11.19 Super computers in KEK HITACHI SR11000 POWER5 16 24GB 16 134GFlops,
More information橡紙目次第1章1
1 1 1 AstA A st t Q + = 0 Ast A st t y = bst ( y) t (1.1) (1.) y 1 Q + = 0 t b st q (1.3) (1.3) b st y Q + = q t (1.4) Abbott(1979) Q Q y + ( β ) + ga + gas f = 0 t A q u (1.5) Q Q y + ( β ) + ga + Sf
More information行列代数2010A
(,) A (,) B C = AB a 11 a 1 a 1 b 11 b 1 b 1 c 11 c 1 c a A = 1 a a, B = b 1 b b, C = AB = c 1 c c a 1 a a b 1 b b c 1 c c i j ij a i1 a i a i b 1j b j b j c ij = a ik b kj b 1j b j AB = a i1 a i a ik
More information. sinh x sinh x) = e x e x = ex e x = sinh x 3) y = cosh x, y = sinh x y = e x, y = e x 6 sinhx) coshx) 4 y-axis x-axis : y = cosh x, y = s
. 00 3 9 [] sinh x = ex e x, cosh x = ex + e x ) sinh cosh 4 hyperbolic) hyperbola) = 3 cosh x cosh x) = e x + e x = cosh x ) . sinh x sinh x) = e x e x = ex e x = sinh x 3) y = cosh x, y = sinh x y =
More informationmugensho.dvi
1 1 f (t) lim t a f (t) = 0 f (t) t a 1.1 (1) lim(t 1) 2 = 0 t 1 (t 1) 2 t 1 (2) lim(t 1) 3 = 0 t 1 (t 1) 3 t 1 2 f (t), g(t) t a lim t a f (t) g(t) g(t) f (t) = o(g(t)) (t a) = 0 f (t) (t 1) 3 1.2 lim
More informationx () 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 informationII 1 3 2 5 3 7 4 8 5 11 6 13 7 16 8 18 2 1 1. x 2 + xy x y (1 lim (x,y (1,1 x 1 x 3 + y 3 (2 lim (x,y (, x 2 + y 2 x 2 (3 lim (x,y (, x 2 + y 2 xy (4 lim (x,y (, x 2 + y 2 x y (5 lim (x,y (, x + y x 3y
More information1 n A a 11 a 1n A =.. a m1 a mn Ax = λx (1) x n λ (eigenvalue problem) x = 0 ( x 0 ) λ A ( ) λ Ax = λx x Ax = λx y T A = λy T x Ax = λx cx ( 1) 1.1 Th
1 n A a 11 a 1n A = a m1 a mn Ax = λx (1) x n λ (eigenvalue problem) x = ( x ) λ A ( ) λ Ax = λx x Ax = λx y T A = λy T x Ax = λx cx ( 1) 11 Th9-1 Ax = λx λe n A = λ a 11 a 12 a 1n a 21 λ a 22 a n1 a n2
More information21 2 26 i 1 1 1.1............................ 1 1.2............................ 3 2 9 2.1................... 9 2.2.......... 9 2.3................... 11 2.4....................... 12 3 15 3.1..........
More informationAC-2
AC-1 AC-2 AC-3 AC-4 AC-5 AC-6 AC-7 AC-8 AC-9 * * * AC-10 AC-11 AC-12 AC-13 AC-14 AC-15 AC-16 AC-17 AC-18 AC-19 AC-20 AC-21 AC-22 AC-23 AC-24 AC-25 AC-26 AC-27 AC-28 AC-29 AC-30 AC-31 AC-32 * * * * AC-33
More informationエンジョイ北スポーツ
28 3 20 85132 http://www.kita-city-taikyo.or.jp 85 63 27 27 85132 http://www.kita-city-taikyo.or.jp 2 2 3 4 4 3 6 78 27, http://www.kita-city-taikyo.or.jp 85132 3 35 11 8 52 11 8 2 3 4 1 2 4 4 5 4 6 8
More information6kg 1.1m 1.m.1m.1 l λ ϵ λ l + λ l l l dl dl + dλ ϵ dλ dl dl + dλ dl dl 3 1. JIS 1 6kg 1% 66kg 1 13 σ a1 σ m σ a1 σ m σ m σ a1 f f σ a1 σ a1 σ m f 4
35-8585 7 8 1 I I 1 1.1 6kg 1m P σ σ P 1 l l λ λ l 1.m 1 6kg 1.1m 1.m.1m.1 l λ ϵ λ l + λ l l l dl dl + dλ ϵ dλ dl dl + dλ dl dl 3 1. JIS 1 6kg 1% 66kg 1 13 σ a1 σ m σ a1 σ m σ m σ a1 f f σ a1 σ a1 σ m
More informationa n a n ( ) (1) a m a n = a m+n (2) (a m ) n = a mn (3) (ab) n = a n b n (4) a m a n = a m n ( m > n ) m n 4 ( ) 552
3 3.0 a n a n ( ) () a m a n = a m+n () (a m ) n = a mn (3) (ab) n = a n b n (4) a m a n = a m n ( m > n ) m n 4 ( ) 55 3. (n ) a n n a n a n 3 4 = 8 8 3 ( 3) 4 = 8 3 8 ( ) ( ) 3 = 8 8 ( ) 3 n n 4 n n
More information20 6 4 1 4 1.1 1.................................... 4 1.1.1.................................... 4 1.1.2 1................................ 5 1.2................................... 7 1.2.1....................................
More information> > <., vs. > x 2 x y = ax 2 + bx + c y = 0 2 ax 2 + bx + c = 0 y = 0 x ( x ) y = ax 2 + bx + c D = b 2 4ac (1) D > 0 x (2) D = 0 x (3
13 2 13.0 2 ( ) ( ) 2 13.1 ( ) ax 2 + bx + c > 0 ( a, b, c ) ( ) 275 > > 2 2 13.3 x 2 x y = ax 2 + bx + c y = 0 2 ax 2 + bx + c = 0 y = 0 x ( x ) y = ax 2 + bx + c D = b 2 4ac (1) D >
More informationp12.dvi
301 12 (2) : 1 (1) dx dt = f(x,t) ( (t 0,t 1,...,t N ) ) h k = t k+1 t k. h k k h. x(t k ) x k. : 2 (2) :1. step. 1 : explicit( ) : ξ k+1 = ξ k +h k Ψ(t k,ξ k,h k ) implicit( ) : ξ k+1 = ξ k +h k Ψ(t k,t
More information1990 IMO 1990/1/15 1:00-4:00 1 N N N 1, N 1 N 2, N 2 N 3 N 3 2 x x + 52 = 3 x x , A, B, C 3,, A B, C 2,,,, 7, A, B, C
0 9 (1990 1999 ) 10 (2000 ) 1900 1994 1995 1999 2 SAT ACT 1 1990 IMO 1990/1/15 1:00-4:00 1 N 1990 9 N N 1, N 1 N 2, N 2 N 3 N 3 2 x 2 + 25x + 52 = 3 x 2 + 25x + 80 3 2, 3 0 4 A, B, C 3,, A B, C 2,,,, 7,
More informationIA September 25, 2017 ( ) I = [a, b], f (x) I = (a 0 = a < a 1 < < a m = b) I ( ) (partition) S (, f (x)) = w (I k ) I k a k a k 1 S (, f (x)) = I k 2
IA September 5, 7 I [, b], f x I < < < m b I prtition S, f x w I k I k k k S, f x I k I k [ k, k ] I I I m I k I j m inf f x w I k x I k k m k sup f x w I k x I k inf f x w I S, f x S, f x sup f x w I
More informationII K116 : January 14, ,. A = (a ij ) ij m n. ( ). B m n, C n l. A = max{ a ij }. ij A + B A + B, AC n A C (1) 1. m n (A k ) k=1,... m n A, A k k
: January 14, 28..,. A = (a ij ) ij m n. ( ). B m n, C n l. A = max{ a ij }. ij A + B A + B, AC n A C (1) 1. m n (A k ) k=1,... m n A, A k k, A. lim k A k = A. A k = (a (k) ij ) ij, A k = (a ij ) ij, i,
More information120 9 I I 1 I 2 I 1 I 2 ( a) ( b) ( c ) I I 2 I 1 I ( d) ( e) ( f ) 9.1: Ampère (c) (d) (e) S I 1 I 2 B ds = µ 0 ( I 1 I 2 ) I 1 I 2 B ds =0. I 1 I 2
9 E B 9.1 9.1.1 Ampère Ampère Ampère s law B S µ 0 B ds = µ 0 j ds (9.1) S rot B = µ 0 j (9.2) S Ampère Biot-Savart oulomb Gauss Ampère rot B 0 Ampère µ 0 9.1 (a) (b) I B ds = µ 0 I. I 1 I 2 B ds = µ 0
More information