• 제목/요약/키워드: Partial Inverse Problem

검색결과 21건 처리시간 0.021초

Partial Inverse Traveling Salesman Problems on the Line

  • Chung, Yerim;Park, Myoung-Ju
    • 한국컴퓨터정보학회논문지
    • /
    • 제24권11호
    • /
    • pp.119-126
    • /
    • 2019
  • 부분역최적화는 역최적화의 흥미로운 변형으로, 주어진 최적화문제와 그 문제의 부분해가 주어지면 이 부분해가 최적해에 포함되도록 문제를 최소한으로 수정하는 문제이다. 이 논문은 라인위에서 정의되는 순환외판원문제(TSP)를 다루는데, 이는 배달시스템, 창고 선반에서 물건을 수집하는 것, 등의 많은 응용을 가진다. 라인 위에서 위치하는 n개의 일이 주어지고 이 중 연속적으로 처리해야하는 일 k개가 부분적으로 주어진다. 각각의 일은 라인 위의 특정 장소에 위치하고 라인을 움직이는 서버에 의해 처리되어야 한다. 우리의 임무는 k개의 일이 최적해에서 연속적으로 처리되도록 n개의 일의 위치를 라인 위에서 최소한으로 조정하는 것이다. 이 논문에서 이 문제와 이 문제의 다양한 변종을 다항시간 내에 푸는 알고리즘을 개발한다. 구체적으로, 서버가 특정한 Forward Trip이라는 특정한 내부 알고리즘을 사용하는 경우와 일반적인 최적 알고리즘을 사용하는 경우에 대한 부분역최적화를 다룬다.

COMPLETIONS OF HANKEL PARTIAL CONTRACTIONS OF SIZE 5×5 NON-EXTREMAL CASE

  • Lee, Sang Hoon
    • 충청수학회지
    • /
    • 제29권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.

THE FAULTY RESISTOR PROBLEMS AND THE INVERSE SOURCE PROBLEMS FOR RECTANGULAR ELECTRICAL NETWORKS

  • Mun, Young-Hun
    • 대한수학회논문집
    • /
    • 제24권3호
    • /
    • pp.467-479
    • /
    • 2009
  • This paper ultimately aims to develop noninvasive techniques to identify the inside of a given electrical network. Based on the theory of the partial differentiation equations and mathematical modeling, this paper devises the algorithms to find the locations of possible abnormalities. To ensure the certainty of the algorithms, this study restricted the forms of the network and the number of abnormalities, rendering it easy to prove the uniqueness of the position of the abnormalities.

