Search NASA⌕ Search

SEARCH · Search NASA

Results for “Random Matrix”

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 415 records · Page 23

Classical phases and quantum angles in the description of interfering Bose-Einstein condensates

The interference of two Bose-Einstein condensates, initially in Fock states, can be described in terms of their relative phase, treated as a random unknown variable. This phase can be understood either as emerging from the measurements or pre-existing to them; in the latter case, the originating states could be phase states with unknown phases, so an average over all their possible values is taken. Both points of view lead to a description of probabilities of results of experiments in terms of a phase angle, which plays the role of a classical variable. Nevertheless, in some situations, this description is not sufficient: another variable, which we call the ''quantum angle,'' emerges from the theory. This article studies various manifestations of the quantum angle. We first introduce the quantum angle by expressing two Fock states crossing a beam splitter in terms of phase states and relate the quantum angle to off-diagonal matrix elements in the phase representation. Then we consider an experiment with two beam splitters, where two experimenters make dichotomic measurements with two interferometers and detectors that are far apart; the results lead to violations of the Bell-Clauser-Horne-Shimony-Holt inequality (valid for local-realistic theories, including classical descriptions of the phase). Finally, we discuss an experiment where particles from each of two sources are either deviated via a beam splitter to a side collector or proceed to the point of interference. For a given interference result, we find ''population oscillations'' in the distributions of the deviated particles, which are entirely controlled by the quantum angle. Various versions of population oscillation experiments are discussed, with two or three independent condensates.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Pu239 Cross-Section Variations Based on Experimental Uncertainties and Covariances

Algorithms and software have been developed for producing variations in plutonium-239 neutron cross sections based on experimental uncertainties and covariances. The varied cross-section sets may be produced as random samples from the multi-variate normal distribution defined by an experimental mean vector and covariance matrix, or they may be produced as Latin-Hypercube/Orthogonal-Array samples (based on the same means and covariances) for use in parametrized studies. The variations obey two classes of constraints that are obligatory for cross-section sets and which put related constraints on the mean vector and covariance matrix that detemine the sampling. Because the experimental means and covariances do not obey some of these constraints to sufficient precision, imposing the constraints requires modifying the experimental mean vector and covariance matrix. Modification is done with an algorithm based on linear algebra that minimizes changes to the means and covariances while insuring that the operations that impose the different constraints do not conflict with each other.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

Large scale Brownian dynamics of confined suspensions of rigid particles

We introduce methods for large-scale Brownian Dynamics (BD) simulation of many rigid particles of arbitrary shape suspended in a fluctuating fluid. Our method adds Brownian motion to the rigid multiblob method [F. Balboa Usabiaga et al., Commun. Appl. Math. Comput. Sci. 11(2), 217–296 (2016)] at a cost comparable to the cost of deterministic simulations. We demonstrate that we can efficiently generate deterministic and random displacements for many particles using preconditioned Krylov iterative methods, if kernel methods to efficiently compute the action of the Rotne-Prager-Yamakawa (RPY) mobility matrix and its “square” root are available for the given boundary conditions. These kernel operations can be computed with near linear scaling for periodic domains using the positively split Ewald method. Here we study particles partially confined by gravity above a no-slip bottom wall using a graphical processing unit implementation of the mobility matrix-vector product, combined with a preconditioned Lanczos iteration for generating Brownian displacements. We address a major challenge in large-scale BD simulations, capturing the stochastic drift term that arises because of the configuration-dependent mobility. Unlike the widely used Fixman midpoint scheme, our methods utilize random finite differences and do not require the solution of resistance problems or the computation of the action of the inverse square root of the RPY mobility matrix. We construct two temporal schemes which are viable for large-scale simulations, an Euler-Maruyama traction scheme and a trapezoidal slip scheme, which minimize the number of mobility problems to be solved per time step while capturing the required stochastic drift terms. We validate and compare these schemes numerically by modeling suspensions of boomerang-shaped particles sedimented near a bottom wall. Using the trapezoidal scheme, we investigate the steady-state active motion in dense suspensions of confined microrollers, whose height above the wall is set by a combination of thermal noise and active flows. We find the existence of two populations of active particles, slower ones closer to the bottom and faster ones above them, and demonstrate that our method provides quantitative accuracy even with relatively coarse resolutions of the particle geometry.

