Search NASA⌕ Search

SEARCH · Search NASA

Results for “methods - statistical”

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 37 records · Page 2

A comparison between whole transcript and 3’ RNA sequencing methods using Kapa and Lexogen library preparation methods

Background: 3’ RNA sequencing provides an alternative to whole transcript analysis. However, we do not know a priori the relative advantage of each method. Thus, a comprehensive comparison between the whole transcript and the 3' method is needed to determine their relative merits. To this end, we used two commercially available library preparation kits, the KAPA Stranded mRNA-Seq kit (traditional method) and the Lexogen QuantSeq 3’ mRNASeq kit (3' method), to prepare libraries from mouse liver RNA. We then sequenced and analyzed the libraries to determine the advantages and disadvantages of these two approaches. Results: We found that the traditional whole transcript method and the 3’ RNA-Seq method had similar levels of reproducibility. As expected, the whole transcript method assigned more reads to longer transcripts, while the 3' method assigned roughly equal numbers of reads to transcripts regardless of their lengths. We found that the 3’ RNA-Seq method detected more short transcripts than the whole transcript method. With regard to differential expression analysis, we found that the whole transcript method detected more differentially expressed genes, regardless of the level of sequencing depth. Conclusions: The 3’ RNA-Seq method was better able to detect short transcripts, while the whole transcript RNA-Seq was able to detect more differentially expressed.

3’ RNA-Seq↗

Analysis of the Spectral Stability of the Generalized Runge–Kutta Methods Applied to Initial-Boundary-Value Problems for Equations of the Parabolic Type. II. Implicit Methods

We consider specific realizations of different implicit generalized Runge–Kutta methods as applied to the numerical integration with respect to time of initial-boundary-value problems for the second-order parabolic equations and investigate their spectral stability. It is shown that all implicit generalized Runge–Kutta methods are unconditionally spectrally stable but some of them have the conditional property of monotonicity of the numerical solution with respect to time. The functions of spectral stability of the implicit generalized Runge–Kutta methods are rational. We compare the analytic solution of the nonstationary one-dimensional problem of heat conduction with the numerical solutions of this problem obtained by different implicit generalized Runge–Kutta methods. It is shown that, in this case, the application of the one-stage Radau methods with subsequent discretization of the problem with respect to the space variable leads to the classical forward finite difference scheme (Laasonen scheme), whereas the use of the one-stage Gauss–Legendre method leads to a six-point symmetric scheme (Crank–Nicolson scheme). It is shown that diagonally implicit generalized Nørsett and Burrage methods are realized in almost the same way as the one-stage Radau and Gauss–Legendre methods but their accuracy in the time step is 10–1000 times higher. On the basis of comparison of the numerical and analytic solutions, we conclude that, in order to get practically suitable numerical solutions without any restrictions on the time step, it is reasonable to use one- and three-stage generalized Radau methods or two- and four-stage Lobatto IIIC methods. All other explicit and implicit generalized Runge–Kutta methods require certain restrictions imposed on the time step.

42 ENGINEERING↗

Composite-particle decay widths by the generator coordinate method

We study the feasibility of applying the Generator Coordinate Method (GCM) of self-consistent mean-field theory to calculate decay widths of composite particles to composite-particle final states. The main question is how well the GCM can approximate continuum wave functions in the decay channels. The analysis is straightforward under the assumption that the GCM wave functions are separable into internal and Gaussian center-of-mass wave functions. Two methods are examined for calculating decay widths. In one method, the density of final states is computed entirely in the GCM framework. In the other method, it is determined by matching the GCM wave function to an asymptotic scattering wave function. Both methods are applied to a numerical example and are found to agree within their determined uncertainties.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Enhanced Large-Signal Stability Method for Grid-Forming Inverters During Current Limiting: Preprint

