Search NASA⌕ Search

SEARCH · Search NASA

Results for “randomized matrix approximation”

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 73 records · Page 4

Nuclear matrix elements for 0νβ{sup −}β{sup −} decays: Comparative analysis of the QRPA, shell model and IBM predictions

In this work we report on general properties of the nuclear matrix elements involved in the neutrinoless double β{sup −} decays (0νβ{sup −}β{sup −} decays) of several nuclei. A summary of the values of the NMEs calculated along the years by the Jyväskylä-La Plata collaboration is presented. These NMEs, calculated in the framework of the quasiparticle random phase approximation (QRPA), are compared with those of the other available calculations, like the Shell Model (ISM) and the interacting boson model (IBA-2)

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

A review on recent machine learning applications for imaging mass spectrometry studies

Imaging mass spectrometry (IMS) is a powerful analytical technique widely used in biology, chemistry, and materials science fields that continue to expand. IMS provides a qualitative compositional analysis and spatial mapping with high chemical specificity. The spatial mapping information can be 2D or 3D depending on the analysis technique employed. Due to the combination of complex mass spectra coupled with spatial information, large high-dimensional datasets (hyperspectral) are often produced. Therefore, the use of automated computational methods for an exploratory analysis is highly beneficial. The fast-paced development of artificial intelligence (AI) and machine learning (ML) tools has received significant attention in recent years. These tools, in principle, can enable the unification of data collection and analysis into a single pipeline to make sampling and analysis decisions on the go. There are various ML approaches that have been applied to IMS data over the last decade. Here, in this review, we discuss recent examples of the common unsupervised (principal component analysis, non-negative matrix factorization, k-means clustering, uniform manifold approximation and projection), supervised (random forest, logistic regression, XGboost, support vector machine), and other methods applied to various IMS datasets in the past five years. The information from this review will be useful for specialists from both IMS and ML fields since it summarizes current and representative studies of computational ML-based exploratory methods for IMS.

47 OTHER INSTRUMENTATION↗

Collective excitations of strongly coupled bilayer charged Bose liquids in the third-frequency-moment sum rule

We calculate the collective excitation modes of strongly coupled bilayer charged Bose systems. We employ the dielectric matrix formulation to study the correlation effects within the random-phase approximation (RPA), the self consistent field approximation Singwi, Tosi, Land, and Sjoelander (STLS), and the quasilocalized charge approximation (QLCA), which satisfies the third-frequency-moment (<{omega}{sup 3}>) sum rule. We find that the QLCA predicts a long-wavelength correlation-induced energy gap in the out-of-phase plasmon mode, similar to the situation in electronic bilayer systems. The energy gap and the plasmon density of states are studied as a function of interlayer separation and coupling parameter r{sub s}. The results should be helpful for experimental investigations.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗

Neutrinoless double {beta}-decay nuclear matrix elements within the SRQRPA with self-consistent short range correlations

The nuclear matrix elements M{sup 0v} of the neutrinoless double beta decay (0v{beta}{beta}-decay) are systematically evaluated using the self-consistent renormalized quasiparticle random phase approximation (SRQRPA). The residual interaction and the two-nucleon short-range correlations are derived from the charge-dependent Bonn (CD-Bonn) potential. The importance of further progress in the calculation of the 0v{beta}{beta}-decay nuclear matrix elements is stressed.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

Random-matrix approach to RPA equations. I

We study the RPA equations in their most general form by taking the matrix elements appearing in the RPA equations as random. This yields either a unitary or an orthogonally invariant random-matrix model that does not appear in the Altland-Zirnbauer classification. The average spectrum of the model is studied with the help of a generalized Pastur equation. Two independent parameters govern the behaviour of the system: the strength {alpha}{sup 2} of the coupling between positive- and negative-energy states and the distance between the origin and the centers of the two semicircles that describe the average spectrum for {alpha}{sup 2} = 0, the latter measured in units of the equal radii of the two semicircles. With increasing {alpha}{sup 2}, positive- and negative-energy states become mixed and ever more of the spectral strength of the positive-energy states is transferred to those at negative energy, and vice versa. The two semicircles are deformed and pulled toward each other. As they begin to overlap, the RPA equations yield non-real eigenvalues: The system becomes unstable. We determine analytically the critical value of the strength for the instability to occur. Several features of the model are illustrated numerically.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

The phonon-coupling model for Skyrme forces

