• Journal of the Chungcheong Mathematical Society
• /
• v.24 no.1
• /
• pp.91-104
• /
• 2011

We define a quarter-symmetric non-metric connection in an almost r-paracontact Riemannian manifold and we consider the submanifolds of an almost r-paracontact Riemannian manifold endowed with a quarter-symmetric non-metric connection. We also obtain the Gauss, Codazzi and Weingarten equations and the curvature tensor for the submanifolds of an almost r-paracontact Riemannian manifold endowed with a quarter-symmetric non-metric connection.

• Communications of the Korean Mathematical Society
• /
• v.9 no.3
• /
• pp.739-751
• /
• 1994

• The KSFM Journal of Fluid Machinery
• /
• v.6 no.1 s.18
• /
• pp.44-50
• /
• 2003

Flow through a turbine flow meter is simulated by solving the incompressible Navier-Stokes equations. The solution method is based on the pseudo-compressibility approach and uses an implicit-upwind differencing scheme together with the Gauss-Seidel line relaxation method. The equations are solved steadily in rotating reference frames, and the centrifugal force and the Coriolis force are added to the equation of motion. The standard $k-{\epsilon}$model is employed to evaluate turbulent viscosity. Computational results yield quantitative as well as qualitative information on the design of turbine flow meters by showing the distributions of pressure and velocity around the turbine blades.

• 한국전산유체공학회:학술대회논문집
• /
• 2001.05a
• /
• pp.93-98
• /
• 2001

An adaptive Cartesian grid method having the best elements of structured, unstructured, and Cartesian grids is developed to solve the steady two-dimensional Euler equations. The solver is based on a cell-centered finite-volume method with Roe's flux-difference splitting and implicit point Gauss-seidel time integration method. Calculations of several compressible flows are carried out to show the efficiency of the developed computer code. The results were generally in good agreements with existing data in the literature and the developed code has the good ability to capture important feature of the flows.

• 유체기계공업학회:학술대회논문집
• /
• 2000.12a
• /
• pp.247-252
• /
• 2000

Flow through turbine flow meter is simulated by solving the incompressible Navier-Stockes equations. The solution method is based on the pseudocompressibility approach and uses an implicit-upwind differencing scheme together with the Gauss-Seidel Line relaxation method. The equations are solved steadily in rotating reference frames and the centrifugal force and the Coriolis force are added to the equation of motion. The standard k-$\epsilon$ model is employed to evaluate turbulent viscosity.

• Proceedings of the KSME Conference
• /
• 2000.11b
• /
• pp.573-578
• /
• 2000

Flow through turbine flow meter is simulated by solving the incompressible Navier-Stockes equations. The solution method is based on the pseudocompressibility approach and uses an implicit-upwind differencing scheme together with the Gauss-Seidel line relaxation method. The equations are solved steadily in rotating reference frames and the centrifugal force and tile Coriolis force are added to the equation of motion. The standard $k-{\varepsilon}$ model is employed to evaluate turbulent viscosity. At first the stability and accuracy of the program is verified with the flow through a square duct with a $90^{\circ}$ bend and on the flat plate.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.15 no.9
• /
• pp.3458-3481
• /
• 2021

Existing methods for blind identification of linear block codes without a candidate set are mainly built on the Gauss elimination process. However, the fault tolerance will fall short when the intercepted bit error rate (BER) is too high. To address this issue, we apply the reverse algebra approach and propose a novel "two-step-screening" algorithm by solving the linear error equations on the binary Galois field, or GF(2). In the first step, a recursive matrix partition is implemented to solve the system linear error equations where the coefficient matrix is constructed by the full codewords which come from the intercepted noisy bitstream. This process is repeated to derive all those possible parity-checks. In the second step, a check matrix constructed by the intercepted codewords is applied to find the correct parity-checks out of all possible parity-checks solutions. This novel "two-step-screening" algorithm can be used in different codes like Hamming codes, BCH codes, LDPC codes, and quasi-cyclic LDPC codes. The simulation results have shown that it can highly improve the fault tolerance ability compared to the existing Gauss elimination process-based algorithms.

• Bulletin of the Korean Mathematical Society
• /
• v.47 no.4
• /
• pp.767-775
• /
• 2010

Let ${\varphi}\;:\;(M^n,\;F)\;{\rightarrow}\;(\overline{M}^{n+p},\;\overline{F})$ be an isometric immersion from a Finsler manifold to a Finsler manifold. In this paper, we shall obtain the Gauss and Codazzi equations with respect to the Chern connection on submanifolds M, by which we prove that if M is a weakly totally geodesic submanifold of $\overline{M}$, then flag curvature of M equals flag curvature of $\overline{M}$.

• Journal of Communications and Networks
• /
• v.16 no.4
• /
• pp.436-446
• /
• 2014

The high intensity of research and modeling in fields of mathematics, physics, biology and chemistry requires new computing resources. For the big computational complexity of such tasks computing time is large and costly. The most efficient way to increase efficiency is to adopt parallel principles. Purpose of this paper is to present the issue of parallel computing with emphasis on the analysis of parallel systems, the impact of communication delays on their efficiency and on overall execution time. Paper focuses is on finite algorithms for solving systems of linear equations, namely the matrix manipulation (Gauss elimination method, GEM). Algorithms are designed for architectures with shared memory (open multiprocessing, openMP), distributed-memory (message passing interface, MPI) and for their combination (MPI + openMP). The properties of the algorithms were analytically determined and they were experimentally verified. The conclusions are drawn for theory and practice.

• 한국전산유체공학회:학술대회논문집
• /
• 2002.10a
• /
• pp.95-102
• /
• 2002

Studies of the numerical characteristics of implicit upwind schemes, such as upwind ADI, Line Gauss-Seidel(LGS) and Point Gauss-Seidel(LU) algorithms, for preconditioned Navier-Stokes equations ate performed. All the algorithms are expressed in approximate factorization form and Von Neumann stability analysis and convergence studies are made. Preconditioning is applied for efficient convergence at low Mach numbers and low Reynolds numbers. For high aspect ratio computations, the ADI and LGS algorithms show efficient and uniform convergence up to moderate aspect ratio if we adopt viscous preconditioning based on min- CFL/max- VNN time-step definition. The LU algorithm, on the other hand, shows serious deterioration in convergence rate as the grid aspect ratio increases. Computations for practical applications also verify these results.