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 109 records · Page 6

Linear scaling solution of the time-dependent self-consistent-field equations with quasi-independent Rayleigh quotient iteration

An algorithm for solution of the Time-Dependent Self-Consistent-Field (TD-SCF) equations is developed, based on dual solution channels for non-linear optimization of the Tsiper functional [J.Phys.B, 34 L401 (2001)]. This formulation poses the TD-SCF problem as two Rayleigh quotients, coupled weakly through biorthogonality. Convergence rates for the Random Phase Approximation (RPA) are found to be equivalent to the Tamm-Dancoff approximation (TDA). Moreover, the variational nature of the quotient is robust to approximation errors, allowing linear scaling solution to the bulk limit of the RPA matrix-eigenvalue and exchange operator problem for molecular wires with extended conjugation, including polyphenylene vinylene and the (4,3) nanotube.

74 ATOMIC AND MOLECULAR PHYSICS↗

Coherent manipulation of graph states composed of finite-energy Gottesman-Kitaev-Preskill-encoded qubits

Graph states are a central resource in measurement-based quantum information processing. In the photonic qubit architecture based on Gottesman-Kitaev-Preskill (GKP) encoding, the generation of high-fidelity graph states composed of realistic, finite-energy approximate GKP-encoded qubits thus constitutes a key task. We consider the finite-energy approximation of GKP-qubit states given by a coherent superposition of shifted finite-squeezed vacuum states, where the displacements are Gaussian distributed. We present an exact description of graph states composed of such approximate GKP qubits as a coherent superposition of a Gaussian ensemble of randomly displaced ideal GKP-qubit graph states. Using standard Gaussian dynamics, we track the transformation of the covariance matrix and the mean-displacement vector elements of the Gaussian distribution of the ensemble under tools such as GKP-Steane error-correction and fusion operations that can be used to grow large high-fidelity GKP-qubit graph states. The covariance matrix elements capture the noise in the graph state due to the finite-energy approximation of GKP qubits, while the mean displacements relate to the possible absolute shift errors on the individual qubits arising conditionally from the homodyne measurements that are a part of these tools. Our work thus pins down an exact coherent error model for graph states generated from truly finite-energy GKP qubits, which can shed light on their error-correction properties.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Augmenting subspace optimization methods with linear bandits

In this work, we consider the framework of methods for unconstrained minimization that are, in each iteration, restricted to a model that is only a valid approximation to the objective function on some affine subspace containing an incumbent point. These methods are of practical interest in computational settings where derivative information is either expensive or impossible to obtain. Recent attention has been paid in the literature to employing randomized matrix sketching for generating the affine subspaces within this framework. We consider a relatively straightforward, deterministic augmentation of such a generic subspace optimization method. In particular, we consider a sequential optimization framework where actions consist of one-dimensional linear subspaces and rewards consist of (approximations to) the magnitudes of directional derivatives computed in the direction of the action subspace. Reward maximization in this context is consistent with maximizing lower bounds on descent guaranteed by first-order Taylor models. This sequential optimization problem can be analysed through the lens of dynamic regret. We modify an existing linear upper confidence bound (UCB) bandit method and prove sublinear dynamic regret in the subspace optimization setting. We demonstrate the efficacy of employing this linear UCB method in a setting where forward-mode algorithmic differentiation can provide directional derivatives in arbitrary directions and in a derivative-free setting. For the derivative-free setting, we propose SS-POUNDers, an extension of the derivative-free optimization method POUNDers that employs the linear UCB mechanism to identify promising subspaces. Our numerical experiments suggest a preference, in either computational setting, for employing a linear UCB mechanism within a subspace optimization method.

97 MATHEMATICS AND COMPUTING↗

Giant resonances in {sup 238}U within the quasiparticle random-phase approximation with the Gogny force

Fully consistent axially-symmetric deformed quasiparticle random-phase approximation (QRPA) calculations have been performed, using the same Gogny D1S effective force for both the Hartree-Fock-Bogolyubov mean field and QRPA matrix. New implementation of this approach leads to the applicability of QRPA to heavy deformed nuclei. Giant resonances and low-energy collective states for monopole, dipole, quadrupole, and octupole modes are predicted for the heavy deformed nucleus {sup 238}U and compared with experimental data.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

Thermal and Mechanical Properties of CO{sub 2}-Based Biodegradable Poly(cyclohexene carbonate)/Organically Modified Layered Zinc Phenylphosphonate Nanocomposites

