• 제목/요약/키워드: homotopy

검색결과 204건 처리시간 0.023초

ANALYTICAL SOLUTION OF SINGULAR FOURTH ORDER PARABOLIC PARTIAL DIFFERENTIAL EQUATIONS OF VARIABLE COEFFICIENTS BY USING HOMOTOPY PERTURBATION TRANSFORM METHOD

  • Gupta, V.G.;Gupta, Sumit
    • Journal of applied mathematics & informatics
    • /
    • 제31권1_2호
    • /
    • pp.165-177
    • /
    • 2013
  • In this paper, we apply Homotopy perturbation transform method (HPTM) for solving singular fourth order parabolic partial differential equations with variable coefficients. This method is the combination of the Laplace transform method and Homotopy perturbation method. The nonlinear terms can be easily handled by the use of He's polynomials. The aim of using the Laplace transform is to overcome the deficiency that is mainly caused by unsatisfied conditions in other semi-analytical methods such as Homotopy perturbation method (HPM), Variational iteration method (VIM) and Adomain Decomposition method (ADM). The proposed scheme finds the solutions without any discretization or restrictive assumptions and avoids the round-off errors. The comparison shows a precise agreement between the results and introduces this method as an applicable one which it needs fewer computations and is much easier and more convenient than others, so it can be widely used in engineering too.

How to Compute the Smallest / Largest Eigenvalue of a Symmetric Matrix

  • Baik, Ran
    • Journal of the Korean Society for Industrial and Applied Mathematics
    • /
    • 제3권2호
    • /
    • pp.37-49
    • /
    • 1999
  • In this paper we develop a general Homotopy method called the Group Homotopy method to solve the symmetric eigenproblem. The Group Homotopy method overcomes notable drawbacks of the existing Homotopy method, namely, (i) the possibility of breakdown or having a slow rate of convergence in the presence of clustering of the eigenvalues and (ii) the absence of any definite criterion to choose a step size that guarantees the convergence of the method. On the other hand, We also have a good approximations of the largest eigenvalue of a Symmetric matrix from Lanczos algorithm. We apply it for the largest eigenproblem of a very large symmetric matrix with a good initial points.

  • PDF

A PROSET STRUCTURE INDUCED FROM HOMOTOPY CLASSES OF MAPS AND A CLASSIFICATION OF FIBRATIONS

  • Yamaguchi, Toshihiro;Yokura, Shoji
    • 대한수학회논문집
    • /
    • 제34권3호
    • /
    • pp.991-1004
    • /
    • 2019
  • Firstly we consider preorders (not necessarily partial orders) on a canonical quotient of the set of the homotopy classes of continuous maps between two spaces induced by a certain equivalence relation ${\sim}_{{\varepsilon}R}$. Secondly we apply it to a classification of orientable fibrations over Y with fibre X. In the classification theorem of J. Stasheff [22] and G. Allaud [3], they use the set $[Y,\;Baut_1X]$ of homotopy classes of continuous maps from Y to $Baut_1X$, which is the classifying space for fibrations with fibre X due to A. Dold and R. Lashof [11]. In this paper we give a classification of fibrations using a preordered set (abbr., proset) structure induced by $[Y,\;Baut_1X]_{{\varepsilon}R}:=[Y,\;Baut_1X]/{\sim}_{{\varepsilon}R}$.

REMARKS ON SIMPLY k-CONNECTIVITY AND k-DEFORMATION RETRACT IN DIGITAL TOPOLOGY

  • Han, Sang-Eon
    • 호남수학학술지
    • /
    • 제36권3호
    • /
    • pp.519-530
    • /
    • 2014
  • To study a deformation of a digital space from the viewpoint of digital homotopy theory, we have often used the notions of a weak k-deformation retract [20] and a strong k-deformation retract [10, 12, 13]. Thus the papers [10, 12, 13, 16] firstly developed the notion of a strong k-deformation retract which can play an important role in studying a homotopic thinning of a digital space. Besides, the paper [3] deals with a k-deformation retract and its homotopic property related to a digital fundamental group. Thus, as a survey article, comparing among a k-deformation retract in [3], a strong k-deformation retract in [10, 12, 13], a weak deformation k-retract in [20] and a digital k-homotopy equivalence [5, 24], we observe some relationships among them from the viewpoint of digital homotopy theory. Furthermore, the present paper deals with some parts of the preprint [10] which were not published in a journal (see Proposition 3.1). Finally, the present paper corrects Boxer's paper [3] as follows: even though the paper [3] referred to the notion of a digital homotopy equivalence (or a same k-homotopy type) which is a special kind of a k-deformation retract, we need to point out that the notion was already developed in [5] instead of [3] and further corrects the proof of Theorem 4.5 of Boxer's paper [3] (see the proof of Theorem 4.1 in the present paper). While the paper [4] refers some properties of a deck transformation group (or an automorphism group) of digital covering space without any citation, the study was early done by Han in his paper (see the paper [14]).

