Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “multiresolution analysis”

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 55 records · Page 3

A multiresolution adaptive wavelet method for nonlinear partial differential equations

We report the multiscale complexity of modern problems in computational science and engineering can prohibit the use of traditional numerical methods in multi-dimensional simulations. Therefore, novel algorithms are required in these situations to solve partial differential equations (PDEs) with features evolving on a wide range of spatial and temporal scales. To meet these challenges, we present a multiresolution wavelet algorithm to solve PDEs with significant data compression and explicit error control. We discretize in space by projecting fields and spatial derivative operators onto wavelet basis functions. We provide error estimates for the wavelet representation of fields and their derivatives. Then, our estimates are used to construct a sparse multiresolution discretization which guarantees the prescribed accuracy. Additionally, we embed a predictor-corrector procedure within the temporal integration to dynamically adapt the computational grid and maintain the accuracy of the solution of the PDE as it evolves. We present examples to highlight the accuracy and adaptivity of our approach.

97 MATHEMATICS AND COMPUTING↗

Estimating Filtering Errors Using the Peano Kernel Theorem

The Peano Kernel Theorem is introduced and a frequency domain derivation is given. It is demonstrated that the application of this theorem yields simple and accurate formulas for estimating the error introduced into a signal by filtering it to reduce noise.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Multilevel cloud retrieval using multispectral HIRS and AVHRR data: Nighttime oceanic analysis

A multispectral, multiresolution (MSMR) method is developed for analyzing scenes of overlapping cloud layers. The MSMR method is applied to data from the NOAA 11 advanced very high resolution radiometer (AVHRR) and the high-resolution infrared radiometer sounder (HIRS-2). The data are from a nighttime oceanic scene in which a semitransparent cirrus veil overlays a large-scale stratus cloud. Low-cloud and clear-sky radiances are determined using a spatial coherence technique. Middle to upper level cloud pressures and radiances are estimated from HIRS-2 15 micrometer CO2 band radiometric data. The MSMR method improves the interpretation of a nighttime, oceanic scene containing thin cirrus over a large-scale stratiform cloud. If, for example, the same scene is analyzed using only the AVHRR 10.8 micrometer channel, the accompanying retrieved cloud heights are found to be between the cirrus and stratus cloud heights and are incorrectly identified as midlevel altostratus clouds. Theoretical radiative transfer model results for both water droplet spheres and randomly oriented hexagonal ice crystals are compared to observed AVHRR brightness temperature differences (BTD) between the 3.7- and 10.8 micrometer channels (BTD(sup 34)) and between the 10.8- and 12- micrometer channels (BTD(sup 45)) to distinguish among the effects of cloud optical depth, particle size, and phase for both single-layer clouds and overlapping two-layer clouds. Theoretical BTD calculations are used to estimate the range of effective particle sizes for eac h cloud layer. The data for the cirrus in the case study region near Bermuda are consistent with theoretical results for relatively small randomly oriented hexagonal ice crystals. The observed BTD(sup 34) and BTD(sup 45) values are lower for the cirrus above a lower-level cloud than for single-level cirrus with no underlying cloud. In certain cases the BTD analysis provides a way to distinguish between clouds composed of supercooled water droplets rather than ice particles. Analysis of nighttime data permits determination of stratus infrared optical depths smaller than 4.

Baum, Bryan A.↗

Multiresolution and Explicit Methods for Vector Field Analysis and Visualization

This is a request for a second renewal (3d year of funding) of a research project on the topic of multiresolution and explicit methods for vector field analysis and visualization. In this report, we describe the progress made on this research project during the second year and give a statement of the planned research for the third year. There are two aspects to this research project. The first is concerned with the development of techniques for computing tangent curves for use in visualizing flow fields. The second aspect of the research project is concerned with the development of multiresolution methods for curvilinear grids and their use as tools for visualization, analysis and archiving of flow data. We report on our work on the development of numerical methods for tangent curve computation first.