COMPLETION OF HANKEL PARTIAL CONTRACTIONS OF NON-EXTREMAL TYPE

  • KIM, IN HYOUN;YOO, SEONGUK;YOON, JASANG
    • 대한수학회지
    • /
    • 제52권5호
    • /
    • pp.1003-1021
    • /
    • 2015
  • A matrix completion problem has been exploited amply because of its abundant applications and the analysis of contractions enables us to have insight into structure and space of operators. In this article, we focus on a specific completion problem related to Hankel partial contractions. We provide concrete necessary and sufficient conditions for the existence of completion of Hankel partial contractions for both extremal and non-extremal types with lower dimensional matrices. Moreover, we give a negative answer for the conjecture presented in [8]. For our results, we use several tools such as the Nested Determinants Test (or Choleski's Algorithm), the Moore-Penrose inverse, the Schur product techniques, and a congruence of two positive semi-definite matrices; all these suggest an algorithmic approach to solve the contractive completion problem for general Hankel matrices of size $n{\times}n$ in both types.

Inverse Eigenvalue Problems with Partial Eigen Data for Acyclic Matrices whose Graph is a Broom

  • Sharma, Debashish;Sen, Mausumi
    • Kyungpook Mathematical Journal
    • /
    • 제57권2호
    • /
    • pp.211-222
    • /
    • 2017
  • In this paper, we consider three inverse eigenvalue problems for a special type of acyclic matrices. The acyclic matrices considered in this paper are described by a graph called a broom on n + m vertices, which is obtained by joining m pendant edges to one of the terminal vertices of a path on n vertices. The problems require the reconstruction of such a matrix from given partial eigen data. The eigen data for the first problem consists of the largest eigenvalue of each of the leading principal submatrices of the required matrix, while for the second problem it consists of an eigenvalue of each of its trailing principal submatrices. The third problem has an eigenvalue and a corresponding eigenvector of the required matrix as the eigen data. The method of solution involves the use of recurrence relations among the leading/trailing principal minors of ${\lambda}I-A$, where A is the required matrix. We derive the necessary and sufficient conditions for the solutions of these problems. The constructive nature of the proofs also provides the algorithms for computing the required entries of the matrix. We also provide some numerical examples to show the applicability of our results.

An inverse determination method for strain rate and temperature dependent constitutive model of elastoplastic materials

  • Li, Xin;Zhang, Chao;Wu, Zhangming
    • Structural Engineering and Mechanics
    • /
    • 제80권5호
    • /
    • pp.539-551
    • /
    • 2021
  • With the continuous increase of computational capacity, more and more complex nonlinear elastoplastic constitutive models were developed to study the mechanical behavior of elastoplastic materials. These constitutive models generally contain a large amount of physical and phenomenological parameters, which often require a large amount of computational costs to determine. In this paper, an inverse parameter determination method is proposed to identify the constitutive parameters of elastoplastic materials, with the consideration of both strain rate effect and temperature effect. To carry out an efficient design, a hybrid optimization algorithm that combines the genetic algorithm and the Nelder-Mead simplex algorithm is proposed and developed. The proposed inverse method was employed to determine the parameters for an elasto-viscoplastic constitutive model and Johnson-cook model, which demonstrates the capability of this method in considering strain rate and temperature effect, simultaneously. This hybrid optimization algorithm shows a better accuracy and efficiency than using a single algorithm. Finally, the predictability analysis using partial experimental data is completed to further demonstrate the feasibility of the proposed method.

LEAST-SQUARES SPECTRAL COLLOCATION PARALLEL METHODS FOR PARABOLIC PROBLEMS

  • SEO, JEONG-KWEON;SHIN, BYEONG-CHUN
    • 호남수학학술지
    • /
    • 제37권3호
    • /
    • pp.299-315
    • /
    • 2015
  • In this paper, we study the first-order system least-squares (FOSLS) spectral method for parabolic partial differential equations. There were lots of least-squares approaches to solve elliptic partial differential equations using finite element approximation. Also, some approaches using spectral methods have been studied in recent. In order to solve the parabolic partial differential equations in parallel, we consider a parallel numerical method based on a hybrid method of the frequency-domain method and first-order system least-squares method. First, we transform the parabolic problem in the space-time domain to the elliptic problems in the space-frequency domain. Second, we solve each elliptic problem in parallel for some frequencies using the first-order system least-squares method. And then we take the discrete inverse Fourier transforms in order to obtain the approximate solution in the space-time domain. We will introduce such a hybrid method and then present a numerical experiment.

1차원 유한요소망 연속기법을 이용한 시간영역 탄성파의 역해석 (Time-domain Elastic Full-waveform Inversion Using One-dimensional Mesh Continuation Scheme)

  • 강준원
    • 한국전산구조공학회논문집
    • /
    • 제26권4호
    • /
    • pp.213-221
    • /
    • 2013
  • 이 논문에서는 반무한 고체영역의 표면에서 측정한 변위응답의 시간이력으로부터 유한요소망 연속기법을 이용해 탄성파 속도의 공간적 분포를 추정하는 역해석 문제를 소개한다. 반무한 영역에서의 역해석을 위해서는 해석 대상이 되는 유한영역의 경계에서 파동의 반사가 일어나지 않도록 하는 것이 중요하다. 이를 위해 유한영역의 경계면에 perfectly-matchedlayers(PMLs)라는 수치적 파동흡수층을 도입하였고, PML을 경계로 하는 유한영역에서 역해석 문제를 정의하였다. 이 문제를 탄성파동방정식을 구속조건으로 하는 최적화 문제로 표현하였으며, 라그랑주 승수법에 기초한 비구속 최적화 기법에 의해 탄성파속도의 최적 분포를 결정하였다. 해의 정확도와 수렴성을 높이기 위해 유한요소망 연속기법을 도입하여 점진적으로 밀도가 증가하는 유한요소망에 대해 연속적으로 역해석을 수행하였다. 1차원 예제들을 통해 유한요소망 연속기법을 이용한 역해석으로부터 탄성파속도의 분포를 정확히 추정할 수 있음을 확인하였으며, 측정 응답에 노이즈가 존재하는 경우에도 제안한 역해석 기법은 목표 탄성파속도 분포에 근사한 결과를 도출하였다.

DISCRETE EVOLUTION EQUATIONS ON NETWORKS AND A UNIQUE IDENTIFIABILITY OF THEIR WEIGHTS

  • Chung, Soon-Yeong
    • 대한수학회지
    • /
    • 제53권5호
    • /
    • pp.1133-1148
    • /
    • 2016
  • In this paper, we first discuss a representation of solutions to the initial value problem and the initial-boundary value problem for discrete evolution equations $${\sum\limits^l_{n=0}}c_n{\partial}^n_tu(x,t)-{\rho}(x){\Delta}_{\omega}u(x,t)=H(x,t)$$, defined on networks, i.e. on weighted graphs. Secondly, we show that the weight of each link of networks can be uniquely identified by using their Dirichlet data and Neumann data on the boundary, under a monotonicity condition on their weights.

다수단 가변수요 통행배정문제를 위한 부분선형화 알고리즘의 성능비교 (A Performance Comparison of the Partial Linearization Algorithm for the Multi-Mode Variable Demand Traffic Assignment Problem)

  • 박태형;이상건
    • 대한산업공학회지
    • /
    • 제39권4호
    • /
    • pp.253-259
    • /
    • 2013
  • Investment scenarios in the transportation network design problem usually contain installation or expansion of multi-mode transportation links. When one applies the mode choice analysis and traffic assignment sequentially for each investment scenario, it is possible that the travel impedance used in the mode choice analysis is different from the user equilibrium cost of the traffic assignment step. Therefore, to estimate the travel impedance and mode choice accurately, one needs to develop a combined model for the mode choice and traffic assignment. In this paper, we derive the inverse demand and the excess demand functions for the multi-mode multinomial logit mode choice function and develop a combined model for the multi-mode variable demand traffic assignment problem. Using data from the regional O/D and network data provided by the KTDB, we compared the performance of the partial linearization algorithm with the Frank-Wolfe algorithm applied to the excess demand model and with the sequential heuristic procedures.