Ning Zhong 0002

dblp:z/NingZhong2 · DBLP profile ↗
← Back
23ranked-venue papers
6as first author
2since 2021 · last 2021
—ORCID · conflict

Domains — the database's venue-derived domains; a paper can count in several

Theory of computation · 21 · 5 first-author · 2 since 2021Artificial intelligence and machine learning · 1Applied, interdisciplinary, general and emerging computing · 1 · 1 first-author
YearPublicationVenuePosition
2021 Computability of Limit Sets for Two-Dimensional Flows
Daniel Silva Graça, Ning Zhong 0002
CiE2
2021 The set of hyperbolic equilibria and of invertible zeros on the unit ball is computable
Daniel Silva Graça, Ning Zhong 0002
Theor. Comput. Sci.2
2018 Computability of Ordinary Differential Equations
Daniel Silva Graça, Ning Zhong 0002
CiE2
2015 On Computability of Navier-Stokes' Equation
Shu-Ming Sun, Ning Zhong 0002, Martin Ziegler 0001
CiE2
2015 A Tribute to Marian Boykan Pour-El (1928-2009)
abstract
This two part article consists of a brief biography of Marian Boykan Pour-El followed by a summary of her mathematical achievements.
I. Pour-El, Ning Zhong 0002
J. Log. Comput.2
2015 An analytic System with a Computable Hyperbolic Sink Whose Basin of Attraction is Non-Computable
Daniel Silva Graça, Ning Zhong 0002
Theory Comput. Syst.2
2015 Computability aspects for 1st-order partial differential equations via characteristics
Shu-Ming Sun, Ning Zhong 0002
Theor. Comput. Sci.2
2013 Computability and Computational Complexity of the Evolution of Nonlinear Dynamical Systems
Olivier Bournez, Daniel Silva Graça, Amaury Pouly, Ning Zhong 0002
CiE4
2012 The connection between computability of a nonlinear problem and its linearization: The Hartman-Grobman theorem revisited
Daniel Silva Graça, Ning Zhong 0002, H. S. Dumas
Theor. Comput. Sci.2
2011 Computability in planar dynamical systems
Daniel Silva Graça, Ning Zhong 0002
Nat. Comput.2
2009 Computable Analysis of Differential Equations (Invited Talk)
Ning Zhong 0002
CCA1
2009 Computing Domains of Attraction for Planar Dynamics
Daniel Silva Graça, Ning Zhong 0002
UC2
2007 Computable Analysis of a Boundary-Value Problem for the Korteweg-de Vries Equation
Ning Zhong 0002
Theory Comput. Syst.1
2006 Beyond the First Main Theorem - When Is the Solution of a Linear Cauchy Problem Computable?
Klaus Weihrauch, Ning Zhong 0002
TAMC2
2006 Computing Schrödinger propagators on Type-2 Turing machines
Klaus Weihrauch, Ning Zhong 0002
J. Complex.2
2006 An Algorithm for Computing Fundamental Solutions
abstract
For a partial differential operator $P=\sum _{|\alpha |\leq m}c_{\alpha }D^{\alpha }$ with constant coefficients, a generalized function u is a fundamental solution if $Pu=\delta$, where $\delta$ is the Dirac distribution. In this article, we provide an algorithm which computes a fundamental solution for every such differential operator P on a Turing machine if the input- and output-data are represented canonically.
Klaus Weihrauch, Ning Zhong 0002
SIAM J. Comput.2
2005 Computable Analysis of a Non-homogeneous Boundary-Value Problem for the Korteweg-de Vries Equation
Ning Zhong 0002
CiE1
2005 Computing the solution of the Korteweg-de Vries equation with arbitrary precision on Turing
Klaus Weihrauch, Ning Zhong 0002
Theor. Comput. Sci.2
2003 Computatbility theory of generalized functions
abstract
The theory of generalized functions is the foundation of the modern theory of partial differential equations (PDE). As computers are playing an ever-larger role in solving PDEs, it is important to know those operations involving generalized functions in analysis and PDE that can be computed on digital computers. In this article, we introduce natural concepts of computability on test functions and generalized functions, as well as computability on Schwartz test functions and tempered distributions. Type-2 Turing machines are used as the machine model [Weihrauch 2000]. It is shown here that differentiation and integration on distributions are computable operators, and various types of Fourier transforms and convolutions are also computable operators. As an application, it is shown that the solution operator of the distributional inhomogeneous three dimensional wave equation is computable.
Ning Zhong 0002, Klaus Weihrauch
J. ACM1
2001 Turing Computability of a Nonlinear Schrödinger Propagator
Klaus Weihrauch, Ning Zhong 0002
COCOON2
1999 The Wave Propagator Is Turing Computable
Klaus Weihrauch, Ning Zhong 0002
ICALP2
1999 Computability Structure of the Sobolev Spaces and Its Applications
Ning Zhong 0002
Theor. Comput. Sci.1
1998 Recursively Enumerable Subsets of Rq in Two Computing Models: Blum-Shub-Smale Machine and Turing Machine
Ning Zhong 0002
Theor. Comput. Sci.1