Search NASA⌕ Search

SEARCH · Search NASA

Results for “Non-negative solutions”

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.

24 records · Page 2

Node Distortion as a Tunable Mechanism for Negative Thermal Expansion in Metal–Organic Frameworks

Chemically functionalized series of metal–organic frameworks (MOFs), with subtle differences in local structure but divergent properties, provide a valuable opportunity to explore how local chemistry can be coupled to long-range structure and functionality. Using in situ synchrotron X-ray total scattering, with powder diffraction and pair distribution function (PDF) analysis, we investigate the temperature dependence of the local- and long-range structure of MOFs based on NU-1000, in which Zr 6 O 8 nodes are coordinated by different capping ligands (H 2 O/OH, Cl – ions, formate, acetylacetonate, and hexafluoroacetylacetonate). We show that the local distortion of the Zr 6 nodes depends on the lability of the ligand and contributes to a negative thermal expansion (NTE) of the extended framework. Using multivariate data analyses, involving non-negative matrix factorization (NMF), we demonstrate a new mechanism for NTE: progressive increase in the population of a smaller, distorted node state with increasing temperature leads to global contraction of the framework. The transformation between discrete node states is noncooperative and not ordered within the lattice, i.e., a solid solution of regular and distorted nodes. Density functional theory calculations show that removal of ligands from the node can lead to distortions consistent with the Zr···Zr distances observed in the experiment PDF data. Control of the node distortion imparted by the nonlinker ligand in turn controls the NTE behavior. Furthermore, these results reveal a mechanism to control the dynamic structure of MOFs based on local chemistry.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

30 Years of Wahba's Problem

This article discusses a problem proposed by Grace Wahba: Find the orthogonal matrix A with determinant +1 that minimizes the loss function L(A) is identical with the 1/2(summation from i( a(sub i) * absolute value of (b(sub i)- Ar(sub i))squared). where {b(sub i)} is a set of unit vectors measured in a spacecraft's body frame, {r(sub i)} e the corresponding unit vectors in a reference frame and {a(sub i) are non-negative weights). The orthogonal Procrustes problem is to find the orthogonal matrix A that is closest to B in the sense of the Fobenius norm, so that Wahba's Problem is equivalent to the orthogonal Procrustes problem with the provision that the determinant of A must be +1. The article reviews various solutions to this problem and the implementations of the various solutions.

Markley, F. Landis↗

Enhanced relaxed physical factorization preconditioner for coupled poromechanics

The relaxed physical factorization (RPF) preconditioner is a recent algorithm allowing for the efficient and robust solution to the block linear systems arising from the three-field displacement-velocity-pressure formulation of coupled poromechanics. For its application, however, it is necessary to invert blocks with the algebraic form C^ = (C + βFF T ), where C is a symmetric positive definite matrix, FF T a rank-deficient term, and β a real non-negative coefficient. The inversion of C^, performed in an inexact way, can become unstable for large values of β, as it usually occurs at some stages of a full poromechanical simulation. In this work, we propose a family of algebraic techniques to stabilize the inexact solve with C^. This strategy can prove useful in other problems as well where such an issue might arise, such as augmented Lagrangian preconditioning techniques for Navier-Stokes or incompressible elasticity. First, we introduce an iterative scheme obtained by a natural splitting of matrix C^. Second, we develop a technique based on the use of a proper projection operator annihilating the near-kernel modes of C^. Both approaches give rise to a novel class of preconditioners denoted as Enhanced RPF (ERPF). Furthermore, effectiveness and robustness of the proposed algorithms are demonstrated in both theoretical benchmarks and real-world large-size applications, outperforming the native RPF preconditioner.

97 MATHEMATICS AND COMPUTING↗

Quasinormal modes of naked singularities in presence of nonlinear scalar fields

We study linear perturbations against static spherically symmetric background configurations of general relativity with a real scalar field (SF), which is minimally coupled with gravity; it is nonlinear due to the presence of the self-action potential. The background solutions have a naked singularity at the center of the configuration. The focus is on the stability of the background and fundamental frequencies of the quasinormal modes (QNM) of the axial perturbations in the Regge-Wheeler gauge. The problem is reduced to one hyperbolic master equation with an effective potential 𝑊eff, which turns out to be positive for a general non-negative SF potential; this ensures the linear stability with respect to this kind of perturbations. For numerical simulations, the SF potential was chosen in the power-law form 𝑉⁡(𝜙) ∼ 𝜙 2⁢𝑛 with 2 < 𝑛 ≤40. We extracted the fundamental frequencies of QNM for different 𝑛 and various sets of the background configuration parameters. The results show that even for a small background SF, there is a significant difference between the fundamental frequencies and ones in case of the Schwarzschild background. Furthermore, the results are also compared with the case of the Fisher-Janis-Newman-Winicour background dealing with a massless linear scalar field.

General relativity↗

Positive Energy Functional for Massless Scalars in Rotating Black Hole Backgrounds of Maximal Ungauged Supergravity

Here, we outline a proof of the stability of a massless neutral scalar field ψ in the background of a wide class of four dimensional asymptotically flat rotating and “electrically charged” solutions of supergravity, and the low energy limit of string theory, known as STU metrics. Despite their complexity, we find it possible to circumvent the difficulties presented by the existence of ergo regions and the related phenomenon of superradiance in the original metrics by following a strategy due to Whiting, and passing to an auxiliary metric admitting an everywhere lightlike Killing field and constructing a scalar field ψ (related to a possible unstable mode ψ by a nonlocal transformation) which satisfies the massless wave equation with respect to the auxiliary metric. By contrast with the case for ψ, the associated energy density of ψ is not only conserved but is also non-negative.

79 ASTRONOMY AND ASTROPHYSICS↗

A neural network for determination of latent dimensionality in Nonnegative Matrix Factorization

Non-negative Matrix Factorization (NMF) has proven to be a powerful unsupervised learning method for uncovering hidden features in complex and noisy datasets with applications in data mining, text recognition, dimension reduction, face recognition, anomaly detection, blind source separation, and many other fields. An important input for NMF is the latent dimensionality of the data, that is, the number of hidden features, K, present in the explored dataset. Unfortunately, and this quantity is rarely known a priori. The existing methods for determining latent dimensionality, such as Automatic Relevance Determination (ARD), are mostly heuristic and utilize different characteristics to estimate the number of hidden features. However, all of them require human presence to make a final determination of K. Here we utilize a supervised machine learning approach in combination with a recent method for model determination, called NMFk, to determine the number of hidden features automatically. NMFk performs a set of NMF simulations on an ensemble of matrices, obtained by bootstrapping the initial dataset, and estimates which K produces stable groups of latent features that reconstruct the initial dataset well. We then train a Multi-Layter Perceptron (MLP) classifier network to determine the correct number of latent features utilizing the statistics and characteristics of the NMF solution, obtained from NMFk. In order to train the MLP classifier, a training set of 58,660 matrices with predetermined latent features were factorized with NMFk. The MLP classifier in conjunction with NMFk maintains a greater than 95% success rate when applied to a held out test set. Additionally, when applied to two well-known benchmark datasets, the swimmer and MIT face data, NMFk/MLP correctly recovers the established number of hidden features. Finally, we compare the accuracy of our method to the ARD, AIC and Stability-based methods.

97 MATHEMATICS AND COMPUTING↗