Search NASA⌕ Search

SEARCH · Search NASA

Results for “hierarchical methods”

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

Hierarchical Bayesian Modeling for Cosmology: Can NPE reliably replace MCMC?

Hierarchical neural posterior estimation has its place Hierarchical Bayesian Modeling (HBM) combined with MCMC algorithms has been shown to provide more robust and accurate inference for real-world phenomena in which nature takes a nested form. However, MCMC-based inference can be computationally expensive, and its performance often suffers for complex posterior geometries. These costs are especially pertinent for HBM. Studies have recently demonstrated the potential for a flexible, expressive, and amortized hierarchical neural posterior estimator (HNPE) built on Normalizing Flows. These studies have mostly been performed on simple datasets, or they focus on a single parameter from each level of the hierarchy. A systematic study analyzing how both hierarchical methods compare for more complex and realistic datasets is necessary before applying HNPE for scientific measurements. Here, we re-explore the theory behind HNPE and conduct comparative numerical experiments of HNPE and MCMC-based HBM methods on real and synthetic data, including strong gravitational lensing simulations. In particular, we use a suite of diagnostics to show trade-offs in terms of accuracy, precision, time to train or sample, reproducibility, and the need for expert domain knowledge. Especially for higher dimensional and complex posteriors, HNPE is expected to drastically improve on time for inference, accuracy, and precision with an upfront training time cost.

Hur, Rachel [Chicago U.] (ORCID:000900089890445X)↗

Automated matching of pairs of SIR-B images for elevation mapping

During the SIR-B mission in October 1984, a significant number of overlapping synthetic aperture radar (SAR) images of various ground areas was collected. This has offered the first opportunity to perform stereo analyses on images from space that cover large ground areas to determine elevation information. This paper presents the preliminary results of an investigation to obtain elevation data from stereo pairs of SIR-B images. First, the accuracy with which elevation information can be derived from SIR-B image pairs is evaluated theoretically. It is shown that elevation accuracy is a function of the slant range resolution, the incidence angles with which the stereo pair is obtained, the accuracies in spacecraft state estimation, and determination of corresponding pixels in the stereo pair. Next, a hierarchical method is developed to match the corresponding pixels. This method involves iterative removal of local distortions and correlations of pairs of local neighborhoods in the two images. Since it is necessary to perform the matching at every pixel in the image, it is very computationally intensive. Therefore, it has been implemented on the Massively Parallel Processor (MPP) at the Goddard Space Flight Center (GSFC). The MPP's speed permits two iterations of this technique to operate on a pair of 512 x 512 images within 7 s. Results of applying this algorithm of SIR-B images of Mount Shasta, CA, are shown. The matching algorithm performs well in regions of the image with significant features. An approximate elevation image derived from the matching process corresponds to published topographic map data, except for certain obvious discontinuities.

Ramapriyan, H. K.↗

Observing rotation and deformation of sea ice with synthetic aperture radar

The ESA's ERS-1 satellite will carry SARs over the polar regions; an important component in the use of these data is an automated scheme for the extraction of sea ice velocity fields from a sequence of SAR images of the same geographical region. The image pyramid area-correlation hierarchical method is noted to be vulnerable to uncertainties for sea ice rotations greater than 10-15 deg between SAR observations. Rotation-invariant methods can successfully track isolated floes in the marginal ice zone. Hu's (1962) invariant moments are also worth considering as a possible basis for rotation-invariant tracking methods. Feature tracking is inherently robust for tracking rotating sea ice, but is limited when features are floe-lead boundaries. A variety of techniques appears neccessary.

Vesecky, J. F.↗

A comparison between families obtained from different proper elements

Using the hierarchical method of family identification developed by Zappala et al., the results coming from the data set of proper elements computed by Williams (about 2100 numbered + about 1200 PLS 2 asteroids) and by Milani and Knezevic (5.7 version, about 4200 asteroids) are compared. Apart from some expected discrepancies due to the different data sets and/or low accuracy of proper elements computed in peculiar dynamical zones, a good agreement was found in several cases. It follows that these high reliability families represent a sample which can be considered independent on the methods used for their proper elements computation. Therefore, they should be considered as the best candidates for detailed physical studies.