97 MATHEMATICS AND COMPUTING↗

Compression of tokamak boundary plasma simulation data using a maximum volume algorithm for matrix skeleton decomposition

This report demonstrates satisfactory data compression of SOLPS-ITER simulation output ranging from 2D fields, 1D profiles, and 0D scalar variables with a novel matrix decomposition approach. The singular value decomposition (SVD) scales poorly for large matrix sizes and is unsuited to the application on high dimensional data common to fusion plasma physics simulation. In this work, we employ the columns-submatrix-rows (CUR) matrix factorization technique in order to compute a low-rank approximation up to two orders of magnitude faster than the SVD, but within a nominal L2-norm relative error of ε = 10 –2 . In addition, the CUR approach maintains the original format of the data, in its extracted columns and rows, allowing for interpretable data storage at the original resolution of the simulation. We utilize an iterative algorithm to compute the CUR decomposition of simulation output by maximizing the volume, or linearly independent information content, of a low-rank submatrix contained within the data. Experiments over $\textit{n} × \textit{n}$ randomized test matrices with embedded rank-deficient features show that this maximum volume implementation of CUR matrix approximation has reduced asymptotic computational complexity on the order of n compared to the SVD, which scales approximately as $n^3$. These results show that the CUR technique can be used to effectively select time step snapshots (columns) of over 140 SOLPS-ITER output variables and the associated discretized coordinate timeseries (rows) allowing for reconstruction of the complete simulation dynamics.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

The Effect of the Prior and the Experimental Design on the Inference of the Precision Matrix in Gaussian Chain Graph Models

Here, we investigate whether (and how) experimental design could aid in the estimation of the precision matrix in a Gaussian chain graph model, especially the interplay between the design, the effect of the experiment and prior knowledge about the effect. Estimation of the precision matrix is a fundamental task to infer biological graphical structures like microbial networks. We compare the marginal posterior precision of the precision matrix under four priors: flat, conjugate Normal-Wishart, Normal-MGIG and a general independent. Under the flat and conjugate priors, the Laplace-approximated posterior precision is not a function of the design matrix rendering useless any efforts to find an optimal experimental design to infer the precision matrix. In contrast, the Normal-MGIG and general independent priors do allow for the search of optimal experimental designs, yet there is a sharp upper bound on the information that can be extracted from a given experiment. We confirm our theoretical findings via a simulation study comparing (i) the KL divergence between prior and posterior and (ii) the Stein’s loss difference of MAPs between random and no experiment. Our findings provide practical advice for domain scientists conducting experiments to better infer the precision matrix as a representation of a biological network.

54 ENVIRONMENTAL SCIENCES↗

Thermal dewetting with a chemically heterogeneous nano-template for self-assembled L1 0 FePt nanoparticle arrays

In this paper, a design for the fabrication of metallic nanoparticles is presented by thermal dewetting with a chemically heterogeneous nano-template. For the template, we fabricate a nanostructured polystyrene-b-polydimethylsiloxane (PS-b-PDMS) film on a Si|SiO 2 substrate, followed by a thermal annealing and reactive ion etching (RIE) process. This gives a template composed of an ordered hexagonal array of SiOC hemispheres emerging in the polystyrene matrix. After the deposition of a FePt film on this template, we utilize the rapid thermal annealing (RTA) process, which provides in-plane stress, to achieve thermal dewetting and structural ordering of FePt simultaneously. Since the template is composed of different composition surfaces with periodically varied morphologies, it offers more tuning knobs to manipulate the nanostructures. We show that both the decrease in the area of the PS matrix and the increase in the strain energy relaxation transfer the dewetted pattern from the randomly distributed nanoparticles into a hexagonal periodic array of L1 0 FePt nanoparticles. Transmission electron microscopy with the in situ heating stage reveals the evolution of the dewetting process, and confirms that the positions of nanoparticles are aligned with those of the SiOC hemispheres. The nanoparticles formed by this template-dewetting show an average diameter and center-to-center distance of 19.30 ± 2.09 nm and 39.85 ± 4.80 nm, respectively. The hexagonal array of FePt nanoparticles reveals a large coercivity of 1.5 T, much larger than the nanoparticles fabricated by top-down approaches. Lastly, this approach offers an efficient pathway toward self-assembled nanostructures in a wide range of material systems.

