#### Filter Results:

- Full text PDF available (10)

#### Publication Year

1989

2017

- This year (1)
- Last 5 years (10)
- Last 10 years (17)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

- Jae Heon Yun
- Computers & Mathematics with Applications
- 2013

- Jae Heon Yun
- Numerische Mathematik
- 2003

- Jae Heon Yun
- Int. J. Comput. Math.
- 2012

Taylor & Francis makes every effort to ensure the accuracy of all the information (the “Content”) contained in the publications on our platform. However, Taylor & Francis, our agents, and our licensors make no representations or warranties whatsoever as to the accuracy, completeness, or suitability for any purpose of the Content. Any opinions and views… (More)

- Jae Heon Yun, Sang Wook Kim
- Applied Mathematics and Computation
- 2006

We first study convergence of both the relaxed multisplitting method and the relaxed (nonstationary) two-stage multisplitting method using incomplete factorizations for solving a linear system whose coefficient matrix is a large sparse symmetric positive definite matrix. We next study a parallel implementation of the relaxed two-stage multisplitting method… (More)

- Jae Heon Yun
- Applied Mathematics and Computation
- 2008

In this short note we give certain comments and improvements of some three-step iterative methods recently considered by N.A. Mir and T. Zaman (Appl. Math. Comput. (2007) doi: 10.1016/j.amc.2007.03.071).

- Glenn R. Luecke, Jae Heon Yun, Philip W. Smith
- The Journal of Supercomputing
- 1992

This paper considers four parallel Cholesky factorization algorithms, including SPOTRF from the February 1992 release of LAPACK, each of which call parallel Level 2 or 3 BLAS, or both. A fifth parallel Cholesky algorithm that calls serial Level 3 BLAS is also described. The efficiency of these five algorithms on the CRAY-2, CRAY Y-MP/832, Hitachi Data… (More)

- Jae Heon Yun
- Applied Mathematics and Computation
- 2015

- Jae Heon Yun, Jae Heon Yun
- 2016

In this paper, we first introduce two one-parameter relaxation (OPR) iterative methods for solving singular saddle point problems whose semi-convergence rate can be accelerated by using scaled preconditioners. Next we present formulas for finding their optimal parameters which yield the best semi-convergence rate. Lastly, numerical experiments are provided… (More)

- Jae Heon Yun, Sang Wook Kim
- Applied Mathematics and Computation
- 2008

- Jae Heon Yun
- Applied Mathematics and Computation
- 2011