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

• Proceedings of the KSME Conference
• /
• 2000.04b
• /
• pp.144-147
• /
• 2000

A numerical method for the solution of one-dimensional inverse heat conduction problem is established and its performance is demonstrated with computational results. The present work introduces the maximum entropy method in order to build a robust formulation of the inverse problem. The maximum entropy method finds the solution that maximizes the entropy functional under given temperature measurement. The philosophy of the method is to seek the most likely inverse solution. The maximum entropy method converts the inverse problem to a non-linear constrained optimization problem of which constraint is the statistical consistency between the measured temperature and the estimated temperature. The successive quadratic programming facilitates the maximum entropy estimation. The gradient required fur the optimization procedure is provided by solving the adjoint problem. The characteristic feature of the maximum entropy method is discussed with the illustrated results. The presented results show considerable resolution enhancement and bias reduction in comparison with the conventional methods.

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

• Journal of applied mathematics & informatics
• /
• v.40 no.3_4
• /
• pp.765-767
• /
• 2022

The inverse Galois problem concerns whether or not every finite group appears as the Galois group of some Galois extension of the rational numbers. This problem, first posed in the early 19th century, is unsolved. In other words, we consider a pair - the group G and the field K. The question is whether there is an extension field L of K such that G is the Galois group of L. In this paper we present the proof that any group G is a Galois group of any field extension. In other words, we only consider the group G. And we present the solution to the inverse Galois problem.

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

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

• The Journal of the Acoustical Society of Korea
• /
• v.23 no.1E
• /
• pp.3-9
• /
• 2004

An important inverse problem in the field of acoustics is that of reconstructing the strengths of a number of sources given a model of transmission paths from the sources to a number of sensors at which measurements are made. In dealing with this kind of the acoustical inverse problem, strengths of the discretised source distribution can be simply deduced from the measured pressure field data and the inversion of corresponding matrix of frequency response functions. However, deducing :he solution of such problems is not straightforward due to the practical difficulty caused by their inherent ill-conditioned behaviour. Therefore, in order to overcome this difficulty associated with the ill-conditioning, the problem is replaced by a nearby well-conditioned problem whose solution approximates the required solution. In this paper a microphone array are identified for which the inverse problem is optimally conditioned, which can be robust to contaminating errors. This involves sampling both source and field in a manner which results in the discrete pressures and source strengths constituting a discrete Fourier transform pair.

• Journal of Electrical Engineering and Technology
• /
• v.4 no.3
• /
• pp.365-369
• /
• 2009

Identification is considered to be among the main applications of inverse theory and its objective for a given physical system is to use data which is easily observable, to infer some of the geometric parameters which are not directly observable. In this paper, a parameter identification method using inverse problem methodology is proposed. The minimisation of the objective function with respect to the desired vector of design parameters is the most important procedure in solving the inverse problem. The conjugate gradient method is used to determine the unknown parameters, and Tikhonov's regularization method is then used to replace the original ill-posed problem with a well-posed problem. The simulation and experimental results are presented and compared.

• Transactions of the Korean Society for Noise and Vibration Engineering
• /
• v.11 no.9
• /
• pp.431-438
• /
• 2001

This paper present experimental results of source identification for non-minimum phase system. Generally, a causal linear system may be described by matrix form. The inverse problem is considered as a matrix inversion. Direct inverse method can\`t be applied for a non-minimum phase system, the reason is that the system has ill-conditioning. Therefore, in this study to execute an effective inversion, SVD inverse technique is introduced. In a Non-minimum phase system, its system matrix may be singular or near-singular and has one more very small singular values. These very small singular values have information about a phase of the system and ill-conditioning. Using this property we could solve the ill-conditioned problem of the system and then verified it for the practical system(cantilever beam). The experimental results show that SVD inverse technique works well for non-minimum phase system.

• Journal of the Korean Society for Industrial and Applied Mathematics
• /
• v.12 no.3
• /
• pp.191-199
• /
• 2008

This paper proposes a new method for the inverse problem of the three-dimensional reconstruction of the electrical activity of the brain from electroencephalography (EEG). Compared to conventional direct methods using additional parameters, the proposed approach solves the EEG inverse problem iteratively without any parameter. We describe the Lagrangian corresponding to the minimization problem and suggest the numerical inverse algorithm. The restriction of influence space and the lead field matrix reduce the computational cost in this approach. The reconstructed divergence of primary current converges to a reasonable distribution for three dimensional sphere head model.