• Journal of Internet Computing and Services
• /
• v.12 no.3
• /
• pp.131-137
• /
• 2011

GPUs were originally designed for graphic processing, and GPGPUs are general-purpose GPUs for numerical computation with high performance and low electric power. In this paper, we implemented the parallel LU factorization program for GPGPUs. In CUDA, which is computational environment for Nvidia GPGPUs, domains are divided into blocks, and multi-threads compute each sub-blocks Simultaneously. In LU factorization program, computation order should be artificially decided due to the data dependence. To resolve the data dependancy, we suggested a parallel LU program for GPGPUs, and also explained parallel reduction algorithm for partial pivoting of LU factorization. We finally present performance analysis to show efficiency of the parallel LU factorization program based on multi-threads on GPGPUs.

• Kyungpook Mathematical Journal
• /
• v.52 no.4
• /
• pp.359-373
• /
• 2012

The block LU factorization is used to solve the coupled Stokes equations arisen from an optimal control problem subject to Stokes equations. The convergence of the spectral element solution is proved. Some numerical evidences are provided for the model coupled Stokes equations. Moreover, as an application, this algorithm is performed for an optimal control problem.

• East Asian mathematical journal
• /
• v.39 no.5
• /
• pp.523-528
• /
• 2023

Let S_n = [S(i, j)]_1≤i,j≤n and S^*_n = [S(i + j, j)]_1≤i,j≤n where S(i, j) is the Stirling number of the second kind. Choi and Jo [On the determinants of the square-type Stirling matrix and Bell matrix, Int. J. Math. Math. Sci. 2021] obtained the diagonal entries of matrix U in the LU-factorization of S^*_n for calculating the determinant of S^*_n, where L = S_n. In this paper, we compute the all entries of U in the LU-factorization of matrix S^*_n. This implies the identities related to Stirling numbers of both kinds.

• Journal of the Korean Mathematical Society
• /
• v.36 no.1
• /
• pp.209-227
• /
• 1999

We propose new parallel block ILU (Incomplete LU) factorization preconditioners for a nonsymmetric block-tridiagonal M-matrix. Theoretial properties of these block preconditioners are studied to see the convergence rate of the preconditioned iterative methods, Lastly, numerical results of the right preconditioned GMRES and BiCGSTAB methods using the block ILU preconditioners are compared with those of these two iterative methods using a standard ILU preconditioner to see the effectiveness of the block ILU preconditioners.

• Journal of applied mathematics & informatics
• /
• v.16 no.1_2
• /
• pp.19-35
• /
• 2004

We develop in this paper some preconditioners for sparse non-symmetric M-matrices, which combine a recursive two-level block I LU factorization with multigrid method, we compare these preconditioners on matrices arising from discretized convection-diffusion equations using up-wind finite difference schemes and multigrid orderings, some comparison theorems and experiment results are demonstrated.

• Journal of applied mathematics & informatics
• /
• v.8 no.2
• /
• pp.305-326
• /
• 2001

We introduce a class of multilevel recursive incomplete LU preconditioning techniques (RILUM) for solving general sparse matrices. This techniques is based on a recursive two by two block incomplete LU factorization on the coefficient martix. The coarse level system is constructed as an (approximate) Schur complement. A dynamic preconditioner is obtained by solving the Schur complement matrix approximately. The novelty of the proposed techniques is to solve the Schur complement matrix by a preconditioned Krylov subspace method. Such a reduction process is repeated to yield a multilevel recursive preconditioner.

• Proceedings of the KIEE Conference
• /
• 2000.07a
• /
• pp.274-275
• /
• 2000

This paper introduces new ordering algorithms using the graph of data structure and forward/backward substitution of LU decomposition using recursive function. The performance of the algorithm is compared with Tinney's algorithm using 14 bus systems. Test results show that the new fill-in element of Jacobian matrix using the proposed ordering algorithm is same as that of Tinner scheme 3 and the forward/backward substitution can reduce the computation time

• Journal of applied mathematics & informatics
• /
• v.22 no.1_2
• /
• pp.307-316
• /
• 2006

Incomplete LU factorization preconditioning techniques often have difficulty on indefinite sparse matrices. We present hybrid reordering strategies to deal with such matrices, which include new diagonal reorderings that are in conjunction with a symmetric nondecreasing degree algorithm. We first use the diagonal reorderings to efficiently search for entries of single element rows and columns and/or the maximum absolute value to be placed on the diagonal for computing a nonsymmetric permutation. To augment the effectiveness of the diagonal reorderings, a nondecreasing degree algorithm is applied to reduce the amount of fill-in during the ILU factorization. With the reordered matrices, we achieve a noticeable improvement in enhancing the stability of incomplete LU factorizations. Consequently, we reduce the convergence cost of the preconditioned Krylov subspace methods on solving the reordered indefinite matrices.

• 한국전산유체공학회:학술대회논문집
• /
• 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.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.15 no.2
• /
• pp.65-72
• /
• 2005

Quite recently, Zhou, Lu and Cao proposed a proxy-protected signature scheme based on the RSA assumption and two proxy-protectcd schemes based on the hardness of integer factorization. Dey also provided a security proof for each signature scheme in the random oracle model. In this paper, we show that their schemes do not satisfy a security requirement necessary for proxy signature schemes. This results in generating proxy signature without fay Permission from an original signer.