A short review on the self-consistent RPA based on the energy-density functional of the Skyrme type is given. We also present an extension of the RPA where the coupling of phonons to the single-particle states is considered. Within this approach we present numerical results which are compared with data. The self-consistent approach is compared with the Landau–Migdal theory. Here we derive from the self-consistent ph interaction, the Landau–Migdal parameters as well as their density dependence. In the Appendix a new derivation of the reduced matrix elements of the ph interaction is presented.

74 ATOMIC AND MOLECULAR PHYSICS↗

Asymptotic Behavior of Memristive Circuits

The interest in memristors has risen due to their possible application both as memory units and as computational devices in combination with CMOS. This is in part due to their nonlinear dynamics, and a strong dependence on the circuit topology. We provide evidence that also purely memristive circuits can be employed for computational purposes. In the present paper we show that a polynomial Lyapunov function in the memory parameters exists for the case of DC controlled memristors. Such a Lyapunov function can be asymptotically approximated with binary variables, and mapped to quadratic combinatorial optimization problems. This also shows a direct parallel between memristive circuits and the Hopfield-Little model. In the case of Erdos-Renyi random circuits, we show numerically that the distribution of the matrix elements of the projectors can be roughly approximated with a Gaussian distribution, and that it scales with the inverse square root of the number of elements. This provides an approximated but direct connection with the physics of disordered system and, in particular, of mean field spin glasses. Using this and the fact that the interaction is controlled by a projector operator on the loop space of the circuit. We estimate the number of stationary points of the approximate Lyapunov function and provide a scaling formula as an upper bound in terms of the circuit topology only.

97 MATHEMATICS AND COMPUTING↗

Graph Sparsification by Approximate matrix Multiplication

Graphs arising in statistical problems, signal processing, large networks, combinatorial optimization, and data analysis are often dense, which causes both computational and storage bottlenecks. One way of sparsifying a weighted graph, while sharing the same vertices as the original graph but reducing the number of edges, is through spectral sparsification. We study this problem through the perspective of RandNLA. Specifically, we utilize randomized matrix multiplication to give a clean and simple analysis of how sampling according to edge weights gives a spectral approximation to graph Laplacians, without requiring spectral information. Through the CR–MM algorithm, we attain a simple and computationally efficient sparsifier whose resulting Laplacian estimate is unbiased and of minimum variance. Here, we define a new notion of additive spectral sparsifiers, which has not been considered in the literature.

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↗

In-Trap Decay Spectroscopy of Radioactive Nuclei at TITAN/TRIUMF for a Determination of 2{nu}{beta}{beta} Matrix Elements

To extract the effective neutrino Majorana mass from an observed 0{nu}{beta}{beta} decay, precise knowledge of the involved nuclear matrix element is required. This poses a challenge to nuclear structure models. In particular, calculations based on the proton-neutron Quasiparticle Random Phase Approximation show significant discrepancies with experimental electron capture (EC) rates of the intermediate nucleus even when tuned on 2{nu}{beta}{beta} decay rates. However, EC branching ratios (BR) are in many cases not well known because the strengths of these decay branches are at the sensitivity limit of traditional experimental techniques. Here, we present a novel approach at TITAN/TRIUMF to measure EC-BR and to overcome shortcomings of previous methods. We also present results of a first proof-of-principle experiment which represents the very first observation of an electron capture in a Penning trap.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

Topological Quantum Hashing with the Icosahedral Group

We study an efficient algorithm to hash any single-qubit gate into a braid of Fibonacci anyons represented by a product of icosahedral group elements. By representing the group elements by braid segments of different lengths, we introduce a series of pseudogroups. Joining these braid segments in a renormalization group fashion, we obtain a Gaussian unitary ensemble of random-matrix representations of braids. With braids of length O(log{sup 2}(1/{epsilon})), we can approximate all SU(2) matrices to an average error {epsilon} with a cost of O(log(1/{epsilon})) in time. The algorithm is applicable to generic quantum compiling.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

A Provably Accurate Randomized Sampling Algorithm for Logistic Regression

In statistics and machine learning, logistic regression is a widely-used supervised learning technique primarily employed for binary classification tasks. When the number of observations greatly exceeds the number of predictor variables, we present a simple, randomized sampling-based algorithm for logistic regression problem that guarantees high-quality approximations to both the estimated probabilities and the overall discrepancy of the model. Our analysis builds upon two simple structural conditions that boil down to randomized matrix multiplication, a fundamental and well-understood primitive of randomized numerical linear algebra. We analyze the properties of estimated probabilities of logistic regression when leverage scores are used to sample observations, and prove that accurate approximations can be achieved with a sample whose size is much smaller than the total number of observations. To further validate our theoretical findings, we conduct comprehensive empirical evaluations. Overall, our work sheds light on the potential of using randomized sampling approaches to efficiently approximate the estimated probabilities in logistic regression, offering a practical and computationally efficient solution for large-scale datasets.

Chowdhury, Agniva↗

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↗

Random matrix analysis of the monopole strength distribution in {sup 208}Pb

We study statistical properties of the 0{sup +} spectrum of {sup 208}Pb in the energy region E{sub x} ≤ 20 MeV. We use the Skyrme interaction SLy4 as our model Hamiltonian to create a single-particle spectrum and to analyze excited states. The finite-rank separable approximation for the particle–hole interaction enables us to perform the calculations in large configuration spaces. We show that while the position of the monopole resonance centroid is determined by one-phonon excitations of 0{sup +}, the phonon–phonon coupling is crucial for the description of the strength distribution of the 0{sup +} spectrum. In fact, this coupling has an impact on the spectral rigidity Δ{sub 3}(L) which is shifted towards the random matrix limit of the Gaussian orthogonal ensembles.

74 ATOMIC AND MOLECULAR PHYSICS↗

New Advances in Neutrinoless Double Beta Decay Matrix Elements

We present the matrix elements necessary to evaluate the half-life of some neutrinoless double beta decay candidates in the framework of the microscopic interacting boson model (IBM). We compare our results with those from other models and extract some simple features of the calculations.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

Uncertainty estimates for the Bayes Inference Engine, (BIE)

In the fall 2007 meeting of the BIB users group, two approaches to making uncertainty estimates were presented. Ken Hanson asserted that if the BFGS optimizer was used, the inverse Hessian matrix was the same as the covariance matrix representing parameter uncertainties. John Pang presented preliminary results of a Monte Carlo method called Randomized Maximum Likelihood (RML). The BFGS/Hessian matrix approach may be applied to the region of the 'ideal model' Approximately 250 parameters describing the object density patches that are varied to match an image of 1,000,000 pixels. I cast this in terms of least squares analysis, as it is much better understood. This not as large a conceptual jump as some suppose because many of the functional blocks in the BIB are taken directly from existing least squares programs. If a Gaussian (normal) probability density function is assumed for both the observation and parameter errors, the Bayesian and least squares result should be identical.

97 MATHEMATICS AND COMPUTING↗

Generalized density matrix reexamined: Microscopic approach to collective dynamics in soft spherical nuclei

The generalized density matrix method is used to calculate microscopically the parameters of the collective Hamiltonian. Higher-order anharmonicities are obtained consistently with the lowest-order results, the mean field (Hartree-Fock-Bogoliubov equation), and the harmonic potential (quasiparticle random-phase approximation). The method is applied to soft spherical nuclei, where the anharmonicities are essential for restoring the stability of the system, as the harmonic potential becomes small or negative. The approach is tested in three models of increasing complexity: the Lipkin model, model with factorizable forces, and the quadrupole plus pairing model.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

Polynomial chaos representation of spatio-temporal random fields from experimental measurements

Two numerical techniques are proposed to construct a polynomial chaos (PC) representation of an arbitrary second-order random vector. In the first approach, a PC representation is constructed by matching a target joint probability density function (pdf) based on sequential conditioning (a sequence of conditional probability relations) in conjunction with the Rosenblatt transformation. In the second approach, the PC representation is obtained by having recourse to the Rosenblatt transformation and simultaneously matching a set of target marginal pdfs and target Spearman's rank correlation coefficient (SRCC) matrix. Both techniques are applied to model an experimental spatio-temporal data set, exhibiting strong non-stationary and non-Gaussian features. The data consists of a set of oceanographic temperature records obtained from a shallow-water acoustics transmission experiment. The measurement data, observed over a finite denumerable subset of the indexing set of the random process, is treated as a collection of observed samples of a second-order random vector that can be treated as a finite-dimensional approximation of the original random field. A set of properly ordered conditional pdfs, that uniquely characterizes the target joint pdf, in the first approach and a set of target marginal pdfs and a target SRCC matrix, in the second approach, are estimated from available experimental data. Digital realizations sampled from the constructed PC representations based on both schemes capture the observed statistical characteristics of the experimental data with sufficient accuracy. The relative advantages and disadvantages of the two proposed techniques are also highlighted.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