Searcharxiv⌕ Search
Home/Archive/arXiv

arXiv · 1905.09317

Cell2Fire: A Cell Based Forest Fire Growth Model

Cristobal Pais·Jaime Carrasco·David L. Martell·Andres Weintraub·David L. Woodruff
View original source ↗Read source document ↗Export metadata ↓

Abstract

Cell2Fire is a new cell-based forest and wildland landscape fire growth simulator that is open-source and exploits parallelism to support the modelling of fire growth cross large spatial and temporal scales in a timely manner. The fire environment is characterized by partitioning the landscape into a large number of cells each of which has specified fuel, weather, fuel moisture and topography attributes. Fire spread within each cell is assumed to be elliptical and governed by spread rates predicted by a fire spread model such as the Canadian Forest Fire Behavior Prediction (FBP) System. The simulator includes powerful statistical and graphical output and spatial analysis features to facilitate the display and analysis of projected fire growth. We validated Cell2Fire by using it to predict the growth of real and realistic hypothetical fires, comparing our fire growth predictions with those produced by the state-of-the-art Prometheus fire growth simulator. Cell2Fire is structured to facilitate its use for predicting the growth of individual fires or embedding it in landscape management simulation models. It can be used to produce probabilistic fire scar predictions by allowing for uncertainty concerning the basic spread rate predictions and uncertain weather scenarios that might drive their growth.

Explore related subjects

stat.CO

Keep this discovery

BibTeXRIS

Cristobal Pais, Jaime Carrasco, David L. Martell, Andres Weintraub, David L. Woodruff. 2019-05-22. Cell2Fire: A Cell Based Forest Fire Growth Model. https://arxiv.org/abs/1905.09317

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

Estimating Hierarchically Rank Structured Covariance Matrices

We consider the problem of estimating a high-dimensional covariance matrix from a very limited number of samples. This problem is ubiquitous in computational fluid dynamics, where a small number of fluid snapshots must be used to construct a Gramian matrix determining a reduced-order model, as well as in computational geoscience, where a small ensemble of Earth system forecasts must be used to estimate the covariance matrix associated with the forecast uncertainty. It is common practice to regularize the small-sample covariance by imposing a "localization" structure that enforces a physically realistic correlation length scale, imposing a sparsity constraint, "shrinking" towards a prescribed target, or attenuating small correlations. We propose an alternate technique that regularizes the small-sample covariance by imposing hierarchical rank structure. Compared to regularization methods that assume sparsity such as spatial localization, hierarchical rank structure accommodates a wider range of covariance matrices, roughly corresponding to situations where long-range correlations vary more smoothly than short-range ones. It also results in a data-sparse matrix format that permits highly efficient matrix-vector products. We present theory and algorithms which show how to efficiently estimate a high-dimensional, hierarchically rank structured covariance matrix from limited samples. Through an error analysis and numerical experiments with a variety of model problems, we demonstrate that these techniques are effective at reducing sampling errors, and that in many cases they achieve smaller estimation error than conventional techniques.

stat.CO↗
arXiv2026

Optimal Slice-Adaptive Tuning of Hybrid Slice Sampling

Slice sampling is a Markov chain Monte Carlo algorithm that draws its next state uniformly from a "slice"---a super-level set of the target density function---at each iteration, thereby providing automatic local adaptivity to the scale of the target. In practice the exact slice is not known, so general-purpose implementations use an approximate slice that is grown from a starting interval of length $w>0$, with a computational cost that depends on $w$. This work presents an analysis of the average per-iteration number of target density evaluations, as a function of $w$, of hybrid slice sampling with various slice-finding schemes for targets with contiguous slices. The paper uses the results of the analysis to develop automated, slice-adaptive tuning schemes along with suboptimality bounds and asymptotic convergence guarantees. Simulations demonstrate that the tuning schemes reliably yield near-optimal slice-adaptive tuning with essentially no dependence on the initial setting of $w$.

stat.CO↗