Nielson, Gregory M.↗

MADNESS: A Multiresolution, Adaptive Numerical Environment for Scientific Simulation

MADNESS (multiresolution adaptive numerical environment for scientific simulation) is a high-level software environment for solving integral and differential equations in many dimensions that uses adaptive and fast harmonic analysis methods with guaranteed precision based on multiresolution analysis and separated representations. Underpinning the numerical capabilities is a powerful petascale parallel programming environment that aims to increase both programmer productivity and code scalability. This paper describes the features and capabilities of MADNESS and briefly discusses some current applications in chemistry and several areas of physics.

00A72↗

DynaM: Dynamic Multiresolution Data Representation for Large-Scale Scientific Analysis

Fast growing large-scale systems enable scientific applications to run at a much larger scale and accordingly produce gigantic volumes of simulation output. Such data imposes a grand challenge to post-processing tasks such as visualization and data analysis, because these tasks are often performed at a host machine that is remotely located and equipped with much less memory and storage resources. During the simulation runs, it is also desirable for scientists to be able to interactively monitor and steer the progress of simulation. This requires scientific data to be represented in an efficient form for initial exploration and computation steering. In this paper, we propose DynaM a software framework that can represent scientific data in a multiresolution form, and dynamically organize data blocks into an optimized layout for efficient scientific analysis. DynaM supports a convolution-based multiresolution data representation for abstracting scientific data for visualization at a wide spectrum of resolution. To support the efficient generation and retrieval of different data granularities from such representation, a dynamic data organization in DynaM is enabled to cater distinct peculiarities of different size data blocks for efficient and balanced I/O performance. Our experimental results demonstrate that DynaM can efficiently represent large scientific dataset and speed up the visualization of multidimensional scientific data. An up to 29 times speedup is achieved on Jaguar supercomputer at Oak Ridge National Laboratory.

Tian, Yuan↗

Multiresolution and Explicit Methods for Vector Field Analysis and Visualization

We first report on our current progress in the area of explicit methods for tangent curve computation. The basic idea of this method is to decompose the domain into a collection of triangles (or tetrahedra) and assume linear variation of the vector field over each cell. With this assumption, the equations which define a tangent curve become a system of linear, constant coefficient ODE's which can be solved explicitly. There are five different representation of the solution depending on the eigenvalues of the Jacobian. The analysis of these five cases is somewhat similar to the phase plane analysis often associate with critical point classification within the context of topological methods, but it is not exactly the same. There are some critical differences. Moving from one cell to the next as a tangent curve is tracked, requires the computation of the exit point which is an intersection of the solution of the constant coefficient ODE and the edge of a triangle. There are two possible approaches to this root computation problem. We can express the tangent curve into parametric form and substitute into an implicit form for the edge or we can express the edge in parametric form and substitute in an implicit form of the tangent curve. Normally the solution of a system of ODE's is given in parametric form and so the first approach is the most accessible and straightforward. The second approach requires the 'implicitization' of these parametric curves. The implicitization of parametric curves can often be rather difficult, but in this case we have been successful and have been able to develop algorithms and subsequent computer programs for both approaches. We will give these details along with some comparisons in a forthcoming research paper on this topic.

Source record↗

Multiscale geometric modeling of macromolecules I: Cartesian representation

This paper focuses on the geometric modeling and computational algorithm development of biomolecular structures from two data sources: Protein Data Bank (PDB) and Electron Microscopy Data Bank (EMDB) in the Eulerian (or Cartesian) representation. Molecular surface (MS) contains non-smooth geometric singularities, such as cusps, tips and self-intersecting facets, which often lead to computational instabilities in molecular simulations, and violate the physical principle of surface free energy minimization. Variational multiscale surface definitions are proposed based on geometric flows and solvation analysis of biomolecular systems. Our approach leads to geometric and potential driven Laplace–Beltrami flows for biomolecular surface evolution and formation. The resulting surfaces are free of geometric singularities and minimize the total free energy of the biomolecular system. High order partial differential equation (PDE)-based nonlinear filters are employed for EMDB data processing. We show the efficacy of this approach in feature-preserving noise reduction. After the construction of protein multiresolution surfaces, we explore the analysis and characterization of surface morphology by using a variety of curvature definitions. Apart from the classical Gaussian curvature and mean curvature, maximum curvature, minimum curvature, shape index, and curvedness are also applied to macromolecular surface analysis for the first time. Our curvature analysis is uniquely coupled to the analysis of electrostatic surface potential, which is a by-product of our variational multiscale solvation models. As an expository investigation, we particularly emphasize the numerical algorithms and computational protocols for practical applications of the above multiscale geometric models. Such information may otherwise be scattered over the vast literature on this topic. Based on the curvature and electrostatic analysis from our multiresolution surfaces, we introduce a new concept, the polarized curvature, for the prediction of protein binding sites.

97 MATHEMATICS AND COMPUTING↗

Statistical Challenges in Modern Astronomy II

Wavelets are the central idea of a broad framework for thinking about displaying, and analyzing data - not just a new specialized technique. They are localized basis functions that provide an extremely flexible and efficient representation of time series. Current developments in the theory and application of wavelets are yielding powerful multiresolution techniques for the analysis of time series and image data. Wavelet methods can effect noise removal. characterization of stochastic behavior, depiction of power spectrum time-variations, and data compression - for time series data, image data, and data of higher dimensions. I review published applications of wavelets in astronomy.

Scargle, Jeffrey D.↗

Asynchronous Programming in UPC: A Case Study and Potential for Improvement

In a traditional Partitioned Global Address Space language like UPC, an application programmer works with the model of a static set of threads performing locality-aware accesses on a global address space. On the other hand, asynchronous programming provides a simple interface for expressing the concurrency in dynamic, irregular algorithms, with the prospect of efficient portable execution from sophisticated runtime schemes handling the exposed concurrency. In this paper, we adopt the asynchronous style of programming to parallelize a nested, tree-based code in UPC. To maximize performance without losing the ease of application programming, we design Asynchronous Remote Methods as a potential extension to the UPC standard. Our prototype implementation of this construct in Berkeley UPC yields within 7% of ideal performance and 20-fold improvement over the original Standard UPC solution in some cases.

97 MATHEMATICS AND COMPUTING↗

Multiresolution persistent homology for excessively large biomolecular datasets

Although persistent homology has emerged as a promising tool for the topological simplification of complex data, it is computationally intractable for large datasets. We introduce multiresolution persistent homology to handle excessively large datasets. We match the resolution with the scale of interest so as to represent large scale datasets with appropriate resolution. We utilize flexibility-rigidity index to access the topological connectivity of the data set and define a rigidity density for the filtration analysis. By appropriately tuning the resolution of the rigidity density, we are able to focus the topological lens on the scale of interest. The proposed multiresolution topological analysis is validated by a hexagonal fractal image which has three distinct scales. We further demonstrate the proposed method for extracting topological fingerprints from DNA molecules. In particular, the topological persistence of a virus capsid with 273 780 atoms is successfully analyzed which would otherwise be inaccessible to the normal point cloud method and unreliable by using coarse-grained multiscale persistent homology. The proposed method has also been successfully applied to the protein domain classification, which is the first time that persistent homology is used for practical protein domain analysis, to our knowledge. The proposed multiresolution topological method has potential applications in arbitrary data sets, such as social networks, biological networks, and graphs.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Development of Multiresolution Capabilities for the Holistic Energy Resource Optimization Network (HERON) tool A progress update

