A class of numerical algorithms for computing outer inverses

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

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

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

منابع مشابه

GCD-Free Algorithms for Computing Modular Inverses

This paper describes new algorithms for computing a modular inverse e−1 mod f given coprime integers e and f . Contrary to previously reported methods, we neither rely on the extended Euclidean algorithm, nor impose conditions on e or f . The main application of our gcd-free technique is the computation of an RSA private key in both standard and CRT modes based on simple modular arithmetic oper...

متن کامل

Successive matrix squaring algorithm for computing outer inverses

In this paper we derive a successive matrix squaring (SMS) algorithm to approximate an outer generalized inverse with prescribed range and null space of a given matrix A ∈ Cm×n r . We generalize the results from the papers [3], [16], [18], and obtain an algorithm for computing various classes of outer generalized inverses of A. Instead of particular matrices used in these articles, we use an ap...

متن کامل

Gauss-Jordan elimination method for computing outer inverses

This paper deals with the algorithm for computing outer inverse with prescribed range and null space, based on the choice of an appropriate matrix G and Gauss–Jordan elimination of the augmented matrix [G | I]. The advantage of such algorithms is the fact that one can compute various generalized inverses using the same procedure, for different input matrices. In particular, we derive representa...

متن کامل

A numerical algorithm for solving a class of matrix equations

In this paper, we present a numerical algorithm for solving matrix equations $(A otimes B)X = F$  by extending the well-known Gaussian elimination for $Ax = b$. The proposed algorithm has a high computational efficiency. Two numerical examples are provided to show the effectiveness of the proposed algorithm.

متن کامل

Numerical Algorithms for a Class of Matrix Norm Approximation Problems

This thesis focuses on designing robust and efficient algorithms for a class of matrix norm approximation (MNA) problems that are to find an affine combination of given matrices having the minimal spectral norm subject to some prescribed linear equality and inequality constraints. These problems arise often in numerical algebra, network, control, engineering and other areas, such as finding the...

متن کامل

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


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

ژورنال

عنوان ژورنال: Journal of Computational and Applied Mathematics

سال: 2014

ISSN: 0377-0427

DOI: 10.1016/j.cam.2013.12.033