Solving systems of nonlinear equations using the Lyapunov direct method
The paper is devoted to the issue of finding the value of the parameter \(k\) which guarantees the fastest convergence of the steepest descent method \(x_{k+1}=x_ k-k J^ T_ k f_ k\), \(k>0\), for solving a system of algebraic or transcendental equations of the form: (1) \(f(x)=0\). The author shows the way of a direct Lyapunov method to this problem and presents a broad list of Lyapunov functions which are suitable to some of the forms of the system (1). Numerical examples are presented with estimates of the convergence rate and time evolution.
- scientific article; zbMATH DE number 150474
- On the numerical resolution of the systems of nonlinear equations using a descent like-method
- Convergence of algorithms in optimization and solutions of nonlinear equations
- Parametric lyapunov function method for solving nonlinear systems in hilbert spaces
- scientific article; zbMATH DE number 150474 (Why is no real title available?)
- scientific article; zbMATH DE number 2064214 (Why is no real title available?)
- On the numerical resolution of the systems of nonlinear equations using a descent like-method
- Convergence of algorithms in optimization and solutions of nonlinear equations
- Use of high-gain observers in the inverse kinematic problem
This page was built for publication: Solving systems of nonlinear equations using the Lyapunov direct method
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1173902)