• Nuclear Engineering and Technology
• /
• v.49 no.6
• /
• pp.1135-1142
• /
• 2017

The applicability of the algebraic collapsing acceleration (ACA) technique to the method of characteristics (MOC) in cases with scattering anisotropy and/or linear sources was investigated. Previously, the ACA was proven successful in cases with isotropic scattering and uniform (step) sources. A presentation is first made of the MOC implementation, available in the DRAGON5 code. Two categories of schemes are available for integrating the propagation equations: (1) the first category is based on exact integration and leads to the classical step characteristics (SC) and linear discontinuous characteristics (LDC) schemes and (2) the second category leads to diamond differencing schemes of various orders in space. The acceleration of these MOC schemes using a combination of the generalized minimal residual [GMRES(m)] method preconditioned with the ACA technique was focused on. Numerical results are provided for a two-dimensional (2D) eight-symmetry pressurized water reactor (PWR) assembly mockup in the context of the DRAGON5 code.

• Journal of the Korean Society for Precision Engineering
• /
• v.21 no.7
• /
• pp.76-82
• /
• 2004

The solutions of neighboring optimal control are typically obtained using the sweep method or transition matrices. Due to the numerical integration, however, the gain matrix can become infinite as time go to final one in the transition matrices, and the Riccati solution can become infinite when the final time free. To overcome these disadvantages, this paper proposes the pseudospectral Legendre method which is to first discreteize the linear boundary value problem using the global orthogonal polynomial, then transforms into an algebraic equations. Because this method is not necessary to take any integration of transition matrix or Riccati equation, it can be usefully used in real-time operation. Finally, its performance is verified by the numerical example for the space vehicle's orbit transfer.

• Kyungpook Mathematical Journal
• /
• v.60 no.4
• /
• pp.869-881
• /
• 2020

Most first kind integral equations are ill-posed, and obtaining their numerical solution often requires solving a linear system of algebraic equations of large condition number, which may be difficult or impossible. This article proposes a regularization-direct method to numerically solve first kind Fredholm integral equations. The vector forms of block-pulse functions and related properties are applied to formulate the direct method and reduce the integral equation to a linear system of algebraic equations. We include a regularization scheme to overcome the ill-posedness of integral equation and obtain a stable numerical solution. Some test problems are solved using the proposed regularization-direct method to illustrate its efficiency for solving first kind Fredholm integral equations.

• East Asian mathematical journal
• /
• v.37 no.4
• /
• pp.401-426
• /
• 2021

In order to propose ways to implement mathematical connection between algebra and geometry, this study reinterpreted and visualized the Khayyam's geometric method solving the cubic equations using two conic sections and the Al-Kāshi's method of constructing of angle trisection using a cubic equation. Khayyam's method is an example of a geometric solution to an algebraic problem, while Al-Kāshi's method is an example of an algebraic a solution to a geometric problem. The construction and property of conics were presented deductively by the theorem of "Stoicheia" and the Apollonius' symptoms contained in "Conics". In addition, I consider connections that emerged in the alternating process of algebra and geometry and present meaningful Implications for instruction method on mathematical connection.

• Proceedings of the IEEK Conference
• /
• 2005.11a
• /
• pp.849-852
• /
• 2005

A factorization is an extremely important part of multi-level logic synthesis. The number of literals in a factored from is a good estimate of the complexity of a logic function, and can be translated directly into the number of transistors required for implementation. Factored forms are described as either algebraic or Boolean, according to the trade-off between run-time and optimization. A Boolean factored form contains fewer number of literals than an algebraic factored form. In this paper, we present a new method for a Boolean factorization. The key idea is to identify two-cube Boolean subexpression pairs from given expression. Experimental results on various benchmark circuits show the improvements in literal counts over the algebraic factorization based on Brayton's co-kernel cube matrix.

• Kyungpook Mathematical Journal
• /
• v.56 no.4
• /
• pp.1141-1160
• /
• 2016

In this paper, a symbolic algorithm for solving a regular initial value problem (IVP) for a system of linear differential-algebraic equations (DAEs) with constant coeffcients has been presented. Algebra of integro-differential operators is employed to express the given system of DAEs. We compute a canonical form of the given system which produces another simple equivalent system. Algorithm includes computing the matrix Green's operator and the vector Green's function of a given IVP. Implementation of the proposed algorithm in Maple is also presented with sample computations.

• Proceedings of the IEEK Conference
• /
• 1998.10a
• /
• pp.1219-1222
• /
• 1998

This paper analyzes the dynamic spars algebraic codebook used to model a residual signal and proposes a new algebraic codebook structure as well as a searching process with improved performance. The proposed algorithm improves the disadvantage of algebraic codebook without increased computation. First, this paper makes it possibel to select various pulse amplitudes differently from the conventional method which looks up the sign bit simply. In addition, two pulses are made to be selected on the same track. For speech quality on the telephone line 5.6kbps speech coder using the proposed algorithm was equivalent to the 6.3kbps MP-MLQ in the viewpoint of subjective speech quality. However, speech degradation was caused a little compared to the MP-MLQ where MNRU 1=15dB.

• Journal of the Korean Society for Industrial and Applied Mathematics
• /
• v.20 no.1
• /
• pp.37-50
• /
• 2016

A large eddy simulation (LES) of a turbulent channel flow is performed by using the third order low-storage Runge-Kutta method in time and second order finite difference formulation in space with staggered grid at a Reynolds number, $Re_{\tau}=590$ based on the channel half width, ${\delta}$ and wall shear velocity, $u_{\tau}$. To reduce the calculation cost of LES, algebraic wall model (AWM) is applied to approximate the near-wall region. The computation is performed in a domain of $2{\pi}{\delta}{\times}2{\delta}{\times}{\pi}{\delta}$ with $32{\times}20{\times}32$ grid points. Standard Smagorinsky model is used for subgrid-scale (SGS) modeling. Essential turbulence statistics of the flow field are computed and compared with Direct Numerical Simulation (DNS) data and LES data using no wall model. Agreements as well as discrepancies are discussed. The flow structures in the computed flow field have also been discussed and compared with LES data using no wall model.

• Journal of the Korea Computer Industry Society
• /
• v.7 no.4
• /
• pp.293-298
• /
• 2006

A factorization is an extremely important part of multi-level logic synthesis. The number of literals in a factored form is a good estimate of the complexity of a logic function, and can be translated directly into the number of transistors required for implementation. Factored forms are described as either algebraic or Boolean, according to the trade-off between run-time and optimization. A Boolean factored form contains fewer number of literals than an algebraic factored form. In this paper, we present a new method for a Boolean factorization. The key idea is to identify two-cube Boolean subexpression pairs from given expression. Experimental results on various benchmark circuits show the improvements in literal counts over the algebraic factorization based on Bryton's co-kernel cube matrix.

• ETRI Journal
• /
• v.27 no.2
• /
• pp.231-234
• /
• 2005

This letter proposes a new embedded speech coding structure based on the Adaptive Multi-Rate Wideband (AMR-WB) standard codec. The proposed coding scheme consists of three different bitrates where the two lower bitrates are embedded into the highest one. The embedded bitstream was achieved by modifying the algebraic codebook search procedure adopted for the AMR-WB codec. The proposed method provides the advantage of scalability due to the embedded bitstream, while it inevitably requires some additional computational complexity for obtaining two different code vectors of the higher bitrate modes. Compared to the AMR-WB codec, the embedded coder shows improved speech qualities for two higher bitrate modes with a slightly increased bitrate caused by the decreased coding efficiency of the algebraic codebook.