tailieunhanh - Numerical_Methods for Nonlinear Variable Problems Episode 5

Tham khảo tài liệu 'numerical_methods for nonlinear variable problems episode 5', kỹ thuật - công nghệ, cơ khí - chế tạo máy phục vụ nhu cầu học tập, nghiên cứu và làm việc hiệu quả | 3. Relaxation Methods for Convex Functionals Finite-Dimensional Case 147 Since u is the solution of and II 11 e K we have cf. J o u u l Ù 4- J u 1 J Au 0 which combined with implies Jó u 1 u l - u Ji w 1 - Ji u ổM u 1 - nil . Relation implies J o u 1 un 1 - u J1 u 1 Ji u i Í 1 uVị dVị N AJ E - ui ji 1 -ji Ui j ỖMW i-u where ũ 1 w 1 . u 1 ti 1 . . Since UịeKí it follows from that V i 1 . N ứl 1 uĩ 1 - H. jM - jfa 0. ÕVị Therefore and show that E - 1 m 1 - Mll n 1 - D- 3-36 ÕVị OVi Since 1 ũ 1II IIun 1 u it follows from that V i 1 . IV we have lim m 1 1 0. n- co Since J o 6 C Riv J o is uniformly continuous on the bounded subsets of R v. This property combined with implies V i 1 . N lim n 00 CVi OV 0. Therefore from and the properties of 0M it follows that lim II w u 0 which completes the proof of the theorem. . Various remarks Remark . We assume that K nF and that J Jo . Jj 0 where Jo v Ỉ ĂV v b v where b 6 IR V and A is an N X N symmetrical positive-definite matrix. 148 V Relaxation Methods and Applications The problem associated with this choice of J and K obviously has an unique solution characterized cf. by Au b. If we apply the algorithm to this particular case we obtain u 6 arbitrarily given lt 1 bi - 1 _ a Ju 1 N- 3-41 flii j i j i The algorithm is known as the Gauss-Seidel method for solving see . Varga 1 and D. Young 1 . Therefore when A is symmetric and positive definite optimization theory yields another proof of the convergence of the Gauss-Seidel method through Theorem . Remark . From the above remark it follows that the introduction of over-or under-relaxation parameters could be effective for increasing the speed of convergence. This possibility will be discussed in the sequel of this chapter. Let F V - R. We define D F r re V F r oo . If F is convex and proper then D F is a nonempty convex subset of V. .

TỪ KHÓA LIÊN QUAN
crossorigin="anonymous">
Đã phát hiện trình chặn quảng cáo AdBlock
Trang web này phụ thuộc vào doanh thu từ số lần hiển thị quảng cáo để tồn tại. Vui lòng tắt trình chặn quảng cáo của bạn hoặc tạm dừng tính năng chặn quảng cáo cho trang web này.