A new sustainable composite material was fabricated using CO{sub 2}-based poly(cyclohexene carbonate) (PCHC) and organically modified layered zinc phenylphosphonate (m-PPZn) via a solution mixing process. Analysis by wide-angle X-ray diffraction (WAXD) showed that the interlayer spacing of the m-PPZn was enlarged to 30.4 Å. The morphology of the PCHC/m-PPZn nanocomposites was characterized by transmission electron microscopy and WAXD, which revealed that the layered materials were partially delaminated and randomly dispersed in the PCHC matrix. The enhancement of the dynamic mechanical properties of the 1 wt% PCHC/m-PPZn nanocomposite at 80 °C was approximately 114% relative to those of the neat PCHC matrix. The thermal properties of the PCHC/m-PPZn nanocomposites characterized using thermogravimetric analysis were substantially improved upon incorporation of m-PPZn. With the addition of 0.25 wt% m-PPZn into the PCHC matrix, the decomposition temperature associated with 10 wt% loss of the nanocomposites was substantially increased by approximately 24 °C compared with that of the PCHC matrix. The isothermal degradation data demonstrated that the activation energy of the composites was higher than that of the PCHC. This finding was attributed to the addition of m-PPZn to PCHC increasing the thermal energy required for degradation, thus inducing a reduction in the degradation rate and an increase in the residual weight for the PCHC/m-PPZn nanocomposites.

77 NANOSCIENCE AND NANOTECHNOLOGY↗

Scalable Matrix-Free Adaptive Product-Convolution Approximation for Locally Translation-Invariant Operators

We present an adaptive grid matrix-free operator approximation scheme based on a "product-convolution" interpolation of convolution operators. This scheme is appropriate for operators that are locally translation-invariant, even if these operators are high rank or full rank. Such operators arise in Schur complement methods for solving partial differential equations (PDEs), as Hessians in PDE-constrained optimization and inverse problems, as integral operators, as covariance operators, and as Dirichlet-to-Neumann maps. Constructing the approximation requires computing the impulse responses of the operator to point sources centered on nodes in an adaptively refined grid of sample points. A randomized a posteriori error estimator drives the adaptivity. Once constructed, the approximation can be efficiently applied to vectors using the fast Fourier transform. The approximation can be efficiently converted to hierarchical matrix (H-matrix) format, then inverted or factorized using scalable H-matrix arithmetic. The quality of the approximation degrades gracefully as fewer sample points are used, allowing cheap lower quality approximations to be used as preconditioners. Furthermore, this yields an automated method to construct preconditioners for locally translation-invariant Schur complements. We directly address issues related to boundaries and prove that our scheme eliminates boundary artifacts. We test the scheme on a spatially varying blurring kernel, on the nonlocal component of an interface Schur complement for the Poisson operator, and on the data misfit Hessian for an advection dominated advection-diffusion inverse problem. Numerical results show that the scheme outperforms existing methods.

97 MATHEMATICS AND COMPUTING↗

Origin of a sensitive dependence of calculated {beta}{beta}-decay amplitudes on the particle-particle residual interaction

In the present work the sensitivity of calculated {beta}{beta}-decay amplitudes to a realistic residual interaction is analyzed in the framework of the approach of O. A. Rumyantsev and M. H. Urin, Phys. Lett. B 443, 51 (1998). and V. A. Rodin, M. H. Urin, and A. Faessler, Nucl. Phys. A 747, 297 (2005). Both the Gamow-Teller (GT) and Fermi (F) matrix elements M{sup 2}{nu} for two-neutrino {beta}{beta} decay (2{nu}{beta}{beta} decay), along with the monopole transition contributions to the total matrix elements M{sup 0{nu}} of neutrinoless {beta}{beta} decay (0{nu}{beta}{beta} decay), are calculated within the quasiparticle random-phase approximation (QRPA). In the aforementioned approach decompositions of M{sup 2{nu}} and M{sup 0{nu}} can be obtained in terms of the corresponding energy-weighted sum rules S. It is shown that in most of the cases almost the whole dependence of M{sup 2{nu}} and M{sup 0{nu}} on the particle-particle (p-p) renormalization parameter g{sub pp} is accounted for by the g{sub pp} dependence of the corresponding sum rules S. General expressions relating S to a realistic residual particle-particle interaction are derived, which show a pronounced sensitivity of S to the singlet-channel interaction in the case of F transitions and to the triplet-channel interaction in the case of GT transitions. Thus, the sensitivity of M{sup 2{nu}} and M{sup 0{nu}} to the SU(4)-symmetry-breaking part of the p-p residual interaction is dictated by the generic structure of the {beta}{beta}-decay amplitudes. Therefore, a choice of this part in a particular calculation needs a special caution. Finally, a better isospin-consistent way of renormalization of a realistic residual p-p interaction to use in QRPA calculations is suggested.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

Revisiting the Hail Radar Reflectivity–Kinetic Energy Flux Relation by Combining T-Matrix and Discrete Dipole Approximation Calculations to Size Distribution Observations

The retrieval of hail kinetic energy with weather radars or its simulation in numerical models is challenging because of the shape complexity and variable density of hailstones. We combine 3D scans of individual hailstones with measurements of the particle size distributions (PSD) and T-matrix calculations to understand how hail reflectivity Z changes when approximating hailstones as spheroids, as compared to the realistic shapes obtained by 3D scanning technology. Additionally, recent terminal velocity relations are used to compare Z to the hail kinetic energy flux E ˙ . We parameterize the hail backscattering cross sections at L, S, C, and X bands as a function of size between 0.5 and 5.0 cm, matching the range of the observed PSDs. The scattering calculations use the T-matrix method for size parameters below 1.0 and the discrete dipole approximation (DDA) method otherwise. The DDA calculations are done for 48 digital models of realistic hailstones of sizes between 1 and 5 cm. The DDA cross sections are calculated for multiple orientations and averaged assuming a fully random orientation distribution to provide a single value per hailstone. The T-matrix reflectivity assuming solid ice spheres presents negligible differences to DDA results for size parameters below 1.0. Therefore, T matrix was used to fill in the gaps left by the DDA calculations. The results are mapped to the same size bins of the observed PSDs, allowing the calculation of the radar reflectivity. This is then correlated to E ˙ , allowing a potential improvement of past retrieval methods of E ˙ from Z in multiple wavelengths.

54 ENVIRONMENTAL SCIENCES↗

Nuclear-structure aspects of double beta decay

Neutrinoless double beta (0{nu}{beta}{beta}) decay of nuclei is a process that requires the neutrino to be a massive Majorana particle and thus cannot proceed in the standard model of electro-weak interactions. Recent results of the neutrino-oscillation experiments have produced accurate information on the mixing of neutrinos and their squared mass differences. The 0{nu}{beta}{beta} decay takes place in atomic nuclei where it can be observed, at least in principle, by underground neutrino experiments. The need of nuclei in observation of the 0{nu}{beta}{beta} decay bears two facets: The nucleus serves as laboratory for detection but at the same time its complicated many-nucleon structure interferes strongly with the analysis of the experimental data. The information about the weak-interaction observables, like the neutrino mass, has to be filtered from the data through the nuclear matrix elements (NMEs). Hence, exact knowledge about the NMEs is of paramount importance in the analysis of the data provided by the expensive and time-consuming underground experiments.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Efficient Unitary Designs from Random Sums and Permutations

A unitary k-design is an ensemble of unitaries that matches the first k moments of the Haar measure. In this work, we provide two efficient constructions of k-designs on n-qubits using new random matrix theory techniques. Our first construction is based on exponentiating sums of random i.i.d. Hermitian matrices and uses O(k2n2)-many gates. In the spirit of central limit theorems, we show that this random sum approximates the Gaussian Unitary Ensemble (GUE). We then show that the product of just two exponentiated GUE matrices is already approximately Haar random. Our second construction is based on products of exponentiated sums of random permutations and uses Õ(k poly (n)) many gates. The k dependence is optimal (up to polylogarithmic factors) and is inherited from the efficiency of existing k-wise independent permutations. Furthermore, replacing random permutations with quantum-secure pseudorandom permutations (PRPs), we also obtain a pseudorandom unitary (PRU) ensemble that is secure under nonadaptive queries. A central feature of both proofs is a new connection between the polynomial method in quantum query complexity and the large-dimension (N) expansion in random matrix theory. In particular, the first construction uses the polynomial method to control high moments of certain random matrix ensembles without requiring delicate Weingarten calculations. In doing so, we define and solve a moment problem on the unit circle, asking whether a finite number of equally weighted points can reproduce a given set of moments. In our second construction, the key step is to exhibit an orthonormal basis for irreducible representations of the partition algebra that has a low-degree large-N expansion. This allows us to show that the distinguishing probability is a low-degree rational polynomial of the dimension N.

algebra↗

Randomized algorithms for accelerating linear algebraic computations

The project supported the development of new methodologies for performing matrix computations that form key building blocks in modern scientific computing, such as low rank approximation of matrices, and efficient representations of global operators that arise in simulations of physical phenomena.

97 MATHEMATICS AND COMPUTING↗

Randomized low-rank decompositions of nuclear three-body interactions

First-principles simulations of many-fermion systems are commonly limited by the computational requirements of processing large data objects. As a remedy, we propose the use of low-rank approximations of three-body interactions, which are the dominant such limitation in nuclear physics. We introduce a randomized decomposition technique to handle the excessively large matrix dimensions and study the sensitivity of low-rank properties to interaction details. The developed low-rank three-nucleon interactions are benchmarked in ab initio simulations of few- and many-body systems. Exploiting low-rank properties provides a promising route to extend the microscopic description of atomic nuclei to large systems where storage requirements exceed the computational capacities of the most advanced high-performance computing facilities.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

Doorway states in the random-phase approximation

By coupling a doorway state to a sea of random background states, we develop the theory of doorway states in the framework of the random-phase approximation (RPA). Because of the symmetry of the RPA equations, that theory is radically different from the standard description of doorway states in the shell model. We derive the Pastur equation in the limit of large matrix dimension and show that the results agree with those of matrix diagonalization in large spaces. The complexity of the Pastur equation does not allow for an analytical approach that would approximately describe the doorway state. Our numerical results display unexpected features: The coupling of the doorway state with states of opposite energy leads to strong mutual attraction.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

A Galerkin method with two-dimensional Haar basis functions for the computation of the Karhunen–Loève expansion

We study the numerical approximation of a homogeneous Fredholm integral equation of second kind associated with the Karhunen–Loève expansion of Gaussian random fields. We develop, validate, and discuss an algorithm based on the Galerkin method with two-dimensional Haar wavelets as basis functions. The shape functions are constructed from the orthogonal decomposition of tensor-product spaces of one-dimensional Haar functions, and a recursive algorithm is employed to compute the matrix of the discrete eigenvalue system without the explicit calculation of integrals, allowing the implementation of a fast and efficient algorithm that provides considerable reduction in CPU time, when compared with classical Galerkin methods. Numerical experiments confirm the convergence rate of the method and assess the approximation error and the sparsity of the eigenvalue system when the wavelet expansion is truncated. We illustrate the numerical solution of a diffusion problem with random input data with the present method. In this problem, accuracy was retained after dropping the coefficients below a threshold value that was numerically determined. A similar method with scaling functions rather than wavelet functions does not need a discrete wavelet transform and leads to eigenvalue systems with better conditioning but lower sparsity.

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↗

First-principles study of electron transport in ScN

We investigate the conduction-band structure and electron mobility in rocksalt ScN based on density functional theory. The first-principles band structure allows us to obtain band velocities and effective masses as a function of energy. Electron-phonon scattering is assessed by explicitly computing the q-dependent electron-phonon matrix elements, with the inclusion of the long-range electrostatic interaction. The influence of free-carrier screening on the electron transport is assessed using the random phase approximation. We find a notable enhancement of electron mobility when the carrier concentration exceeds 10 20 cm -3 . We calculate the room-temperature electron mobility in ScN to be 587 cm2 /Vs at low carrier concentrations. When the carrier concentration is increased, the electron mobility starts to decrease significantly around n = 10 19 cm -3 , and drops to 240 cm 2 /Vs at n = 10 21 cm -3 . We also explore the influence of strain in (111)- and (100)-oriented ScN films. For (111) films, we find that a 1.0% compressive epitaxial strain increases the in-plane mobility by 72 cm 2 /Vs and the out-of-plane mobility by 50 cm 2 /Vs. For (100) films, a 1.0% compressive epitaxial strain increases the out-of-plane mobility by as much as 172 cm2 /Vs, but has a weak impact on the in-plane mobility. Our study sheds light on electron transport in ScN at different electron concentrations and shows how strain engineering could increase the electron mobility.

36 MATERIALS SCIENCE↗

Identifying Important Ions and Positions in Mass Spectrometry Imaging Data Using CUR Matrix Decompositions

Mass spectrometry imaging enables label-free, high-resolution spatial mapping of the chemical composition of complex, biological samples. Typical experiments require selecting ions and/or positions from the images: ions for fragmentation studies to identify keystone compounds and positions for follow up validation measurements using microdissection or other orthogonal techniques. Unfortunately, with modern imaging machines, these must be selected from an overwhelming amount of raw data. Existing techniques to reduce the volume of data, the most popular of which are principle component analysis and non-negative matrix factorization, have the disadvantage that they return difficult-to-interpret linear combinations of actual data elements. In this work, we show that CX and CUR matrix decompositions can be used directly to address this selection need. CX and CUR matrix decompositions use empirical statistical leverage scores of the input data to provide provably good low-rank approximations of the measured data that are expressed in terms of actual ions and actual positions, as opposed to difficult-to-interpret eigenions and eigenpositions. We show that this leads to effective prioritization of information for both ions and positions. In particular, important ions can be found either by using the leverage scores as a ranking function and using a deterministic greedy selection algorithm or by using the leverage scores as an importance sampling distribution and using a random sampling algorithm; however, selection of important positions from the original matrix performed significantly better when they were chosen with the random sampling algorithm. Also, we show that 20 ions or 40 locations can be used to reconstruct the original matrix to a tolerance of 17% error for a widely studied image of brain lipids; and we provide a scalable implementation of this method that is applicable for analysis of the raw data where there are often more than a million rows and/or columns, which is larger than SVD-based low-rank approximation methods can handle. Lastly, these results introduce the concept of CX/CUR matrix factorizations to mass spectrometry imaging, describing their utility and illustrating principled algorithmic approaches to deal with the overwhelming amount of data generated by modern mass spectrometry imaging.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