• Title/Summary/Keyword: Solution of Polynomial

Search Result 327, Processing Time 0.026 seconds

Incorporation of anisotropic scattering into the method of characteristics

  • Rahman, Anisur;Lee, Deokjung
    • Nuclear Engineering and Technology
    • /
    • v.54 no.9
    • /
    • pp.3478-3487
    • /
    • 2022
  • In this study, we incorporate an anisotropic scattering scheme involving spherical harmonics into the method of characteristics (MOC). The neutron transport solution in a light water reactor can be significantly improved because of the impact of an anisotropic scattering source with the MOC flat source approximation. Several problems are selected to verify the proposed scheme and investigate its effects and accuracy. The MOC anisotropic scattering source is based on the expansion of spherical harmonics with Legendre polynomial functions. The angular flux, scattering source, and cross section are expanded in terms of the surface spherical harmonics. Later, the polynomial is expanded to achieve the odd and even parity of the source components. Ultimately, the MOC angular and scalar fluxes are calculated from a combination of two sources. This paper presents various numerical examples that represent the hot and cold conditions of a reactor core with boron concentration, burnable absorbers, and control rod materials, with and without a reflector or baffle. Moreover, a small critical core problem is considered which involves significant neutron leakage at room temperature. We demonstrate that an anisotropic scattering source significantly improves solution accuracy for the small core high-leakage problem, as well as for practical large core analyses.

Dynamic Analysis of the Multi-Span Beam on Elastic Foundation Part one : Natural Frequencies (탄성지반 위에 놓여있는 다지지 보의 동적해석 제1보 : 고유진동수)

  • Y.C. Kim;K.J. Choi
    • Journal of the Society of Naval Architects of Korea
    • /
    • v.28 no.1
    • /
    • pp.83-91
    • /
    • 1991
  • In this paper the dynamic analysis of the multi-span beam on elastic foundation, which include discrete transnational and rotational springs, was performed. Furthermore, the effects of the intermediate supports were investigated. As a solution method, first the orthogonal polynomial functions which satisfy both the geometric and dynamic boundary conditions are obtained by imposing the orthogonality conditions. Then, the Galerkin's method is used to obtain the natural frequencies of the system. From numerical tests for various constraint and boundary conditions, it was found that the higher order orthogonal polynomial functions obtained by the present method can be used to get the accurate solution.

  • PDF

Polynomial-time Greedy Algorithm for Anti-Air Missiles Assignment Problem (지대공 미사일 배정 문제의 다항시간 탐욕 알고리즘)

  • Lee, Sang-Un
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.19 no.3
    • /
    • pp.185-191
    • /
    • 2019
  • During the modern battlefields of multi-batches flight formation attack situation, it is an essential task for a commander to make a proper fire distribution of air defense missile launch platforms for threat targets with effectively and quickly. Pan et al. try to solve this problem using genetic algorithm, but they are fails. This paper gets the initial feasible solution using high threat target first destroying strategy only use 75% available fire of each missile launch platform. Then, the assigned missile is moving to another target in the case of decreasing total threat. As a result of experiment, while the proposed algorithm is polynomial-time complexity greedy algorithm but this can be improve the solution than genetic algorithm.

Storage Type Nonlinear Hydrological Forecasting Model (저류함수형(貯溜凾數型) 비선형(非線型) 수문예측모형(水文豫測模型))

  • Baek, Un Il;Yoon, Tae Hoon
    • KSCE Journal of Civil and Environmental Engineering Research
    • /
    • v.2 no.2
    • /
    • pp.29-38
    • /
    • 1982
  • Nonlinear hydrological model containing the nonlinearity of effective rainfall, lag time and runoff is presented. In the evaluation of rainfall excess, the polynomial fitting method for total rainfall, 5 day antecedant rainfall and direct runoff is developed. In the application to actual watershed, the estimated model parameters of nonlinear lag model reflecting the nonlinearity of lag time are compared with the parameters, by both the fitting method and the correlation, model which are the modified version of the storage function model. The Successive Approximation Method in mathematical solution and Newton-Rhapson method in numerical solution are found to be superior to the conventional numerical graphic method in the analysis of nonlinear processes.

  • PDF

Theory of Acoustic Propagation in 3 Dimensional Wedge Domain (3차원 쐐기형 영역에서의 음향파 전달 이론)

  • Seong, Woo-Jae
    • The Journal of the Acoustical Society of Korea
    • /
    • v.13 no.2E
    • /
    • pp.83-91
    • /
    • 1994
  • Three components contribute to the acoustic field propagating in a wedge or over a ridge : a direct path arrival, an image component due to reflection from the boundaries and a component diffracted by the apex. All three contributions are included in a new, exact solution of the Helmholtz equation for the three-dimensional time harmonic field from a point source in a wedge(or over a ridge) formed by two intersecting, pressure-release plane boundaries. The solution is obtained by applying three integral transforms, and consists of and infinite sum of uncoupled normal nodes. The mode coefficients are given by a finite integral involving a Gegenbauer polynomial in the integrand, which may be computed relatively efficiently. Results of the theory for propagation over a 90 degree ridge is discussed.

  • PDF