36 MATERIALS SCIENCE↗

A proposed method for addressing large unphysical uncertainties in mubar

Mubar uncertainties in Section MF 34 MT 2 of ENDF/B-VIII.0 data are sometimes too large. Physical limitations of the bounds of mubar limit the maximum uncertainty to be < 1.0 and usually $\ll$ 1.0. Two ad hoc methods are proposed to artificially constrain the randomly sampled values of mubar to allowable values. The application of NJOY’s mubar covariance matrix to the “sandwich rule” is also discussed and a consistent way to apply sensitivity coefficients is described. Mubar uncertainties for the Jezebel k eff were found to be 156 pcm – a value comparable to other evaluated cross section uncertainties.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

Latest developments in seismic texture analysis for subsurface structure, facies, and reservoir characterization: A review

In exploration geology and geophysics, seismic texture is still a developing concept that has not been sufficiently known, although quite a number of different algorithms have been published in the literature. This paper provides a review of the seismic texture concepts and methodologies, focusing on latest developments in seismic amplitude texture analysis, with particular reference to the gray level co-occurrence matrix (GLCM) and the texture model regression (TMR) methods. The GLCM method evaluates spatial arrangements of amplitude samples within an analysis window using a matrix (a two-dimensional histogram) of amplitude co-occurrence. The matrix is then transformed into a suite of texture attributes, such as homogeneity, contrast, and randomness, which provide the basis for seismic facies classification. The TMR method uses a texture model as reference to discriminate among seismic features based on a linear, least-squares regression analysis between the model and the data within an analysis window. By implementing customized texture model schemes, the TMR algorithm has the flexibility to characterize subsurface geology for different purposes. A texture model with a constant phase is effective at enhancing the visibility of seismic structural fabrics, a texture model with a variable phase is helpful for visualizing seismic facies, and a texture model with variable amplitude, frequency, and size is instrumental in calibrating seismic to reservoir properties. Preliminary test case studies in the very recent past have indicated that the latest developments in seismic texture analysis have added to the existing amplitude interpretation theories and methodologies. These and future developments in seismic texture theory and methodologies will hopefully lead to a better understanding of the geologic implications of the seismic texture concept and to an improved geologic interpretation of reflection seismic amplitude

58 GEOSCIENCES↗

Statistical uncertainty analysis applied to the DRAGONv4 code lattice calculations and based on JENDL-4 covariance data

In this paper, multi-group microscopic cross-section uncertainty is propagated through the DRAGON (Version 4) lattice code, in order to perform uncertainty analysis on k{infinity} and 2-group homogenized macroscopic cross-sections predictions. A statistical methodology is employed for such purposes, where cross-sections of certain isotopes of various elements belonging to the 172 groups DRAGLIB library format, are considered as normal random variables. This library is based on JENDL-4 data, because JENDL-4 contains the largest amount of isotopic covariance matrixes among the different major nuclear data libraries. The aim is to propagate multi-group nuclide uncertainty by running the DRAGONv4 code 500 times, and to assess the output uncertainty of a test case corresponding to a 17 x 17 PWR fuel assembly segment without poison. The chosen sampling strategy for the current study is Latin Hypercube Sampling (LHS). The quasi-random LHS allows a much better coverage of the input uncertainties than simple random sampling (SRS) because it densely stratifies across the range of each input probability distribution. Output uncertainty assessment is based on the tolerance limits concept, where the sample formed by the code calculations infers to cover 95% of the output population with at least a 95% of confidence. This analysis is the first attempt to propagate parameter uncertainties of modern multi-group libraries, which are used to feed advanced lattice codes that perform state of the art resonant self-shielding calculations such as DRAGONv4. (authors)

