Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “sampling algorithm”

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,477 records · Page 82

SLUG-STOCHASTICALLY LIGHTING UP GALAXIES. I. METHODS AND VALIDATING TESTS

The effects of stochasticity on the luminosities of stellar populations are an often neglected but crucial element for understanding populations in the low-mass or the low star formation rate regime. To address this issue, we present SLUG, a new code to 'Stochastically Light Up Galaxies'. SLUG synthesizes stellar populations using a Monte Carlo technique that properly treats stochastic sampling including the effects of clustering, the stellar initial mass function, star formation history, stellar evolution, and cluster disruption. This code produces many useful outputs, including (1) catalogs of star clusters and their properties such as their stellar initial mass distributions and their photometric properties in a variety of filters, (2) two dimensional histograms of color-magnitude diagrams of every star in the simulation, and (3) the photometric properties of field stars and the integrated photometry of the entire simulated galaxy. After presenting the SLUG algorithm in detail, we validate the code through comparisons with STARBURST99 in the well-sampled regime, and with observed photometry of Milky Way clusters. Finally, we demonstrate SLUG's capabilities by presenting outputs in the stochastic regime. SLUG is publicly distributed through the Web site http://sites.google.com/site/runslug/.

79 ASTRONOMY AND ASTROPHYSICS↗

Recursive form of the eigensystem realization algorithm for system identification

An algorithm is developed for recursively calculating the minimum realization of a linear system from sampled impulse response data. The Gram-Schmidt orthonormalization technique is used to generate an orthonormal basis for factorization of the data matrix. The system matrix thus identified is in upper Hessenberg form, which has advantages for the identification of modal parameters including damping coefficients, frequencies, mode shapes, and modal participation factors. It also has the property that once an element of the system matrix is computed, it is never altered as the dimension of the model is increased in the recursive process. Numerical examples are presented for comparison of the recursive and nonrecursive forms of the eigensystem realization algorithm.

Longman, Richard W.↗

Adaptive sampling quasi-Newton methods for zeroth-order stochastic optimization

Here, we consider unconstrained stochastic optimization problems with no available gradient information. Such problems arise in settings from derivative-free simulation optimization to reinforcement learning. We propose an adaptive sampling quasi-Newton method where we estimate the gradients using finite differences of stochastic function evaluations within a common random number framework. We develop modified versions of a norm test and an inner product quasi-Newton test to control the sample sizes used in the stochastic approximations and provide global convergence results to the neighborhood of a locally optimal solution. We present numerical experiments on simulation optimization problems to illustrate the performance of the proposed algorithm. When compared with classical zeroth-order stochastic gradient methods, we observe that our strategies of adapting the sample sizes significantly improve performance in terms of the number of stochastic function evaluations required.

97 MATHEMATICS AND COMPUTING↗

An Adaptive Particle Tracking Algorithm for Lagrangian-Eulerian Simulations of Dispersed Multiphase Flows

The Lagrangian-Eulerian method is broadly used for simulations of dispersed multiphase flows by solving the continuous phase in the Eulerian framework while treating the dispersed phase as point particles in a Lagrangian framework. The accuracy of the Lagrangian-Eulerian method largely depends on the number of computational particles tracked for the Lagrangian phase. In this study, an adaptive Lagrangian particle tracking algorithm is proposed to balance the statistical error and the computational cost by dividing and merging the particles according to the local particle statistics in the computational domain. The computational particles are considered as weighted sampling points of the particle probability density functions (PDF) which represents a statistical equivalence of the Lagrangian phase. The algorithm is implemented as a part of a C++ library for Lagrangian particles, Grit, with performance portability to multi-core or many-core CPUs and Graphic Processing Unit (GPU) architectures. The accuracy of the proposed algorithm with two different schemes are studied through a test problem with analytical solutions for both the particle number density and momentum source term. The results are used to evaluate the proposed algorithm as well as to validate the parallel implementation.