ON FACTORIZATIONS OF THE SUBGROUPS OF SELF-HOMOTOPY EQUIVALENCES

  • Shi, Yi-Yun;Zhao, Hao
    • 대한수학회지
    • /
    • 제45권4호
    • /
    • pp.1089-1100
    • /
    • 2008
  • For a pointed space X, the subgroups of self-homotopy equivalences $Aut_{\sharp}_N(X)$, $Aut_{\Omega}(X)$, $Aut_*(X)$ and $Aut_{\Sigma}(X)$ are considered, where $Aut_{\sharp}_N(X)$ is the group of all self-homotopy classes f of X such that $f_{\sharp}=id\;:\;{\pi_i}(X){\rightarrow}{\pi_i}(X)$ for all $i{\leq}N{\leq}{\infty}$, $Aut_{\Omega}(X)$ is the group of all the above f such that ${\Omega}f=id;\;Aut_*(X)$ is the group of all self-homotopy classes g of X such that $g_*=id\;:\;H_i(X){\rightarrow}H_i(X)$ for all $i{\leq}{\infty}$, $Aut_{\Sigma}(X)$ is the group of all the above g such that ${\Sigma}g=id$. We will prove that $Aut_{\Omega}(X_1{\times}\cdots{\times}X_n)$ has two factorizations similar to those of $Aut_{\sharp}_N(X_1{\times}\cdots{\times}\;X_n)$ in reference [10], and that $Aut_{\Sigma}(X_1{\vee}\cdots{\vee}X_n)$, $Aut_*(X_1{\vee}\cdots{\vee}X_n)$ also have factorizations being dual to the former two cases respectively.

시분할구간 호모토피 섭동법을 이용한 공간 트러스의 비선형 동적 해석 (Nonlinear Dynamic Analysis of Space Truss by Using Multistage Homotopy Perturbation Method)

  • 손수덕;하준홍;이승재
    • 한국소음진동공학회논문집
    • /
    • 제22권9호
    • /
    • pp.879-888
    • /
    • 2012
  • This study aims to apply multistage homotopy perturbation method(MHPM) to space truss composed of discrete members to obtain a semi-analytical solution. For the purpose of this research, a nonlinear governing equation of the structures is formulated in consideration of geometrical nonlinearity, and homotopy equation is derived. The result of carrying out dynamic analysis on a simple model is compared to a numerical method of 4th order Runge-Kutta method(RK4), and the dynamic response by MHPM concurs with the numerical result. Besides, the displacement response and attractor in the phase space is able to delineate dynamic snapping properties under step excitations and the responses of damped system are reflected well the reduction effect of the displacement.

KD-(k0, k1)-HOMOTOPY EQUIVALENCE AND ITS APPLICATIONS

  • Han, Sang-Eon
    • 대한수학회지
    • /
    • 제47권5호
    • /
    • pp.1031-1054
    • /
    • 2010
  • Let $\mathbb{Z}^n$ be the Cartesian product of the set of integers $\mathbb{Z}$ and let ($\mathbb{Z}$, T) and ($\mathbb{Z}^n$, $T^n$) be the Khalimsky line topology on $\mathbb{Z}$ and the Khalimsky product topology on $\mathbb{Z}^n$, respectively. Then for a set $X\;{\subset}\;\mathbb{Z}^n$, consider the subspace (X, $T^n_X$) induced from ($\mathbb{Z}^n$, $T^n$). Considering a k-adjacency on (X, $T^n_X$), we call it a (computer topological) space with k-adjacency and use the notation (X, k, $T^n_X$) := $X_{n,k}$. In this paper we introduce the notions of KD-($k_0$, $k_1$)-homotopy equivalence and KD-k-deformation retract and investigate a classification of (computer topological) spaces $X_{n,k}$ in terms of a KD-($k_0$, $k_1$)-homotopy equivalence.

호모토피 알고리즘을 이용한 Successive Backward Sweep 최적제어 알고리즘 설계 및 궤도전이 문제에의 적용 (Successive Backward Sweep Method for Orbit Transfer Augmented with Homotopy Algorithm)

  • 조동현;김승필
    • 한국항공우주학회지
    • /
    • 제44권7호
    • /
    • pp.620-628
    • /
    • 2016
  • 호모토피 알고리즘은 비선형성이 강하거나 다수의 최적해가 존재하는 비선형 최적제어 문제에서 점진적으로 비선형 항으로 고려하게 해줌으로써 강건하게 전역의 최적해를 구할 수 있는 방법이다. 본 논문에서는 초기 추정치에 둔감한 SBS 알고리즘과 호모토피 알고리즘을 결합한 비선형 최적제어 알고리즘을 제시하였다. 이러한 접근방식은 저추력 궤적최적화 문제와 같이 비선형성이 강한 문제의 최적해를 구하는데 효과적이다. 또한, 비선형성이 강한 문제들은 종종 다수 국소 해가 존재하게 되는데, 이러한 경우에 SBS-호모토피 방법은 점진적으로 전역해를 찾는 것을 가능하게 한다.