22 GENERAL STUDIES OF NUCLEAR REACTORS↗

Note: Fully integrated 3.2 Gbps quantum random number generator with real-time extraction

We present a real-time and fully integrated quantum random number generator (QRNG) by measuring laser phase fluctuations. The QRNG scheme based on laser phase fluctuations is featured for its capability of generating ultra-high-speed random numbers. However, the speed bottleneck of a practical QRNG lies on the limited speed of randomness extraction. To close the gap between the fast randomness generation and the slow post-processing, we propose a pipeline extraction algorithm based on Toeplitz matrix hashing and implement it in a high-speed field-programmable gate array. Further, all the QRNG components are integrated into a module, including a compact and actively stabilized interferometer, high-speed data acquisition, and real-time data post-processing and transmission. The final generation rate of the QRNG module with real-time extraction can reach 3.2 Gbps.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗

First-order nonadiabatic coupling matrix elements between excited states: A Lagrangian formulation at the CIS, RPA, TD-HF, and TD-DFT levels

Analytic expressions for the first-order nonadiabatic coupling matrix elements between electronically excited states are first formulated exactly via both time-independent equation of motion and time-dependent response theory, and are then approximated at the configuration interaction singles, particle-hole/particle-particle random phase approximation, and time-dependent density functional theory/Hartree-Fock levels of theory. Note that, to get the Pulay terms arising from the derivatives of basis functions, the standard response theory designed for electronic perturbations has to be extended to nuclear derivatives. The results are further recast into a Lagrangian form that is similar to that for excited-state energy gradients and allows to use atomic orbital based direct algorithms for large molecules.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Sparse Representations to Replace TOFD Images in Non-destructive Testing of Materials

This paper describes a proposed method for the selection of relevant samples of ultrasonic signals during automatic material inspection. Instead of the well-known time of flight diffraction (TOFD) images, data are stored as a sparse matrix in which the elements only indicate whether a defect has been detected. This technique avoids storage of useless signals received during probe displacement in cases of low and high signal-to-noise ratios that correspond to coarse-grained and fine-grained materials, respectively. The approach is based on comparing the positions of maximum amplitudes, which are randomly located when signals only consist of noise but are in the same signal range when a defect is detected. The matrix elements are then applied as inputs to a self organizing map by neural networks to produce a normalized sparse matrix as the output, with a constant number of elements. This approach will be beneficial to enable the use of selected data in intelligent systems requiring a fixed number of inputs to characterize defects.

42 ENGINEERING↗

Neutron interaction and their transport with bulk materials

In the current paper an attempt was made to study and provide fundamental information about neutron interactions that are important to nuclear material measurements. The application of this study is explained about macroscopic interactions with bulk compound materials through a program in DEV C++ language which is done by enabling interaction of neutrons in nature. The output of the entire process depends upon the random number (i.e., incident neutron number), thickness of the material and mean free path as input parameters. Further the current study emphasizes on the usage of materials in shielding.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Fast truncated SVD of sparse and dense matrices on graphics processors

We investigate the solution of low-rank matrix approximation problems using the truncated singular value decomposition (SVD). For this purpose, we develop and optimize graphics processing unit (GPU) implementations for the randomized SVD and a blocked variant of the Lanczos approach. Our work takes advantage of the fact that the two methods are composed of very similar linear algebra building blocks, which can be assembled using numerical kernels from existing high-performance linear algebra libraries. Furthermore, the experiments with several sparse matrices arising in representative real-world applications and synthetic dense test matrices reveal a performance advantage of the block Lanczos algorithm when targeting the same approximation accuracy.

Computer Science↗

Locality-aware and load-balanced static task scheduling for MapReduce