Ge, Wenjun↗

A model and variance reduction method for computing statistical outputs of stochastic elliptic partial differential equations

We present a model and variance reduction method for the fast and reliable computation of statistical outputs of stochastic elliptic partial differential equations. Our method consists of three main ingredients: (1) the hybridizable discontinuous Galerkin (HDG) discretization of elliptic partial differential equations (PDEs), which allows us to obtain high-order accurate solutions of the governing PDE; (2) the reduced basis method for a new HDG discretization of the underlying PDE to enable real-time solution of the parameterized PDE in the presence of stochastic parameters; and (3) a multilevel variance reduction method that exploits the statistical correlation among the different reduced basis approximations and the high-fidelity HDG discretization to accelerate the convergence of the Monte Carlo simulations. The multilevel variance reduction method provides efficient computation of the statistical outputs by shifting most of the computational burden from the high-fidelity HDG approximation to the reduced basis approximations. Furthermore, we develop a posteriori error estimates for our approximations of the statistical outputs. Based on these error estimates, we propose an algorithm for optimally choosing both the dimensions of the reduced basis approximations and the sizes of Monte Carlo samples to achieve a given error tolerance. We provide numerical examples to demonstrate the performance of the proposed method.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Dakota, a multilevel parallel object-oriented framework for design optimization, parameter estimation, uncertainty quantification, and sensitivity analysis version 6.0 theory manual

The Dakota (Design Analysis Kit for Optimization and Terascale Applications) toolkit provides a exible and extensible interface between simulation codes and iterative analysis methods. Dakota contains algorithms for optimization with gradient and nongradient-based methods; uncertainty quanti cation with sampling, reliability, and stochastic expansion methods; parameter estimation with nonlinear least squares methods; and sensitivity/variance analysis with design of experiments and parameter study methods. These capabilities may be used on their own or as components within advanced strategies such as surrogate-based optimization, mixed integer nonlinear programming, or optimization under uncertainty. By employing object-oriented design to implement abstractions of the key components required for iterative systems analyses, the Dakota toolkit provides a exible and extensible problem-solving environment for design and performance analysis of computational models on high performance computers. This report serves as a theoretical manual for selected algorithms implemented within the Dakota software. It is not intended as a comprehensive theoretical treatment, since a number of existing texts cover general optimization theory, statistical analysis, and other introductory topics. Rather, this manual is intended to summarize a set of Dakota-related research publications in the areas of surrogate-based optimization, uncertainty quanti cation, and optimization under uncertainty that provide the foundation for many of Dakota's iterative analysis capabilities.

97 MATHEMATICS AND COMPUTING↗

Computational Tools and Algorithms for Designing Customized Synthetic Genes

Advances in DNA synthesis have enabled the construction of artificial genes, gene circuits, and genomes of bacterial scale. Freedom in de novo design of synthetic constructs provides significant power in studying the impact of mutations in sequence features, and verifying hypotheses on the functional information that is encoded in nucleic and amino acids. To aid this goal, a large number of software tools of variable sophistication have been implemented, enabling the design of synthetic genes for sequence optimization based on rationally defined properties. The first generation of tools dealt predominantly with singular objectives such as codon usage optimization and unique restriction site incorporation. Recent years have seen the emergence of sequence design tools that aim to evolve sequences toward combinations of objectives. The design of optimal protein-coding sequences adhering to multiple objectives is computationally hard, and most tools rely on heuristics to sample the vast sequence design space. In this review, we study some of the algorithmic issues behind gene optimization and the approaches that different tools have adopted to redesign genes and optimize desired coding features. We utilize test cases to demonstrate the efficiency of each approach, as well as identify their strengths and limitations.

60 APPLIED LIFE SCIENCES↗

DAKOTA : a multilevel parallel object-oriented framework for design optimization, parameter estimation, uncertainty quantification, and sensitivity analysis. Version 5.0, developers manual.

The DAKOTA (Design Analysis Kit for Optimization and Terascale Applications) toolkit provides a flexible and extensible interface between simulation codes and iterative analysis methods. DAKOTA contains algorithms for optimization with gradient and nongradient-based methods; uncertainty quantification with sampling, reliability, and stochastic finite element methods; parameter estimation with nonlinear least squares methods; and sensitivity/variance analysis with design of experiments and parameter study methods. These capabilities may be used on their own or as components within advanced strategies such as surrogate-based optimization, mixed integer nonlinear programming, or optimization under uncertainty. By employing object-oriented design to implement abstractions of the key components required for iterative systems analyses, the DAKOTA toolkit provides a flexible and extensible problem-solving environment for design and performance analysis of computational models on high performance computers. This report serves as a developers manual for the DAKOTA software and describes the DAKOTA class hierarchies and their interrelationships. It derives directly from annotation of the actual source code and provides detailed class documentation, including all member functions and attributes.

97 MATHEMATICS AND COMPUTING↗

Constructing and sampling graphs with a given joint degree distribution.

One of the most influential recent results in network analysis is that many natural networks exhibit a power-law or log-normal degree distribution. This has inspired numerous generative models that match this property. However, more recent work has shown that while these generative models do have the right degree distribution, they are not good models for real life networks due to their differences on other important metrics like conductance. We believe this is, in part, because many of these real-world networks have very different joint degree distributions, i.e. the probability that a randomly selected edge will be between nodes of degree k and l. Assortativity is a sufficient statistic of the joint degree distribution, and it has been previously noted that social networks tend to be assortative, while biological and technological networks tend to be disassortative. We suggest understanding the relationship between network structure and the joint degree distribution of graphs is an interesting avenue of further research. An important tool for such studies are algorithms that can generate random instances of graphs with the same joint degree distribution. This is the main topic of this paper and we study the problem from both a theoretical and practical perspective. We provide an algorithm for constructing simple graphs from a given joint degree distribution, and a Monte Carlo Markov Chain method for sampling them. We also show that the state space of simple graphs with a fixed degree distribution is connected via end point switches. We empirically evaluate the mixing time of this Markov Chain by using experiments based on the autocorrelation of each edge. These experiments show that our Markov Chain mixes quickly on real graphs, allowing for utilization of our techniques in practice.

99 GENERAL AND MISCELLANEOUS↗

A New Retrieval of Aerosol Optical Depth under Partly Cloudy Conditions with Multi-Spectral Measurements of Reflectance

The three-dimensional (3D) radiative effects may cause large uncertainties of satellite aerosol retrievals under partly cloudy conditions [1,2]. For example, analysis of multi-year aerosol statistics derived from the MODerate-Resolution Imaging Spectroradiometer (MODIS) data in clear patches of cloud fields suggests that aerosol product may be in a large error (up to 140%) as a result of 3D cloud-induced enhancement of clear sky reflectance [3]. Retrievals of AOD τa from satellite observations consist of two basic steps: (1) sampling, which includes detection of clear pixels and (2) and application of an algorithm, which estimates AOD in these pixels. The quality of the final product depends on both steps [4]. The largest errors occur for pixels located within areas of sunlight and shadows where the 3D radiative effects have the greatest impacts on the AOD retrievals [2]. To reduce the 3D radiative effects, clear pixels have to be selected far away (~1-2 km) from clouds and their shadows [3]. For selected clear pixels, the independent pixel approximation approach (IPA) [5] is used to estimate the AOD. Since the IPA ignores the 3D cloud-induced enhancement, the IPA-based retrievals can substantially overestimate AOD even for these clear pixels. To take into account such enhancement, a simple parameterization has been suggested [6]. Here we introduce an approach [7], that provides an effective way to avoid the 3D cloud effects, and illustrate with a model-output inverse problem its capability to detect clear pixels (outside of shadows) and estimate their AOD.

54 ENVIRONMENTAL SCIENCES↗

UCB-GLOBES: An open-access mass spectral database of identified and unidentified atmospheric organic compounds

Chemical characterization of atmospheric organic aerosols using gas chromatography with 70 eV electron ionization mass spectrometry (GC/EI-MS) has been used for decades in advancing molecular marker detection and identification, though primarily through suspect screening and/or targeted analyses. To advance non-targeted analyses of environmental samples, we have catalogued approximately 27 000 mass spectra (MS) of the trimethylsilyl derivatives of semi-volatile organic aerosol (OA) analytes in the open-access University of California Berkeley Goldstein Library of Organic Biogenic Environmental Spectra (UCB-GLOBES). Analytes were observed in ambient samples from the U.S. and the Central Amazon and/or laboratory simulations of secondary OA (SOA) formation. These samples are representative of OA under urban and biomass burning influences as well as SOA derived from biogenic precursors (e.g., isoprene, monoterpenes, sesquiterpenes) and biomass burning intermediates. MS are documented in UCB-GLOBES without regard to known chemical identity, annotated with extensive metadata such as sample source/experimental conditions, any structural information gained from MS analyses, and predicted chemical properties such as average carbon oxidation state and carbon number. UCB-GLOBES MS are compatible for importing into the NIST MS Search program, and we have also provided a Jupyter Notebook for MS visualization and comparisons. We demonstrate the utility of UCB-GLOBES through MS reanalyses of prior analytes observed in ambient data, finding a 20 % reduction in the number of analytes assigned to OA source categories reliant solely on time series correlation and an overall 11 % increase in new MS-based OA source categorization for the Southeast U.S. For 1513 analytes observed previously in the Central Amazon, we found 375 MS matches using UCB-GLOBES vs. 136 MS matches during prior analyses, representing a 14 % gain in newly confirmed or newly categorized OA species. While OA from laboratory oxidation experiments in UCB-GLOBES are highly diverse chemically, on average only 29 % of UCB-GLOBES MS have a mass spectral match to another MS entry in UCB-GLOBES and/or in databases of known compounds (i.e. NIST MS Database, Adams Essential Oil, MANE Flavor and Fragrance Company). This indicates that roughly 70 % of UCB-GLOBES MS are unique thus far, not observed more than once among the laboratory oxidation samples and ambient data in UCB-GLOBES MS. Further, only 18 % can be positively identified using these databases or known authentic standards. This points to a large gap between these laboratory simulations and ambient OA. Overall, the UCB-GLOBES database can be utilized for improving confidence in OA source categorization and/or identification, novel chemical marker discovery, tracking chemical diversity, de novo structure and properties prediction, and improving MS search and matching algorithms. This can ultimately inform future research priorities for the chemical characterization of atmospheric organic samples.

Mass spectrometry↗

Assimilation of Wave Imaging Radar Observations for Real-time Wave-by-Wave Forecasting

This project addressed Topic 3: “Wave Measurement Instrumentation for Feed Forward Controls” under the FOA number DE-FOA-0000971. The overall goal of the program was to develop a phase-resolving wave forecasting technique for application to the active control of Wave Energy Conversion (WEC) devices. We have developed an approach that couples a wave imaging marine radar with a phase-resolving linear wave model for real-time wave field reconstruction and forward propagation of the wave field in space and time. The scope of the project was to develop and assess the performance of this novel forecasting system. Specific project goals were as follows: Develop and verify a fast, GPU-based (Graphical Processing Unit) wave propagation model suitable for phase-resolved computation of nearshore wave transformation over variable bathymetry; Compare the accuracy and speed of performance of the wave model against a deep water model in their ability to predict wave field transformation in the intermediate water depths (50 to 70 m) typical of planned WEC sites; Develop and implement a variational assimilation algorithm that can ingest wave imaging radar observations and estimate the time-varying wave conditions offshore of the domain of interest such that the observed wave field is best reconstructed throughout the domain and then use this to produce model forecasts for a given WEC location; Collect wave-resolving marine radar data, along with relevant in situ wave data, at a suitable wave energy test site, apply the algorithm to the field data, assess performance, and identify any necessary improvements; and Develop a production cost estimate that addresses the affordability of the wave forecasting technology and include in the Final Report. The developed forecasting algorithm (“Wavecast”) was evaluated for both speed and accuracy against a substantial synthetic dataset. Early in the project, performance tests definitively demonstrated that the system was capable of forecasting in real-time, as the GPU-based wave model backbone was very computationally efficient. The data assimilation algorithm was developed on a polar grid domain in order to match the sampling characteristics of the observation system (wave imaging marine radar). For verification purposes, a substantial set of synthetic wave data (i.e. forward runs of the wave model) were generated to be used as ground truth for comparison to the reconstructions and forecasts produced by Wavecast. For these synthetic cases, Wavecast demonstrated very good accuracy, for example, typical forecast correlation coefficients were between 0.84-0.95 when compared to the input data. Dependencies on shadowing, observational noise, and forecast horizon were also identified. During the second year of the project, a short field deployment was conducted in order to assess forecast accuracy under field conditions. For this, a radar was installed on a fishing vessel and observations were collected at the South Energy Test Site (SETS) off the coast of Newport, OR. At the SETS site, simultaneous in situ wave observations were also available owing to an ongoing field project funded separately. Unfortunately, the position and heading information that was available for the fishing vessel were not of sufficient accuracy in order to validate the forecast in a phase-resolving sense. Instead, a spectral comparison was made between the Wavecast forecast and the data from the in situ wave buoy. Although the wave and wind conditions during the field test were complex, the comparison showed a promising reconstruction of the wave spectral shape, where both peaks in the bimodal spectrum were represented. However, the total reconstructed spectral energy (across all directions and frequencies) was limited to 44% of the observed spectrum. Overall, wave-by-wave forecasting using a data assimilation approach based on wave imaging radar observations and a physics-based wave model shows promise for short-term phase-resolved predictions. Two recommendations for future work are as follows: first, we would recommend additional focused field campaigns for algorithm validation. The field campaign should be long enough to capture a range of wave conditions relevant to the target application and WEC site. In addition, it will be crucial to make sure the vessel of choice has high accuracy position and heading instrumentation (this instrumentation is commercially available but not standard on commercial fishing vessels). The second recommendation is to expand the model physics in the wave model backbone to include some nonlinear effects. Specifically, the third-order correction to the wave speed due to amplitude dispersion would be the next step in order to more accurately represent the phase speeds of large amplitude waves.

16 TIDAL AND WAVE POWER↗

Accelerating Lipidomic Method Development through in Silico Simulation

Judicious selection of mass spectrometry (MS) acquisition parameters is essential for effectively profiling the broad diversity and dynamic range of biomolecules. Typically, acquisition parameters are individually optimized to maximally characterize analytes from each new sample matrix. This time-consuming process often ignores the synergistic relationship between MS method parameters, producing suboptimal results. Here in this paper, we detail the creation of an algorithm which accurately simulates LC-MS/MS lipidomic data acquisition performance for a benchtop quadrupole-Orbitrap MS system. By coupling this simulation tool with a genetic algorithm for constrained parameter optimization, we demonstrate the efficient identification of LC-MS/MS method parameter sets individually suited for specific sample matrices. Finally, we utilize the in silico simulation to examine how continued developments in MS acquisition speed and sensitivity will further increase the power of MS lipidomics as a vital tool for impactful biochemical analysis.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Blind identification of full-field vibration modes of output-only structures from uniformly-sampled, possibly temporally-aliased (sub-Nyquist), video measurements

Enhancing the spatial and temporal resolution of vibration measurements and modal analysis could significantly benefit dynamic modelling, analysis, and health monitoring of structures. For example, spatially high-density mode shapes are critical for accurate vibration-based damage localization. In experimental or operational modal analysis, higher (frequency) modes, which may be outside the frequency range of the measurement, contain local structural features that can improve damage localization as well as the construction and updating of the modal-based dynamic model of the structure. In general, the resolution of vibration measurements can be increased by enhanced hardware. Traditional vibration measurement sensors such as accelerometers have high-frequency sampling capacity; however, they are discrete point-wise sensors only providing sparse, low spatial sensing resolution measurements, while dense deployment to achieve high spatial resolution is expensive and results in the mass-loading effect and modification of structure's surface. Non-contact measurement methods such as scanning laser vibrometers provide high spatial and temporal resolution sensing capacity; however, they make measurements sequentially that requires considerable acquisition time. As an alternative non-contact method, digital video cameras are relatively low-cost, agile, and provide high spatial resolution, simultaneous, measurements. Combined with vision based algorithms (e.g., image correlation or template matching, optical flow, etc.), video camera based measurements have been successfully used for experimental and operational vibration measurement and subsequent modal analysis. However, the sampling frequency of most affordable digital cameras is limited to 30–60 Hz, while high-speed cameras for higher frequency vibration measurements are extremely costly. This work develops a computational algorithm capable of performing vibration measurement at a uniform sampling frequency lower than what is required by the Shannon-Nyquist sampling theorem for output-only modal analysis. In particular, the spatio-temporal uncoupling property of the modal expansion of structural vibration responses enables a direct modal decoupling of the temporally-aliased vibration measurements by existing output-only modal analysis methods, yielding (full-field) mode shapes estimation directly. Then the signal aliasing properties in modal analysis is exploited to estimate the modal frequencies and damping ratios. Furthermore, the proposed method is validated by laboratory experiments where output-only modal identification is conducted on temporally-aliased acceleration responses and particularly the temporally-aliased video measurements of bench-scale structures, including a three-story building structure and a cantilever beam.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

SPARSE FARADAY ROTATION MEASURE SYNTHESIS

Faraday rotation measure synthesis is a method for analyzing multichannel polarized radio emissions, and it has emerged as an important tool in the study of Galactic and extragalactic magnetic fields. The method requires the recovery of the Faraday dispersion function from measurements restricted to limited wavelength ranges, which is an ill-conditioned deconvolution problem. Here, we discuss a recovery method that assumes a sparse approximation of the Faraday dispersion function in an overcomplete dictionary of functions. We discuss the general case when both thin and thick components are included in the model, and we present the implementation of a greedy deconvolution algorithm. We illustrate the method with several numerical simulations that emphasize the effect of the covered range and sampling resolution in the Faraday depth space, and the effect of noise on the observed data.

79 ASTRONOMY AND ASTROPHYSICS↗

A review of lunar chronology revealing a preponderance of 4.34-4.37 Ga ages

In this study, data obtained from Sm-Nd and Rb-Sr isotopic measurements of lunar highlands’ samples are renormalized to common standard values and then used to define ages with a common isochron regression algorithm. The reliability of these ages is evaluated using five criteria that include whether: (1) the ages are defined by multiple isotopic systems, (2) the data demonstrate limited scatter outside uncertainty, (3) initial isotopic compositions are consistent with the petrogenesis of the samples, (4) the ages are defined by an isotopic system that is resistant to disturbance by impact metamorphism, and (5) the rare-earth element abundances determined by isotope dilution of bulk of mineral fractions match those measured by in situ analyses. From this analysis, it is apparent that the oldest highlands’ rock ages are some of the least reliable, and that there is little support for crustal ages older than ~4.40 Ga. A model age for ur-KREEP formation calculated using the most reliable Mg-suite Sm-Nd isotopic systematics, in conjunction with Sm-Nd analyses of KREEP basalts, is 4389 ± 45 Ma. This age is a good match to the Lu-Hf model age of 4353 ± 37 Ma determined using a subset of this sample suite, the average model age of 4353 ± 25 Ma determined on mare basalts with the 146 Sm- 142 Nd isotopic system, with a peak in Pb-Pb ages observed in lunar zircons of ~4340 ± 20 Ma, and the oldest terrestrial zircon age of 4374 ± 6 Ma. The preponderance of ages between 4.34 and 4.37 Ga reflect either primordial solidification of a lunar magma ocean or a widespread secondary magmatic event on the lunar nearside. The first scenario is not consistent with the oldest ages reported for lunar zircons, whereas the second scenario does not account for concordance between ages of crustal rocks and mantle reservoirs.

