Department of Mathematics""
  About the Department

  Undergrad Studies

  Graduate Studies

  Faculty & Staff
    Open Positions
    Graduate Assistants

  News & Events

  Alumni & Friends

  Course Information
""

Ning Zhong

Professor
816 Old Chemistry Building
513-556-4086
ning.zhong@uc.edu
http://homepages.uc.edu/~zhongn

Education

PhD, University of Wisconsin, Madison, 1991.

Research Support

Taft Summer Fellowship, University of Cincinnati. Funded 2005

The National Science Foundation . (DMS 0304986); Funded 2003 to 2004.

Summer Faculty Research Fellowship, University of Cincinnati. Funded 2002

Summer Faculty Research Fellowship, University of Cincinnati. Funded 1998

Junior Faculty Research Fellowship, University of Connecticut. Funded 1996

Society of Actuaries . Funded 1994

Peer Reviewed Publications

Computability theory of Sobolev space and its applications, Theoret. Computer Science, 219(1 & 2), 487-510, 1999.

Is the linear Schr¨odinger propagator computable (with K. Weihrauch), Lecture Notes in Computer Sci., 2064, 369-378, 2000.

Computable analysis of the Korteweg-de Vries equation, (with W. Gay and B.Y. Zhang), Math. Logic Quarterly, 1(47), 93-110, 2001.

Turing computability of a nonlinear Schr¨odinger propagator, (with K. Weihrauch), Lecture Notes in Computer Sci., 2108, 596-601, 2001.

The solution operator of the Korteweg-de Vries equation is computable (with K. Weihrauch), Electronic Notes in Theoretical Computer Science, 66(1), 1-13, 2002.

Is the wave propagator computable or can wave machines beat Turing machines (with K. Weihrauch)? Proceedings of the London Mathematical Society, 3(85), 312-332, 2002.

Computability theory of generalized functions (with K. Weihrauch), Journal of ACM, 50(4), 469-505, 2003.

Computing the solution of the Korteweg-de Vries equation with arbitrary precision on Turingmachines (with K. Weihrauch), Theoretical Computer Science, 332, 337-366, 2005.

Computable analysis of a non-homogeneous boundary-value problem for the Korteweg-deVires equation, Lecture Notes in Computer Science, 3526, 552-561, 2005.

Beyond the first main theorem – When is the solution of a linear Cauchy problem computable (with K. Weihrauch)? Lecture Notes in Computer Science, 3959, 785-794, 2006.

An algorithm for computing fundamental solutions (with K. Weihrauch), SIAM Journal on Computing, 35(6), 1283-1294, 2006.

Computing Schr¨odinger propagators on type-2 Turing machines (with K. Weihrauch), J. Complexity, 22(6), 918–935, 2006.

Complexity of blowup problems (with R. Rettinger and K. Weihrauch), Electronic Notes in Theoretical Computer Science (ENTCS), Vol. 221, 219-230, 2008.

Computable analysis of the abstract Cauchy problem in Banach spaces and its applications I (with K. Weihrauch), Mathematical Logic Quarterly, 53(4-5), 511-531, 2007.

Computable analysis of a boundary-value problem for the Korteweg-de Vries equation, Theory of Computing Systems, 41, 155-175, 2007.

Topological complexity of blowup problems (with R. Rettinger & K. Weihrauch), Journal of Universal Computer Science, VOl. 15, Issue 6, 1301-1316, 2009.

Computability, noncomputability and undecidability of maximalintervals of IVPs (with D.S. Graca & J. Buescu), Transactions of American Mathematical Society, 361(6), 2913-2927, 2009.

Computing Domains of Attraction for Planar Dynamics (with D. S. Graca), Lecture Notes in Computer Science 5715 (2009), 179-190.

Computational unsolvability of domains of attraction of nonlinear systems, Proceedings of American Mathematical Society, 137 (2009), 2773-2783.

Powered by eProfessional
 




© Copyright 2003, University of Cincinnati
839 Old Chem (ML:0025), Cincinnati, OH 45221-0025
Phone: 513.556.4050 Fax:
513.556.3417
Email technical questions or comments


navigation skip McMicken College of Arts and Sciences University of Cincinnati