• 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 applied mathematics & informatics
• /
• v.19 no.1_2
• /
• pp.297-310
• /
• 2005

The concept of the Moore-Penrose inverse in an indefinite inner product space is introduced. Extensions of some of the formulae in the Euclidean space to an indefinite inner product space are studied. In particular range-hermitianness is completely characterized. Equivalence of a weighted generalized inverse and the Moore-Penrose inverse is proved. Finally, methods of computing the Moore-Penrose inverse are presented.

• Bulletin of the Korean Mathematical Society
• /
• v.51 no.2
• /
• pp.501-510
• /
• 2014

We characterize hypergeneralized k-projectors (i.e., $A^k=A^{\dag}$). Also, some representation for the Moore-Penrose inverse of a linear combination of hypergeneralized k-projectors is found and the invertibility for some linear combinations of commuting hypergeneralized k-projectors is considered.

• Journal of the Korean Mathematical Society
• /
• v.57 no.3
• /
• pp.691-706
• /
• 2020

Necessary and sufficient conditions are provided under which the weighted Moore-Penrose inverse A^†_MN exists, where A is an adjointable operator between Hilbert C^⁎-modules, and the weights M and N are only self-adjoint and invertible. Relationship between weighted Moore-Penrose inverses A^†_MN is clarified when A is fixed, whereas M and N are variable. Perturbation analysis for the weighted Moore-Penrose inverse is also provided.

• 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 the Korean Mathematical Society
• /
• v.50 no.6
• /
• pp.1349-1367
• /
• 2013

The weighted Moore-Penrose inverse will be introduced and studied in the context of Banach algebras. In addition, weighted EP Banach algebra elements will be characterized. The Banach space operator case will be also considered.

• 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 Institute of Intelligent Systems
• /
• v.17 no.6
• /
• pp.807-812
• /
• 2007

Recently, Extreme learning machine(ELM), a novel learning algorithm which is much faster than conventional gradient-based learning algorithm, was proposed for single-hidden-layer feedforward neural networks. The initial input weights and hidden biases of ELM are usually randomly chosen, and the output weights are analytically determined by using Moore-Penrose(MP) generalized inverse. But it has the difficulties to choose initial input weights and hidden biases. In this paper, an advanced method using the bacterial foraging algorithm to adjust the input weights and hidden biases is proposed. Experiment at results show that this method can achieve better performance for problems having higher dimension than others.

• 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.