INL researchers work on technoeconomic analyses for integrated energy systems (IES) using the Framework for Optimization of ResourCes and Economics (FORCE). Within FORCE, researchers use the Holistic Energy Resource Optimization Network (HERON) tool to conduct optimization of grid portfolios under uncertain market conditions. These optimizations determine optimal capacities for all IES components and strategies for resource dispatch which maximize some economic metric (e.g., net present value). Resource dispatch occurs on finer timescales (typically hours) and thus are asked to respond to a given time series (e.g. hourly load demand profiles for a grid, or pre-determined electricity prices). Volatile and complex bidding dynamics as well as poorly forecasted weather events within deregulated markets add uncertainty to the time series; FORCE can address this uncertainty by training a reduced order model on historical time series and generate unique synthetic time series which represent individual scenarios or realizations of the market. The IES configuration can be simulated under these different sampled realizations and a stochastic optimization is conducted which optimizes the expected value of the desired economic metric. The training of a synthetic time series generator is limited by the chosen time resolution; dynamics can occur on different time scales. Seasonal demand trends can dominate faster dynamical events (such as power outages from certain sectors or severe weather events) which might not get captured correctly by the trained model. In this report, we investigate different ways of addressing the training and generation of time series on multiple time scales using three main algorithms: wavelet decomposition, dynamic mode decomposition, and generative adversarial networks for time series. We demonstrate a time series analysis that yields information on not just the frequency space but also temporal space: where a fast Fourier transform can provide what frequencies dominate, the new algorithms can provide when the frequencies dominate as well. These analyses can help improve IES optimization by allowing researchers to couple simulations at different timescales when it is most needed - seasonal, day-ahead, and real time optimization - with greater computational efficiency. Future work will include implementation of a subset of the proposed algorithms into the FORCE toolset and application of these analyses into multiple timescale optimization.

22 GENERAL STUDIES OF NUCLEAR REACTORS↗

Selecting registration schemes in case of interstitial lung disease follow-up in CT

Purpose: Primary goal of this study is to select optimal registration schemes in the framework of interstitial lung disease (ILD) follow-up analysis in CT. Methods: A set of 128 multiresolution schemes composed of multiresolution nonrigid and combinations of rigid and nonrigid registration schemes are evaluated, utilizing ten artificially warped ILD follow-up volumes, originating from ten clinical volumetric CT scans of ILD affected patients, to select candidate optimal schemes. Specifically, all combinations of four transformation models (three rigid: rigid, similarity, affine and one nonrigid: third order B-spline), four cost functions (sum-of-square distances, normalized correlation coefficient, mutual information, and normalized mutual information), four gradient descent optimizers (standard, regular step, adaptive stochastic, and finite difference), and two types of pyramids (recursive and Gaussian-smoothing) were considered. The selection process involves two stages. The first stage involves identification of schemes with deformation field singularities, according to the determinant of the Jacobian matrix. In the second stage, evaluation methodology is based on distance between corresponding landmark points in both normal lung parenchyma (NLP) and ILD affected regions. Statistical analysis was performed in order to select near optimal registration schemes per evaluation metric. Performance of the candidate registration schemes was verified on a case sample of ten clinical follow-up CT scans to obtain the selected registration schemes. Results: By considering near optimal schemes common to all ranking lists, 16 out of 128 registration schemes were initially selected. These schemes obtained submillimeter registration accuracies in terms of average distance errors 0.18 ± 0.01 mm for NLP and 0.20 ± 0.01 mm for ILD, in case of artificially generated follow-up data. Registration accuracy in terms of average distance error in clinical follow-up data was in the range of 1.985–2.156 mm and 1.966–2.234 mm, for NLP and ILD affected regions, respectively, excluding schemes with statistically significant lower performance (Wilcoxon signed-ranks test, p < 0.05), resulting in 13 finally selected registration schemes. Conclusions: Selected registration schemes in case of ILD CT follow-up analysis indicate the significance of adaptive stochastic gradient descent optimizer, as well as the importance of combined rigid and nonrigid schemes providing high accuracy and time efficiency. The selected optimal deformable registration schemes are equivalent in terms of their accuracy and thus compatible in terms of their clinical outcome.

