• 디지털융복합연구
• /
• 제12권7호
• /
• pp.65-76
• /
• 2014

본 논문은 우리나라의 1인당 지방재정지출이 1985-2011년 기간 동안 수렴하고 있는 지 여부를 광역자치단체 자료를 이용하여 검증하고 있다. Skidmore et al.(2004)의 구조적 모형을 이용하여 1인당 재정지출증가율 방정식을 추정한 결과 우리나라의 1인당 지방재정지출이 수렴하는 것을 확인할 수 있었다[23]. 더욱이 재정지출 증가율에 기여한 것은 노령인구 증가율이라는 것이 확인되었고, 5개 분야로 지방재정지출을 구분하여 수렴여부를 분석한 결과 기능별 재정지출의 유형에 따라 수렴속도가 다른 것으로 나타나 공공투자지출의 수렴속도가 공공소비지출의 수렴속도 보다 빠른 것으로 나타났으며, 경제개발비 지출의 수렴속도가 사회개발비 지출의 수렴속도보다 빠른 것으로 나타났다. 향후 연구에서는 개별 지방공공재의 혼잡도를 고려한 지방공공서비스의 수렴에 대하여 분석하는 것이 중요한 것으로 보인다.

• East Asian mathematical journal
• /
• 제25권4호
• /
• pp.425-431
• /
• 2009

We provide a local convergence analysis for Newton-like methods for the solution of generalized equations in a Banach space setting. Using some ideas of ours introduced in [2] for nonlinear equations we show that under weaker hypotheses and computational cost than in [7] a larger convergence radius and finer error bounds on the distances involved can be obtained.

• 한국융합학회논문지
• /
• 제7권4호
• /
• pp.217-227
• /
• 2016

본 논문은 우리나라 사회복지서비스가 지역 간 수렴하고 있는지를 분석하고 있다. 본 논문에서는 사회복지서비스가 지방공공재로서 어느 정도의 혼잡도를 갖는 것을 고려하여 1985-2013년 기간 동안 우리나라의 지역간 수렴을 분석한 결과 절대적인 사회복지서비스가 수렴하는 것이 실증적으로 입증되어 -수렴이 존재하는 것으로 드러났다. 또한 초기연도에 사회복지서비스의 수준에 반비례하여 사회복지서비스의 증가율이 결정되어 지역 간 사회복지서비스가 수렴하는 소위 -수렴이 존재하는 것으로 나타났다. 본 논문의 정책적 시사점으로는 첫째 지자체가 사회복지정책을 수행할 때 사회복지서비스의 혼잡도를 고려하여야 한다는 것이다. 둘째, 사회복지정책은 지방정부에서 차별적으로 수행하는 것보다는 국가전체의 관점에서 최소한의 복지서비스를 제공하는 것이 바람직하다는 것이다.

• 대한수학회논문집
• /
• 제37권4호
• /
• pp.1009-1023
• /
• 2022

The main objective of this work is to investigate the study of the local and semi-local convergence of the contraharmonic-mean Newton's method (CHMN) for solving nonlinear equations in a Banach space. We have performed the semi-local convergence analysis by using generalized conditions. We examine the theoretical results by comparing the CHN method with the Newton's method and other third order methods by Weerakoon et al. using some test functions. The theoretical and numerical results are also supported by the basins of attraction for a selected test function.

• 제어로봇시스템학회논문지
• /
• 제17권12호
• /
• pp.1210-1218
• /
• 2011

GA (Genetic Algorithms) are efficient for searching for global optima but may have some problems such as premature convergence, convergence to local extremum and divergence. These phenomena are related to the evolutionary operators. As population diversity converges to low value, the search ability of a GA decreases and premature convergence or converging to local extremum may occur but population diversity converges to high value, then genetic algorithm may diverge. To guarantee that genetic algorithms converge to the global optima, the genetic operators should be chosen properly. In this paper, we analyze the effects of the selection operator, crossover operator, and mutation operator on convergence properties, and propose the sweeping method of mutation probability and elitist propagation rate to maintain the diversity of the GA's population for getting out of the premature convergence. Results of simulation studies verify the feasibility of using these sweeping operators to avoid premature convergence and convergence to local extrema.

• 한국수학교육학회지시리즈B:순수및응용수학
• /
• 제13권4호
• /
• pp.261-267
• /
• 2006

A local convergence analysis of Newton's method for perturbed generalized equations is provided in a Banach space setting. Using center Lipschitzian conditions which are actually needed instead of Lipschitzian hypotheses on the $Fr\'{e}chet$-derivative of the operator involved and more precise estimates under less computational cost we provide a finer convergence analysis of Newton's method than before [5]-[7].

• 한국수학교육학회지시리즈B:순수및응용수학
• /
• 제15권1호
• /
• pp.47-55
• /
• 2008

Local convergence results for three Newton-like methods in Banach space are provided. A comparison is given between the three convergence radii. Then we show that using the largest convergence radius we can pick an initial guess from with we start the corresponding iteration. It turns out that after a finite number of steps we can always use the iterate found as the starting guess for a faster method, since this iterate will be inside the convergence domain of the new method.

• 한국전산유체공학회:학술대회논문집
• /
• 한국전산유체공학회 2009년 춘계학술대회논문집
• /
• pp.269-276
• /
• 2009

The local preconditioning method has both robust convergence and accurate solutions by using local flow properties for parameters in the preconditioning matrix. Preconditioning methods have been very effective to low speed inviscid flows. In the viscous and turbulent flows, deterioration of convergence should be overcame on the high aspect ratio grids to get better convergence and accuracy. In the present study, the local time stepping and min-CFL/max-VNN definitions are applied to compare the results and we propose the method that switches between two methods. The min-CFL definition is applied for inviscid flow problems and the min-CFL/max-VNN definition is implemented to viscous and turbulent flow problems.

• 대한수학회보
• /
• 제56권3호
• /
• pp.621-629
• /
• 2019

In this paper, we present a local convergence analysis of a three point method with convergence order $1.839{\ldots}$ for approximating a locally unique solution of a nonlinear operator equation in setting of Banach spaces. Using weaker hypotheses than in earlier studies, we obtain: larger radius of convergence and more precise error estimates on the distances involved. Finally, numerical examples are used to show the advantages of the main results over earlier results.

• 충청수학회지
• /
• 제28권1호
• /
• pp.1-12
• /
• 2015

We present a local convergence analysis for inexact Newton-like method in a Banach space under weaker Lipschitz condition. The convergence ball is enlarged and the estimates on the error distances are more precise under the same computational cost as in earlier studies such as [6, 7, 11, 18]. Some special cases are considered and applications for solving nonlinear systems using the Newton-arithmetic mean method are improved with the new convergence technique.