Contact Information

Weihua Geng

Assisnt Professor

Department of Mathematics

Southern Methodist University

Tel: (214) 768-2252

Email: wgeng at smu dot edu


Zhejiang University Electrical and Computer Engineering B.S. 1995-1999
Michigan State University Industrial Mathematics M.S. 2001-2003
Statistics M.S. 2003-2005
Applied Mathematics Ph.D. 2003-2008
University of Michigan Scientific Computing Postdoc 2008-2011

My CV (Last update: August 18, 2014)

Research Interests

Structural biology
Systems biology
Bioinformatics & biomedicine

1) protein folding;

2) protein-protein interaction;

3) chromatin folding


1) Circadian (24h) rhythms

1) Neuromuscular disease, e.g. Myasthenia Gravis


1) Poisson--Botlzmann model (PDE);

2) generalized Born model (N-body)

1) system of ODEs (deterministic);

2) Master equations (Stochastic)

1) parametric models;

2) non-parametric models


1) MIB methods (finite difference);

2) boundary integral methods;

3) Cartesian multipole treecode

1) combinatorics;

2) numerical ODEs;

3) numerical stochastic equations

1) testing hypothesis;

2) data mining;

3) information retrieval

Parallel high performance computing e.g. GPU

Selected Publication


Rsearch Statement

I am interested in modeling problems in structural and systems biology using differential equations and integral equations, and solving these problems numerically with fast algorithms and high performance computing. My main research interest is in numerically solving interface problems described by PDEs and integral equations. These problems appear when adjacent layers with different physical, chemical and biological properties are present. For example, solvated proteins have different permittivities on solutes and solvents, and metal oxide semiconductor field effect transistors (MOSFETs) have different conductivities in metal gates, semiconductors and insulators. Interface problems have discontinuities in equation coefficients and solution which require special numerical treatment. I am interested in: 1) matched interface and boundary (MIB) methods, and 2) boundary integral methods. MIB methods are high order, finite difference mesh-based algorithms used in solving elliptic PDEs, which have discontinuities in solutions and coefficients, and singularities on interfaces and sources. Boundary integral methods are more general methods to solve integral formulations of PDEs. I am interested in combining boundary integral methods with treecode, a fast algorithm for evaluating interactions of N-Body problems, to achieve high accuracy and efficiency.

I am also interested in problems from systems biology. In systems biology, a major difficulty in simulating genetic networks is combinatorial complexity. Although a network may involve a relatively low number of proteins (e.g.~10), complexes can form leading to a very large 2^10 number of species which must be simulated. Even writing down equations of each of these species is very difficult. To simulate these networks, I have been working on algorithms and codes to automatically generate and simulate genetic networks with combinatorial complexity. Our simulations demonstrate that the specific mechanisms of complex formation can drastically change the time scales and steady state behavior of these networks. Using these methods we have begun to model one of the most well studied genetic networks with combinatorial complexity: the mammalian circadian (24-hour) clock which times biological events in our body.

Research Statement