default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAndreas Karageorghis
Person information
- affiliation: University of Cyprus, Department of Mathematics and Statistics, Nicosia, Cyprus
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2025
[j53]Andreas Karageorghis, C. S. Chen
:
Multi-level method of fundamental solutions for solving polyharmonic problems. J. Comput. Appl. Math. 456: 116220 (2025)- [j52]C. S. Chen, Andreas Karageorghis:
Novel method of fundamental solutions formulation for polyharmonic BVPs. Math. Comput. Simul. 227: 85-102 (2025) - 2024
- [j51]Malgorzata A. Jankowska, Andreas Karageorghis, C. S. Chen:
Training RBF neural networks for solving nonlinear and inverse boundary value problems. Comput. Math. Appl. 165: 205-216 (2024) - 2023
- [j50]Malgorzata A. Jankowska, Andreas Karageorghis, C. S. Chen:
Kansa-RBF algorithms for elliptic BVPs in annular domains with mixed boundary conditions. Math. Comput. Simul. 206: 77-104 (2023) - 2022
- [j49]Andreas Karageorghis:
A time-efficient variable shape parameter Kansa-radial basis function method for the solution of nonlinear boundary value problems. Appl. Math. Comput. 413: 126613 (2022) - [j48]Andreas Karageorghis, Amir Noorizadegan, Chuin-Shan Chen:
Fictitious centre RBF method for high order BVPs in multiply connected domains. Appl. Math. Lett. 125: 107711 (2022) - [j47]Andreas Karageorghis, C. S. Chen:
Training RBF neural networks for the solution of elliptic boundary value problems. Comput. Math. Appl. 126: 196-211 (2022) - [j46]C. S. Chen, Malgorzata A. Jankowska, Andreas Karageorghis:
RBF-DQ algorithms for elliptic problems in axisymmetric domains. Numer. Algorithms 89(1): 33-63 (2022) - [j45]Bernard Bialecki, Graeme Fairweather, Andreas Karageorghis:
An optimal two-step quadratic spline collocation method for the Dirichlet biharmonic problem. Numer. Algorithms 91(3): 1115-1143 (2022) - 2021
- [j44]C. S. Chen, Andreas Karageorghis, Lionel Amuzu:
Kansa RBF collocation method with auxiliary boundary centres for high order BVPs. J. Comput. Appl. Math. 398: 113680 (2021) - [j43]Andreas Karageorghis, Demetriana Tappoura, C. S. Chen:
The Kansa RBF method with auxiliary boundary centres for fourth order boundary value problems. Math. Comput. Simul. 181: 581-597 (2021) - 2020
- [j42]Xiaomin Zhu, Fangfang Dou, Andreas Karageorghis, C. S. Chen:
A fictitious points one-step MPS-MFS technique. Appl. Math. Comput. 382: 125332 (2020) - [j41]C. S. Chen, Andreas Karageorghis, Fang-Fang Dou:
A novel RBF collocation method using fictitious centres. Appl. Math. Lett. 101 (2020) - [j40]Daniel W. Watson, Andreas Karageorghis, C. S. Chen:
The radial basis function-differential quadrature method for elliptic problems in annular domains. J. Comput. Appl. Math. 363: 53-76 (2020) - [j39]Bernard Bialecki, Graeme Fairweather, Andreas Karageorghis, Jonathan Maack:
A quadratic spline collocation method for the Dirichlet biharmonic problem. Numer. Algorithms 83(1): 165-199 (2020)
2010 – 2019
- 2018
- [j38]Bernard Bialecki, Andreas Karageorghis:
A Legendre spectral quadrature Galerkin method for the Cauchy-Navier equations of elasticity with variable coefficients. Numer. Algorithms 77(2): 491-516 (2018) - [j37]Andreas Karageorghis, Malgorzata A. Jankowska, C. S. Chen:
Kansa-RBF algorithms for elliptic problems in regular polygonal domains. Numer. Algorithms 79(2): 399-421 (2018) - 2017
- [j36]Xiao-Yan Liu, C. S. Chen, Andreas Karageorghis:
Conformal Mapping for the Efficient Solution of Poisson Problems with the Kansa-RBF Method. J. Sci. Comput. 71(3): 1035-1061 (2017) - 2016
- [j35]C. S. Chen, Andreas Karageorghis, Yan Li:
On choosing the location of the sources in the MFS. Numer. Algorithms 72(1): 107-130 (2016) - [j34]Andreas Karageorghis, C. S. Chen, Xiao-Yan Liu:
Kansa-RBF Algorithms for Elliptic Problems in Axisymmetric Domains. SIAM J. Sci. Comput. 38(1) (2016) - 2015
- [j33]Bernard Bialecki, Andreas Karageorghis:
Finite Difference Schemes for the Cauchy-Navier Equations of Elasticity with Variable Coefficients. J. Sci. Comput. 62(1): 78-121 (2015) - [j32]Xiao-Yan Liu, Andreas Karageorghis, C. S. Chen:
A Kansa-Radial Basis Function Method for Elliptic Boundary Value Problems in Annular Domains. J. Sci. Comput. 65(3): 1240-1269 (2015) - [j31]Andreas Karageorghis:
The method of fundamental solutions for elliptic problems in circular domains with mixed boundary conditions. Numer. Algorithms 68(1): 185-211 (2015) - 2013
- [j30]Ming Li, C. S. Chen, Andreas Karageorghis:
The MFS for the solution of harmonic boundary value problems with non-harmonic boundary conditions. Comput. Math. Appl. 66(11): 2400-2424 (2013) - [j29]Andreas Karageorghis, Liviu Marin:
Efficient MFS Algorithms for Problems in Thermoelasticity. J. Sci. Comput. 56(1): 96-121 (2013) - [j28]Bernard Bialecki, Andreas Karageorghis:
Modified nodal cubic spline collocation for three-dimensional variable coefficient second order partial differential equations. Numer. Algorithms 64(2): 349-383 (2013) - [j27]Andreas Karageorghis:
Efficient Trefftz collocation algorithms for elliptic problems in circular domains. Numer. Algorithms 64(3): 427-453 (2013) - 2011
- [j26]Graeme Fairweather, Andreas Karageorghis, Jon Maack:
Compact optimal quadratic spline collocation methods for the Helmholtz equation. J. Comput. Phys. 230(8): 2880-2895 (2011) - [j25]Andreas Karageorghis:
Efficient MFS Algorithms for Inhomogeneous Polyharmonic Problems. J. Sci. Comput. 46(3): 519-541 (2011) - [j24]Bernard Bialecki, Graeme Fairweather, Andreas Karageorghis:
Matrix decomposition algorithms for elliptic boundary value problems: a survey. Numer. Algorithms 56(2): 253-295 (2011) - 2010
- [j23]Andreas Karageorghis:
Efficient Kansa-type MFS algorithm for elliptic problems. Numer. Algorithms 54(2): 261-278 (2010) - [j22]Bernard Bialecki, Andreas Karageorghis:
Spectral Chebyshev Collocation for the Poisson and Biharmonic Equations. SIAM J. Sci. Comput. 32(5): 2995-3019 (2010)
2000 – 2009
- 2009
- [j21]Andreas Karageorghis:
Efficient MFS algorithms in regular polygonal domains. Numer. Algorithms 50(2): 215-240 (2009) - 2008
- [j20]Andreas Karageorghis, Yiorgos Sokratis Smyrlis:
Conformal mapping for the efficient MFS solution of Dirichlet boundary value problems. Computing 83(1): 1-24 (2008) - [j19]Bernard Bialecki, Andreas Karageorghis:
Spectral Chebyshev-Fourier collocation for the Helmholtz and variable coefficient equations in a disk. J. Comput. Phys. 227(19): 8588-8603 (2008) - 2007
- [j18]Zakaria Belhachmi, Andreas Karageorghis:
A Spectral Mortar Element Discretization of the Poisson Equation with Mixed Boundary Conditions. J. Sci. Comput. 30(2): 275-299 (2007) - [j17]Bernard Bialecki, Andreas Karageorghis:
A Nonoverlapping Domain Decomposition Method for Legendre Spectral Collocation Problems. J. Sci. Comput. 32(2): 373-409 (2007) - 2006
- [j16]Zakaria Belhachmi, Andreas Karageorghis, K. Taous:
Identification and Reconstruction of a Small Leak Zone in a Pipe by a Spectral Element Method. J. Sci. Comput. 27(1-3): 111-122 (2006) - [j15]Th. Tsangaris, Yiorgos Sokratis Smyrlis, Andreas Karageorghis:
A Matrix Decomposition MFS Algorithm for Problems in Hollow Axisymmetric Domains. J. Sci. Comput. 28(1): 31-50 (2006) - [j14]Andreas Karageorghis, Yiorgos Sokratis Smyrlis, Th. Tsangaris:
A matrix decomposition MFS algorithm for certain linear elasticity problems. Numer. Algorithms 43(2): 123-149 (2006) - [j13]Yiorgos Sokratis Smyrlis, Andreas Karageorghis:
The Method of Fundamental Solutions for Stationary Heat Conduction Problems in Rotationally Symmetric Domains. SIAM J. Sci. Comput. 27(4): 1493-1512 (2006) - 2005
- [j12]Graeme Fairweather, Andreas Karageorghis, Yiorgos Sokratis Smyrlis:
A matrix decomposition MFS algorithm for axisymmetric biharmonic problems. Adv. Comput. Math. 23(1-2): 55-71 (2005) - [j11]Bernard Bialecki, Graeme Fairweather, Andreas Karageorghis:
Optimal Superconvergent One Step Nodal Cubic Spline Collocation Methods. SIAM J. Sci. Comput. 27(2): 575-598 (2005) - [c5]Roman Tankelevich, Andreas Karageorghis:
The method of fundamental solutions in geometric design with potential fields. SIGGRAPH Posters 2005: 1 - 2004
- [j10]Yiorgos Sokratis Smyrlis, Andreas Karageorghis:
A Linear Least-Squares MFS for Certain Elliptic Problems. Numer. Algorithms 35(1): 29-44 (2004) - [j9]Bernard Bialecki, Andreas Karageorghis:
Legendre Gauss Spectral Collocation for the Helmholtz Equation on a Rectangle. Numer. Algorithms 36(3): 203-227 (2004) - 2003
- [j8]Bernard Bialecki, Graeme Fairweather, Andreas Karageorghis:
Matrix Decomposition Algorithms for Modified Spline Collocation for Helmholtz Problems. SIAM J. Sci. Comput. 24(5): 1733-1753 (2003) - 2001
- [j7]Andreas Karageorghis:
The method of fundamental solutions for the calculation of the eigenvalues of the Helmholtz equation. Appl. Math. Lett. 14(7): 837-842 (2001) - [j6]Yiorgos Sokratis Smyrlis, Andreas Karageorghis:
Some Aspects of the Method of Fundamental Solutions for Certain Harmonic Problems. J. Sci. Comput. 16(3): 341-371 (2001) - [j5]Zakaria Belhachmi, Christine Bernardi, Andreas Karageorghis:
Spectral Element Discretization of the Circular Driven Cavity, Part II: The Bilaplacian Equation. SIAM J. Numer. Anal. 38(6): 1926-1960 (2001) - [j4]Bernard Bialecki, Andreas Karageorghis:
A Legendre Spectral Galerkin Method for the Biharmonic Dirichlet Problem. SIAM J. Sci. Comput. 22(5): 1549-1569 (2001) - [c4]Andreas Poullikkas, Andreas Karageorghis, Georgios Georgiou:
The Method of Fundamental Solutions in Three-Dimensional Elastostatics. PPAM 2001: 747-755 - [c3]Yiorgos Sokratis Smyrlis, Andreas Karageorghis:
Rotation of the Sources and Normalization of the Fundamental Solutions in the MFS. PPAM 2001: 762-769
1990 – 1999
- 1999
- [j3]Andreas Karageorghis, Marcin Paprzycki:
Conditioning of Pseudospectral Matrices for Certain Domain Decompositions. J. Sci. Comput. 14(1): 107-119 (1999) - 1998
- [j2]Graeme Fairweather, Andreas Karageorghis:
The method of fundamental solutions for elliptic boundary value problems. Adv. Comput. Math. 9(1-2): 69-95 (1998) - 1996
- [j1]Andreas Karageorghis, Marcin Paprzycki:
An efficient direct method for fully conforming spectral collocation schemes. Numer. Algorithms 12(2): 309-319 (1996) - [c2]Andreas Karageorghis:
Conforming Spectral Domain Decomposition Schemes. WNAA 1996: 220-226 - [c1]Marcin Paprzycki, Andreas Karageorghis:
High Performance Solution of Linear Systems Arising from Conforming Spectral Approximations for Non-Conforming Domain Decompositions. WNAA 1996: 373-379
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-09-21 23:40 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:
