Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
6891796 | Computers & Mathematics with Applications | 2018 | 17 Pages |
Abstract
In this paper we consider a family of high-order iterative methods which is more efficient than the Newton method to approximate a solution of symmetric algebraic Riccati equations. In fact, this paper is devoted to the convergence study of a k-steps iterative scheme with low operational cost and high order of convergence. We analyze their accessibility and computational efficiency. We also obtain results about the existence and localization of solution. Numerical experiments confirm the advantageous performance of the iterative scheme analyzed.
Related Topics
Physical Sciences and Engineering
Computer Science
Computer Science (General)
Authors
M.A. Hernández-Verón, N. Romero,