60 APPLIED LIFE SCIENCES↗

Multiresolution molecular mechanics: Implementation and efficiency

Atomistic/continuum coupling methods combine accurate atomistic methods and efficient continuum methods to simulate the behavior of highly ordered crystalline systems. Coupled methods utilize the advantages of both approaches to simulate systems at a lower computational cost, while retaining the accuracy associated with atomistic methods. Many concurrent atomistic/continuum coupling methods have been proposed in the past; however, their true computational efficiency has not been demonstrated. The present work presents an efficient implementation of a concurrent coupling method called the Multiresolution Molecular Mechanics (MMM) for serial, parallel, and adaptive analysis. First, we present the features of the software implemented along with the associated technologies. The scalability of the software implementation is demonstrated, and the competing effects of multiscale modeling and parallelization are discussed. Then, the algorithms contributing to the efficiency of the software are presented. These include algorithms for eliminating latent ghost atoms from calculations and measurement-based dynamic balancing of parallel workload. The efficiency improvements made by these algorithms are demonstrated by benchmark tests. The efficiency of the software is found to be on par with LAMMPS, a state-of-the-art Molecular Dynamics (MD) simulation code, when performing full atomistic simulations. Speed-up of the MMM method is shown to be directly proportional to the reduction of the number of the atoms visited in force computation. Finally, an adaptive MMM analysis on a nanoindentation problem, containing over a million atoms, is performed, yielding an improvement of 6.3–8.5 times in efficiency, over the full atomistic MD method. For the first time, the efficiency of a concurrent atomistic/continuum coupling method is comprehensively investigated and demonstrated.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗

Joint Bayesian Component Separation and CMB Power Spectrum Estimation

We describe and implement an exact, flexible, and computationally efficient algorithm for joint component separation and CMB power spectrum estimation, building on a Gibbs sampling framework. Two essential new features are (1) conditional sampling of foreground spectral parameters and (2) joint sampling of all amplitude-type degrees of freedom (e.g., CMB, foreground pixel amplitudes, and global template amplitudes) given spectral parameters. Given a parametric model of the foreground signals, we estimate efficiently and accurately the exact joint foreground- CMB posterior distribution and, therefore, all marginal distributions such as the CMB power spectrum or foreground spectral index posteriors. The main limitation of the current implementation is the requirement of identical beam responses at all frequencies, which restricts the analysis to the lowest resolution of a given experiment. We outline a future generalization to multiresolution observations. To verify the method, we analyze simple models and compare the results to analytical predictions. We then analyze a realistic simulation with properties similar to the 3 yr WMAP data, downgraded to a common resolution of 3 deg FWHM. The results from the actual 3 yr WMAP temperature analysis are presented in a companion Letter.

numerical↗

BOREAS AFM-12 1-km AVHRR Seasonal Land Cover Classification

