default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDFatih Celiker
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2019
[j16]Burak Aksoylu
, Fatih Celiker, Orsan Kilicer:
Nonlocal operators with local boundary conditions in higher dimensions. Adv. Comput. Math. 45(1): 453-492 (2019)- [j15]Burak Aksoylu, Fatih Celiker, Orsan Kilicer:
Correction to: Nonlocal operators with local boundary conditions in higher dimensions. Adv. Comput. Math. 45(1): 493 (2019) - 2018
- [j14]Huiqing Zhu, Fatih Celiker:
Nodal superconvergence of the local discontinuous Galerkin method for singularly perturbed problems. J. Comput. Appl. Math. 330: 95-116 (2018) - [j13]Mehmet Fatih Karaaslan, Fatih Celiker, Muhammet Kurulay:
A hybridizable discontinuous Galerkin method for a class of fractional boundary value problems. J. Comput. Appl. Math. 333: 20-27 (2018) - 2016
- [j12]Mehmet Fatih Karaaslan, Fatih Celiker, Muhammet Kurulay:
Approximate solution of the Bagley-Torvik equation by hybridizable discontinuous Galerkin methods. Appl. Math. Comput. 285: 51-58 (2016) - [j11]Huiqing Zhu, Fatih Celiker:
Error analysis of an HDG method for a distributed optimal control problem. J. Comput. Appl. Math. 307: 2-12 (2016) - 2015
- [c2]Burak Aksoylu, Fatih Celiker:
Comparison of Nonlocal Operators Utilizing Perturbation Analysis. ENUMATH 2015: 589-606 - 2014
- [j10]Fatih Celiker, Li Fan:
HDG Methods for Naghdi Arches. J. Sci. Comput. 59(1): 217-246 (2014) - 2012
- [j9]Fatih Celiker, Zhimin Zhang, Huiqing Zhu:
Nodal Superconvergence of SDFEM for Singularly Perturbed Problems. J. Sci. Comput. 50(2): 405-433 (2012) - [j8]Fatih Celiker, Li Fan, Sheng Zhang, Zhimin Zhang:
Locking-Free Optimal Discontinuous Galerkin Methods for a Naghdi-Type Arch Model. J. Sci. Comput. 52(1): 49-84 (2012) - [j7]Fatih Celiker, Bernardo Cockburn, Ke Shi:
A projection-based error analysis of HDG methods for Timoshenko beams. Math. Comput. 81(277): 131-151 (2012) - [j6]M. Emre Celebi, Hassan A. Kingravi, Fatih Celiker:
Comments on "On approximating Euclidean metrics by weighted t-cost distances in arbitrary dimension". Pattern Recognit. Lett. 33(10): 1422-1425 (2012) - [i4]M. Emre Celebi, Hassan A. Kingravi, Fatih Celiker:
Comments on "On Approximating Euclidean Metrics by Weighted t-Cost Distances in Arbitrary Dimension". CoRR abs/1206.2061 (2012) - 2011
- [j5]M. Emre Celebi, Fatih Celiker, Hassan A. Kingravi:
On Euclidean norm approximations. Pattern Recognit. 44(2): 278-283 (2011) - 2010
- [j4]Fatih Celiker, Bernardo Cockburn, Ke Shi:
Hybridizable Discontinuous Galerkin Methods for Timoshenko Beams. J. Sci. Comput. 44(1): 1-37 (2010) - [c1]M. Emre Celebi, Hassan A. Kingravi, Fatih Celiker:
Accelerating color space transformations using numerical approximations. ICIP 2010: 1349-1352 - [i3]M. Emre Celebi, Fatih Celiker, Hassan A. Kingravi:
On Euclidean Norm Approximations. CoRR abs/1008.4870 (2010) - [i2]M. Emre Celebi, Hassan A. Kingravi, Fatih Celiker:
Fast Color Space Transformations Using Minimax Approximations. CoRR abs/1009.0854 (2010) - [i1]M. Emre Celebi, Hassan A. Kingravi, Rastislav Lukac, Fatih Celiker:
Cost-Effective Implementation of Order-Statistics Based Vector Filters Using Minimax Approximations. CoRR abs/1009.0959 (2010)
2000 – 2009
- 2007
- [j3]Fatih Celiker, Bernardo Cockburn:
Superconvergence of the numerical traces of discontinuous Galerkin and Hybridized methods for convection-diffusion problems in one space dimension. Math. Comput. 76(257): 67-96 (2007) - 2006
- [j2]Fatih Celiker, Bernardo Cockburn:
Element-by-Element Post-Processing of Discontinuous Galerkin Methods for Timoshenko Beams. J. Sci. Comput. 27(1-3): 177-187 (2006) - [j1]Fatih Celiker, Bernardo Cockburn, Henry K. Stolarski:
Locking-Free Optimal Discontinuous Galerkin Methods for Timoshenko Beams. SIAM J. Numer. Anal. 44(6): 2297-2325 (2006)
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:43 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:
