default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDCharalampos Tsitouras
Person information
- affiliation: Technological Educational Institute of Sterea Hellas, Department of Applied Sciences
- affiliation: Technological Educational Institute of Chalkida, Department of Applied Sciences
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j36]Vladislav N. Kovalnogov, Ruslan V. Fedorov, M. T. Karpukhina, M. I. Kornilova, T. E. Simos, Charalampos Tsitouras:
Economical handling of Runge-Kutta-Nyström step rejection. J. Comput. Appl. Math. 438: 115528 (2024)- [j35]Vladislav N. Kovalnogov, Ruslan V. Fedorov, Tamara V. Karpukhina, Theodore E. Simos, Charalampos Tsitouras:
Runge-Kutta pairs of orders 9(8) for use in quadruple precision computations. Numer. Algorithms 95(4): 1905-1919 (2024) - 2023
- [j34]Vladislav N. Kovalnogov, Ruslan V. Fedorov, M. T. Karpukhina, M. I. Kornilova, T. E. Simos, Charalampos Tsitouras:
Runge-Kutta-Nyström methods of eighth order for addressing Linear Inhomogeneous problems. J. Comput. Appl. Math. 419: 114778 (2023) - 2022
- [j33]Theodore E. Simos, Charalampos Tsitouras:
On high order Runge-Kutta-Nyström pairs. J. Comput. Appl. Math. 400: 113753 (2022) - 2021
- [j32]T. E. Simos, Charalampos Tsitouras:
Evolutionary derivation of Runge-Kutta pairs for addressing inhomogeneous linear problems. Numer. Algorithms 87(2): 511-525 (2021) - [j31]T. E. Simos, Charalampos Tsitouras:
Efficiently inaccurate approximation of hyperbolic tangent used as transfer function in artificial neural networks. Neural Comput. Appl. 33(16): 10227-10233 (2021)
2010 – 2019
- 2019
- [j30]Charalampos Tsitouras
:
Explicit Runge-Kutta methods for starting integration of Lane-Emden problem. Appl. Math. Comput. 354: 353-364 (2019) - 2018
- [j29]Charalampos Tsitouras, Ioannis Th. Famelis:
Bounds for variable degree rational L∞ approximations to the matrix exponential. Appl. Math. Comput. 338: 376-386 (2018) - 2017
- [j28]Ioannis Th. Famelis, Charalampos Tsitouras:
Symbolic derivation of Runge-Kutta-Nyström type order conditions and methods for solving y'''=f(x, y). Appl. Math. Comput. 297: 50-60 (2017) - [j27]Charalampos Tsitouras, Ioannis Th. Famelis, T. E. Simos:
Phase-fitted Runge-Kutta pairs of orders 8(7). J. Comput. Appl. Math. 321: 226-231 (2017) - 2016
- [j26]Ioannis Th. Famelis, Charalampos Tsitouras:
On modifications of Runge-Kutta-Nyström methods for solving y(4) = f(x, y). Appl. Math. Comput. 273: 726-734 (2016) - 2014
- [j25]Charalampos Tsitouras:
On fitted modifications of Runge-Kutta-Nyström pairs. Appl. Math. Comput. 232: 416-423 (2014) - [j24]Charalampos Tsitouras, Vasilios N. Katsikis:
Bounds for variable degree rational L∞ approximations to the matrix cosine. Comput. Phys. Commun. 185(11): 2834-2840 (2014) - 2012
- [j23]Charalampos Tsitouras, Christos G. Massouros:
Enumeration of Rosenberg-type hypercompositional structures defined by binary relations. Eur. J. Comb. 33(8): 1777-1786 (2012) - 2011
- [j22]Charalampos Tsitouras:
Greatest remainder bi-proportional rounding and the Greek parliamentary elections of 2007. Appl. Math. Comput. 217(22): 9254-9260 (2011) - [j21]Charalampos Tsitouras:
Hybrid Hamilton-Webster and the Greek apportionment. Appl. Math. Comput. 218(7): 3957-3961 (2011) - [j20]Charalampos Tsitouras:
Runge-Kutta pairs of order 5(4) satisfying only the first column simplifying assumption. Comput. Math. Appl. 62(2): 770-775 (2011) - [j19]Charalampos Tsitouras, Ioannis Th. Famelis, T. E. Simos:
On modified Runge-Kutta trees and methods. Comput. Math. Appl. 62(4): 2101-2111 (2011) - 2010
- [j18]Charalampos Tsitouras, Christos G. Massouros:
On enumeration of hypergroups of order 3. Comput. Math. Appl. 59(1): 519-523 (2010) - [j17]Dimitrios G. Pavlou, F. I. Mavrothanasis, Charalampos Tsitouras, M. G. Pavlou, S. Avlonitis, V. N. Vlachakis:
Stress concentration analysis of interfacial micro-structural cracks under internal singular loading sources. J. Comput. Methods Sci. Eng. 10(1-2): 3-12 (2010)
2000 – 2009
- 2007
- [j16]Athanassios G. Bratsos, Ioannis Th. Famelis, A. Kollias, Charalampos Tsitouras:
Phase-fitted Numerov type methods. Appl. Math. Comput. 184(1): 23-29 (2007) - [j15]Charalampos Tsitouras:
Runge-Kutta interpolants for high precision computations. Numer. Algorithms 44(3): 291-307 (2007) - 2004
- [j14]Ioannis Th. Famelis, S. N. Papakostas, Charalampos Tsitouras:
Symbolic derivation of Runge-Kutta order conditions. J. Symb. Comput. 37(3): 311-327 (2004) - 2003
- [j13]Charalampos Tsitouras:
Families of explicit two-step methods for integration of problems with oscillating solutions. Appl. Math. Comput. 135(1): 169-178 (2003) - [j12]George Papageorgiou, Charalampos Tsitouras:
Runge-Kutta Pairs for Scalar Autonomous Initial Value Problems. Int. J. Comput. Math. 80(2): 201-209 (2003) - [j11]Tom E. Simos, Ioannis Th. Famelis, Charalampos Tsitouras:
Zero Dissipative, Explicit Numerov-Type Methods for Second Order IVPs with Oscillating Solutions. Numer. Algorithms 34(1): 27-40 (2003) - 2002
- [j10]Charalampos Tsitouras, T. E. Simos:
High algebraic, high phase-lag order embedded Numerov-type methods for oscillatory problems. Appl. Math. Comput. 131(1): 201-211 (2002) - [j9]Charalampos Tsitouras:
Neural networks with multidimensional transfer functions. IEEE Trans. Neural Networks 13(1): 222-228 (2002) - 2001
- [j8]Charalampos Tsitouras:
Dissipative high phase-lag order methods. Appl. Math. Comput. 117(1): 35-43 (2001)
1990 – 1999
- 1999
- [j7]Charalampos Tsitouras, S. N. Papakostas:
Cheap Error Estimation for Runge-Kutta Methods. SIAM J. Sci. Comput. 20(6): 2067-2088 (1999) - [j6]S. N. Papakostas, Charalampos Tsitouras:
High Phase-Lag-Order Runge-Kutta and Nyström Pairs. SIAM J. Sci. Comput. 21(2): 747-763 (1999) - 1998
- [j5]Charalampos Tsitouras, Theodore E. Simos:
Explicit high order methods for the numerical integration of periodic initial-value problems. Appl. Math. Comput. 95(1): 15-26 (1998) - [j4]George Papageorgiou, Ioannis Th. Famelis, Charalampos Tsitouras:
A P-stable singly diagonally implicit Runge-Kutta-Nyström method. Numer. Algorithms 17(3-4): 345-353 (1998) - 1997
- [j3]George Papageorgiou, Charalampos Tsitouras:
Continuous extensions to high order runge-kutta methods. Int. J. Comput. Math. 65(3-4): 273-291 (1997) - 1993
- [j2]George Papageorgiou, Charalampos Tsitouras, S. N. Papakostas:
Runge-Kutta pairs for periodic initial value problems. Computing 51(2): 151-163 (1993) - 1990
- [j1]Charalampos Tsitouras, George Papageorgiou:
Runge-Kutta interpolants based on values from two successive integration steps. Computing 43(3): 255-266 (1990)
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-05-08 21:50 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:
