Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “decomposition algorithms”

Search indexed NASA NTRS and DOE OSTI research on propulsion, heat transfer, battery materials and energy systems. Follow report and document links to the original sources.

Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.

At least 1,099 records · Page 61

Discretization and Preconditioning Algorithms for the Euler and Navier-Stokes Equations on Unstructured Meshes

Several stabilized demoralization procedures for conservation law equations on triangulated domains will be considered. Specifically, numerical schemes based on upwind finite volume, fluctuation splitting, Galerkin least-squares, and space discontinuous Galerkin demoralization will be considered in detail. A standard energy analysis for several of these methods will be given via entropy symmetrization. Next, we will present some relatively new theoretical results concerning congruence relationships for left or right symmetrized equations. These results suggest new variants of existing FV, DG, GLS, and FS methods which are computationally more efficient while retaining the pleasant theoretical properties achieved by entropy symmetrization. In addition, the task of Jacobean linearization of these schemes for use in Newton's method is greatly simplified owing to exploitation of exact symmetries which exist in the system. The FV, FS and DG schemes also permit discrete maximum principle analysis and enforcement which greatly adds to the robustness of the methods. Discrete maximum principle theory will be presented for general finite volume approximations on unstructured meshes. Next, we consider embedding these nonlinear space discretizations into exact and inexact Newton solvers which are preconditioned using a nonoverlapping (Schur complement) domain decomposition technique. Elements of nonoverlapping domain decomposition for elliptic problems will be reviewed followed by the present extension to hyperbolic and elliptic-hyperbolic problems. Other issues of practical relevance such the meshing of geometries, code implementation, turbulence modeling, global convergence, etc, will. be addressed as needed.

Barth, Timothy J.↗

Identification of Solid-Electrolyte Interphase Species by Joint Characterization of Li-Ion Battery Chemistry by Mass Spectrometry and Electrochemical Reaction Networks

The formation and stability of the solid-electrolyte interphase (SEI) play central roles in determining the long-term performance and safety of modern electrochemical energy storage systems. Despite decades of research, the SEI’s heterogeneous, dynamic, and multiphase nature has defied comprehensive molecular-level characterization, creating a critical knowledge gap that limits rational battery design. In this work, we introduce a computational−experimental framework that integrates high-throughput quantum chemistry calculations, data-driven electrochemical reaction networks (eCRNs), stochastic algorithms, and laser desorption/ionization Fourier transform ion cyclotron resonance mass spectrometry (LDI-FTICR-MS) to unravel SEI formation in carbonatebased electrolytes without imposing predefined mechanisms. We constructed the most comprehensive eCRN to date, spanning over 10,000 species and 209 million reactions. Through stochastic network analysis, we successfully recovered 27 species that were previously reported in the literature and predicted 28 novel SEI species nearly doubling our scientific knowledge in this area. Each new species was rigorously confirmed through advanced mass spectral analysis of its distinct molecular and isotopic signatures. We kinetically refined the formation pathways for a select set of both previously reported and novel SEI products, revealing kinetically feasible elementary reaction mechanisms with activation barriers below 1 eV. This computational−experimental approach deepens our molecular-level understanding of SEI chemistry by resolving which species form and through which decomposition mechanisms they emerge. Such knowledge provides the foundation necessary to connect electrolyte composition to the resulting SEI components, a critical step toward a more informed electrolyte development in next-generation lithium-based batteries.

25 ENERGY STORAGE↗

Decentralized Schemes with Overlap for Solving Graph-Structured Optimization Problems

We present a new algorithmic paradigm for the decentralized solution of graph-structured optimization problems that arise in the estimation and control of network systems. A key and novel design concept of the proposed approach is that it uses overlapping subdomains to promote and accelerate convergence. We show that the algorithm converges if the size of the overlap is sufficiently large and that the convergence rate improves exponentially with the size of the overlap. The proposed approach provides a bridge between fully decentralized and centralized architectures and is flexible in that it enables the implementation of asynchronous schemes, handling of constraints, and balancing of computing, communication, and data privacy needs. The proposed scheme is tested in an estimation problem for a 9241-node power network and we show that it outperforms the alternating direction method of multipliers.

asynchronous↗

Algorithms and analyses for stochastic optimization for turbofan noise reduction using parallel reduced-order modeling

Simulation-based optimization of acoustic liner design in a turbofan engine nacelle for noise reduction purposes can dramatically reduce the cost and time needed for experimental designs. Because uncertainties are inevitable in the design process, a stochastic optimization algorithm is posed based on the conditional value-at-risk measure so that an ideal acoustic liner impedance is determined that is robust in the presence of uncertainties. A parallel reduced-order modeling framework is developed that dramatically improves the computational efficiency of the stochastic optimization solver for a realistic nacelle geometry. The reduced stochastic optimization solver takes less than 500 s to execute. Additionally, well-posedness and finite element error analyses of the state system and optimization problem are provided.

97 MATHEMATICS AND COMPUTING↗

Discretization and Preconditioning Algorithms for the Euler and Navier-Stokes Equations on Unstructured Meshes

Several stabilized discretization procedures for conservation law equations on triangulated domains will be considered. Specifically, numerical schemes based on upwind finite volume, fluctuation splitting, Galerkin least-squares, and space discontinuous Galerkin discretization will be considered in detail. A standard energy analysis for several of these methods will be given via entropy symmetrization. Next, we will present some relatively new theoretical results concerning congruence relationships for left or right symmetrized equations. These results suggest new variants of existing FV, DG, GLS and FS methods which are computationally more efficient while retaining the pleasant theoretical properties achieved by entropy symmetrization. In addition, the task of Jacobian linearization of these schemes for use in Newton's method is greatly simplified owing to exploitation of exact symmetries which exist in the system. These variants have been implemented in the "ELF" library for which example calculations will be shown. The FV, FS and DG schemes also permit discrete maximum principle analysis and enforcement which greatly adds to the robustness of the methods. Some prevalent limiting strategies will be reviewed. Next, we consider embedding these nonlinear space discretizations into exact and inexact Newton solvers which are preconditioned using a nonoverlapping (Schur complement) domain decomposition technique. Elements of nonoverlapping domain decomposition for elliptic problems will be reviewed followed by the present extension to hyperbolic and elliptic-hyperbolic problems. Other issues of practical relevance such the meshing of geometries, code implementation, turbulence modeling, global convergence, etc. will be addressed as needed.

Barth, Timothy↗

Some practicable applications of quadtree data structures/representation in astronomy

Development of quadtree as hierarchical data structuring technique for representing spatial data (like points, regions, surfaces, lines, curves, volumes, etc.) has been motivated to a large extent by storage requirements of images, maps, and other multidimensional (spatially structured) data. For many spatial algorithms, time-efficiency of quadtrees in terms of execution may be as important as their space-efficiency concerning storage conditions. Briefly, the quadtree is a class of hierarchical data structures which is based on the recursive partition of a square region into quadrants and sub-quadrants until a predefined limit. Beyond the wide applicability of quadtrees in image processing, spatial information analysis, and building digital databases (processes becoming ordinary for the astronomical community), there may be numerous further applications in astronomy. Some of these practicable applications based on quadtree representation of astronomical data are presented and suggested for further considerations. Examples are shown for use of point as well as region quadtrees. Statistics of different leaf and non-leaf nodes (homogeneous and heterogeneous sub-quadrants respectively) at different levels may provide useful information on spatial structure of astronomical data in question. By altering the principle guiding the decomposition process, different types of spatial data may be focused on. Finally, a sampling method based on quadtree representation of an image is proposed which may prove to be efficient in the elaboration of sampling strategy in a region where observations were carried out previously either with different resolution or/and in different bands.

Pasztor, L.↗

Baseline Observations of Hemispheric Sea Ice with the Nimbus 7 Scanning Multichannel Microwave Radiometer

The Scanning Multichannel Microwave Radiometer (SMMR) on board the NASA Nimbus 7 satellite was designed to obtain data for sea surface temperatures (SSTs), near-surface wind speeds, sea ice coverage and type, rainfall rates over the oceans, cloud water content, snow water equivalent, and soil moisture. In this paper, I shall emphasize the sea ice observations and mention briefly some important SST observations. A prime factor contributing to the importance of SMMR sea ice observations lies in their successful integration into a long-term time series, presently being extended by observations from the series of Special Sensor Microwave/Imager (SSMI) on board the DOD/DMSP F8, Fl1, and F12 satellites. This currently constitutes a 19-year data set. Almost half of this was provided by the SMMR. Unfortunately, the 4-year data set produced earlier by the single-channel Electrically Scanned Microwave Radiometer (ESMR) was not successfully integrated into the SMMR/SSMI data set. This resulted primarily from the lack of an overlap period to provide intersensor adjustment, but also because of the large difference between the algorithms to produce ice concentrations and large temporal gaps in the ESMR data. The lack of overlap between the SeaSat and Nimbus 7 SMMR data sets was an important consideration for also excluding the SeatSat one, but the spatial gaps especially in the Southern Hemisphere daily SeaSat observations was another. The sea ice observations will continue into the future by means of the Advanced Microwave Scanning Radiometer (AMSR) on board the ADEOS II and EOS satellites due to be launched in mid- and late-2000, respectively. Analysis of the sea ice data has been carried out by a number of different techniques. Long-term trends have been examined by means of ordinary least squares and band-limited regression. Oscillations in the data have been examined by band-limited Fourier analysis. Here, I shall present results from a novel combination of Principal Component analysis and the recently-developed Empirical Mode Decomposition (EMD). In this method, the data are first separated into spatial and temporal parts, and then the temporal parts of the first few PCs are broken into intrinsic modes by the EMD method.

Gloersen, Per↗

High-order discretization of a gyrokinetic Vlasov model in edge plasma geometry

We describe a new spatial discretization of a continuum gyrokinetic Vlasov model in axisymmetric tokamak edge plasma geometries. The geometries are represented using a multiblock decomposition in which logically distinct blocks are smoothly mapped from rectangular computational domains and are aligned with magnetic flux surfaces to accommodate strong anisotropy induced by the magnetic field. We employ a fourth-order, finite-volume discretization in mapped coordinates to mitigate the computational expense associated with discretization on 4D phase space grids. Applied to a conservative formulation of the gyrokinetic system, a finite-volume approach expresses local conservation discretely in a natural manner involving the calculation of normal fluxes at cell faces. In the approach presented here, the normal fluxes are computed in terms of face-averaged velocity normals in such a way that (i) the divergence-free property of the gyrokinetic velocity is preserved discretely to machine precision, (ii) the configuration space normal velocities are independent of mapping metrics, and (iii) the configuration space normal velocities are computed from exact pointwise evaluation of magnetic field data except for one term. The algorithms described in this paper form the foundation of a continuum gyrokinetic edge code named COGENT, which is used here to perform a convergence study verifying the accuracy of the spatial discretization.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

An overlapping domain decomposition method for large-scale problems

Discretization of dynamical models defined through partial differential equations leads to large-scale systems. Time-depending condition involves an iterative integration of such kind of systems. In this paper, a novel technique based on overlapped domain decomposition, without preconditioner and scalable, is presented. Due to the domain decomposition, subproblems are solved in parallel without communications, cutting off the computation time and optimizing the computational cost. This direct method describes an optimized parallel strategy to solve the initial problem, providing the exact solution, up to rounding errors. Moreover, it takes into account both physical nature of the problem and deriving numerical properties of the system. It is highly recommended in case of band matrices and a long time interval because of an increasing gain in terms of performance and computational cost with the number of integrations. A deep analysis of the computational cost concludes the paper.

97 MATHEMATICS AND COMPUTING↗

Metagenome-assembled genomes from soil samples in control and warming plots in Blodgett Forest, CA (2014-2021)

The pathways of carbon transport and loss through and from soils—soil organic matter (SOM) depolymerization to dissolved organic carbon and mineralization to carbon dioxide (CO2)—are fundamentally driven by microbial activity, which is strongly regulated by environmental conditions. As part of LBNL (Lawrence Berkeley National Laboratory) TES (Terrestrial Ecosystem Science) Belowground Biogeochemistry Science Focus Area (SFA), we have established a novel whole-soil long-term warming experiment at the University of California (UC) Blodgett Forest Research Station (Sierra Nevada) in 2014, where we study the role of biogeochemical, microbial and geochemical process interactions in SOM decomposition and stabilization.Here, we present metagenome-assembled genomes (MAGs) for the bacterial and archaeal community from soil depth profiles collected from 2014 to 2021 from three paired control and warming plots. We collected soil samples across a range of depth profiles (spanning surface to 90 cm deep) from three paired control and warming plots from a temperate mixed forest in Northern California. Each paired plot had been subjected to experimental warming since June 2014 to simulate a predicted climate change scenario for northern California. 101 soil metagenomes were sequenced at JGI (Joint Genome Institute) and UCSF (University of California San Francisco) Center for Advanced Technology and can be found under the JGI (Joint Genome Institute) GOLD (Genomes Online Database) Sequencing project Gs0151586 and NCBI (National Center for Biotechnology Information) Projects PRJNA1225762 and PRJEB39497. Metagenomes were assembled using JGI (Joint Genome Institute) Metagenome Workflow (10.1128/mSystems.00804-20). For each metagenome, the assembled contigs were binned into genomes using 3 binning algorithms (cocacola, metabat, and maxbin) and the resulting bins were consolidated using dastool. The consolidated bins from all metagenomes were pooled, filtered by completeness (>50%) and contamination (<25%), and dereplicated at 99% ANI (average nucleotide identity) using dRep (https://github.com/MrOlm/drep).The dataset includes a zip file of 2321 MAG (Metagenome Assembled Genome) fasta files, the accession numbers for the underlying metagenomes, and a csv file with MAG (Metagenome Assembled Genome) quality metrics and taxonomic classification (GTDB -Genome Taxonomy Database-RS220). This dataset also includes a file-level metadata (flmd.csv) file that lists each file contained in the dataset with associated metadata and a data dictionary (dd.csv) file that contains column/row headers used throughout the files along with a definition, units, and data type. A sample metadata file (samples.csv) that contains site information has also been included.

54 ENVIRONMENTAL SCIENCES↗

Image Segmentation, Registration, Compression, and Matching

A novel computational framework was developed of a 2D affine invariant matching exploiting a parameter space. Named as affine invariant parameter space (AIPS), the technique can be applied to many image-processing and computer-vision problems, including image registration, template matching, and object tracking from image sequence. The AIPS is formed by the parameters in an affine combination of a set of feature points in the image plane. In cases where the entire image can be assumed to have undergone a single affine transformation, the new AIPS match metric and matching framework becomes very effective (compared with the state-of-the-art methods at the time of this reporting). No knowledge about scaling or any other transformation parameters need to be known a priori to apply the AIPS framework. An automated suite of software tools has been created to provide accurate image segmentation (for data cleaning) and high-quality 2D image and 3D surface registration (for fusing multi-resolution terrain, image, and map data). These tools are capable of supporting existing GIS toolkits already in the marketplace, and will also be usable in a stand-alone fashion. The toolkit applies novel algorithmic approaches for image segmentation, feature extraction, and registration of 2D imagery and 3D surface data, which supports first-pass, batched, fully automatic feature extraction (for segmentation), and registration. A hierarchical and adaptive approach is taken for achieving automatic feature extraction, segmentation, and registration. Surface registration is the process of aligning two (or more) data sets to a common coordinate system, during which the transformation between their different coordinate systems is determined. Also developed here are a novel, volumetric surface modeling and compression technique that provide both quality-guaranteed mesh surface approximations and compaction of the model sizes by efficiently coding the geometry and connectivity/topology components of the generated models. The highly efficient triangular mesh compression compacts the connectivity information at the rate of 1.5-4 bits per vertex (on average for triangle meshes), while reducing the 3D geometry by 40-50 percent. Finally, taking into consideration the characteristics of 3D terrain data, and using the innovative, regularized binary decomposition mesh modeling, a multistage, pattern-drive modeling, and compression technique has been developed to provide an effective framework for compressing digital elevation model (DEM) surfaces, high-resolution aerial imagery, and other types of NASA data.

Yadegar, Jacob↗

Enhancing SRF cavity stability and minimizing detuning with data-driven resonance control based on dynamic mode decomposition

Effective resonance control of superconducting radio frequency (SRF) cavities is critical for large machines like LCLS-II, as failure to achieve proper control can result in increased RF power consumption, higher cryogenic heat loads, and increased costs. To address this challenge, we have developed a machine learning (ML) model based on the dynamic mode decomposition method to represent the forced cavity dynamics. Using this model, we designed a model predictive controller (MPC) and demonstrated through simulation that the MPC can effectively stabilize the amplitude and phase of SRF cavities using only a frequency actuator, even in the presence of multiple mechanical modes. The lightweight and explicit ML model makes the controller suitable for direct implementation on field-programmable gate arrays, unlocking the full potential of SRF linacs like LCLS-II, enabling higher beam power and energy, and also serving as an advanced motion controller for various applications, such as photon beamlines and storage rings.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗

Disjunctive optimization model and algorithm for long-term capacity expansion planning of reliable power generation systems

This paper proposes a new optimization model and algorithm for long-term capacity expansion planning of reliable power generation systems. The model optimizes both investment decisions (e.g., size, location, and time to install, retire and decommission facilities) and operation decisions (e.g., on/off status, operating capacity, and expected power output). It is also able to optimize reserve systems (or backup systems), as well as the main systems, to improve power systems reliability. An impact of operational strategies of generators (i.e., participating in electricity production vs. remaining as idle units during operation) on power systems reliability is considered. Probability of equipment failures and capacity failure states are used to rigorously estimate the power systems reliability depending on design and operation strategies. The optimization model is formulated with Generalized Disjunctive Programming (GDP), which is reformulated as a mixed-integer linear programming (MILP) model using the Hull relaxation. Two reliability-related penalties, such as downtime penalty and unmet demand penalty, are included in the objective function to maximize reliability while minimizing the total net present cost. Furthermore, a bilevel decomposition with tailored cuts is developed to reduce computational times of the multi-scale optimization model. The effectiveness of the proposed model is shown by comparing the results with the results obtained from the expansion planning models that do not explicitly consider reliability. In conclusion, we also show that the proposed bilevel decomposition is computationally efficient for solving large scale problems through 5-years and 10-years planning case studies.

29 ENERGY PLANNING, POLICY, AND ECONOMY↗

Satellite Monitoring of Global Surface Soil Organic Carbon Dynamics Using the SMAP Level 4 Carbon Product

Soil organic carbon (SOC) is an important metric of soil health and the terrestrial carbon balance. Short‐term climate variations affect SOC through changes in temperature and moisture, which control vegetation growth and soil decomposition. We evaluated a satellite data‐driven carbon model, operating under the NASA Soil Moisture Active‐Passive (SMAP) mission, as a means of monitoring global surface SOC dynamics. The SMAP Level 4 Carbon (L4C) product estimates a daily global carbon budget including surface (0‐ to 5‐cm depth) SOC. We found that the L4C mean latitudinal SOC distribution is generally consistent with alternative assessments from static soil inventory records and dynamic global vegetation models (r ≥ 0.89). Within forest systems, based on inventory data, L4C SOC is most similar in magnitude to litterfall but is correlated with coarse woody debris ( urn:x-wiley:jgrg:media:jgrg21790:jgrg21790-math-0001) and total SOC ( urn:x-wiley:jgrg:media:jgrg21790:jgrg21790-math-0002). L4C SOC is sensitive to seasonal and annual climate variability, with mean residence times that range from 1.5 years in the wet tropics to 17 years in the cold tundra. Incorporating soil moisture retrievals from the SMAP L‐band (1.4 GHz) microwave radiometer within the L4C algorithm provides enhanced soil moisture sensitivity under low‐to‐moderate vegetation cover (<5 kg/sq.m vegetation water content). The L‐band soil moisture had the greatest impact on the L4C carbon budget in semiarid regions, which span almost 60% of the globe and account for substantial variability in the terrestrial carbon sink. The L4C operational product enables prognostic investigations into effects of recent climate trends and anomalies (e.g., droughts and pluvials) on shallow soil carbon dynamics.

K. Arthur Endsley↗

A variance-based decomposition and global sensitivity index method for uncertainty quantification: Application to retrieved ice cloud properties

This study develops a novel uncertainty quantification (UQ) method for cloud microphysical property retrievals using variance-based decomposition and global sensitivity index. In this UQ framework, empirical orthogonal function (EOF) analysis is applied to the U.S. Department of Energy Atmospheric Radiation Measurement (ARM) ground-based observations, which are the inputs for the cloud retrieval studied here. The principal components (PCs) in the EOF expansion are parameterized as random input variables, and hence, the input dimension is greatly reduced (up to a factor of 50), allowing large ensemble of random samplings. The EOF expansion improves the accuracy of the uncertainty estimation by taking into account the cross correlations in the input data profiles. Here, this method enables a probabilistic representation of a retrieval process by adding normally distributed perturbations into PCs of sample means of input data profiles within a time window. Therefore, it effectively facilitates objective validation of climate models against cloud retrievals under a probabilistic framework for rigorous statistical inferences. Moreover, the variance-based global sensitivity index analysis, part of this method, attributes the output uncertainties to each individual source, thus providing directions for improving retrieval algorithms and observation strategies. For demonstration, we apply this method to quantify the uncertainties of the ARM program's baseline cloud retrieval algorithm for an ice cloud case observed at the Southern Great Plains site on 9 March 2000.

54 ENVIRONMENTAL SCIENCES↗

An Algorithmic and Software Pipeline for Very Large Scale Scientific Data Compression with Error Guarantees

Efficient data compression is becoming increasingly critical for storing scientific data because many scientific applications produce vast amounts of data. This paper presents an end-to-end algorithmic and software pipeline for data compression that guarantees both error bounds on primary data (PD) and derived data, known as Quantities of Interest (QoI).We demonstrate the effectiveness of the pipeline by compressing fusion data generated by a large-scale fusion code, XGC, which produces tens of petabytes of data in a single day. We demonstrate that the compression is conducted by setting aside computational resources known as staging nodes, and does not impact the simulation performance. For efficient parallel I/O, the pipeline uses ADIOS2, which many codes such as XGC already use for their parallel I/O. We show that our approach can compress the data by two orders of magnitude while guaranteeing high accuracy on both the PD and the QoIs. Further, the amount of resources required by compression is a few percent of the resources required by simulation while ensuring that the compression time for each stage is less than the corresponding simulation time.This pipeline consists of three main steps. The first step decomposes the data using domain decomposition into small subdomains. Each subdomain is then compressed independently to achieve a high level of parallelism. The second step uses existing techniques that guarantee error bounds on the primary data for each subdomain. The third step uses a post-processing optimization technique based on Lagrange multipliers to reduce the QoI errors for data corresponding to each subdomain. The Lagrange multipliers generated can be further quantized or truncated to increase the compression level. All of the above characteristics of our approach make it highly practical to apply on-the-fly compression while guaranteeing errors on QoIs that are critical to the scientists.

Banerjee, Tania↗

Monitoring of Volcanogenic CO2-Induced Tree Kills with AVIRIS Image Data at Mammoth Mountain, California

Elevated cold CO2 emissions from the flank of Mammoth Mountain volcano on the southwest rim of the Long Valley Caldera, eastern California, have been the cause of over 100 acres of dead trees in that area since 1990. The source of the CO2 gas is thought to be from one or more magmatic intrusion(s) beneath Mammoth Mountain and is probably related to a period of seismic unrest that began in 1989. The gas rises to the surface probably from depths of a few kilometers, along faults and fracture zones. The gas is at ambient temperature and diffuses from the soil rather than discharging from distinct vents. Typically, soil gas concentrations in tree-kill areas range from 10% to over 90% CO2 by volume, as compared to normal background of < 1% in healthy forest. The gas composition is predominantly CO2 mixed with air (sulfur gases are not elevated), and C and He isotopic ratios are consistent with a magmatic origin for the gas. The total CO2 emission has been estimated at 1200 tons/day, comparable to the emissions at Kilauea. Some of the dead trees are as old as 250 years, suggesting that similar anomalous gas discharge has not occurred over the previous few hundred years. The delta C-13/12 ratio in the Mammoth Mountain CO2 emission averages about -4.5 (PDB standard). This is consistent with a mantle source for the carbon. However, the large volume of the emission suggests that not all of the CO2 is necessarily being generated from the 1989 intrusion. The voluminous gas could be leaking from a vapor-rich zone, capped by an impermeable layer, that was supplied CO2 from degassing of many small magma bodies that intruded beneath the mountain over a period of decades or centuries. Earthquakes in 1989 could have fractured the capping layer and provided pathways for the escape Of CO2 to the surface. Alternatively, some of the CO2 could be derived from contact metamorphism of carbonate rocks intruded by magma. Carbonate-bearing Paleozoic roof pendents crop out in close proximity to Mammoth Mountain. It is possible that similar rocks could occur at depth beneath Mammoth Mountain, and could have contributed CO2 from thermal decomposition caused from recent intrusions. We hope to determine the C-13/12 ratio of a suite of samples to demonstrate if the carbonate rocks could be the source of at least part of the 1990-97 CO2 emission. To better understand the behavior of the CO2 gas, we have used hyperspectral imagery data of Mammoth Mountain acquired from the Airborne Visual/Infrared Imaging Spectrometer (AVIRIS) to map out areas of dead trees. The areas of tree kill have increased in size from about 50 acres in 1994 to about 100 acres in 1997. Tree kill is the major surface manifestation of the carbon dioxide flux at Mammoth Mountain, is widely dispersed, and has been cursorily mapped by regular field mapping techniques in the area. Initial investigations using airborne digital imagery from the Thematic Mapper Simulator (NS001) and AVIRIS instruments have shown extremely encouraging results for complete delineation of the vegetation anomalies. The most successful maps (when compared with ground truth) were developed using AVIRIS data with spectral angle mapper and matched filter algorithms with a data set that was reduced to maximum variance via the minimum noise fraction transformation. The result of this work is a series of maps that show the tree kill areas occurring in an halo-pattern surrounding the base of Mammoth Mountain. We are applying these same techniques to earlier AVIRIS images of Mammoth Mountain to examine the progression of the tree kill areas over time. Temporal maps of the tree kill areas may assist in constructing a picture of the structure beneath Mammoth Mountain.

Hausback, Brian P.↗