Zappala, Vincenzo↗

"Tools For Analysis and Visualization of Large Time- Varying CFD Data Sets"

During the four years of this grant (including the one year extension), we have explored many aspects of the visualization of large CFD (Computational Fluid Dynamics) datasets. These have included new direct volume rendering approaches, hierarchical methods, volume decimation, error metrics, parallelization, hardware texture mapping, and methods for analyzing and comparing images. First, we implemented an extremely general direct volume rendering approach that can be used to render rectilinear, curvilinear, or tetrahedral grids, including overlapping multiple zone grids, and time-varying grids. Next, we developed techniques for associating the sample data with a k-d tree, a simple hierarchial data model to approximate samples in the regions covered by each node of the tree, and an error metric for the accuracy of the model. We also explored a new method for determining the accuracy of approximate models based on the light field method described at ACM SIGGRAPH (Association for Computing Machinery Special Interest Group on Computer Graphics) '96. In our initial implementation, we automatically image the volume from 32 approximately evenly distributed positions on the surface of an enclosing tessellated sphere. We then calculate differences between these images under different conditions of volume approximation or decimation.

Wilhelms, Jane↗

Excalibur: A Nonparametric, Hierarchical Wavelength Calibration Method for a Precision Spectrograph

Excalibur is a nonparametric, hierarchical framework for precision wavelength calibration of spectrographs. It is designed with the needs of extreme-precision radial-velocity (EPRV) instruments in mind, which require calibration or stabilization to better than 10{sup −4} pixels. Instruments vary along only a few dominant degrees of freedom, especially EPRV instruments that feature highly stabilized optical systems and detectors. Excalibur takes advantage of this property by using all calibration data to construct a low-dimensional representation of all accessible calibration states for an instrument. Excalibur also takes advantage of laser-frequency combs or etalons, which generate a dense set of stable calibration points. This density permits the use of a nonparametric wavelength solution that can adapt to any instrument or detector oddities better than parametric models, such as a polynomial. We demonstrate the success of this method with data from the Extreme Precision Spectrograph (EXPRES), which uses a laser-frequency comb. When wavelengths are assigned to laser comb lines using excalibur, the rms of the residuals is about one-fifth that of wavelengths assigned using polynomial fits to individual exposures. Radial-velocity measurements of HD 34411 show a reduction in rms scatter over a 10 month time baseline from 1.17 to 1.05 m s{sup −1}.

47 OTHER INSTRUMENTATION↗

A fourth-order Lagrangian discontinuous Galerkin method using a hierarchical orthogonal basis on curvilinear grids

The existing high-order Lagrangian discontinuous Galerkin (DG) hydrodynamic methods are restricted to using quadratic meshes with quadratic polynomials (P2), which in turn, yield up to third-order accuracy. Additionally, these existing DG hydrodynamic schemes, when extended to work with cubic meshes and cubic polynomials (P3), can be unstable on strong-shock problems. Therefore, this paper presents a new Lagrangian discontinuous Galerkin (DG) hydrodynamic method to simulate compressible material dynamics ( e.g., gasses, fluids, and solids) with strong-shocks using cubic meshes and cubic polynomials, and delivers up to fourth-order accuracy on smooth flows. The stability on shock problems is achieved using new hierarchical orthogonal basis functions and a new subcell mesh stabilization (SMS) scheme for cubic meshes. The accuracy and robustness of the new high-order accurate Lagrangian DG hydrodynamic method is demonstrated by simulating a diverse suite of challenging test problems covering gas and solid dynamic problems on curvilinear meshes.

97 MATHEMATICS AND COMPUTING↗

Multilevel Hierarchical Decomposition of Finite Element White Noise with Application to Multilevel Markov Chain Monte Carlo

