An approximate method for determining response of nonlinear dynamic systems to random disturbances
Approximation method for determining response of nonlinear dynamic systems to random disturbances
DYNAMIC RESPONSE↗
SEARCH · Search NASA
Results for “randomized 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.
Generation of pseudo-random numbers
Practical methods for generating acceptable random numbers from a variety of probability distributions which are frequently encountered in engineering applications are described. The speed, accuracy, and guarantee of statistical randomness of the various methods are discussed.
Howell, L. W.↗
Randomized Algorithms for Symmetric Nonnegative Matrix Factorization
Symmetric Nonnegative Matrix Factorization (SymNMF) is a technique in data analysis and machine learning that approximates a matrix with a product of a nonnegative, low-rank matrix and it transpose. To design faster and more scalable algorithms for SymNMF we develop two randomized algorithms for its computation. The first method uses randomized matrix sketching to compute an initial low-rank approximation to the input matrix and proceeds to uses this as a low-rank input to rapidly compute a SymNMF. The second methods uses randomized leverage score sampling to approximately solve constrained least squares problems. Many successful methods for SymNMF rely on (approximately) solving sequences of constrained least squares problems. Here, we prove theoretically that leverage score sampling can approximately solve constrained least squares problems to e-accuracy. Finally we demonstrate both methods work in practice by applying them to graph clustering tasks on large real world data sets. These experiments show that our methods approximately maintain solution quality and achieve significant speed ups for both large dense and large sparse problems.
97 MATHEMATICS AND COMPUTING↗
A method for determining the weak statistical stationarity of a random process
A method for determining the weak statistical stationarity of a random process is presented. The core of this testing procedure consists of generating an equivalent ensemble which approximates a true ensemble. Formation of an equivalent ensemble is accomplished through segmenting a sufficiently long time history of a random process into equal, finite, and statistically independent sample records. The weak statistical stationarity is ascertained based on the time invariance of the equivalent-ensemble averages. Comparison of these averages with their corresponding time averages over a single sample record leads to a heuristic estimate of the ergodicity of a random process. Specific variance tests are introduced for evaluating the statistical independence of the sample records, the time invariance of the equivalent-ensemble autocorrelations, and the ergodicity. Examination and substantiation of these procedures were conducted utilizing turbulent velocity signals.
Sadeh, W. Z.↗
Methods for Validation of Random Uncertainty Estimates and Their Applications to Ozone Profiles From Limb-Viewing Satellite Instruments
For satellite measurements of atmospheric composition, the random uncertainty estimates provided by retrieval algorithms might be imperfect due to various approximations used in the retrievals or the presence of unknown error sources. This paper presents an overview of the methods used for the validation of random uncertainty estimates. All methods discussed in this study are categorized, and assumptions and limitations of each method are discussed. This overview evaluates these methods in application to ozone profile measurements from limb and occultation satellite instruments and provides practical illustrations of random uncertainty validation.
Viktoria F Sofieva↗
Application of the locally self-consistent embedding approach to the Anderson model with non-uniform random distributions
Highlights: • Typical Medium Theory (TMT) for the Anderson Localization. • Locally Self-Consistent Multiple Scattering Method (LSMS) for Random Disordered Systems. • Linear Scaling Computational Method for Random Disordered Systems. We apply the recently developed embedding scheme for the locally self-consistent method to random disorder electrons systems. The method is based on the locally self-consistent multiple scattering theory and the typical medium theory. The locally self-consistent multiple scattering theory divides a system into many small designated local interaction zones. The subsystem within each local interaction zone is embedded in a self-consistent field from the typical medium theory. This approximation allows the study of random systems with large numbers of sites. We present results for the three dimensional Anderson model with different random disorder potential distributions. Using the typical density of states as an indicator of Anderson localization, we find that the method can capture the localization for commonly studied disorder potentials. These include the uniform distribution, the Gaussian distribution, and even the unbounded Cauchy distribution.
71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
Devices and methods for increasing the speed and efficiency at which a computer is capable of modeling a plurality of random walkers using a particle method
A method for increasing a speed or energy efficiency at which a computer is capable of modeling a plurality of random walkers. The method includes defining a virtual space in which a plurality of virtual random walkers will move among different locations in the virtual space. The method also includes either assigning a corresponding set of ringed neurons in a spiking neural network to a corresponding virtual random walker, or assigning a corresponding set of ringed neurons to a point in the virtual space. Movement of a given virtual random walker is tracked by decoding differences between states of individual neurons in a corresponding given set of ringed neurons. A virtual random walk of the plurality of virtual random walkers is executed using the spiking neural network.
Aimone, James Bradley↗
Devices and methods for increasing the speed and efficiency at which a computer is capable of modeling a plurality of random walkers using a density method
A method for increasing a speed or energy efficiency at which a computer is capable of modeling a plurality of random walkers. The method includes defining a virtual space in which a plurality of virtual random walkers will move among different locations in the virtual space, wherein the virtual space comprises a plurality of vertices and wherein the different locations are ones of the plurality of vertices. A corresponding set of neurons in a spiking neural network is assigned to a corresponding vertex such that there is a correspondence between sets of neurons and the plurality of vertices, wherein a spiking neural network comprising a plurality of sets of spiking neurons is established. A virtual random walk of the plurality of virtual random walkers is executed using the spiking neural network, wherein executing includes tracking how many virtual random walkers are at each vertex at a given time increment.
Aimone, James Bradley↗
Natural fracture systems on planetary surfaces: Genetic classification and pattern randomness
One method for classifying natural fracture systems is by fracture genesis. This approach involves the physics of the formation process, and it has been used most frequently in attempts to predict subsurface fractures and petroleum reservoir productivity. This classification system can also be applied to larger fracture systems on any planetary surface. One problem in applying this classification system to planetary surfaces is that it was developed for ralatively small-scale fractures that would influence porosity, particularly as observed in a core sample. Planetary studies also require consideration of large-scale fractures. Nevertheless, this system offers some valuable perspectives on fracture systems of any size.
Rossbacher, Lisa A.↗
Wave propagation through random media: A local method of small perturbations based on the Helmholtz equation
Propagation of sound through the turbulent atmosphere is a statistical problem. The randomness of the refractive index field causes sound pressure fluctuations. Although no general theory to predict sound pressure statistics from given refractive index statistics exists, there are several approximate solutions to the problem. The most common approximation is the parabolic equation method. Results obtained by this method are restricted to small refractive index fluctuations and to small wave lengths. While the first condition is generally met in the atmosphere, it is desirable to overcome the second. A generalization of the parabolic equation method with respect to the small wave length restriction is presented.
Grosse, Ralf↗
Treatment of Overlapping Gaseous Absorption with the Correlated-k Method in Hot Jupiter and Brown Dwarf Atmosphere Models
The correlated-k method is frequently used to speed up radiation calculations in both one-dimensional and three-dimensional atmosphere models. An inherent difficulty with this method is how to treat overlapping absorption, i.e. absorption by more than one gas in a given spectral region. We have evaluated the applicability of three different methods in hot Jupiter and brown dwarf atmosphere models, all of which have been previously applied within models in the literature: (i) Random overlap, both with and without resorting and rebinning, (ii) equivalent extinction and (iii) pre-mixing of opacities, where (i) and (ii) combine k-coefficients for different gases to obtain k-coefficients for a mixture of gases, while (iii) calculates k-coefficients for a given mixture from the corresponding mixed line-by-line opacities. We find that the random overlap method is the most accurate and flexible of these treatments, and is fast enough to be used in one-dimensional models with resorting and rebinning. In three-dimensional models such as GCMs it is too slow, however, and equivalent extinction can provide a speed-up of at least a factor of three with only a minor loss of accuracy while at the same time retaining the flexibility gained by combining k-coefficients computed for each gas individually. Pre-mixed opacities are significantly less flexible, and we also find that particular care must be taken when using this method in order to to adequately resolve steep variations in composition at important chemical equilibrium boundaries. We use the random overlap method with resorting and rebinning in our one-dimensional atmosphere model and equivalent extinction in our GCM, which allows us to e.g. consistently treat the feedback of non-equilibrium chemistry on the total opacity and therefore the calculated P-T profiles in our models.
atmospheres↗
Multi-Agent Methods for the Configuration of Random Nanocomputers
As computational devices continue to shrink, the cost of manufacturing such devices is expected to grow exponentially. One alternative to the costly, detailed design and assembly of conventional computers is to place the nano-electronic components randomly on a chip. The price for such a trivial assembly process is that the resulting chip would not be programmable by conventional means. In this work, we show that such random nanocomputers can be adaptively programmed using multi-agent methods. This is accomplished through the optimization of an associated high dimensional error function. By representing each of the independent variables as a reinforcement learning agent, we are able to achieve convergence must faster than with other methods, including simulated annealing. Standard combinational logic circuits such as adders and multipliers are implemented in a straightforward manner. In addition, we show that the intrinsic flexibility of these adaptive methods allows the random computers to be reconfigured easily, making them reusable. Recovery from faults is also demonstrated.
Lawson, John W.↗
Goal-oriented adaptive modeling of random heterogeneous media and model-based multilevel Monte Carlo methods
Not Available
Scarabosio, Laura (ORCID:0000000309061179)↗
The Global LAnd Surface Satellite (GLASS) evapotranspiration product Version 5.0: Algorithm development and preliminary validation
An accurate estimation of spatially and temporally continuous global terrestrial evapotranspiration (ET) is essential in the assessment of surface energy, water and carbon cycles. The Global LAnd Surface Satellite (GLASS) ET product Version 4.0 (v4.0) based on the Bayesian model averaging (BMA) method was generated to estimate global terrestrial ET. However, certain uncertainty for the GLASS ET product v4.0 limits its application. In this study, we introduced the deep neural networks (DNN) merging framework to improve terrestrial ET estimation for GLASS ET product Version 5.0 (v5.0) generation by integrating five satellite-derived ET products [Moderate Resolution Imaging Spectroradiometer (MODIS) ET product (MOD16), Shuttleworth–Wallace dual-source ET product (SW), Priestley–Taylor-based ET product (PT-JPL), modified satellite-based Priestley–Taylor ET product (MS-PT) and simple hybrid ET product (SIM)]. We compared the performance of DNN method against other merging methods, including GLASS ET algorithm v4.0 (BMA), the gradient boosting regression tree (GBRT) method and the random forest (RF) method, based on 195 global eddy covariance (EC) flux towers covering observations from 2000 through 2015. Validations indicated that the DNN had the highest accuracy among four merging methods across different land cover types, yielding the highest average determination coefficients (R 2 , 0.62), root-mean-squared-error (RMSE, 24.1 W/m 2 ) and Kling–Gupta efficiency (KGE, 0.77) with a of 99% confidence interval. Compared with GLASS ET algorithm v4.0, the DNN improved on the R 2 by approximately 7% (p < 0.01) and the KGE by 10%. Based on the DNN, we then generated 8-day GLASS ET product v5.0 globally with a 1 km spatial resolution from 2001 to 2015 driven by GLASS vegetation and surface net radiation (R n ) datasets and Modern-Era Retrospective Analysis for Research and Applications, Version 2 (MERRA2) datasets. Finally, this global terrestrial ET product provides a valuable dataset for monitoring regional and global water resources and environmental changes.
54 ENVIRONMENTAL SCIENCES↗
Random Forests as a Viable Method to Select and Discover High-redshift Quasars
We present a method of selecting quasars up to redshift ≈6 with random forests, a supervised machine-learning method, applied to Pan-STARRS1 and WISE data. We find that, thanks to the increasing set of known quasars, we can assemble a training set that enables supervised machine-learning algorithms to become a competitive alternative to other methods up to this redshift. We present a candidate set for the redshift range 4.8–6.3, which includes the region around z = 5.5 where selecting quasars is difficult due to their photometric similarity to red and brown dwarfs. We demonstrate that, under our survey restrictions, we can reach a high completeness (66% ± 7% below redshift 5.6/83{sub -9}{sup +6}% above redshift 5.6) while maintaining a high selection efficiency (78{sub -8}{sup +10}%/94{sub -8}{sup +5}%). Our selection efficiency is estimated via a novel method based on the different distributions of quasars and contaminants on the sky. The final catalog of 515 candidates includes 225 known quasars. We predict the candidate catalog to contain additional 148{sub -33}{sup +41} new quasars below redshift 5.6 and 45{sub -8}{sup +5} above, and we make the catalog publicly available. Spectroscopic follow-up observations of 37 candidates led us to discover 20 new high redshift quasars (18 at 4.6 ≤ z ≤ 5.5, 2 z ~ 5.7). These observations are consistent with our predictions on efficiency. We argue that random forests can lead to higher completeness because our candidate set contains a number of objects that would be rejected by common color cuts, including one of the newly discovered redshift 5.7 quasars.
79 ASTRONOMY AND ASTROPHYSICS↗
Single-frame far-field diffractive imaging with randomized illumination
We introduce a single-frame diffractive imaging method called randomized probe imaging (RPI). In RPI, a sample is illuminated by a structured probe field containing speckles smaller than the sample’s typical feature size. Quantitative amplitude and phase images are then reconstructed from the resulting far-field diffraction pattern. The experimental geometry of RPI is straightforward to implement, requires no near-field optics, and is applicable to extended samples. When the resulting data are analyzed with a complimentary algorithm, reliable reconstructions which are robust to missing data are achieved. To realize these benefits, a resolution limit associated with the numerical aperture of the probe-forming optics is imposed. RPI therefore offers an attractive modality for quantitative X-ray phase imaging when temporal resolution and reliability are critical but spatial resolution in the tens of nanometers is sufficient. We discuss the method, introduce a reconstruction algorithm, and present two proof-of-concept experiments: one using visible light, and one using soft X-rays.
77 NANOSCIENCE AND NANOTECHNOLOGY↗
On the normality and accuracy of simulated random processes.
Efficient methods of simulating stationary and nonstationary random processes and envelopes, by using a series of sine or cosine functions or by using the fast Fourier transform, have been proposed previously. Without applying the central limit theorem, it is shown in this paper that the simulated random processes are asymptotically Gaussian processes as the number of terms, N, of sine or cosine functions approaches infinity. The accuracy of the first-order probability densities of the simulated random processes is investigated by using the fast Fourier transform. Numerical results are computed with respect to the variation of the number of terms, N, of sine or cosine functions used for simulation. It is shown that within the practical range of N, such as 500, the accuracy is remarkably satisfactory even outside the region of 3 standard deviations.
Yang, J.-N.↗
Study of Dynamic Characteristics of Aeroelastic Systems Utilizing Randomdec Signatures
The feasibility of utilizing the random decrement method in conjunction with a signature analysis procedure to determine the dynamic characteristics of an aeroelastic system for the purpose of on-line prediction of potential on-set of flutter was examined. Digital computer programs were developed to simulate sampled response signals of a two-mode aeroelastic system. Simulated response data were used to test the random decrement method. A special curve-fit approach was developed for analyzing the resulting signatures. A number of numerical 'experiments' were conducted on the combined processes. The method is capable of determining frequency and damping values accurately from randomdec signatures of carefully selected lengths.
Chang, C. S.↗