Lanczos法を利用したTSVD法の積分方程式への応用
全文
(2) Vol.2018-HPC-163 No.4 2018/2/28. ใॲཧֶձڀݚใࠂ IPSJ SIG Technical Report. ͜͜ͰɼAk ͕ਖ਼ଇߦྻͰͳ͍ͨΊɼਖ਼֬ͳղ͕ඞͣ͠ ଘࡏ͢ΔͱݶΒͳ͍ɽͦΕʹނɼ৽͍͠Λ࠷খೋ ͱͯ͠ղ͘ඞཁ͕͋Δɽ. ui = σi−1 Kvi. (10). ui ͷఆٛΑΓɼੵ ui , ui ͱ ui , uj ʢͨͩ͠ɼui = uj ʣ ɼ࣍ͷΑ͏ʹ͖ͰࢉܭΔɽ. xk = argmin Ak x − b. (5). x. ui , ui = σi−1 Kvi , σi−1 Kvi = σi−2 vi , K∗ Kvi . ͜ͷ࠷খೋΛղ͍ͯɼxk ࣍ͷࣜͰ༩͑ΒΕΔɽ. xk = V Σ−1 k U∗ b. (6). = σi−2 vi , σi2 vi = 1 ui , uj =. ߟ͑ํʹͦͷ··ैͬͯ͢ࢉܭΔͱɼߦྻ A ͷશͳಛҟ ղ͕ඞཁͰ͋ΔͨΊɼेͳ͕ؒ࣌ࢉܭඞཁͱͳΔɽ ͦΕ͚ͩͰͳ͘ɼ্هͷ͚ٞͩͰɼxk ͕ x ʹ͍ۙɼଈ ͪɼಛҟͷΓࣺͯͷૢ࡞͕ղʹͨΒ͢Ө͕ڹখ͍͞. =. σi−2 vi , K∗ Kvj . = σi−2 vi , σi2 vj = 0. ࢉܭͷ్தͰখ͍͞ಛҟ͕ΘΕͳ͔ͬͨͨΊɼxk Λ ൺֱతਫ਼Α͘ٻΊΔ͜ͱ͕Ͱ͖Δɽ͔͠͠ɼTSVD ๏ͷ. (11). σi−1 Kvi , σi−1 Kvj . (12). ࣜ (11) ͱ (12) ΑΓɼ{ui }∞ i=1 ਖ਼نަܥΛͳ͢ɽ ࣍ʹɼK∗ ui Λߟ͑Δɽ. K∗ ui = K∗ σi−1 Kvi = σi−1 K∗ Kvi = σvi. (13). ࣜ (10) ͱࣜ (13) Λ߹Θͤͯɼ࣍ͷ͜ͱ͕Θ͔Δɽ. ͜ͱΛઆ໌͢ΔͷࢸͷٕͰ͋Δɽ ຊߘͰͦͷΑ͏ͳΛվળͯ͠ɼ·ͣ࿈ଓͷࢹ ͔ΒɼୈҰछ Fredholm ੵํఔࣜͷͨΊͷ TSVD ๏Λಋ ग़͠ɼੵํఔࣜʹର͢Δ༗ޮੑʹ͍ͭͯड़Δɽ࣍ʹɼ ࢄԽͨ͠ʹରͯ͠ɼLanczos ๏Λར༻ͨ͠ TSVD ๏ ΛఏҊ͢Δɽ࠷ʹޙɼ͍͔ͭ͘ͷ࣮ݧΛ௨ͯ͠ɼఏҊ ख๏ͷ༗ޮੑΛ͢ূݕΔɽ. Kvi = σi ui , K∗ ui = σi vi. (14). ࣜ (14) ΑΓɼσi ɼui ɼvi K ʹରͯ͠ɼߦྻͷಛҟͱಛ ҟϕΫτϧͱࣅͨΑ͏ͳׂͰ͋ΔɽͦΕΒΛ༻͍ͯɼؔ K(x, y) ͷߦྻͷಛҟղͱಉ༷ͳͷΛߟ͑Δɽ. vi ͷ ఆ ٛ Α Γ ɼK(x, y) vi ͱ ੵ Λ औ Ε Δ ͜ ͱ ͕ อ ূ ͞ Ε Δ ɽ ʹ ނɼK(x, y) Λ y ͷ ؔ ͱ Έ ͳ ͤ ɼ. 2. ୈҰछ Fredholm ੵํఔࣜͷ TSVD ๏ ࣜ (1) Ͱ༩͑ΒΕͨੵํఔࣜΛߟ͑ΔɽͦͷੵΛؔ f ʹֻ͚Δ࡞༻ૉͱΈͳͤɼ࡞༻ૉͷ͖ॻͰࣜܗ͢. K(x, y) ∈ span{vi }∞ i=1 Ͱ͋ΔɽͦͷͨΊɼK(x, y) ʹର ͯ࣍͠ͷΑ͏ͳల։͕Ͱ͖Δɽ. K(x, y) =. ͜ͱ͕Ͱ͖Δɽ. Kf = g. =. (7). ͜͜Ͱɼ࡞༻ૉ K ࣍ͷΑ͏ͳͷͰ͋Δɽ b Kf (y) = K(x, y)f (y)dy. =. i=1 ∞ i=1 ∞ . K(x, y), vi (y)vi (y) (Kvi )vi (y) σi ui (x)vi (y). (15). i=1. (8). a. ∞ . ࣜ (15) ΑΓɼߦྻͷಛҟղͱྨࣅ͢Δؔ K(x, y) ͷ. ͨͩ͠ɼK ∈ L2 ([a, b] × [a, b]) ΑΓɼK L2 [a, b] ͔Β. ಛҟղ͕ಘΒΕͨɽ࣍ʹɼ͜ͷղΛ༻͍ͯɼݩͷํ. L2 [a, b] ͷ࡞༻ૉͰɼ༗քʢΏ͑ʹ࿈ଓʣઢ༻࡞ܕૉͰ͋. ఔࣜͷղΛߟ͑Δɽ. ∗. ΔɽͦͷͨΊɼਵ࡞༻ૉ K ͕ଘࡏ͢Δɽ·ͨɼK ͕ί ∗. ϯύΫτͰ͋Δ͜ͱূ໌Ͱ͖Δ [6]ɽΑͬͯɼK K ͕ࣗ ݾਵͳਖ਼ఆͰɼ͔ͭίϯύΫτͳ࡞༻ૉͰ͋Γɼ࣍. i = 1, 2, · · ·. ͏ʹͳΔɽ. . b. K(x, y)f (y)dy =. ࣜΛຬͨ͢ݻ༗ σi ͱݻ༗ؔ vi ͕ଘࡏ͢Δɽ. K∗ Kvi = σi vi ,. ࣜ (15) Λ࠷ॳͷํఔࣜ (1) ʹೖ͢Δͱɼࠨଆ͕࣍ͷΑ. a. (9). =. ͞Βʹɼ{vi }∞ i=1 ਖ਼نަܥΛͳ͢ɽ·ͨɼඇྵͷ σi ͷ ͕ݸ༗ݸݶɼ·ͨՄࢉແ͋ͰݸݶΔ [5]ɽͦ͜Ͱɼ࠷. =. i=1 ∞ i=1 ∞ . b a. σi ui (x)vi (y)f (y)dy. σi ui (x). . b a. vi (y)f (y)dy. σi f, vi ui (x). (16). i=1. ॳʹɼඇྵͷ σi ͷ͕ݸՄࢉແ͋ͰݸݶΔͷΛԾఆ͢Δɽ ༗ݸݶͷ߹ຊઅͷ࠷͑ߟͰޙΔ͜ͱʹ͢Δɽ. ∞ . ࣜ (16) ΑΓɼࣜ (1) ͷࠨଆ͕ਖ਼نަ{ ܥui }∞ i=1 ͷுΔۭ ؒʹೖ͍ͬͯΔɽͦͷͨΊɼӈଆͷؔ g ҙʹબͿ. 2.1 ඇྵͷ σi ͕Ճࢉແ͋ͰݸݶΔ߹ ∗. ࠷ॳʹɼK K ͷ 1 ͭͷݻ༗ϖΞ. (σi2 , vi ). ؔ ui Λఆٛ͢Δɽ ⓒ 2018 Information Processing Society of Japan. ͜ͱ͕Ͱ͖ͳ͍ɽղ͕ଘࡏ͢Δ͜ͱΛอূ͢ΔͨΊɼg ʹରͯ͠ɼ࣍ͷ. {ui }∞ i=1 ͷுΔۭؒͷதʹͳ͍ͱ͍͚ͳ͍ɽ͜ͷ࣌ɼg ࣍ ͷల։Λ࣋ͭɽ. 2.
(3) Vol.2018-HPC-163 No.4 2018/2/28. ใॲཧֶձڀݚใࠂ IPSJ SIG Technical Report ∞ . g=. g, ui ui. (17). i=1. ࣜ (16) ͱࣜ (17) Λ߹ΘͤΔͱɼํఔࣜ (1) ࣍ࣜͷΑ͏ ʹͳΔɽ ∞ . N ΑΓେ͖͍ i ʹରͯ͠ɼui Λ KK∗ ͷ 0 ʹରԠ͢Δݻ༗ ؔͱ͢Εɼ͕࣍ࣜΓཱͭ͜ͱʹͳΔɽ. K∗ Kvi = KK∗ ui = 0, i > N. ΑͬͯɼKvi , Kvi = K∗ Kvi , vi = 0 Ͱ͋Δ͜ͱΑΓɼ. σi f, vi ui (x) =. i=1. ∞ . g, ui ui (x). (18). i=1. ࣜ (18) ͷ྆ଆͷ ui ͷΛൺֱ͢Δͱɼ࣍ͷ͜ͱ͕Θ ͔Δɽ. Kvi = 0 Ͱ͋Δ͜ͱ͕Θ͔Δɽಉ༷ʹɼK∗ ui = 0 Γཱ ͭɽͭ·Γɼi > N ͷ࣌ɼࣜ (14) ͕ΓཱͪɼͦΕʹଓ͘ ಉ͡ཧͰɼࣜ (19) ͷલ σi f, vi = g, ui ͕ಘΒΕΔɽ ͜ͷ࣌ɼࣜ (20) ͷΑ͏ͳ Ͱڃf Λද͢͜ͱ͕Ͱ͖ͳ͍ ͕ɼi > N ͷ i ʹରͯ͠ɼf, vi ҙͷΛऔΔ͜ͱ͕. σi f, vi = g, ui . Ͱ͖Δɽͭ·Γɼ͜ͷ߹ɼղ͕ҰҙͰͳ͍ɽ͔͠͠ɼ. σi−1 g, ui . ⇒ f, vi =. (19). ࠷ʹޙɼf ͷ vi ʹΑͬͯల։͢Δͱɼσi ɼui ɼvi Λ༻͍ͯ. i > N Ͱ͋Δ i ʹରͯ͠ɼf, vi = 0 ʹ͢Δͱɼ1 ͭͷղ f ͕ಘΒΕΔɽ࣮ɼ͜Ε͕ Kf = g Λຬͨ͢ f ͷதͰϊϧ Ϝ࠷খͷͷͰ͋Δɽ. ղ f Λදࣔ͢Δ͜ͱ͕Ͱ͖Δɽ. f =. ∞ . f = fN =. f, vi vi. ⇒f =. ∞ i=1. (20). i→∞. σi−1 g, ui vi ͕ൃࢄ͢ΔΑ͏ʹ͑ݟΔͷͰɼશମͷڃൃ 2. ࢄ͢ΔΑ͏ʹ͑ݟΔɽ͔͠͠ɼK(x, y) ∈ L ([a, b] × [a, b]) 2. 2. Ͱ͋Εɼ࡞༻ૉ K : L [a, b] → L [a, b] Λఆٛ͢Δ͜ ͱ͕Ͱ͖ɼҙͷ g ∈ R(K)(⊂ L2 [a, b]) ʹରͯ͠ɼඞͣ. Kf = g, f ∈ L2 [a, b] ͱͳΔ ૾ݪf ͕ଘࡏ͢Δɽ্هΑΓ f ɼࣜ (20) ͷΑ͏ͳܗΛ࣋ͭɽf ͕ L2 [a, b] ͷ͋ͰݩΔ͜ ͱΑΓɼL2 ϊϧϜ͕༗ͳݶͷͰɼࣜ (20) ͷӈଆͷ͕ڃ ඞͣऩଋ͢Δɽ ࣜ (20) ͷӈଆ͕ऩଋ͢Δ࣌ɼ͢ͳΘͪɼk → ∞ ͷ࣌ɼ ڃͷલ k ߲Λআ͍ͨୈ k + 1 ߲͔Βͷ૯͕ 0 ʹऩଋ͢ Δɽͭ·Γɼ͕࣍ࣜΓཱͭɽ. lim. σi−1 g, ui vi = 0. (24). ͱ͕Θ͔Δɽ. 3. Lanczos ๏ + TSVD ๏ ࠷ࣗવͳࢄԽͷߟ͑ํɼRiemann Λͬͯࣜ. (1) ΛࢄԽ͠ɼઢํܗఔࣜ Ax = b ΛಘΔ͜ͱͰ͋Δɽ࿈ ଓͷ߹ͱಉ༷ʹߦྻ A ͷಛҟͱಛҟϕΫτϧΛ༻͍ͯ ղ x ͷۙࣅΛٻΊΔɽ. xk =. k i=1. σi−1 (u∗i b)v i. (25). ͜͜Ͱɼ΄ΜͷҰ෦ͷಛҟͱಛҟϕΫτϧ͕ඞཁͳͷͰɼ ߦྻ A ʹରͯ͠ Lanczos ๏͕͑Δɽଟͷಛҟ͕ 0 ʹ ͍ۙͷͰɼҰൠʹ Lanczos ๏ͷऩଋ͕͍ɽ. ˆ1 ͱ u ˆ 1 = Aˆ Lanczos ๏ҙͷϕΫτϧ v v 1 /Aˆ v1 ͔ Β࢝·Γɼ࣍ͷ෮Λߦ͏͜ͱʹͳΔ [3]ɽ. (21). k+1. ˆ i−1 αi−1 , ˆ i = A∗ u ˆ i−1 − v v ˆi = v ˆ i /βi−1 ˆ v i = βi−1 , v. ͦͷͨΊɼࣜ (21) ͷӈଆͷલ k ߲ͷ૯͚ͩͰɼඪͷղ. f ͷۙࣅ fk ΛٻΊΔ͜ͱ͕Ͱ͖Δɽ f ≈ fk =. σi−1 g, ui vi. ैͬͯɼࣜ (24) Λ͜ͷղͷۙࣅͱͯ͠͏͜ͱ͕Ͱ͖Δ͜. σi−1 g, ui vi. લड़ͷ lim σi = 0 ΑΓɼࣜ (20) ͷӈଆͷڃͷ߲. ∞ . N i=1. i=1. k→∞. (23). k i=1. σi−1 g, ui vi. ˆi = u ˆ i /αi ˆ ui = αi , u (22). ͜ΕͰɼత TSVD ๏ͱಉ༷ʹɼখ͍͞ಛҟΛΓ ࣺͯΔ͜ͱʹΑͬͯɼ࿈ଓͷ߹ͷղ f ͷۙࣅΛಛҟ ͱಛҟϕΫτϧͰද͢͜ͱ͕Ͱ͖ͨɽ. 2.2 ඇྵͷ σi ͕༗͋ͰݸݶΔ߹ ඇྵͷ σi ͕༗͋ͰݸݶΔ߹ɼͦͷݸΛ N ∈ N ͱ ͢Εɼi > N Ͱ͋Δͯ͢ͷ σi = 0 ʹͳΔɽ͜ͷ࣌ɼ. i = 1, 2, · · · , N ʹରͯ͠ɼui લड़ͱಉ༷ʹఆٛͰ͖ɼ KK∗ ͷ σi ʹରԠ͢Δݻ༗ؔͰ͋Δ͜ͱʹมΘΒͳ͍ɽ ⓒ 2018 Information Processing Society of Japan. (26). ˆ i−1 βi−1 ˆ i = Aˆ vi − u u. ͨͩ͠ɼ͋Δ βm ͕ेখ͍͞߹ʹऩଋͨ͠ͱఆ͢Δɽ ͜ͷ࣌ɼ͕࣍ࣜಘΒΕΔɽ . A∗ A. . . Vˆm ˆm U. =. . Vˆm ˆm U. Hm. . Tm. ͨͩ͠ɼTm ֤ αi ͱ βi ͔ΒͳΔ࣍ͷΑ͏ͳ̎ॏର֯ߦ ྻͰɼHm Tm ͷసஔͰ͋Δɽ ⎞ ⎛ α1 β1 ⎟ ⎜ ⎟ ⎜ .. ⎟ ⎜ . α 2 ∗ ⎟ , H m = Tm Tm = ⎜ ⎟ ⎜ . .. β ⎟ ⎜ m−1 ⎠ ⎝ αm. (27). 3.
(4) Vol.2018-HPC-163 No.4 2018/2/28. ใॲཧֶձڀݚใࠂ IPSJ SIG Technical Report. ௨ৗɼm େ͖͘ͳ͍ͷͰɼTm ͷҰൠͷ SVDɿ Tm = ˆm U, Vm = U Σm V ∗ ͕؆୯ʹ͖ͰࢉܭΔɽ࠷ ʹޙUm = U ˆ Vm V ͱ͓͚ɼߦྻ A ͷ෦తͳ SVD ͕ಘΒΕΔɽ. AVm = Um Σm. (28). ͜͜ͰಘΒΕͨಛҟͱಛҟϕΫτϧΛ༻͍ͯɼࣜ (25) Ͱ ղ x ͷۙࣅΛٻΊΔ͜ͱ͕Ͱ͖Δɽ. ˆ i−1 − v ˆ i−1 αi−1 , ˆ i = A∗ W u v ˆi = v ˆ i /βi−1 ˆ v i W = βi−1 , v ˆi = u ˆ i /αi ˆ ui W = αi , u ˆi ͱ v ˆ i ɼຊʹਖ਼نަͳϕ ࣜ (32) Ͱੜ͞ΕΔ֤ u Ϋτϧͳͷ͔Λ͜͜Ͱ͔֬ΊΔɽ͋ΔεςοϓͰ͢Ͱʹಘ. ͔͠͠ɼRiemann ੵͷࢄԽ๏ͱͯ͠ਫ਼͕ͦ Ε΄ͲΑ͍Θ͚Ͱͳ͍ɽΑΓਫ਼ͷ͍͍ੵެࣜɼ. Boole ͷެ͕ࣜߟ͑ΒΕΔɽBoole ͷެࣜΑΓ x0 ͱ xn ͷ ؒͷؔ f (x) ͷੵɼ2 ͭͷͱͦͷؒͷ n . ˆ2, · · · , v ˆi ͱ u ˆ 2, · · · , u ˆ i ͕ਖ਼نަͰ͋Δ ˆ1, v ˆ 1, u ΒΕͨ v ˆ i+1 ͕ಘΒΕΔɽ ͱԾఆ͢Δɽͦͯ͠ɼࣜ (32) Ͱ৽͍͠ v ˆ i+1 ͱ v ˆ j ͷੵΛऔΔͱɼ j = 1, 2, · · · , i − 2 ʹରͯ͠ɼv ࣍ࣜͷΑ͏ʹͳΔɽ. x1 , x2 , · · · , xn−1 ʹ͓͚ΔؔΛ͑࣍ͷΑ͏ͳۙࣅ ͕Ͱ͖Δɽͨͩ͠ɼh = 1/nɽ b n 2 h f (x)dx ≈ wi f (xi ) 45 i=0 a ⎧ ⎪ 7 (i = 0 or n) ⎪ ⎪ ⎪ ⎨ 14 (i = 4k) wi = ⎪ 32 (i = 4k + 1 or 4k + 3) ⎪ ⎪ ⎪ ⎩ 12 (i = 4k + 2). ˆ j W = v ˆ ∗j W v ˆ i+1 = ˆ v i+1 , v. 1 1 ˆ j )∗ W u ˆ i = (αj u ˆi ˆ ∗j + βj−1 u ˆ ∗j−1 )W u (AW v βi βi =0 (33) ˆ i+1 ͱ v ˆ i ͷੵΛऔΔͱ࣍ʹͳΔɽ ·ͨɼv (29). ˆi = v ˆ ∗i W v ˆ i+1 = ˆ v i+1 , v. 1 ˆ i )∗ W u ˆ i − αi ) ((AW v βi 1 ˆ i − αi ) ˆ ∗i + βi−1 u ˆ ∗i−1 )W u = ((αi u βi 1 = (αi − αi ) = 0 βi. K(xi , yj )(i, j = 0, 1, · · · , n) ͔ΒͳΔߦྻͱ͢Δɽͦͯ͠ɼ ॏΈΛද͢ߦྻ W Λ࣍ͷΑ͏ʹఆٛ͢Δɽ. (30). ͜͜Ͱɼੵ࡞༻ૉ K ͷࢄԽ AW Ͱද͢͜ͱ͕Ͱ͖ɼ ಘΒΕͨઢํܕఔࣜ AW x = b ͱͳΔɽ Ұݟɼ͜ͷΞϧΰϦζϜͷߦྻ A ͷͱ͜Ζʹ AW Λ ೖ͚͍ͯͯ͠͠ࢉܭྑ͍Α͏ʹ͑ݟΔ͕ɼͦΕΛ࣮ࡍʹ ࣮ߦͯ͠ΈΔͱɼ·͍݁͠ՌΛಘΔ͜ͱ͕Ͱ͖ͳ͔ͬͨɽ ͦͷཧ༝ɼ͠ߦྻ AW ΛલͷΞϧΰϦζϜʹ ೖ͢Δͱɼ࡞༻ૉ K∗ ʹରԠ͢Δߦྻ͕ (AW )∗ = W A∗ ʹ. a. (34). ˆ i+1 ͕લͷ͢ ࣜ (33) ͱࣜ (34) ΑΓɼ৽͘͠ಘΒΕͨ v ˆ j (j ≤ i) ͱަ͢Δɽಉ༷ͳٞͰɼu ˆ i+1 ͯ͢ ͯͷ v ˆ j (j ≤ i) ͱަ͢Δ͜ͱ͕Θ͔Δɽैͬͯɼࣜ (33) Ͱ ͷu n. n. ੜ͞ΕΔ {ˆ ui }i=1 ͱ {ˆ v i }i=1 ɼͦΕͧΕਖ਼نަྻʹ ͳΔɽ લͱಉ͡ɼ͋Δ βi ͕ेখ͍࣌͞ɼΞϧΰϦζϜ͕ऩ ଋͨ͠ͱఆ͢Δɽऩଋͨ࣌͠ɼલͱࣅͨΑ͏ͳ͕ࣜಘΒ ΕΔɽ . A∗ W AW. (31). 1 ∗ ˆ i − αi v ˆ W (A∗ W u ˆi) v βi i. =. ·ͣɼx0 = y0 = a, xn = yn = b ͱ͠ɼߦྻ A Λ֤. ͳΔɽ͔͠͠ɼK∗ ɼ࣍ࣜͰهड़Ͱ͖Δɽ b ∗ K g= K(x, y)g(x)dx. 1 ∗ ˆ i − αi v ˆ W (A∗ W u ˆi) v βi j. =. ͨͩ͠ɼk ∈ N. ࣜ (29) ʹैͬͯࢄԽΛߦ͏ͳΒɼ. W = diag{w0 , w1 , · · · , wn }. (32). ˆi − u ˆ i−1 βi−1 ˆ i = AW v u. . . Vˆm ˆm U. =. . Vˆm ˆm U. Hm. . Tm. ͨͩ͠ɼTm ͱ Hm લड़ͱಉ͡ͷͰ͋Δɽ. K∗ ʹରԠ͢Δߦྻ A∗ W ʹͳΔͣͰ͋ΔɽAW ͕ର. ࣍લड़ͱಉ͡ Tm ͷ௨ৗͷಛҟղ Tm = U Σm V ∗ ˆm U, Vm = Vˆm V ͱஔ͘ͱɼ্هͷؔ Λͯ͠ࢉܭɼUm = U. শͰͳ͍ݶΓɼ྆ํ͕Ұக͠ͳ͍ɽͦͷͨΊɼ͜͜Ͱໃ. ࣜΛར༻ͯ͠ɼ͕࣍ࣜಘΒΕΔɽ. ʹނɼࣜ͠ (31) ͷੵެࣜͰࢄԽΛߦ͏ͱɼ࡞༻ૉ. ६͕ੜ͡Δɽ ͜ͷΛղܾ͢ΔͨΊʹɼLanczos ๏ͷमਖ਼Λߟ͑Δɽ ·ͣɼੵެࣜʹରԠͰ͖Δ W Ͱఆ·ΔੵͱϊϧϜΛɼ. = Vˆm V Σm U ∗ U = Vm Σm ˆ m Tm V AW Vm = AW Vˆm V = U. ࣍ͷΑ͏ʹఆٛ͢Δɽ. u, vW = u∗ W v,. ˆm U = Vˆm T ∗ U A∗ W U m = A ∗ W U m. ||u||W =. u, u,. ∀u, v ∈ Rn. ͜ͷ৽͍͠ੵͱϊϧϜͷಋೖʹΑͬͯɼLanczos ๏ͷ. ˆ 1 /AW v ˆ 1 W ͔Β࢝ ˆ1 ͱ u ˆ 1 = AW v ෮ҙͷϕΫτϧ v. ˆ m U Σm V ∗ V = U m Σ m = U ∗ ˆm U = U ∗ U = I ˆ∗ WU Um W Um = U ∗ U m. Vm∗ W Vm = V ∗ Vˆm∗ W Vˆm V = V ∗ V = I. ·Γɼຖճͷ෮࣍ͷΑ͏ʹͳΔɽ. ैͬͯɼ͜͜ͰಘΒΕͨ Um , Vm , Σm ͔֬ʹ W ʹಋ͔. ⓒ 2018 Information Processing Society of Japan. 4.
(5) Vol.2018-HPC-163 No.4 2018/2/28. ใॲཧֶձڀݚใࠂ IPSJ SIG Technical Report. . ΕΔੵͱϊϧϜͷҙຯͰߦྻ A ͷಛҟϕΫτϧͱಛҟ. sin(xy)f (y)dy =. ͔ΒͳΔߦྻͰ͋ΔɽಛʹɼલͷΑ͏ʹʹ͍ޓໃ६͢Δ͜ ͱ͕ͳ͍ɽΓࣜ (25) ʹԊͬͯۙࣅΛٻΊΕΑ͍ɽ. 1 0. sin x − x cos x x2. ͨͩ͠ɼਅͷղ f (y) = y Ͱ͋Δɽ. W ʹಋ͔ΕΔੵͱϊϧϜʹΑͬͯɼLanczos ෮Λमਖ਼. લͷྫͱಉ͡ɼ2 ͭͷํ๏ͰࢄԽΛߦ͍ɼݹయతͳ. ͯ͠ɼࣜ (29) ͳͲͷੵެࣜΛར༻ͯ͠ࢄԽͨ͠Λ. Lanczs ๏ͱमਖ਼൛ͷ࣮ߦ݁ՌΛௐͨɽͨͩ͠ɼࠓճͷӈ. ͏·͘ղ͚Α͍ɽ. ଆͷؔ g(x) ͷ͕ x2 Ͱ͋ΔͨΊɼb0 = g(0) Λ. 4. ࣮ݧ. ͢ࢉܭΔ͜ͱ͕Ͱ͖ͳ͍ͷͰɼ࣍ͷΑ͏ʹ b0 Λ 0 ʹ͓͚ Δ g(x) ͷͨ͠ࢉܭ͍͓ͯͱݶۃɽ. ࣮ݧ࣍ͷΑ͏ͳͨͬߦͰڥࢉܭɽ. b0 = lim. OS: Windows 10 Home(64-bit)ɼ. x→0. CPU: Intel Core i7-6700HQ CPU @ 2.60GHzɼ Memory: 16.0GBɼ. ྫ 2 ͷ࣮ߦ݁ՌΛද 2 ʹهड़ͨ͠ɽ·ͨɼ2 ͭͷํ๏ ͰٻΊͨ݁Ռʹ·ؚΕΔࠩޡਤ 3 ʹࣔͨ͠ɽྫ 1 ͱಉ. Program Language: MATLAB R2016aɽ. ༷ʹɼमਖ਼ͨ͠ Lanczos ๏ಉ͘͡Β͍ͷ࣌ؒͰ௨ৗͷ 3 ഒҎ্ͷਫ਼͕ಘΒΕͨɽ. 4.1 ྫ 1 ࣍ͷੵํఔࣜΛߟ͑Δɽ 1 ex+1 − 1 exy f (y)dy = x+1 0. 4.3 ྫ 3. ͨͩ͠ɼਅͷղ f (y) = ey Ͱ͋Δɽ ͜͜Ͱ͏ॏΈΛද͢ߦྻ W ࣜ (30) Ͱఆٛ͞Εͨ ͷΛ͏ɽn = 2048, h = 1/n ͱ͢ΔͱɼA ͱ b ҎԼͷ Α͏ʹͳΔɽ. ࣍ͷํఔࣜΛߟ͑Δɽ 1 5x2 − 5x + 3 (x − y)2 f (y)dy = 15 0 ͨͩ͠ɼਅͷղ f (y) = 16y 2 − 16y + 3 Ͱ͋Δɽ. 2 ͭͷࠩޡࢉܭͷ݁ՌΛਤ 3 ʹࣔͨ͠ɽ࣍ʹؒ࣌ࢉܭͷ ൺֱΛද 3 ʹهड़ͨ͠ɽࠓճͷ߹ɼͨͬ·ٻಛҟͷݸ. xi = yi = ih, i = 0, 1, · · · , n ⎛ e x 0 y0 e x 0 y 1 · · · e x 0 yn ⎜ xy ⎜ e 1 0 e x 1 y 1 · · · e x 1 yn ⎜ A = ⎜ .. .. .. ⎜ . . . ··· ⎝ x n y0 x n y1 x n yn e e ··· e b = (b0 , b1 , · · · , bn )∗ , bi =. sin x − x cos x x sin x sin x = lim =0 = lim x→0 x→0 2 x2 2x. ͕গͳͯ͘ɼݹయతͳ Lanczos ๏ʹΑΔղͷࠩޡલͷ. ⎞. ྫͱͦΕ΄ͲมΘΒͳ͍͕ɼࠩͷখ͍͞ղΛಘΔ͜ͱ. ⎟ ⎟ ⎟ ⎟ ⎟ ⎠. exi +1 − 1 , xi + 1. ʹࣦഊͨ͠ɽҰํɼमਖ਼ͨ͠ Lanczos ๏Λར༻͢Δͱɼ ͕ࠩґવͱͯ͠খ͍͚ͩ͞Ͱͳ͘ɼ΄΅શʹਅͷղͱҰ க͢Δࢉܭղ͕ಘΒΕͨɽ. i = 0, 1, · · · , n. ͜ΕҎ߱ͷྫಉ͡Α͏ͳํ๏ͰࢄԽΛߦ͏ͷͱ. ࢀߟจݙ [1]. ͢Δɽ લઅͰड़ͨݹయతͳ Lanczos ๏Λద༻ͨ͠ΞϧΰϦζ Ϝͱमਖ਼ͨ͠ Lanczos Λద༻ͨ͠ΞϧΰϦζϜΛͦΕͧ. [2]. Ε࣮ߦͯ͠ɼ࣮ߦ݁Ռද 1 ʹࣔͨ͠ɽ·ͨɼ֤ yi ʹ͓ ͚Δ ࠩޡe(yi ) = |fexact (yi ) − fnum (yi )| Λਤ 1 ʹϓϩοτ ͨ͠ɽ ද 1 ͱਤ 1 ͔Βɼݹయతͳ Lanczos ๏ʹ͓͍ͯɼf (y) =. [3] [4]. y. e ͷ͖Ε͍ͳ͕ܗಘΒΕͨͱ͍͑ɼࡉ͔ࠩ͘ޡΛ͠ࢉܭ ͯΈΔͱɼਫ਼͕ͦΜͳʹ͍͍ͱ͍͕͍ͨݴɽͦΕൺ ֱతʹ͕ࠩޡେ͖͍ Riemann ͰࢄԽ͔ͨ͠ΒͰ͋Δɽ ҰํɼBoole ͷެࣜΛར༻ͨ͠मਖ਼൛ͷ Lanczos ɼݹయ తͳ Lanczos ๏ʹൺͯ 3 ഒҎ্ͷਫ਼Λ࣮ͨ͠ݱɽn ͱ. [5] [6]. Silvia Noschese, Lothar Reichel, “A modified truncated singular value decomposition method for discrete illposed problems,” Numer. Linear Algebra Appl. 2014; 21: pp. 813–822. Robert Craig Schmidt, “The numerical solution of linear first kind Fredholm integral eqnarrays using an iterative method,” Iowa State University Digital Repository. 1987; pp. 73–81. Lloyd N. Trefethen, “Numerical Linear Algebra,” SIAM. 2007; pp. 414–415. Hong du, “Approximate solution of the Fredholm integral eqnarray of the first kind in a reproducing kernel Hilbert space,ʡɹ An International Journal of Rapid Publication 2008: 21, pp. 617–623. Martin Hanke,“A Taste of Inverse Problems Basic Theory and Examples,” SIAM. 2017; pp. 12-13,130–132. Paul Garrett: “Compact operators, Hilbert-Schmidt operators,” March 2012. pp. 2–3.. m, k ͷ͕ಛʹେ͖͘ͳ͍ͨΊɼ2 ͭͷํ๏ͱ࣮ߦ࣌ؒ ͕͔ͳΓͯ͘ɼແࢹͰ͖Δ΄ͲͰ͋Δɽ. 4.2 ྫ 2 ࣍ͷํఔࣜΛߟ͑Δɽ ⓒ 2018 Information Processing Society of Japan. 5.
(6) Vol.2018-HPC-163 No.4 2018/2/28. ใॲཧֶձڀݚใࠂ IPSJ SIG Technical Report. ද 1: ྫ 1 ͷ࣮ߦ݁Ռͷൺֱ m. k. ࠩ. ɹ૬ରࠩޡ. ࣮ߦ࣌ؒ (sec). ݹయతͳ Lanczos ๏ɹ. 10. 7. 2.5300 × 10−15. 2.7100 × 10−3. 0.2331s. मਖ਼ Lanczos ๏. 10. 6. 8.9763 × 10−16. 3.3327 × 10−10. 0.2030s. ද 2: ྫ 2 ͷ࣮ߦ݁Ռͷൺֱ m. k. ࠩ. ɹ૬ରࠩޡ. ࣮ߦ࣌ؒ (sec). ݹయతͳ Lanczos ๏ɹ. 7. 4. 9.5246 × 10−14. 2.5202 × 10−3. 0.1953s. मਖ਼ Lanczos ๏. 7. 4. 1.4434 × 10−14. 2.9982 × 10−10. 0.1667s. ද 3: ྫ 3 ͷ࣮ߦ݁Ռͷൺֱ m. k. ࠩ. ɹ૬ରࠩޡ. ࣮ߦ࣌ؒ (sec). ݹయతͳ Lanczos ๏ɹ. 2. 2. 3.2057 × 10−4. 1.8213 × 10−3. 0.1175s. मਖ਼ Lanczos ๏. 2. 2. 2.3977 × 10−15. 1.2275 × 10−15. 0.0766s. 2.5. 0.035 0.03. ×10-9. 2. 0.025 1.5 0.02 1. e(y). e(y). 0.015 0.01. 0.5. 0.005. 0. 0 -0.5. -0.005 -0.01. 0. 0.1. 0.2. 0.3. 0.4. 0.5. 0.6. 0.7. 0.8. 0.9. -1. 1. 0. 0.1. 0.2. 0.3. 0.4. 0.5. 0.6. 0.7. 0.8. 0.9. 1. y. y. (a) ݹయతͳ Lanczos ๏ʹΑΔղͷࠩޡ. (b) मਖ਼ Lanczos ๏ʹΑΔղͷࠩޡ. ਤ 1: ྫ 1 ͷ Lanczos ๏ʹΑΔղͷࠩޡࢉܭͷ݁Ռ 9. ×10. -3. ×10. 8. -10. 8 6 7 4. 6. e(y). e(y). 5 2. 4 0. 3 2. -2 1 0. 0. 0.1. 0.2. 0.3. 0.4. 0.5. 0.6. 0.7. 0.8. 0.9. -4. 1. 0. 0.1. 0.2. 0.3. 0.4. y. 0.5. 0.6. 0.7. 0.8. 0.9. 1. y. (a) ݹయతͳ Lanczos ๏ʹΑΔղͷࠩޡ. (b) मਖ਼ Lanczos ๏ʹΑΔղͷࠩޡ. ਤ 2: ྫ 2 ͷ Lanczos ๏ʹΑΔղͷࠩޡࢉܭͷ݁Ռ 4. ×10-3 8. ×10-15. 6. 3. 4. 2. 2 1. e(y). e(y). 0 0. -2 -4. -1. -6 -2 -8 -3 -4. -10. 0. 0.1. 0.2. 0.3. 0.4. 0.5. 0.6. 0.7. 0.8. 0.9. 1. y. (a) ݹయతͳ Lanczos ๏ʹΑΔղͷࠩޡ. -12. 0. 0.1. 0.2. 0.3. 0.4. 0.5. 0.6. 0.7. 0.8. 0.9. 1. y. (b) मਖ਼ Lanczos ๏ʹΑΔղͷࠩޡ. ਤ 3: ྫ 3 ͷ Lanczos ๏ʹΑΔղͷࠩޡࢉܭͷ݁Ռ. ⓒ 2018 Information Processing Society of Japan. 6.
(7)
関連したドキュメント
In solving equations in which the unknown was represented by a letter, students explicitly explored the concept of equation and used two solving methods.. The analysis of
In this paper, we we have illustrated how the modified recursive schemes 2.15 and 2.27 can be used to solve a class of doubly singular two-point boundary value problems 1.1 with Types
Existence of weak solution for volume preserving mean curvature flow via phase field method. 13:55〜14:40 Norbert
Namely, in [7] the equation (A) has been considered in the framework of regular variation, but only the case c = 0 in (1.4) has been considered, providing some asymptotic formulas
The objective of this paper is to apply the two-variable G /G, 1/G-expansion method to find the exact traveling wave solutions of the following nonlinear 11-dimensional KdV-
In recent years, singular second order ordinary differential equations with dependence on the first order derivative have been studied extensively, see for example [1-8] and
Abstract. Recently, the Riemann problem in the interior domain of a smooth Jordan curve was solved by transforming its boundary condition to a Fredholm integral equation of the
Based on these results, we first prove superconvergence at the collocation points for an in- tegral equation based on a single layer formulation that solves the exterior Neumann