Modeling and Simulating Forest Fire Spread

In this work we propose the use of a cellular automata defined on unstructured triangular grids to simulate forest fire propagation. This approach allows us to model computational domains with complex geometries (a domain bounded by a polygonal). It still retains the easy implementation of cellular automata and does not present the anisotropy induced by regular grids. The forest fire spread is modeled by using ignition and burning probabilities for three different fuels. Each cell assumes four states: nonflammable cell, fuel cell, burning cell and burned cell. Ignition probability is modified by effects of type of fuel, ambient temperature/relative humidity slope and wind (intensity/direction). Numerical simulations reproduce the qualitative behavior of forest fires

Investigación en matemáticas, economía y ciencias sociales

El resultado de este libro que reune inquietudes académicas en torno a temas tan estudiados como los que están alrededor del maíz, del frijol o del café; y tan contemporáneos como las aplicaciones concretas de las ciencias ya citadas, al estudio de la adopción del comercio electrónico en empresas del sector agroindustrial o, el caso de la generación de biogas o energía eléctrica por medio de biodigestores. Al editar este texto e incorporarlo a la bibliografía de los temas de referencia, se enriquecen opciones de consulta para los estudiosos de esos temas en general; pero también para interesados en aspectos tan específicos como la cadena de suministro del mercado hortofrutícola en Texcoco

Tetrahedral Grid Generators and the Eigenvalue Calculation with Edge Elements

Abstract. In this work we investigate some computational aspects of the eigenvalue calculation with edge elements; those include: the importance of the grid generator and node-edge numbering. As the examples show, the sparse structure of the mass and stiffness matrices is highly influenced by the edge numbering. Tetrahedral grid generators are mainly designed for nodal based finite elements so an edge numbering is required. Two different edge numbering schemes are tested with six different grid generators. Significant bandwidth reduction can be obtained by the proper combination of the edge numbering scheme with the grid generator method. Moreover, an ordering algorithm such as the Reverse Cuthill McKee can improve the bandwidth reduction which is necessary to reduce storage requirements