Polynomial Time Algorithm for Advertising and Publicity Campaign Problem (광고홍보활동 문제의 다항시간 알고리즘)

  • Sang-Un, Lee
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.23 no.1
    • /
    • pp.151-156
    • /
    • 2023
  • This paper deals with the optimization problem that decides the number of advertising for any media among various medium to maximize the perception quality index of new product meets the given budget and over the minimum reached people constraints. For this problem, there is only in used the mathematical approach as linear programming (LP) software package and has been unknown the polynomial time algorithm. In this paper we suggest the heuristic algorithm with O(nlog n)time complexity to solve the optimal solution for this problem. This paper suggests the evaluation index to select the media most economically-efficient way and decides the media and the number of advertisement. While we utilize Excel, the proposed algorithm can be get the same optimal solution as LP for experimental data.

Model-based subpixed motion estimation for image sequence compression (도영상 압축을 위한 모델 기반 부화소 단위 움직임 추정 기법)

  • 서정욱;정제창
    • Journal of the Korean Institute of Telematics and Electronics S
    • /
    • v.35S no.1
    • /
    • pp.130-140
    • /
    • 1998
  • This paper presents a method to estimate subpixel accuracy motion vectors using a mathermatical model withoug interpolation. the proposed method decides the coefficients of mathematical model, which represents the motion vector which is achieved by full search. And then the proposed method estimates subpixel accuracy motion vector from achieved mathematical model. Step by step mathematical models such as type 1, type 2, type 3, modified bype 2, modified type 3, and Partial Interpolation type 3 are presented. In type 1, quadratic polynomial, which has 9 unknown coefficients and models the 3by 3 pixel plane, is used to get the subpixel accuracy motion vectors by inverse matrix solution. In type 2 and 3, each quadratic polynomial which is simplified from type 1 has 5 and 6 unknown coefficients and is used by least square solution. Modified type 2 and modified type 3 are enhanced models by weighting only 5 pixels out of 9. P.I. type 3 is more accurate method by partial interpolation around subpixel which isachieved by type 3. LThese simulation results show that the more delicate model has the better performance and modified models which are simplified have excellent performance with reduced computational complexity.

  • PDF

A Polynomial Time Algorithm for Aircraft Landing Problem (항공기 착륙 문제의 다항시간 알고리즘)

  • Lee, Sang-Un
    • Journal of the Korea Society of Computer and Information
    • /
    • v.19 no.9
    • /
    • pp.161-168
    • /
    • 2014
  • The optimal solution of minimum cost for aircraft landing problem(ALP) is very difficult problem because the approached aircraft are random time interval. Therefore this problem has been applied by various meta heuristic methods. This paper suggests O(nlog n) polynomial time heuristic algorithm to obtain the optimal solution for ALP. This algorithm sorts the target time of aircraft into ascending order. Then we apply the optimization of change the landing sequence take account of separation time and the cost of landing. For the Airland1 through Airland8 of benchmark data of ALP, we choose 25 data until the number of runway m that the total landing cost is 0. We can be obtain the optimal solution for all of the 25 data. Especially we can be improve the known optimal solution for m = 1of Airland8.

An efficient technique to generate reusable matrix to solve a problem in the engineering field (공학문제 해결을 위한 프로그램에서의 재사용이 가능한 Matrix의 효율적 자동생성기법)

  • Lee, Mi-Young
    • The KIPS Transactions:PartD
    • /
    • v.10D no.7
    • /
    • pp.1145-1148
    • /
    • 2003
  • We show the mixed finite element method which induces solutions that has the same order of errors for both the gradient of the solution and the solution itself. The technique to construct an efficient reusable matrix is suggested. Two families of mixed finite element methods are introduced with an automatic generating technique for matrix with my order of basis. The generated matrix by this technique has more accurate values and is a sparse matrix. This new technique is applied to solve a minimal surface problem.

Independent Set Bin Packing Algorithm for Routing and Wavelength Assignment (RWA) Problem (경로설정과 파장 배정 문제의 독립집합 상자 채우기 알고리즘)

  • Lee, Sang-Un
    • Journal of the Korea Society of Computer and Information
    • /
    • v.20 no.1
    • /
    • pp.111-118
    • /
    • 2015
  • This paper deals with the routing and wavelength assignment problem (RWAP) that decides the best lightpaths for multiple packet demands for (s,t) in optical communication and assigns the minimum number of wavelengths to given lightpaths. There has been unknown of polynomial-time algorithm to obtain the optimal solution for RWAP. Hence, the RWAP is classified as NP-complete problem and one can obtain the approximate solution in polynomial-time. This paper decides the shortest main and alternate lightpath with same hop count for all (s,t) for given network in advance. When the actual demands of communication for particular multiple packet for (s,t), we decrease the maximum utilized edge into b utilized number using these dual-paths. Then, we put these (s,t) into b-wavelength bins without duplicated edge. This algorithm can be get the optimal solution within O(kn) computational complexity. For two experimental data, the proposed algorithm shows that can be obtain the known optimal solution.