Grid-forming (GFM) inverters are a promising technology for the widespread integration of renewable energy sources in future power systems. As a key element of GFM inverter control, the primary controller governs the internal reference voltage and angle. During contingencies in the grid---such as faults, voltage drops, or frequency and phase jumps---an inverter can be forced into a current-limiting mode of operation modulating inverter dynamics, and, as a result, it is prone to losing synchronism with the grid. In this paper, we propose a novel GFM primary control method with an additional synchronization term that naturally activates during contingencies to improve the dynamic response. The method allows the inverter to remain synchronized with the grid, which improves the inverter's dynamic behavior both during and after current-limiting grid conditions and enhances grid support, including voltage support using full current capacity. The method is demonstrated for voltage, frequency, and phase jumps both in a single-machine-to-infinite-bus and a network-wide electromagnetic transient simulation of the IEEE 14-bus system with 5 GFM inverters. The simulations provide insights into the proposed synchronization method and confirm the high potential of the method, which robustly secures synchronism under severe contingencies.

current limiting↗

Improvements to a class of hybrid methods for radiation transport: Nyström reconstruction and defect correction methods

In this study, two modifications are introduced for improving the accuracy, versatility, and robustness of a class of hybrid methods for radiation transport. In general, such methods are constructed by splitting the radiative flux into collided and uncollided components to which low- and high-resolution angular approximations are applied, respectively. In this work we focus on discrete ordinates discretizations of high and low order. The first modification we introduce changes the way in which the collided component is mapped into the uncollided component at the end of each time step in a simulation. The new mapping is a Nyström-type reconstruction that is applicable to arbitrary discrete ordinates quadratures, is guaranteed to preserve positivity of the solution provided that all ordinate weights are positive, is significantly more accurate than previous methods, and can be readily extended to other discretizations such as moment methods, finite element methods, and diffusion approximations. The second modification leverages integral deferred correction (IDC) to iteratively correct for the splitting error introduced by the inconsistency in angular discretization between the collided and uncollided components, in addition to improving the accuracy of the low-order temporal error that is treated by traditional IDC methods. Numerical tests in one- and two-dimensional geometries are used to demonstrate the increased accuracy and efficiency of the proposed modifications. It is found that the two techniques combined yield methods with solution accuracy and memory requirements comparable to that of monolithic discrete ordinates methods while reducing runtime by as much as a factor of between two and ten, depending on the problem.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

Analysis of the Spectral Stability of the Generalized Runge–Kutta Methods Applied to Initial-Boundary-Value Problems for Equations of the Parabolic Type. I. Explicit Methods

We develop a general algorithm for the analysis the spectral stability of generalized multistage Runge–Kutta methods of various orders of accuracy as applied to the numerical integration with respect to time of an initial-boundary-value problem for the second-order parabolic equation. The expression for the function of spectral stability is obtained in two alternative forms: on the basis of matrix relations and in the determinant form. We study specific realizations of various generalized explicit Runge–Kutta methods and their spectral stability. It is shown that all explicit generalized Runge–Kutta methods possess the property of conditional spectral stability and the property of conditional monotonicity of the numerical solution in time whose violation leads to the appearance of false oscillations of the approximate solution. The stability function for these methods is polynomial. It is shown that the application of two-stage generalized explicit Runge–Kutta methods leads to the appearance of predictor-corrector-type schemes. In the case of nonstationary one-dimensional heat-conduction problem, on the basis of a one-stage generalized Runge–Kutta method, we obtain the classical two-layer conditionally stable explicit finite-difference scheme on a four-point template. It is demonstrated that the five-stage generalized Runge–Kutta–Merson method is characterized by the weakest condition of spectral stability as compared with all investigated explicit generalized Runge–Kutta methods.

42 ENGINEERING↗

Comparison of Surface Tension Generation Methods in Smoothed Particle Hydrodynamics for Dynamic Systems

Developing robust numerical models of dynamic surface tension dominated multiphase systems is an ongoing challenge, especially in scenarios with large density and viscosity ratios. This is critical to the design and understanding of various physical and engineering systems, such as fluidized beds, fuel injectors, and drug delivery schemes. Much of the computational work in surface tension dominated multiphase flows has employed the continuum surface force method (CSF) of Brackbill et al. [1], which recasts surface tension from a surface force to a volumetric force that can be imposed in the vicinity of an interface. The CSF method produces accurate results across a variety of systems, however it relies on the identication of surface normals, which can be unreliable under certain conditions. Alternative methods of simulating surface tension have been proposed. Here the advantages and disadvantages of the CSF method in comparison to a pairwise forces (PF) method proposed by Tartakovsky and Panchenko [2] are explored. The CSF and PF methods are used in a smoothed particle hydrodynamics (SPH) framework to model dynamic systems. Results are compared to existing test cases from the literature and to analytic solutions derived from fundamental normal mode behavior of bubbles and droplets. A physical system for which the PF method is more stable and physically appropriate than the CSF method is identied.

smoothed particle hydrodynamics, multiphase flow↗

A Fast and Accurate Transient Stability Assessment Method Based on Deep Learning: WECC Case Study

Transient stability is one of the critical aspects of power system stability assessment. The increasing integration of inverter-based resources and the retirement of conventional synchronous generators result in the decreasing system inertia and growing complexity of system operating conditions. Using a few selected typical operating conditions cannot guarantee system transient stability in all operating conditions, and the time-domain simulation of all operating conditions requires tremendous time and is often infeasible. This paper proposes a more efficient transient stability assessment method based on deep learning. The binary search method is used to determine the critical clearing time (CCT) in creating training databased by time-domain simulation. This method is fast and accurate with 1 ms resolution. The buses whose CCTs are lower than 200 ms are considered critical buses. Buses close to each other are grouped based on their mutual admittance matrix to reduce the search space of the critical buses. This paper also proposes the generator feature normalization based on the physical model. Case study on the reduced 240-bus WECC system model demonstrates that the proposed method can predict CCT accurately and efficiently.

critical clearing time↗

Methods for the Automated Determination of Sustained Maximum Amplitudes in Oscillating Signals

Machine condition monitoring has been proven to reduce machine downtime and increase productivity. The state-of-the-art research uses vibration monitoring for tasks such as maintenance and tool wear prediction. A less explored aspect is how vibration monitoring might be used to monitor equipment sensitive to vibration. In a manufacturing environment, one example of where this might be needed is in monitoring the vibration of optical linear encoders used in high-precision machine tools and coordinate measuring machines. Monitoring the vibration of sensitive equipment presents a unique case for vibration monitoring because an accurate calculation of the maximum sustained vibration is needed, as opposed to extracting trends from the data. To do this, techniques for determining sustained peaks in vibration signals are needed. Here, this work fills this gap by formalizing and testing methods for determining sustained vibration amplitudes. The methods are tested on simulated signals based on experimental data. Results show that processing the signal directly with the novel Expire Timer method produces the smallest amounts of error on average under various test conditions. Additionally, this method can operate in real-time on streaming vibration data.

Industrial Internet of Things↗

Physics-Informed Deep Neural Network Method for Limited Observability State Estimation

The precise knowledge regarding the state of the power grid is important in order to ensure optimal and reliable grid operation. Specifically, knowing the state of the distribution grid becomes increasingly important as more renewable energy sources are connected directly into the distribution network, increasing the fluctuations of the injected power. In this paper, we consider the case when the distribution grid becomes partially observable, due to for example cyber attacks, and the state estimation problem is under-determined. We present a new methodology that leverages a deep neural network (DNN) to estimate the grid state. The standard DNN training method is modified to explicitly incorporate the physical information of the grid topology and line/shunt admittance. We show that our method leads to a superior accuracy of the estimation when compared to the case when no physical information is provided. Finally, we compare the performance of our method to the standard state estimation approach, which is based on the weighted least squares with pseudo-measurements, and show that our method performs significantly better with respect to the estimation accuracy.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Toward a scalable robust security-constrained optimal power flow using a proximal projection bundle method

Robust security-constrained optimal power flow (rSCOPF) aims to find the worst-case contingencies of alternating current optimal power flow (ACOPF) in power systems. With the rise of GPU architectures on the upcoming supercomputer architectures, optimization algorithms that rely on sparse linear algebra and indefinite linear systems are becoming increasingly hard to solve efficiently (e.g. interior-point method). To address this we revisit a maximin optimization formulation of the rSCOPF and the single-level mixed-integer semidefinite programming (MISDP) reformulation, which is obtained by taking the Lagrangian relaxation of the inner minimization ACOPF problem. In this paper, we focus on the development of a proximal projection bundle method (PPBM) for solving continuous relaxation node subproblems of the MISDP problem, based primarily on the well-known alternating direction method of multipliers. Cutting planes reminiscent of bundle method ideas are also applied in coordination with updates of the proximal parameter. The cutting-plane method can generate a large number of linear inequalities, leading to a large scale but decomposable quadratic programming (QP) subproblem that is amenable to GPUs. We present the numerical results on the IEEE 30, 57, 118, and 300-bus systems by using our PBMM method. We discuss the main computational bottleneck of our method, which is the time taken to solve each iteration of a QP subproblem instance of the PPBM, and how GPU architectures can accelerate this solution process.

