کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
8901660 | 1631946 | 2019 | 21 صفحه PDF | دانلود رایگان |
عنوان انگلیسی مقاله ISI
Solving separable nonlinear least squares problems using the QR factorization
دانلود مقاله + سفارش ترجمه
دانلود مقاله ISI انگلیسی
رایگان برای ایرانیان
کلمات کلیدی
موضوعات مرتبط
مهندسی و علوم پایه
ریاضیات
ریاضیات کاربردی
پیش نمایش صفحه اول مقاله
![عکس صفحه اول مقاله: Solving separable nonlinear least squares problems using the QR factorization Solving separable nonlinear least squares problems using the QR factorization](/preview/png/8901660.png)
چکیده انگلیسی
We present a method for solving the separable nonlinear least squares problem miny,zâF(y,z)â, where F(y,z)â¡A(y)z+b(y) with a full rank matrix A(y)âR(N+â)ÃN, yâRn, zâRN and the vector b(y)âRN+â, with small ââ¥n. We show how this problem can be reduced to a smaller equivalent problem minyâf(y)â where the function f has only â components. The reduction technique is based on the existence of a locally differentiable orthonormal basis for the nullspace of AT(y). We use Newton's method to solve the reduced problem. We show that successive iteration points are independent of the nullspace basis used at any particular iteration point; thus the QR factorization can be used to provide a local basis at each iteration. We show that the first and second derivative terms that arise are easily computed, so quadratic convergence is obtainable even for nonzero residual problems. For the class of problems with N much greater than n and â the main cost per iteration of the method is one QR factorization of A(y). We provide a detailed algorithm and some numerical examples to illustrate the technique.
ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Journal of Computational and Applied Mathematics - Volume 345, 1 January 2019, Pages 48-58
Journal: Journal of Computational and Applied Mathematics - Volume 345, 1 January 2019, Pages 48-58
نویسندگان
Yunqiu Shen, Tjalling J. Ypma,