• Journal of applied mathematics & informatics
• /
• v.23 no.1_2
• /
• pp.113-126
• /
• 2007

Let A and E be $m{\times}n$ matrices and W an $n{\times}m$ matrix, and let $A_{d,w}$ denote the W-weighted Drazin inverse of A. In this paper, a new representation of the W-weighted Drazin inverse of A is given. Some new properties for the W-weighted Drazin inverse $A_{d,w}\;and\;B_{d,w}$ are investigated, where B=A+E. In addition, the Banach-type perturbation theorem for the W-weighted Drazin inverse of A and B are established, and the perturbation bounds for ${\parallel}B_{d,w}{\parallel}\;and\;{\parallel}B_{d,w}-A_{d,w}{\parallel}/{\parallel}A_{d,w}{\parallel}$ are also presented. When A and B are square matrices and W is identity matrix, some known results in the literature related to the Drazin inverse and the group inverse are directly reduced by the results in this paper as special cases.

• Communications of the Korean Mathematical Society
• /
• v.23 no.1
• /
• pp.29-40
• /
• 2008

Here, some classes of regular order semigroups are discussed. We shall consider that the problems of the existences of (multiplicative) inverse $^{\delta}po$-transversals for such classes of po-semigroups and obtain the following main results: (1) Giving the equivalent conditions of the existence of inverse $^{\delta}po$-transversals for regular order semigroups (2) showing the order orthodox semigroups with biggest inverses have necessarily a weakly multiplicative inverse $^{\delta}po$-transversal. (3) If the Green's relation $\cal{R}$ and $\cal{L}$ are strongly regular (see. sec.1), then any principally ordered regular semigroup (resp. ordered regular semigroup with biggest inverses) has necessarily a multiplicative inverse $^{\delta}po$-transversal. (4) Giving the structure theorem of principally ordered semigroups (resp. ordered regular semigroups with biggest inverses) on which $\cal{R}$ and $\cal{L}$ are strongly regular.

• Journal of applied mathematics & informatics
• /
• v.27 no.1_2
• /
• pp.267-273
• /
• 2009

A representation for the Drazin inverse of an arbitrary square matrix in terms of the eigenprojection was established by Rothblum [SIAM J. Appl. Math., 31(1976) :646-648]. In this paper perturbation results based on the representation for the Darzin inverse $A^D\;=\;(A-X)^{-1}(I-X)$ are developed. Norm estimates of $\parallel(A+E)^D-A^D\parallel_2/\parallel A^D\parallel_2$ and $\parallel(A+E)^#-A^D\parallel_2/\parallel A^D\parallel_2$ are derived when IIEI12 is small.

• Journal of the Korean Mathematical Society
• /
• v.45 no.6
• /
• pp.1505-1521
• /
• 2008

In this paper, we give a characterization of the structurally stable vector fields via the notion of orbital inverse shadowing. More precisely, it is proved that the $C^1$ interior of the set of $C^1$ vector fields with the orbital inverse shadowing property coincides with the set of structurally stable vector fields. This fact improves the main result obtained by K. Moriyasu et al. in [15].

• Journal of the Korean Mathematical Society
• /
• v.43 no.1
• /
• pp.87-98
• /
• 2006

In this paper, a class of constrained inverse eigenvalue problem for antisymmetric matrices and their optimal approximation problem are considered. Some sufficient and necessary conditions of the solvability for the inverse eigenvalue problem are given. A general representation of the solution is presented for a solvable case. Furthermore, an expression of the solution for the optimal approximation problem is given.

• Management Science and Financial Engineering
• /
• v.19 no.1
• /
• pp.25-28
• /
• 2013

Consider the inverse bin-packing number problem. Given a set of items and a prescribed number K of bins, the inverse bin-packing number problem, IBPN for short, is concerned with determining the minimum perturbation to the item-size vector so that all the items can be packed into K bins or less. It is known that this problem is NP-hard (Chung, 2012). In this paper, we investigate some special cases of IBPN that can be solved in polynomial time. We propose an optimal algorithm for solving the IBPN instances with two distinct item sizes and the instances with large items.

• Journal of applied mathematics & informatics
• /
• v.28 no.1_2
• /
• pp.283-293
• /
• 2010

In this paper, inverse constrained minimum spanning tree problem under Hamming distance. Such an inverse problem is to modify the weights with bound constrains so that a given feasible solution becomes an optimal solution, and the deviation of the weights, measured by the weighted Hamming distance, is minimum. We present a strongly polynomial time algorithm to solve the inverse constrained minimum spanning tree problem under Hamming distance.

• School Mathematics
• /
• v.9 no.1
• /
• pp.13-28
• /
• 2007

Division of fractions can be categorized as measurement division, partitive or sharing division, the inverse of multiplication, and the inverse of Cartesian product. Division algorithm for fractions has been interpreted with manipulative aids or models mainly in the contexts of measurement division and partitive division. On the contrary, there are few interpretations for the context of the inverse of a Cartesian product. In this paper the significance and the limits of existing interpretations of division of fractions in the context of the inverse of a Cartesian product were discussed. And some new easier interpretations of division algorithm in the context of a Cartesian product are developed. The problem to determine the length of a rectangle where the area and the width of it are known can be solved by various approaches: making the width of a rectangle be equal to one, making the width of a rectangle be equal to some natural number, making the area of a rectangle be equal to 1. These approaches may help students to understand the meaning of division of fractions and the meaning of the inverse of the divisor. These approaches make the inverse of a Cartesian product have many merits as an introductory context of division algorithm for fractions.

• Management Science and Financial Engineering
• /
• v.20 no.1
• /
• pp.17-19
• /
• 2014

In this paper, we consider an interesting variant of the inverse minimum traveling salesman problem. Given an instance (G, w) of the minimum traveling salesman problem defined on a metric space, we fix a specified Hamiltonian cycle $HC_0$. The task is then to adjust the edge cost vector w to w' so that the new cost vector w' satisfies the triangle inequality condition and $HC_0$ can be returned by the minimum spanning tree algorithm in the TSP-instance defined with w'. The objective is to minimize the total deviation between the original and the new cost vectors with respect to the $L_1$-norm. We call this problem the inverse metric traveling salesman problem against the minimum spanning tree algorithm and show that it is closely related to the inverse metric spanning tree problem.

• Journal of applied mathematics & informatics
• /
• v.11 no.1_2
• /
• pp.155-164
• /
• 2003

The existence and representations of some generalized inverses, including ${A_{T,*}}^{(2)},\;{A_{T,*}}^{(1,2)},\;{A_{T,*}}^{(2,3)},\;{A_{*,S}}^{(2)},\;{A_{*,S}}^{(1,2)}\;and\;{A_{*,S}}^{(2,4)}$, are showed. As applications, the perturbation theory for the generalized inverse {A_{T,S}}^{(2)} and the perturbation bound for unique solution of the general restricted system $A_{x}$ = b(dim(AT)=dimT, $b{\in}AT$ and $x{\in}T$) are studied. Moreover, a characterization and representation of the generalized inverse ${A_{T,*}}^{(2)}$ is obtained.