In this work we develop a new hierarchical multilevel approach to generate Gaussian random field realizations in an algorithmically scalable manner that is well suited to incorporating into multilevel Markov chain Monte Carlo (MCMC) algorithms. This approach builds off of other partial differential equation (PDE) approaches for generating Gaussian random field realizations; in particular, a single field realization may be formed by solving a reaction-diffusion PDE with a spatial white noise source function as the right-hand side. While these approaches have been explored to accelerate forward uncertainty quantification tasks, e.g., multilevel Monte Carlo, the previous constructions are not directly applicable to multilevel MCMC frameworks which build fine-scale random fields in a hierarchical fashion from coarse-scale random fields. Our new hierarchical multilevel method relies on a hierarchical decomposition of the white noise source function in $L^2$ which allows us to form Gaussian random field realizations across multiple levels of discretization in a way that fits into multilevel MCMC algorithmic frameworks. After presenting our main theoretical results and numerical scaling results to showcase the utility of this new hierarchical PDE method for generating Gaussian random field realizations, this method is tested on a four-level MCMC algorithm to explore its feasibility.

algebraic multigrid↗

Low Temperature Aggregation Transitions in N3 and Y6 Acceptors Enable Double‐Annealing Method That Yields Hierarchical Morphology and Superior Efficiency in Nonfullerene Organic Solar Cells

Abstract Thermal transition of organic solar cells (OSCs) constituent materials are often insufficiently researched, resulting in trial‐and‐error rather than rational approaches to annealing strategies to improve domain purity to enhance the power conversion efficiency. Despite the potential utility, little is known about the thermal transitions of the modern high‐performance acceptors Y6 and N3. Here, by using an optical method, it is discovered that the acceptor N3 has a clear solid‐state aggregation transition at 82 °C. This unusually low transition not only explains prior optimization protocols, but the transition informs and enables a double‐annealing method that can fine‐tune aggregation and the device morphology. Compared with 16.6% efficiency for PM6:N3:PC 71 BM control devices, higher efficiency of 17.6% is obtained through the improved protocol. Morphology characterization with x‐ray scattering methods reveals the formation of a multilength scale morphology. Moreover, the double‐annealing method is illustrated and easily transferred and validated with Y6‐based devices, using the transition of Y6 at 102 °C. As a result, the PCE improved from 16.0% to 16.8%. Design of high‐performance acceptors with yet lower aggregation transitions might be required for OSCs to successfully transition to low thermal budget industrial processing methods where annealing temperatures on plastic substrates have to be kept low.

Qin, Yunpeng↗

A Method for Producing Hierarchical and Statistically Calibrated Predictions of Nuclear Material Properties from Existing Models

Computer vision-based analysis of micrographs of nuclear materials is an emerging technique for property prediction, synthetic route identification, and other material analysis tasks. These analysis tasks play a pivotal role in many material characterization applications such as signature development for treaty verification, process optimization, etc. The backbone in many of the recent computer vision-based techniques is a deep learning model, which takes a fixed-size set of pixels and provides a class prediction for that set of pixels. For example, previous work developed a deep convolutional neural network (CNN) to predict the synthetic route from a 256 px x 256 px patch taken from a larger image of uranium ore concentrates. In this work, we present several methods for first calibrating these models in a manner that they can provide accurate probabilities of their predictions’ veracity, and several methods of combining these probabilities. Overall, the combination of these two steps into a pipeline allows for full-image and even full-sample (where a sample has many images) predictions with associated confidence values. Finally, we show that one can also use the patch predictions and confidence to produce a visualization to map predicted constituents through the image. Results and examples for predicting and mapping uranium ore concentrates’ synthetic process from imagery will be presented.

artificial intelligence↗

Hierarchical Krylov and nested Krylov methods for extreme-scale computing