Task scheduling for MapReduce jobs has been an active area of research with the objective of decreasing the amount of data transferred during the shuffle phase via exploiting data locality. In the literature, generally only the scheduling of reduce tasks is considered with the assumption that scheduling of map tasks is already determined by the input data placement. However, in cloud or HPC deployments of MapReduce, the input data is located in a remote storage and scheduling map tasks gains importance. Here, we propose models for simultaneous scheduling of map and reduce tasks in order to improve data locality and balance the processors’ loads in both map and reduce phases. Our approach is based on graph and hypergraph models which correctly encode the interactions between map and reduce tasks. Partitions produced by these models are decoded to schedule map and reduce tasks. A two-constraint formulation utilized in these models enables balancing processors’ loads in both map and reduce phases. The partitioning objective in the hypergraph models correctly encapsulates the minimization of data transfer when a local combine step is performed prior to shuffle, whereas the partitioning objective in the graph models achieve the same feat when a local combine is not performed. Here, we show the validity of our scheduling on the MapReduce parallelizations of two important kernel operations – sparse matrix–vector multiplication (SpMV) and generalized sparse matrix–matrix multiplication (SpGEMM) – that are widely encountered in big data analytics and scientific computations. Compared to random scheduling, our models lead to tremendous savings in data transfer by reducing data traffic from several hundreds of megabytes to just a few megabytes in the shuffle phase and consequently leading up to 2.6x and 4.2x speedup for SpMV and SpGEMM, respectively.

97 MATHEMATICS AND COMPUTING↗

COHERENT BACKSCATTERING VERIFIED NUMERICALLY FOR A FINITE VOLUME OF SPHERICAL PARTICLES

We consider electromagnetic scattering by a spherical volume sparsely and randomly populated by spherical particles of equal size and optical properties. The far-field scattering matrix of the entire volume is computed using an exact method and an approximate method. The former is a direct computer solver of the Maxwell equations called the superposition T-matrix method (STMM). The latter is a solver based on numerical Monte Carlo integration of the ladder and cyclical diagrams appearing in the microphysical theory of radiative transfer and coherent backscattering (RT-CB). The quantitative agreement between the STMM and RT-CB computations provides verification of the RT-CB theory. Prominent backscattering features exhibited by the STMM data cannot be reproduced by keeping only the ladder diagrams of RT. Our results strongly support the CB explanation of opposition brightness and polarization phenomena observed for a class of atmosphereless solar-system objects. Further research is necessary to determine the range of quantitative applicability of the RT-CB theory to densely packed particulate media.

79 ASTRONOMY AND ASTROPHYSICS↗

Pareto-optimal target definition for multi-axis random vibration testing

In random vibration testing with multiple control channels, existing control laws require specification of a complete spectral density matrix at each control frequency. Spectral density matrices include autospectral densities on the diagonal and cross-spectral densities on the off-diagonal. In practice, the off-diagonal terms are often unknown, and recent vibration testing research has focused on fixing the diagonal and specifying the off-diagonal to minimize the required control energy, subject to a constraint that the target matrix is positive semidefinite. This paper shows that, even with a fixed diagonal, off-diagonal terms strongly affect control residuals. This overlooked effect occurs in both square and rectangular systems. By jointly considering input energy and control residuals, open-loop inputs are derived directly from the diagonal without specifying the off-diagonal terms. Vibration targets that can be used in closed-loop control are then derived using the optimal inputs, with positive semidefinite constraints applied during the derivation. The result is a set of Pareto-optimal control solutions. For each solution in the set, any other possible solution produces greater control error, greater input energy, or both. A balanced solution is selected automatically, though others can be chosen based on test needs. Simulations and experiments show that the proposed method outperforms state-of-the-art energy-minimizing approaches, achieving significant reductions in both control error and input energy.

Autospectral density↗

Random matrices with external source and the asymptotic behaviour of multiple orthogonal polynomials

Ensembles of random Hermitian matrices with a distribution measure defined by an anharmonic potential perturbed by an external source are considered. The limiting characteristics of the eigenvalue distribution of the matrices in these ensembles are related to the asymptotic behaviour of a certain system of multiple orthogonal polynomials. Strong asymptotic formulae are derived for this system. As a consequence, for matrices in this ensemble the limit mean eigenvalue density is found, and a variational principle is proposed to characterize this density. Bibliography: 35 titles.

97 MATHEMATICS AND COMPUTING↗