A Matrix Iteration for Finding Drazin Inverse with Ninth-Order Convergence

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Higher Order Iterative Method for Computing the Drazin Inverse

A method with high convergence rate for finding approximate inverses of nonsingular matrices is suggested and established analytically. An extension of the introduced computational scheme to general square matrices is defined. The extended method could be used for finding the Drazin inverse. The application of the scheme on large sparse test matrices alongside the use in preconditioning of line...

متن کامل

A STABLE COUPLED NEWTON'S ITERATION FOR THE MATRIX INVERSE $P$-TH ROOT

The computation of the inverse roots of matrices arises in evaluating non-symmetriceigenvalue problems, solving nonlinear matrix equations, computing some matrixfunctions, control theory and several other areas of applications. It is possible toapproximate the matrix inverse pth roots by exploiting a specialized version of New-ton's method, but previous researchers have mentioned that some iter...

متن کامل

Representations for the Drazin inverse of block matrix∗

In this paper we offer new representations for Drazin inverse of block matrix, which recover some representations from current literature on this subject. 2000 Mathematics Subject Classification: 15A09

متن کامل

Block representations of the Drazin inverse of a bipartite matrix

Block representations of the Drazin inverse of a bipartite matrix A = 2 4 0 B C 0 3 5 in terms of the Drazin inverse of the smaller order block product BC or CB are presented. Relationships between the index of A and the index of BC are determined, and examples are given to illustrate all such possible relationships.

متن کامل

A Geometric Theory for Preconditioned Inverse Iteration Ii: Convergence Estimates

The topic of this paper is a convergence analysis of preconditioned inverse iteration (PINVIT). A sharp estimate for the eigenvalue approximations is derived; the eigenvector approximations are controlled by an upper bound for the residual vector. The analysis is mainly based on extremal properties of various quantities which define the geometry of PINVIT.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Abstract and Applied Analysis

سال: 2014

ISSN: 1085-3375,1687-0409

DOI: 10.1155/2014/137486