scholarly journals Iterative methods for computing generalized inverses related with optimization methods

2005 ◽  
Vol 78 (2) ◽  
pp. 257-272 ◽  
Author(s):  
Dragan S. Djordjević ◽  
Predrag S. Stanimirović
Keyword(s):  
Iterative Methods ◽  
Unconstrained Minimization ◽  
Optimization Methods ◽  
Second Order ◽  
Steepest Descent ◽  
Generalized Inverses ◽  
Minimization Methods ◽  
Second Order Methods

AbstractWe develop several iterative methods for computing generalized inverses using both first and second order optimization methods in C*-algebras. Known steepest descent iterative methods are generalized in C*-algebras. We introduce second order methods based on the minimization of the norms ‖Ax − b‖2 and ‖x‖2 by means of the known second order unconstrained minimization methods. We give several examples which illustrate our theory.

scholarly journals Generalized Inverses Estimations by Means of Iterative Methods with Memory

Mathematics ◽  
2019 ◽  
Vol 8 (1) ◽  
pp. 2
Author(s):  
Santiago Artidiello ◽  
Alicia Cordero ◽  
Juan R. Torregrosa ◽  
María P. Vassileva
Keyword(s):  
Iterative Methods ◽  
Generalized Inverses ◽  
Drazin Inverse ◽  
Nonsingular Matrix ◽  
Type Method ◽  
The Matrix ◽  
Nonlinear Matrix ◽  
First Time ◽  
With Memory ◽  
Theoretical Results

A secant-type method is designed for approximating the inverse and some generalized inverses of a complex matrix A. For a nonsingular matrix, the proposed method gives us an approximation of the inverse and, when the matrix is singular, an approximation of the Moore–Penrose inverse and Drazin inverse are obtained. The convergence and the order of convergence is presented in each case. Some numerical tests allowed us to confirm the theoretical results and to compare the performance of our method with other known ones. With these results, the iterative methods with memory appear for the first time for estimating the solution of a nonlinear matrix equations.

Sign in / Sign up

Export Citation Format

Share Document