The solution of large, sparse linear systems is typically a dominant phase of computation for simulations based on partial differential equations, which are ubiquitous in scientific and engineering applications. While preconditioned Krylov methods are widely used and provide many advantages for solving sparse linear systems that do not have highly convergent, geometric multigrid solvers or specialized fast solvers, Krylov methods encounter well-known scaling difficulties for over 10,000 processor cores because each iteration requires at least one vector inner product, which in turn requires a global synchronization that scales poorly because of internode latency. To aid in overcoming these difficulties, we have developed hierarchical Krylov methods and nested Krylov methods in the PETSc library that reduce the number of global inner products required across the entire system (where they are expensive), though freely allow vector inner products across smaller subsets of the entire system (where they are inexpensive) or use inner iterations that do not invoke vector inner products at all. Nested Krylov methods are a generalization of inner-outer iterative methods with two or more layers. Hierarchical Krylov methods are a generalization of block Jacobi and overlapping additive Schwarz methods, where each block itself is solved by Krylov methods on smaller blocks. Conceptually, the hierarchy can continue recursively to an arbitrary number of levels of smaller and smaller blocks. As a specific case, we introduce the hierarchical FGMRES method, or h-FGMRES, and we demonstrate the impact of two-level h-FGMRES with a variable preconditioner on the PFLOTRAN subsurface flow application. We also demonstrate the impact of nested FGMRES, BiCGStab and Chebyshev methods. These hierarchical Krylov methods and nested Krylov methods significantly reduced overall PFLOTRAN simulation time on the Cray XK6 when using 10,000 through 224,000 cores through the combined effects of reduced global synchronization due to fewer global inner products and stronger inner hierarchical or nested preconditioners.

97 MATHEMATICS AND COMPUTING↗

A Regularized Variance-Reduced Modified Extragradient Method for Stochastic Hierarchical Games

We consider an N -player hierarchical game in which the i th player’s objective comprises of an expectation-valued term, parametrized by rival decisions, and a hierarchical term. Such a framework allows for capturing a broad range of stochastic hierarchical optimization problems, Stackelberg equilibrium problems, and leader-follower games. We develop an iteratively regularized and smoothed variance-reduced modified extragradient framework for iteratively approaching hierarchical equilibria in a stochastic setting. We equip our analysis with rate statements, complexity guarantees, and almost-sure convergence results. We then extend these statements to settings where the lower-level problem is solved inexactly and provide the corresponding rate and complexity statements. Our model framework encompasses many game theoretic equilibrium problems studied in the context of power markets. We present a realistic application to the study of virtual power plants, emphasizing the role of hierarchical decision making and regularization. Preliminary numerics suggest that empirical behavior compares well with theoretical guarantees.

Tikhonov regularization↗

Method for implementation of recursive hierarchical segmentation on parallel computers

A method, computer readable storage, and apparatus for implementing a recursive hierarchical segmentation algorithm on a parallel computing platform. The method includes setting a bottom level of recursion that defines where a recursive division of an image into sections stops dividing, and setting an intermediate level of recursion where the recursive division changes from a parallel implementation into a serial implementation. The segmentation algorithm is implemented according to the set levels. The method can also include setting a convergence check level of recursion with which the first level of recursion communicates with when performing a convergence check.

Tilton, James C.↗

Multilevel filtering elliptic preconditioners

A class of preconditioners is presented for elliptic problems built on ideas borrowed from the digital filtering theory and implemented on a multilevel grid structure. They are designed to be both rapidly convergent and highly parallelizable. The digital filtering viewpoint allows the use of filter design techniques for constructing elliptic preconditioners and also provides an alternative framework for understanding several other recently proposed multilevel preconditioners. Numerical results are presented to assess the convergence behavior of the new methods and to compare them with other preconditioners of multilevel type, including the usual multigrid method as preconditioner, the hierarchical basis method and a recent method proposed by Bramble-Pasciak-Xu.

Kuo, C. C. Jay↗

Calculation of correlated initial state in the hierarchical equations of motion method using an imaginary time path integral approach

Based on recent findings in the hierarchical equations of motion (HEOM) for correlated initial state [Y. Tanimura, J. Chem. Phys. 141, 044114 (2014)], we propose a new stochastic method to obtain the initial conditions for the real time HEOM propagation, which can be used further to calculate the equilibrium correlation functions and symmetrized correlation functions. The new method is derived through stochastic unraveling of the imaginary time influence functional, where a set of stochastic imaginary time HEOM are obtained. The validity of the new method is demonstrated using numerical examples including the spin-Boson model, and the Holstein model with undamped harmonic oscillator modes.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