79 ASTRONOMY AND ASTROPHYSICS↗

Stan : A Probabilistic Programming Language

Stan is a probabilistic programming language for specifying statistical models. A Stan program imperatively defines a log probability function over parameters conditioned on specified data and constants. As of version 2.14.0, Stan provides full Bayesian inference for continuous-variable models through Markov chain Monte Carlo methods such as the No-U-Turn sampler, an adaptive form of Hamiltonian Monte Carlo sampling. Penalized maximum likelihood estimates are calculated using optimization methods such as the limited memory Broyden-Fletcher-Goldfarb-Shanno algorithm. Stan is also a platform for computing log densities and their gradients and Hessians, which can be used in alternative algorithms such as variational Bayes, expectation propagation, and marginal inference using approximate integration. To this end, Stan is set up so that the densities, gradients, and Hessians, along with intermediate quantities of the algorithm such as acceptance probabilities, are easily accessible. Stan can also be called from the command line using the cmdstan package, through R using the rstan package, and through Python using the pystan package. All three interfaces support sampling and optimization-based inference with diagnostics and posterior analysis. rstan and pystan also provide access to log probabilities, gradients, Hessians, parameter transforms, and specialized plotting.

97 MATHEMATICS AND COMPUTING↗

Sampling Biases in MODIS and SeaWiFS Ocean Chlorophyll Data

Although modem ocean color sensors, such as MODIS and SeaWiFS are often considered global missions, in reality it takes many days, even months, to sample the ocean surface enough to provide complete global coverage. The irregular temporal sampling of ocean color sensors can produce biases in monthly and annual mean chlorophyll estimates. We quantified the biases due to sampling using data assimilation to create a "truth field", which we then sub-sampled using the observational patterns of MODIS and SeaWiFS. Monthly and annual mean chlorophyll estimates from these sub-sampled, incomplete daily fields were constructed and compared to monthly and annual means from the complete daily fields of the assimilation model, at a spatial resolution of 1.25deg longitude by 0.67deg latitude. The results showed that global annual mean biases were positive, reaching nearly 8% (MODIS) and >5% (SeaWiFS). For perspective the maximum interannual variability in the SeaWiFS chlorophyll record was about 3%. Annual mean sampling biases were low (<3%) in the midlatitudes (between -40deg and 40deg). Low interannual variability in the global annual mean sampling biases suggested that global scale trend analyses were valid. High latitude biases were much higher than the global annual means, up to 20% as a basin annual mean, and over 80% in some months. This was the result of the high solar zenith angle exclusion in the processing algorithms. Only data where the solar angle is <75deg are permitted, in contrast to the assimilation which samples regularly over the entire area and month. High solar zenith angles do not facilitate phytoplankton photosynthesis and consequently low chlorophyll concentrations occurring here are missed by the data sets. Ocean color sensors selectively sample in locations and times of favorable phytoplankton growth, producing overestimates of chlorophyll. The biases derived from lack of sampling in the high latitudes varied monthly, leading to artifacts in the apparent seasonal cycle from ocean color sensors. A false secondary peak in chlorophyll occurred in May-August, which resulted from lack of sampling in the Antarctic.

Gregg, Watson W.↗