Mohamed Nasser

Prof. Mohamed Nasser


Research Focus & Metrics

Academic Career Length

22Years (2005-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
1 April 2008 in Journal of Computational and Applied Mathematics
Verified
Journal Article
Closed access
RWRudolf Wegmann
Rudolf Wegmann
MNMohamed Nasser
Mohamed Nasser

1 January 2009 in SIAM Journal on Scientific Computing
Verified
Journal Article
Closed access
MNMohamed Nasser
Mohamed Nasser
We present a unified boundary integral method for approximating the conformal mappings from any bounded or unbounded multiply connected region G onto the five classical canonical slit domains. The method is based on a uniquely solvable boundary integral equation with the generalized Neumann kernel. Using the proposed method, the approximate mapping functions onto the five canonical slit domains can be computed in a unified way by solving linear systems with a common coefficient matrix. The method can be also used for calculating the conformal mappings of simply and doubly connected regions. The performance of the method is illustrated by several examples for regions with smooth boundaries and with piecewise smooth boundaries.

1 June 2016 in IMA Journal of Applied Mathematics
Verified
Journal Article
Open access
PDF file
DCD. G. Crowdy
D. G. Crowdy
EKE. H. Kropf
E. H. Kropf
CGC. C. Green
C. C. Green
MNMohamed Nasser
Mohamed Nasser
This article surveys the important role, in a variety of applied mathematical contexts, played by the so-called Schottky–Klein (S–K) prime function. While it is a classical special function, introduced by 19th century investigators, its theoretical significance for applications has only been realized in the last decade or so, especially with respect to solving problems defined in multiply connected, or ‘holey’, domains. It is shown here that, in terms of it, many well-known results pertaining only to the simply connected case (no holes) can be generalized, in a natural way, to the multiply connected case, thereby contextualizing those well-known results within a more general framework of much broader applicability. Given the wide-ranging usefulness of the S–K prime function it is important to be able to compute it efficiently. Here we introduce both a new theoretical formulation for its computation, as well as two distinct numerical methods to implement the construction. The combination of these theoretical and computational developments renders the S–K prime function a powerful new tool in applied mathematics.


22 June 2017 in Computational Methods and Function Theory
Verified
Journal Article
Closed access
PDF file
JLJörg Liesen
Jörg Liesen
OSOlivier Sète
Olivier Sète
MNMohamed Nasser
Mohamed Nasser

7 March 2008 in Computational Methods and Function Theory
Verified
Journal Article
Closed access
PDF file
MNMohamed Nasser
Mohamed Nasser