For satate form linear gram as Fang and sao deined and approach which would find an optimal solution by solving an anconstrained convex dual programming.Thedual
Let A and E be an n×n matrices and B=A+E. Denote the Drazin inverse of A by AD In this paper, we give an upper bound for the relative error ||BD-AD||/||AD|
In this note a simple iterative method for simultaneously finding all zeros of a polynomial is established.The method does not require repeated evaluation of th