Newtonian Methods in Nonlinear Problems (Informatics)
Type: For the student's choice
Department: computational mathematics
|Semester||Amount of hours||Lecturer||Group(s)|
|10||16||Associate Professor H. P. Yarmola||PMp-51m|
|Semester||Amount of hours||Group||Teacher(s)|
|10||16||PMp-51m||Associate Professor H. P. Yarmola|
In this course there are being studied: iterative-difference and iterative-parametric methods, methods for solving nonlinear operator equations, nonlinear least squares problems and unconstrained minimization problems, methods with the approximation of the inverse operators and methods with using internal linear iterations for solving nonlinear systems of equations. The global strategies for quasi-Newton iterative methods, linear algorithms for large systems, nonlinear algorithms focused on decreasing residual and error, inexact Newton methods and global methods of Gauss-Newton type for nonlinear least squares problems are being considered. Much attention is paid to the theoretical aspects of the methods, studying the convergence of methods, advanced modern algorithms and their implementation on computers.