کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
4628451 | 1631830 | 2013 | 10 صفحه PDF | دانلود رایگان |
عنوان انگلیسی مقاله ISI
The steepest descent algorithm without line search for p-Laplacian
دانلود مقاله + سفارش ترجمه
دانلود مقاله ISI انگلیسی
رایگان برای ایرانیان
کلمات کلیدی
موضوعات مرتبط
مهندسی و علوم پایه
ریاضیات
ریاضیات کاربردی
پیش نمایش صفحه اول مقاله
چکیده انگلیسی
In this paper, the steepest descent algorithm without line search is proposed for p-Laplacian. Its search direction is the weighted preconditioned steepest descent one, and step length is estimated by a formula except the first iteration. Continuation method is applied for solving the p-Laplacian with very large p. Lots of numerical experiments are carried out on these algorithms. All numerical results show the algorithm without line search can cut down some computational time. Fast convergence of these new algorithms is displayed by their step length figures. These figures show that if search direction is the steepest descent one, exact step lengths can be substituted properly with step lengths obtained by the formula.
ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Applied Mathematics and Computation - Volume 224, 1 November 2013, Pages 36–45
Journal: Applied Mathematics and Computation - Volume 224, 1 November 2013, Pages 36–45
نویسندگان
Guangming Zhou, Chunsheng Feng,