bundle method↗

An Automated Ultraclean Ion Exchange Separation Method for the Determinations of 232Th and 238U in Copper using Inductively Coupled Plasma Mass Spectrometry

This work presents a novel automated analytical method developed for high throughput ultrasensitive determinations of Th and U in copper using inductively coupled plasma mass spectrometry (ICP-MS). The method is based on the use of ultra clean sample preparation procedures including the use of a fully automated off-line chromatography system for the extraction and pre-concentration of the analytes prior to ICP-MS analysis. The separation system is equipped with a single reusable chromatographic column that, with the rigorously clean procedures developed herein, provided a low carryover, low background, and reproducible automated separation method. Isotope dilution methods were used for quantitation. Method Detection Limits (MDLs) of 3.7 and 9.4 fg·g-1 were obtained for the quantitation of 232Th and 238U in copper, respectively, corresponding to activities of 0.0148 and 0.116 microBq·kg-1 for 232Th and 238U, respectively. The analytical method provided high and reproducible tracer recoveries. The use of an automated system significantly reduced the extremely tedious active work time required for the chemist (by ca. 80%) relative to manually performing the separation. This method could be adapted to other critical sample matrices requiring the utmost in high throughput clean chemistry procedures for automated ultrasensitive analyses.

Arnquist, Isaac J.↗

A robust and efficient finite volume method for compressible inviscid and viscous two-phase flows [A robust and efficient finite volume method for compressible viscous two-phase flows]

A robust and efficient density-based finite volume method is developed for solving the six-equation single pressure system of two-phase flows at all speeds on hybrid unstructured grids. Unlike conventional approaches where an expensive exact Riemann solver is normally required for computing numerical fluxes at the two-phase interfaces in addition to AUSM-type fluxes for single-phase interfaces in order to maintain stability and robustness in cases involving interactions of strong pressure and void-fraction discontinuities, a volume-fraction coupling term for the AUSM + -up fluxes is introduced in this work to impart the required robustness without the need of the exact Riemann solver. The resulting method is significantly less expensive in regions where otherwise the Riemann solver would be invoked. A transformation from conservative variables to primitive variables is presented and the primitive variables are then solved in the implicit method in order for the current finite volume method to be able to solve, effectively and efficiently, low Mach number flows in traditional multiphase applications, which otherwise is a great challenge for the standard density-based algorithms. Here, a number of benchmark test cases are presented to assess the performance and robustness of the developed finite volume method for both inviscid and viscous two-phase flow problems. The numerical results indicate that the current density-based method provides an attractive and viable alternative to its pressure-based counterpart for compressible two-phase flows at all speeds.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

A Consistent Spatially Adaptive Smoothed Particle Hydrodynamics Method for fluid-structure interactions

A new consistent, spatially adaptive, smoothed particle hydrodynamics (SPH) method for Fluid-Structure Interactions (FSI) is presented. The method combines several attributes that have not been simultaneously satisfied by other SPH methods. Specifically, it is second-order convergent; it allows for resolutions spatially adapted with moving (translating and rotating) boundaries of arbitrary geometries; and, it accelerates the FSI solution as the adaptive approach leads to fewer degrees of freedom without sacrificing accuracy. The key ingredients in the method are a consistent discretization of differential operators, a posteriori error estimator/distance-based criterion of adaptivity, and a particle-shifting technique. The method is applied in simulating six different flows or FSI problems. The new method's convergence, accuracy, and efficiency attributes are assessed by comparing the results it produces with analytical, finite element, and consistent SPH uniform high-resolution solutions as well as experimental data.

Hu, Wei↗