Spatio-Temporal Estimation of Wildfire Growth

Author(s):  
Balaji R. Sharma ◽  
Manish Kumar ◽  
Kelly Cohen

This work presents a methodology for real-time estimation of wildland fire growth, utilizing afire growth model based on a set of partial differential equations for prediction, and harnessing concepts of space-time Kalman filtering and Proper Orthogonal Decomposition techniques towards low dimensional estimation of potentially large spatio-temporal states. The estimation framework is discussed in its criticality towards potential applications such as forest fire surveillance with unmanned systems equipped with onboard sensor suites. The effectiveness of the estimation process is evaluated numerically over fire growth data simulated using a well-established fire growth model described by coupled partial differential equations. The methodology is shown to be fairly accurate in estimating spatio-temporal process states through noise-ridden measurements for real-time deploy ability.

Author(s):  
Nkosingiphile Mnguni ◽  
Sameerah Jamal

Abstract This paper considers two categories of fractional-order population growth models, where a time component is defined by Riemann–Liouville derivatives. These models are studied under the Lie symmetry approach, and we reduce the fractional partial differential equations to nonlinear ordinary differential equations. Subsequently, solutions of the latter are determined numerically or with the aid of Laplace transforms. Graphical representations for integral and trigonometric solutions are presented. A key feature of these models is the connection between spatial patterning of organisms versus competitive coexistence.


Complexity ◽  
2018 ◽  
Vol 2018 ◽  
pp. 1-16 ◽  
Author(s):  
J. Nathan Kutz ◽  
J. L. Proctor ◽  
S. L. Brunton

We consider the application of Koopman theory to nonlinear partial differential equations and data-driven spatio-temporal systems. We demonstrate that the observables chosen for constructing the Koopman operator are critical for enabling an accurate approximation to the nonlinear dynamics. If such observables can be found, then the dynamic mode decomposition (DMD) algorithm can be enacted to compute a finite-dimensional approximation of the Koopman operator, including its eigenfunctions, eigenvalues, and Koopman modes. We demonstrate simple rules of thumb for selecting a parsimonious set of observables that can greatly improve the approximation of the Koopman operator. Further, we show that the clear goal in selecting observables is to place the DMD eigenvalues on the imaginary axis, thus giving an objective function for observable selection. Judiciously chosen observables lead to physically interpretable spatio-temporal features of the complex system under consideration and provide a connection to manifold learning methods. Our method provides a valuable intermediate, yet interpretable, approximation to the Koopman operator that lies between the DMD method and the computationally intensive extended DMD (EDMD). We demonstrate the impact of observable selection, including kernel methods, and construction of the Koopman operator on several canonical nonlinear PDEs: Burgers’ equation, the nonlinear Schrödinger equation, the cubic-quintic Ginzburg-Landau equation, and a reaction-diffusion system. These examples serve to highlight the most pressing and critical challenge of Koopman theory: a principled way to select appropriate observables.


2001 ◽  
Vol 124 (1) ◽  
pp. 70-80 ◽  
Author(s):  
C. Prud’homme ◽  
D. V. Rovas ◽  
K. Veroy ◽  
L. Machiels ◽  
Y. Maday ◽  
...  

We present a technique for the rapid and reliable prediction of linear-functional outputs of elliptic (and parabolic) partial differential equations with affine parameter dependence. The essential components are (i) (provably) rapidly convergent global reduced-basis approximations—Galerkin projection onto a space WN spanned by solutions of the governing partial differential equation at N selected points in parameter space; (ii) a posteriori error estimation—relaxations of the error-residual equation that provide inexpensive yet sharp and rigorous bounds for the error in the outputs of interest; and (iii) off-line/on-line computational procedures methods which decouple the generation and projection stages of the approximation process. The operation count for the on-line stage in which, given a new parameter value, we calculate the output of interest and associated error bound, depends only on N (typically very small) and the parametric complexity of the problem; the method is thus ideally suited for the repeated and rapid evaluations required in the context of parameter estimation, design, optimization, and real-time control.


Sign in / Sign up

Export Citation Format

Share Document