Search NASA⌕ Search

SEARCH · Search NASA

Results for “HYPERPLANE”

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 19 records
All sourcesNASA NTRSDOE OSTI
DOE OSTI2024

The hyperplane of early-type galaxies: using stellar population properties to increase the precision and accuracy of the fundamental plane as a distance indicator

ABSTRACT We use deep spectroscopy from the SAMI (Sydney-AAO Multi-object Integral) Galaxy Survey to explore the precision of the fundamental plane (FP) of early-type galaxies as a distance indicator for future single-fibre spectroscopy surveys. We study the optimal trade-off between sample size and signal-to-noise ratio (SNR), and investigate which additional observables can be used to construct hyperplanes with smaller intrinsic scatter than the FP. We add increasing levels of random noise (parametrized as effective exposure time) to the SAMI spectra to study the effect of increasing measurement uncertainties on the FP- and hyperplane-inferred distances. We find that, using direct-fit methods, the values of the FP and hyperplane best-fitting coefficients depend on the spectral SNR, and reach asymptotic values for a mean $\langle \mathrm{ SNR} \rangle =40\, \mathrm{\mathring{\rm A}}^{-1}$. As additional variables for the FP we consider three stellar-population observables: light-weighted age, stellar mass-to-light ratio, and a novel combination of Lick indices ($I_\mathrm{age}$). For an $\langle \mathrm{ SNR} \rangle =45~\mathrm{\mathring{\rm A}}^{-1}$ (equivalent to 1-h exposure on a 4-m telescope), all three hyperplanes outperform the FP as distance indicators. Being an empirical spectral index, $I_\mathrm{age}$ avoids the model-dependent uncertainties and bias underlying age and mass-to-light ratio measurements, yet yields a 10 per cent reduction of the median distance uncertainty compared to the FP. We also find that, as a by-product, the $I_\mathrm{age}$ hyperplane removes most of the reported environment bias of the FP. After accounting for the different SNR, these conclusions also apply to a 50 times larger sample from SDSS-III (Sloan Digital Sky Survey). However, in this case, only $\mathrm{ age}$ removes the environment bias.

D’Eugenio, Francesco (ORCID:0000000323888172)↗
NASA NTRS1976

DHARMA - Discriminant hyperplane abstracting residuals minimization algorithm for separating clusters with fuzzy boundaries

Learning of discriminant hyperplanes in imperfectly supervised or unsupervised training sample sets with unreliably labeled samples along the fuzzy joint boundaries between sample clusters is discussed, with the discriminant hyperplane designed to be a least-squares fit to the unreliably labeled data points. (Samples along the fuzzy boundary jump back and forth from one cluster to the other in recursive cluster stabilization and are considered unreliably labeled.) Minimization of the distances of these unreliably labeled samples from the hyperplanes does not sacrifice the ability to discriminate between classes represented by reliably labeled subsets of samples. An equivalent unconstrained linear inequality problem is formulated and algorithms for its solution are indicated. Landsat earth sensing data were used in confirming the validity and computational feasibility of the approach, which should be useful in deriving discriminant hyperplanes separating clusters with fuzzy boundaries, given supervised training sample sets with unreliably labeled boundary samples.

Dasarathy, B. V.↗
DOE OSTI2018

An efficient algorithm for the projection of a point on the intersection of two hyperplanes and a box in $\mathbb {R}^n$

Here, we present an efficient strongly polynomial algorithm for the projection of a point on the intersection of two hyperplanes and a box in \(\mathbb {R}^n\) . Interior point methods are the most efficient algorithm in the literature to solve this problem. While efficient in practice, the complexity of interior-point methods is bounded by a polynomial in the dimension of the problem and in the accuracy of the solution. Moreover, their efficiency is highly dependent on a series of parameters depending on the specific method chosen (especially for nonlinear problems), such as step size, barrier parameter, accuracy, among others. We propose a new method based on the KKT optimality conditions. In this method, we write the problem as a function of the Lagrangian multipliers of the hyperplanes and seek to find the pair of multipliers that corresponds to the optimal solution. We prove that the algorithm has complexity \(O(n^2 \log n)\) .

42 ENGINEERING↗
DOE OSTI2025

Hyperplane decision trees as piecewise linear surrogate models for chemical process design

