Results 1-9 of 9 (Search time: 0.009 seconds).
NO | Title, Author(s) (Publication Title, Volume Issue, Page, Issue Date) |
---|---|
A two-level nonoverlapping Schwarz algorithm for the Stokes problem without primal pressure unknowns Kim, Hyea Hyun; Lee, Chang-Ock, INTERNATIONAL JOURNAL FOR NUMERICAL METHODS IN ENGINEERING, v.88, no.13, pp.1390 - 1410, 2011-12 | |
A Neumann-Dirichlet preconditioner for a FETI-DP formulation of the two-dimensional Stokes problem with mortar methods Kim, Hyea Hyun; Lee, Chang-Ock, SIAM JOURNAL ON SCIENTIFIC COMPUTING, v.28, no.3, pp.1133 - 1152, 2006 | |
Preconditioners for the dual-primal FETI methods on nonmatching grids: Numerical study Chang, YW; Kim, HH; Lee, Chang-Ock, COMPUTERS & MATHEMATICS WITH APPLICATIONS, v.51, no.5, pp.697 - 712, 2006-03 | |
A FETI-DP FORMULATION FOR THE STOKES PROBLEM WITHOUT PRIMAL PRESSURE COMPONENTS Kim, Hyea Hyun; Lee, Chang-Ock; Park, Eun-Hee, SIAM JOURNAL ON NUMERICAL ANALYSIS, v.47, no.6, pp.4142 - 4162, 2010 | |
A dual iterative substructuring method with a penalty term in three dimensions Lee, Chang-Ock; Park, Eun-Hee, COMPUTERS & MATHEMATICS WITH APPLICATIONS, v.64, no.9, pp.2787 - 2805, 2012-11 | |
On the selection of primal unknowns for a FETI-DP formulation of the Stokes problem in two dimensions Kim, Hyea Hyun; Lee, Chang-Ock; Park, Eun-Hee, COMPUTERS & MATHEMATICS WITH APPLICATIONS, v.60, no.12, pp.3047 - 3057, 2010-12 | |
A preconditioner for the FETI-DP formulation with mortar methods in two dimensions Kim, HH; Lee, Chang-Ock, SIAM JOURNAL ON NUMERICAL ANALYSIS, v.42, no.5, pp.2159 - 2175, 2005 | |
A DUAL ITERATIVE SUBSTRUCTURING METHOD WITH A SMALL PENALTY PARAMETER Lee, Chang-Ock; Park, Eun-Hee, JOURNAL OF THE KOREAN MATHEMATICAL SOCIETY, v.54, no.2, pp.461 - 477, 2017-03 | |
CORRIGENDUM TO "A DUAL ITERATIVE SUBSTRUCTURING METHOD WITH A SMALL PENALTY PARAMETER", [J. KOREAN MATH. SOC. 54 (2017), NO. 2, 461{477] Lee, Chang-Ock; Park, Eun-Hee; Park, Jongho, JOURNAL OF THE KOREAN MATHEMATICAL SOCIETY, v.58, no.3, pp.791 - 797, 2021-05 |
Discover