• Journal of applied mathematics & informatics
• /
• v.5 no.3
• /
• pp.849-857
• /
• 1998

In this paper we have a concern on the Moore-Penrose inverse of two kinds of partitioned matrices of the form [V X] and [{{{{ {V atop {X} {{{{ {X atop { 0} }}] where V is symmetric. The Moore-Penrose inverse of the partitioned matrices can be reduced to be simpler forms according to some algebraic conditions. Firstly we investigate the representations of the Moore-Penrose inverses of the partitioned matrices under four al-gebraic conditions. Each condition reduces the Moore-Penrose inverses of the partitioned matrices under four al-gebraic conditions. Each condition reduces the Morre-Penrose inverse into some simpler form. Also equivalant conditions will be considered. Finally we will perform a simulation study to investigate which con-dition is the most important in the sense that which condition occurs the most frequently in the real situation. The simluation study will show us a particular condition occurs the most likely tha other conditions. This fact enables us to obtain the Morre-Penrose inverse with less computational efforts and computational storage.

• Journal of the Korean Mathematical Society
• /
• v.46 no.6
• /
• pp.1139-1150
• /
• 2009

We obtain necessary and sufficient conditions for $2{\tims}2$ block operator valued matrices to be Moore-Penrose (MP) invertible and give new representations of such MP inverses in terms of the individual blocks.

• Journal of applied mathematics & informatics
• /
• v.32 no.1_2
• /
• pp.171-184
• /
• 2014

A higher order iterative method to compute the Moore-Penrose inverses of arbitrary matrices using only the Penrose equation (ii) is developed by extending the iterative method described in [1]. Convergence properties as well as the error estimates of the method are studied. The efficacy of the method is demonstrated by working out four numerical examples, two involving a full rank matrix and an ill-conditioned Hilbert matrix, whereas, the other two involving randomly generated full rank and rank deficient matrices. The performance measures are the number of iterations and CPU time in seconds used by the method. It is observed that the number of iterations always decreases as expected and the CPU time first decreases gradually and then increases with the increase of the order of the method for all examples considered.

• Journal of the Korean Mathematical Society
• /
• v.47 no.4
• /
• pp.831-843
• /
• 2010

Let $\cal{H}$ and $\cal{K}$ be Hilbert spaces and let T, $\tilde{T}$ = T + ${\delta}T$ be bounded operators from $\cal{H}$ into $\cal{K}$. In this article, two facts related to the perturbation bounds are studied. The first one is to find the upper bound of $\parallel\tilde{T}^+\;-\;T^+\parallel$ which extends the results obtained by the second author and enriches the perturbation theory for the Moore-Penrose inverse. The other one is to develop explicit representations of projectors $\parallel\tilde{T}\tilde{T}^+\;-\;TT^+\parallel$ and $\parallel\tilde{T}^+\tilde{T}\;-\;T^+T\parallel$. In addition, some spectral cases related to these results are analyzed.

• Journal of applied mathematics & informatics
• /
• v.22 no.1_2
• /
• pp.95-112
• /
• 2006

In this paper, the authors investigate the condition number with their condition numbers for weighted Moore-Penrose inverse and weighted least squares solution of min /Ax - b/M, where A is a rank-deficient complex matrix in $C^{m{\times}n} $ and b a vector of length m in $C^m$, x a vector of length n in $C^n$. For the normwise condition number, the sensitivity of the relative condition number itself is studied, the componentwise perturbation is also investigated.

• Journal of applied mathematics & informatics
• /
• v.25 no.1_2
• /
• pp.407-413
• /
• 2007

In this paper, we definite a generalized weighted Moore-Penrose inverse $A^{+}_{M,N}$ of a given matrix A, and give the necessary and sufficient conditions for its existence. We also prove its uniqueness and give a representation of it. In the end we point out this generalized inverse is also a prescribed rang T and null space S of {2}-(or outer) inverse of A.

• Journal of the Chungcheong Mathematical Society
• /
• v.29 no.1
• /
• pp.137-150
• /
• 2016

We introduce a new approach that allows us to solve, algorithmically, the contractive completion problem. In this article, we provide concrete necessary and sufficient conditions for the existence of contractive completions of Hankel partial contractions of size $4{\times}4$ using a Moore-Penrose inverse of a matrix.

• Journal of applied mathematics & informatics
• /
• v.24 no.1_2
• /
• pp.81-94
• /
• 2007

In this paper we investigate symbolic implementation of two modifications of the Leverrier-Faddeev algorithm, which are applicable in computation of the Moore-Penrose and the Drazin inverse of rational matrices. We introduce an algorithm for computation of the Drazin inverse of rational matrices. This algorithm represents an extension of the papers [11] and [14]. and a continuation of the papers [15, 16]. The symbolic implementation of these algorithms in the package MATHEMATICA is developed. A few matrix equations are solved by means of the Drazin inverse and the Moore-Penrose inverse of rational matrices.

• Journal of The Korean Association of Information Education
• /
• v.15 no.3
• /
• pp.517-524
• /
• 2011

This paper presents a fast blind deconvolution method that produces a deblurring result from a single image in only a few seconds. The high speed of our method is enabled by considering the Discrete Fourier Transform (DFT), and its relation to filtering and convolution, and fast computation of Moore-Penrose inverse matrix. How can we predict the behavior of an arbitrary filter, or even more to the point design a filter to achieve certain specifications. The idea is to study the frequency response of the filter. This concept leads to an useful convolution formula. A Matlab implementation of our method usually takes less than one minute to deblur an image of moderate size, while the deblurring quality is comparable.

• Computational Structural Engineering
• /
• v.11 no.1
• /
• pp.217-226
• /
• 1998

The purpose of this study is to develop a technique for the shape analysis of plane truss structures under prescribed displacement modes. The shape analysis is performed based on the existence theorem of the solution and the Moore-Penrose generalized inverse matrix. In this paper, the homologous deformation of structures was proposed as prescribed displacement modes, the shape of the structure is determined from these various modes and applied loads. In general, the shape analysis is a kind of inverse problem different from stress analysis, and the governing equation becomes nonlinear. In this regard, Newton-Raphson method was used to solve the nonlinear equation. Three different shape models are investigated as numerical examples to show the accuracy and the effectiveness of the proposed method.