Recent trends in chemical engineering research point towards an increasing reliance on data-driven modeling approaches. Neural networks, for instance, have proven to be accurate when data is plentiful and high-dimensional, but in many cases, they require computationally-intensive training procedures. Here, in this work, we describe hyperplane decision trees (HT) as a highly expressive and low-compute machine learning model architecture. These models are locally linear and have linear decision boundaries, resulting in a piecewise linear model of the data. This property allows them to be converted into mixed-integer linear constraints which can be globally optimized. Our open-source PyTorch implementation of this method is a fast, flexible, and accessible way to build accurate piecewise linear models of data.

Decision trees↗
DOE OSTI2012

Embeddings of graphs into Euclidean space under which the number of points that belong to a hyperplane is minimal

The paper is devoted to the characteristic of a graph that is the minimal (over all embeddings of the graph into a space of given dimension) number of points that belong to the same hyperplane. Upper and lower estimates for this number are given that linearly depend on the dimension of the space. For trees a more precise upper estimate is obtained, which asymptotically coincides with the lower one for large dimension of the space. Bibliography: 9 titles.

97 MATHEMATICS AND COMPUTING↗
NASA NTRS1995

An aspect ration bound for triangulating a d-grid cut by a hyperplane

We consider the problem of triangulating a d-dimensional uniform grid of d-cubes that is cut by a k-dimensional affine subspace. The goal is to obtain a triangulation with bounded aspect ratio. To achieve this goal, we allow some of the box faces near the affine subspace to be displaced. This problem has applications to finite element mesh generation. For general d and k, the bound on aspect ratio that we attain is double-exponential in d. For the important special case of d = 3, the aspect ratio bound is small enough that the technique is useful in practice.

Mitchell, Scott A.↗
DOE OSTI2019

Bootstrap-based confidence interval estimation for thermal security region of bulk power grid

Thermal security region (TSR) is a powerful tool for monitoring and controlling the thermal security of bulk power grid with high penetration of renewable energy. One of the major challenges of TSR in practical application is to obtain the exact analytical expression of the TSR boundary (TSRB) because TSRB is a nonlinear hypersurface described by an implicit function. For this reason, the TSRB is usually approximated by hyperplane instead of getting the exact analytical expression. Traditionally, the coefficients of the hyperplane are estimated with a set of original TSRB points using least square estimation (LSE). However, LSE is a point estimation method, which is incapable of evaluating the quality of the estimation. In addition, the accuracy and computational efficiency of the hyperplane approximation are influenced by the number of TSRB points significantly. Here, a bootstrap based confidence interval estimation is proposed to estimate not only the coefficients of TSRB approximation hyperplane, but also the standard deviations and confidence intervals of the coefficients for evaluating the quality and reliability of the approximation results. First, empirical distribution functions (EDFs) of the coefficients of TSRB approximation hyperplane are approximated from a set of original TSRB points by using residual resampling bootstrap method. Then, the EDFs of the coefficients are employed to estimate the coefficients of the approximation hyperplane. Meanwhile, the standard deviations and confidence intervals of the estimated coefficients of the hyperplanes are also calculated for evaluating the quality and reliability of the approximation. The proposed approach is tested on the China Southern Power Grid (CSG). Results of simulations validate the accuracy and efficiency of the proposed approach in approximating the TSRB.

32 ENERGY CONSERVATION, CONSUMPTION, AND UTILIZATI↗
NASA NTRS1976

On optimal soft-decision demodulation

A necessary condition is derived for optimal J-ary coherent demodulation of M-ary (M greater than 2) signals. Optimality is defined as maximality of the symmetric cutoff rate of the resulting discrete memoryless channel. Using a counterexample, it is shown that the condition derived is generally not sufficient for optimality. This condition is employed as the basis for an iterative optimization method to find the optimal demodulator decision regions from an initial 'good guess'. In general, these regions are found to be bounded by hyperplanes in likelihood space; the corresponding regions in signal space are found to have hyperplane asymptotes for the important case of additive white Gaussian noise. Some examples are presented, showing that the regions in signal space bounded by these asymptotic hyperplanes define demodulator decision regions that are virtually optimal.

Lee, L.-N.↗
NASA NTRS1991

Robust and real-time control of magnetic bearings for space engines