The Boreal Ecosystem-Atmosphere Study (BOREAS) Airborne Fluxes and Meteorology (AFM)-12 team's efforts focused on regional scale Surface Vegetation and Atmosphere (SVAT) modeling to improve parameterization of the heterogeneous BOREAS landscape for use in larger scale Global Circulation Models (GCMs). This regional land cover data set was developed as part of a multitemporal one-kilometer Advanced Very High Resolution Radiometer (AVHRR) land cover analysis approach that was used as the basis for regional land cover mapping, fire disturbance-regeneration, and multiresolution land cover scaling studies in the boreal forest ecosystem of central Canada. This land cover classification was derived by using regional field observations from ground and low-level aircraft transits to analyze spectral-temporal clusters that were derived from an unsupervised cluster analysis of monthly Normalized Difference Vegetation Index (NDVI) image composites (April-September 1992). This regional data set was developed for use by BOREAS investigators, especially those involved in simulation modeling, remote sensing algorithm development, and aircraft flux studies. Based on regional field data verification, this multitemporal one-kilometer AVHRR land cover mapping approach was effective in characterizing the biome-level land cover structure, embedded spatially heterogeneous landscape patterns, and other types of key land cover information of interest to BOREAS modelers.The land cover mosaics in this classification include: (1) wet conifer mosaic (low, medium, and high tree stand density), (2) mixed coniferous-deciduous forest (80% coniferous, codominant, and 80% deciduous), (3) recent visible bum, vegetation regeneration, or rock outcrops-bare ground-sparsely vegetated slow regeneration bum (four classes), (4) open water and grassland marshes, and (5) general agricultural land use/ grasslands (three classes). This land cover mapping approach did not detect small subpixel-scale landscape features such as fens, bogs, and small water bodies. Field observations and comparisons with Landsat Thematic Mapper (TM) suggest a minimum effective resolution of these land cover classes in the range of three to four kilometers, in part, because of the daily to monthly compositing process. In general, potential accuracy limitations are mitigated by the use of conservative parameterization rules such as aggregation of predominant land cover classes within minimum horizontal grid cell sizes of ten kilometers. The AFM-12 one-kilometer AVHRR seasonal land cover classification data are available from the Earth Observing System Data and Information System (EOSDIS) Oak Ridge National Laboratory (ORNL) Distributed Active Archive Center (DAAC). The data files are available on a CD-ROM (see document number 20010000884).

Steyaert, Lou↗

Fast Multiresolution Reads of Massive Simulation Datasets

Today’s massively parallel simulation codes can produce output ranging up to many terabytes of data. Utilizing this data to support scientific inquiry requires analysis and visualization, yet the sheer size of the data makes it cumbersome or impossible to read without computational resources similar to the original simulation. We identify two broad classes of problems for reading data and present effective solutions for both. The first class of data reads depends on user requirements and available resources. Tasks such as visualization and user-guided analysis may be accomplished using only a subset of variables with a restricted spatial extent at a reduced resolution. The other class of reads requires full resolution multivariate data to be loaded, for example to restart a simulation. We show that utilizing the hierarchical multiresolution IDX data format enables scalable and efficient serial and parallel read access on a variety of hardware from supercomputers down to portable devices. Here, we demonstrate interactive view-dependent visualization and analysis of massive scientific datasets using low-power commodity hardware, and we compare read performance with other parallel file formats for both full and partial resolution data.

97 MATHEMATICS AND COMPUTING↗

Multiresolution pattern recognition of small volcanos in Magellan data

The Magellan data is a treasure-trove for scientific analysis of venusian geology, providing far more detail than was previously available from Pioneer Venus, Venera 15/16, or ground-based radar observations. However, at this point, planetary scientists are being overwhelmed by the sheer quantities of data collected--data analysis technology has not kept pace with our ability to collect and store it. In particular, 'small-shield' volcanos (less than 20 km in diameter) are the most abundant visible geologic feature on the planet. It is estimated, based on extrapolating from previous studies and knowledge of the underlying geologic processes, that there should be on the order of 10(exp 5) to 10(exp 6) of these volcanos visible in the Magellan data. Identifying and studying these volcanos is fundamental to a proper understanding of the geologic evolution of Venus. However, locating and parameterizing them in a manual manner is very time-consuming. Hence, we have undertaken the development of techniques to partially automate this task. The goal is not the unrealistic one of total automation, but rather the development of a useful tool to aid the project scientists. The primary constraints for this particular problem are as follows: (1) the method must be reasonably robust; and (2) the method must be reasonably fast. Unlike most geological features, the small volcanos of Venus can be ascribed to a basic process that produces features with a short list of readily defined characteristics differing significantly from other surface features on Venus. For pattern recognition purposes the relevant criteria include the following: (1) a circular planimetric outline; (2) known diameter frequency distribution from preliminary studies; (3) a limited number of basic morphological shapes; and (4) the common occurrence of a single, circular summit pit at the center of the edifice.

Smyth, P.↗