John. A. Burns

John. A. Burns

Auto-generated profile, based on publicly available information

John. A. Burns

Department of Mathematics, Virginia Tech, Blacksburg, VA, USA

Research Focus & Metrics

Academic Career Length

25Years (2002-Present)

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

Representative Publications

View All Publications
1 June 2009
Verified
Conference Paper
Closed access
JBJ. A. Burns
J. A. Burns
ECE. M. Cliff
E. M. Cliff
CRC. Rautenberg
C. Rautenberg
In this paper we present a framework to address filtering and smoothing problems for distributed parameter systems when mobile (dynamic) sensors are used to provide system measurements. This framework can be used for systems governed by parabolic and hyperbolic partial differential equations and hence has application to a diverse set of problems such as estimating locations of biological and chemical sources, target tracking and estimation. We formulate the problems as hybrid systems on infinite dimensional spaces (coupled systems of partial, ordinary and delay differential equations) and use infinite dimensional theory to develop computational algorithms for the problems. A simple numerical example illustrates the approach.

1 June 2002 in Mathematical and Computer Modelling
Verified
Journal Article
Closed access
PDF file
EAEdward James Allen
Edward James Allen
JBJ. Burns
J. Burns
DGDavid Sexton Gilliam
David Sexton Gilliam
JHJ. Hill
J. Hill
VSV. Shubov
V. Shubov

1 June 2014
Verified
Conference Paper
Closed access
JBJohn A. Burns
John A. Burns
ECEugene M. Cliff
Eugene M. Cliff
Heat exchangers are thermal fluid systems that are basic components in many industrial devices. Heat exchangers are modeled by coupled hyperbolic and parabolic partial differential equations and the structure of these equations depends on the geometry of the heat exchanger. In this paper we consider approximation methods for optimal control of a counter flow heat exchanger. We show the system is well-posed in standard product spaces and develop a numerical scheme based on averaging approximations (AVE scheme). Numerical examples are provided to illustrate the applicability of this scheme to both simulation and optimal control. We also discuss other schemes based on finite elements and suggest future areas of research.

30 July 2013 in ESAIM: Mathematical Modelling and Numerical Analysis
Verified
Journal Article
Closed access
PDF file
EAEdward James Allen
Edward James Allen
JBJohn A. Burns
John A. Burns
DGDavid Sexton Gilliam
David Sexton Gilliam
Using Burgers’ equation with mixed Neumann–Dirichlet boundary conditions, we highlight a problem that can arise in the numerical approximation of nonlinear dynamical systems on computers with a finite precision floating point number system. We describe the dynamical system generated by Burgers’ equation with mixed boundary conditions, summarize some of its properties and analyze the equilibrium states for finite dimensional dynamical systems that are generated by numerical approximations of this system. It is important to note that there are two fundamental differences between Burgers’ equation with mixed Neumann–Dirichlet boundary conditions and Burgers’ equation with both Dirichlet boundary conditions. First, Burgers’ equation with homogenous mixed boundary conditions on a finite interval cannot be linearized by the Cole–Hopf transformation. Thus, on finite intervals Burgers’ equation with a homogenous Neumann boundary condition is truly nonlinear. Second, the nonlinear term in Burgers’ equation with a homogenous Neumann boundary condition is not conservative. This structure plays a key role in understanding the complex dynamics generated by Burgers’ equation with a Neumann boundary condition and how this structure impacts numerical approximations. The key point is that, regardless of the particular numerical scheme, finite precision arithmetic will always lead to numerically generated equilibrium states that do not correspond to equilibrium states of the Burgers’ equation. In this paper we establish the existence and stability properties of these numerical stationary solutions and employ a bifurcation analysis to provide a detailed mathematical explanation of why numerical schemes fail to capture the correct asymptotic dynamics. We extend the results in [E. Allen, J.A. Burns, D.S. Gilliam, J. Hill and V.I. Shubov, Math. Comput. Modelling 35 (2002) 1165–1195] and prove that the effect of finite precision arithmetic persists in generating a nonzero numerical false solution to the stationary Burgers’ problem. Thus, we show that the results obtained in [E. Allen, J.A. Burns, D.S. Gilliam, J. Hill and V.I. Shubov, Math. Comput. Modelling 35 (2002) 1165–1195] are not dependent on a specific time marching scheme, but are generic to all convergent numerical approximations of Burgers’ equation.

1 January 2014 in IFAC Proceedings Volumes
Verified
Journal Article
Closed access
PDF file
JBJohn A. Burns
John A. Burns
ECEugene M. Cliff
Eugene M. Cliff
KFKasie Farlow
Kasie Farlow

1 January 2012 in IFAC Proceedings Volumes
Verified
Journal Article
Closed access
PDF file
JBJohn A. Burns
John A. Burns
LZLizette Zietsman
Lizette Zietsman