Currently, NASA Lewis Research Center is developing magnetic bearings for Space Shuttle Main Engine (SSME) turbopumps. The control algorithms which have been used are based on either the proportional-intergral-derivative control (PID) approach or the linear quadratic (LQ) state space approach. These approaches lead to an acceptable performance only when the system model is accurately known, which is seldom true in practice. For example, the rotor eccentricity, which is a major source of vibration at high speeds, cannot be predicted accurately. Furthermore, the dynamics of a rotor shaft, which must be treated as a flexible system to model the elastic rotor shaft, is infinite dimensional in theory and the controller can only be developed on the basis of a finite number of modes. Therefore, the development of the control system is further complicated by the possibility of closed loop system instability because of residual or uncontrolled modes, the so called spillover problem. Consequently, novel control algorithms for magnetic bearings are being developed to be robust to inevitable parametric uncertainties, external disturbances, spillover phenomenon and noise. Also, as pointed out earlier, magnetic bearings must exhibit good performance at a speed over 30,000 rpm. This implies that the sampling period available for the design of a digital control system has to be of the order of 0.5 milli-seconds. Therefore, feedback coefficients and other required controller parameters have to be computed off-line so that the on-line computational burden is extremely small. The development of the robust and real-time control algorithms is based on the sliding mode control theory. In this method, a dynamic system is made to move along a manifold of sliding hyperplanes to the origin of the state space. The number of sliding hyperplanes equals that of actuators. The sliding mode controller has two parts; linear state feedback and nonlinear terms. The nonlinear terms guarantee that the systems would reach the intersection of all sliding hyperplanes and remain on it when bounds on the errors in the system parameters and external disturbances are known. The linear part of the control drives the system to the origin of state space. Another important feature is that the controller parameter can be computed off-line. Consequently, on-line computational burden is small.

Sinha, Alok↗
NASA NTRS2005

Parallelization of Lower-Upper Symmetric Gauss-Seidel Method for Chemically Reacting Flow

Development of technologies for exploration of the solar system has revived an interest in computational simulation of chemically reacting flows since planetary probe vehicles exhibit non-equilibrium phenomena during the atmospheric entry of a planet or a moon as well as the reentry to the Earth. Stability in combustion is essential for new propulsion systems. Numerical solution of real-gas flows often increases computational work by an order-of-magnitude compared to perfect gas flow partly because of the increased complexity of equations to solve. Recently, as part of Project Columbia, NASA has integrated a cluster of interconnected SGI Altix systems to provide a ten-fold increase in current supercomputing capacity that includes an SGI Origin system. Both the new and existing machines are based on cache coherent non-uniform memory access architecture. Lower-Upper Symmetric Gauss-Seidel (LU-SGS) relaxation method has been implemented into both perfect and real gas flow codes including Real-Gas Aerodynamic Simulator (RGAS). However, the vectorized RGAS code runs inefficiently on cache-based shared-memory machines such as SGI system. Parallelization of a Gauss-Seidel method is nontrivial due to its sequential nature. The LU-SGS method has been vectorized on an oblique plane in INS3D-LU code that has been one of the base codes for NAS Parallel benchmarks. The oblique plane has been called a hyperplane by computer scientists. It is straightforward to parallelize a Gauss-Seidel method by partitioning the hyperplanes once they are formed. Another way of parallelization is to schedule processors like a pipeline using software. Both hyperplane and pipeline methods have been implemented using openMP directives. The present paper reports the performance of the parallelized RGAS code on SGI Origin and Altix systems.

Yoon, Seokkwan↗
DOE OSTI2024

Partially celestial states and their scattering amplitudes

We study representations of the Poincaré group that have a privileged transformation law along a p -dimensional hyperplane, and uncover their associated spinor-helicity variables in D spacetime dimensions. Our novel representations generalize the recently introduced celestial states and transform as conformal primaries of S O ( p , 1 ) , the symmetry group of the p -hyperplane. We will refer to our generalized states as “partially celestial.” Following Wigner’s method, we find the induced representations, including spin degrees of freedom. Defining generalized spinor-helicity variables for every D and p , we are able to construct the little group covariant part of partially celestial amplitudes. Finally, we briefly examine the application of the pairwise little group to partially celestial states with mutually nonlocal charges. Published by the American Physical Society 2024

Astronomy & Astrophysics↗