default search action
Young Hee Geum
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2020
- [j24]Young Hee Geum, Arjun Kumar Rathie, Hwajoon Kim
:
Matrix Expression of Convolution and Its Generalized Continuous Form. Symmetry 12(11): 1791 (2020)
2010 – 2019
- 2018
- [j23]Young Hee Geum, Young Ik Kim, Beny Neta:
Constructing a family of optimal eighth-order modified Newton-type multiple-zero finders along with the dynamics behind their purely imaginary extraneous fixed points. J. Comput. Appl. Math. 333: 131-156 (2018) - [j22]Young Hee Geum, Young Ik Kim, Ángel Alberto Magreñán
A study of dynamics via Möbius conjugacy map on a family of sixth-order modified Newton-like multiple-zero finders with bivariate polynomial weight functions. J. Comput. Appl. Math. 344: 608-623 (2018) - 2017
- [j21]Young Hee Geum, Young Ik Kim, Beny Neta:
A family of optimal quartic-order multiple-zero finders with a weight function of the principal kth root of a derivative-to-derivative ratio and their basins of attraction. Math. Comput. Simul. 136: 1-21 (2017) - 2016
- [j20]Young Hee Geum, Young Ik Kim, Ángel Alberto Magreñán
A biparametric extension of King's fourth-order methods and their dynamics. Appl. Math. Comput. 282: 254-275 (2016) - [j19]Young Hee Geum, Young Ik Kim, Beny Neta:
A sixth-order family of three-point modified Newton-like multiple-root finders and the dynamics behind their extraneous fixed points. Appl. Math. Comput. 283: 120-140 (2016) - 2015
- [j18]Young Hee Geum, Young Ik Kim, Beny Neta:
On developing a higher-order family of double-Newton methods with a bivariate weighting function. Appl. Math. Comput. 254: 277-290 (2015) - [j17]Young Hee Geum, Young Ik Kim, Beny Neta:
A class of two-point sixth-order multiple-zero finders of modified double-Newton type and their dynamics. Appl. Math. Comput. 270: 387-400 (2015) - 2014
- [j16]Young Ik Kim, Young Hee Geum:
A New Biparametric Family of Two-Point Optimal Fourth-Order Multiple-Root Finders. J. Appl. Math. 2014: 737305:1-737305:7 (2014) - [j15]Young Hee Geum, Young Ik Kim:
An Optimal Family of Fast 16th-Order Derivative-Free Multipoint Simple-Root Finders for Nonlinear Equations. J. Optim. Theory Appl. 160(2): 608-622 (2014) - 2013
- [j14]Young Ik Kim, Young Hee Geum:
A Two-Parameter Family of Fourth-Order Iterative Methods with Optimal Convergence for Multiple Zeros. J. Appl. Math. 2013: 369067:1-369067:7 (2013) - 2011
- [j13]Young Hee Geum, Young Ik Kim:
A uniparametric family of three-step eighth-order multipoint iterative methods for simple roots. Appl. Math. Lett. 24(6): 929-935 (2011) - [j12]Young Hee Geum, Young Ik Kim:
A biparametric family of four-step sixteenth-order root-finding methods with the optimal efficiency index. Appl. Math. Lett. 24(8): 1336-1342 (2011) - [j11]Young Hee Geum, Young Ik Kim:
A biparametric family of eighth-order methods with their third-step weighting function decomposed into a one-variable linear fraction and a two-variable generic function. Comput. Math. Appl. 61(3): 708-714 (2011) - [j10]Young Hee Geum, Young Ik Kim:
A family of optimal sixteenth-order multipoint methods with a linear fraction plus a trivariate polynomial as the fourth-step weighting function. Comput. Math. Appl. 61(11): 3278-3287 (2011) - [j9]Young Ik Kim, Young Hee Geum:
A cubic-order variant of Newton's method for finding multiple roots of nonlinear equations. Comput. Math. Appl. 62(4): 1634-1640 (2011) - [j8]Young Hee Geum, Young Ik Kim:
A biparametric family of optimally convergent sixteenth-order multipoint methods with their fourth-step weighting function as a sum of a rational and a generic two-variable function. J. Comput. Appl. Math. 235(10): 3178-3188 (2011) - 2010
- [j7]Young Hee Geum, Young Ik Kim:
A multi-parameter family of three-step eighth-order iterative methods locating a simple root. Appl. Math. Comput. 215(9): 3375-3382 (2010) - [j6]Young Hee Geum, Young Ik Kim:
A penta-parametric family of fifteenth-order multipoint methods for nonlinear equations. Appl. Math. Comput. 217(6): 2311-2319 (2010)
2000 – 2009
- 2009
- [j5]Young Hee Geum, Young Ik Kim, Hae Chull Lim:
A boundary equation of the principal period-2 component in the degree-n bifurcation set. Int. J. Comput. Math. 86(8): 1311-1318 (2009) - [j4]Young Hee Geum, Young Ik Kim:
Cubic convergence of parameter-controlled Newton-secant method for multiple zeros. J. Comput. Appl. Math. 233(4): 931-937 (2009) - 2007
- [j3]Young Hee Geum:
The asymptotic error constant of leap-frogging Newton's method locating a simple real zero. Appl. Math. Comput. 189(1): 963-969 (2007) - 2006
- [j2]Young Hee Geum, Young Ik Kim, Min Surp Rhee:
High-order convergence of the k-fold pseudo-Newton's irrational method locating a simple real zero. Appl. Math. Comput. 182(1): 492-497 (2006) - 2003
- [j1]Young Hee Geum, Young Ik Kim:
A Study on Computation of Component Centers in the Degree-n Bifurcation Set. Int. J. Comput. Math. 80(2): 223-232 (2003)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-25 05:55 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: