SEARCH · Engineering Papers

Results for “Poisson 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.

SourceResearch connectionFrom yearThrough year

Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.

At least 55 records · Page 3

All sources NASA NTRS DOE OSTI

NASA NTRS1974

Computer solutions of Wu's equations for compressible flow through turbomachines

Two computers programs, known as Matrix Through-Flow and Matrix Blade-To-Blade, for analyzing the meridional and blade-to-blade flow patterns are described. The numerical solutions are obtained by finite difference approximations to the governing Poisson-type differential equations for the stream function. Solutions for several turbomachines, giving flow patterns and velocity distributions, are included.

Smith, D. J. L.↗

NASA NTRS1980

Evaluation of pulsed RFI effects on digital satellite repeaters

This paper presents an analytical approach for assessing the effect of pulsed RFI on the error probability of a coherent phase-shift keyed signal through a nonlinear satellite repeater. The RFI is assumed to affect the uplink channel and to consist of CW pulses with random power levels and arriving randomly in time with a Poisson distribution. A model to approximate the effect of intermodulation products is introduced and the error probability conditioned on the output of the satellite repeater is computed. The classical moment technique is then used as an efficient method of averaging the conditional error probability over the numerous random parameters associated with the uplink signal.

Huang, T. C.↗

NASA NTRS1991

Analysis of regional deformation and strain accumulation data adjacent to the San Andreas fault

A new approach to the understanding of crustal deformation was developed under this grant. This approach combined aspects of fractals, chaos, and self-organized criticality to provide a comprehensive theory for deformation on distributed faults. It is hypothesized that crustal deformation is an example of comminution: Deformation takes place on a fractal distribution of faults resulting in a fractal distribution of seismicity. Our primary effort under this grant was devoted to developing an understanding of distributed deformation in the continental crust. An initial effort was carried out on the fractal clustering of earthquakes in time. It was shown that earthquakes do not obey random Poisson statistics, but can be approximated in many cases by coupled, scale-invariant fractal statistics. We applied our approach to the statistics of earthquakes in the New Hebrides region of the southwest Pacific because of the very high level of seismicity there. This work was written up and published in the Bulletin of the Seismological Society of America. This approach was also applied to the statistics of the seismicity on the San Andreas fault system.

Turcotte, Donald L.↗

NASA NTRS2000

Adaptive Detector Arrays for Optical Communications Receivers

The structure of an optimal adaptive array receiver for ground-based optical communications is described and its performance investigated. Kolmogorov phase screen simulations are used to model the sample functions of the focal-plane signal distribution due to turbulence and to generate realistic spatial distributions of the received optical field. This novel array detector concept reduces interference from background radiation by effectively assigning higher confidence levels at each instant of time to those detector elements that contain significant signal energy and suppressing those that do not. A simpler suboptimum structure that replaces the continuous weighting function of the optimal receiver by a hard decision on the selection of the signal detector elements also is described and evaluated. Approximations and bounds to the error probability are derived and compared with the exact calculations and receiver simulation results. It is shown that, for photon-counting receivers observing Poisson-distributed signals, performance improvements of approximately 5 dB can be obtained over conventional single-detector photon-counting receivers, when operating in high background environments.

Vilnrotter, V.↗

DOE OSTI2024

Tensor decompositions for count data that leverage stochastic and deterministic optimization

There is growing interest to extend low-rank matrix decompositions to multi-way arrays, or tensors. One fundamental low-rank tensor decomposition is the canonical polyadic decomposition (CPD). The challenge of fitting a low-rank, nonnegative CPD model to Poisson-distributed count data is of particular interest. Several popular algorithms use local search methods to approximate the maximum likelihood estimator (MLE) of the Poisson CPD model. Here, this work presents two new algorithms that extend state-of-the-art local methods for Poisson CPD. Hybrid GCP-CPAPR combines Generalized Canonical Decomposition (GCP) with stochastic optimization and CP Alternating Poisson Regression (CPAPR), a deterministic algorithm, to increase the probability of converging to the MLE over either method used alone. Restarted CPAPR with SVDrop uses a heuristic based on the singular values of the CPD model unfoldings to identify convergence toward optimizers that are not the MLE and restarts within the feasible domain of the optimization problem, thus reducing overall computational cost when using a multi-start strategy. We provide empirical evidence that indicates our approaches outperform existing methods with respect to converging to the Poisson CPD MLE.

CPAPR↗

DOE OSTI2026

Spatial Correlations of the Poisson Model for Radiation Transport

Characterizing the relationship between bulk physical properties and mixing in randomly heterogeneous media is a central challenge across many areas of science and engineering. A benchmark model for such studies is the Poisson model, a random tessellation of space by a Poisson process of hyperplanes. In radiation transport studies, the lack of exact expressions for the Poisson model’s spatial multipoint functions has led to approximate methods being used, introducing unquantified sources of error. Here, we recently introduced an exact solution for the Poisson model’s multipoint functions and closely related conditional probability functions (CPFs), providing a new opportunity to understand and reduce these sources of error. In this paper, we enable a more rigorous investigation of radiation transport in stochastic media by applying the recently introduced exact solution for the Poisson model’s CPFs. This paper consists of three main contributions. First, we introduce a unified framework for CPFs of the Poisson model, encompassing the recently introduced exact CPFs as well as the previously introduced atomic mix, nearest-neighbor, and combination CPFs. This framework also includes existing pruning techniques for the approximate CPFs, such as angular exclusion, as well as a novel form of angular exclusion suitable for the exact CPFs. Second, we use the exact CPFs to characterize the spatial regions where each approximate three-point CPF is most accurate, thereby explaining the observed hierarchy of accuracy among the approximate models. Finally, we evaluate material transmittance, reflectance, and flux in a three-dimensional test problem using conditional point sampling, demonstrating the relationship between CPF accuracy and transport simulation accuracy.

Poisson model↗

NASA NTRS1993

A robust multilevel simultaneous eigenvalue solver

Multilevel (ML) algorithms for eigenvalue problems are often faced with several types of difficulties such as: the mixing of approximated eigenvectors by the solution process, the approximation of incomplete clusters of eigenvectors, the poor representation of solution on coarse levels, and the existence of close or equal eigenvalues. Algorithms that do not treat appropriately these difficulties usually fail, or their performance degrades when facing them. These issues motivated the development of a robust adaptive ML algorithm which treats these difficulties, for the calculation of a few eigenvectors and their corresponding eigenvalues. The main techniques used in the new algorithm include: the adaptive completion and separation of the relevant clusters on different levels, the simultaneous treatment of solutions within each cluster, and the robustness tests which monitor the algorithm's efficiency and convergence. The eigenvectors' separation efficiency is based on a new ML projection technique generalizing the Rayleigh Ritz projection, combined with a technique, the backrotations. These separation techniques, when combined with an FMG formulation, in many cases lead to algorithms of O(qN) complexity, for q eigenvectors of size N on the finest level. Previously developed ML algorithms are less focused on the mentioned difficulties. Moreover, algorithms which employ fine level separation techniques are of O(q(sub 2)N) complexity and usually do not overcome all these difficulties. Computational examples are presented where Schrodinger type eigenvalue problems in 2-D and 3-D, having equal and closely clustered eigenvalues, are solved with the efficiency of the Poisson multigrid solver. A second order approximation is obtained in O(qN) work, where the total computational work is equivalent to only a few fine level relaxations per eigenvector.

Costiner, Sorin↗

DOE OSTI2022

Constraints from isoscaling on the source size in energetic heavy ion collisions

In the framework of the statistical multifragmentation model, the nuclear isoscaling analysis is extended to constrain the ratio between the sizes of the decaying sources formed in a collision between two heavy ions. It is found that the ratio between the probabilities of observing n fragments in each event, for each of the sources, follows a scaling law, similar to the traditional nuclear isoscaling. However, the corresponding slope is sensitive to the source sizes. This property is explained analytically using the grand-canonical ensemble. Furthermore, the extent to which our findings are affected by finite size effects and by the deexcitation of the hot primary fragments is investigated. The scaling turns out to be robust and weakly affected by effects implied by these two aspects. We also find that the Poisson distribution is a fairly good approximation to the above mentioned probabilities, associated with both the primordial fragments, produced at the breakup stage, and the final ones, found at the end of the fragment deexcitation process.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

NASA NTRS1988

Increased effective barrier heights in Schottky diodes by molecular-beam epitaxy of CoSi2 and Ga-doped Si on Si(111)

Increasing the effective Schottky-barrier height of epitaxial CoSi2/Si(111) diodes by the use of thin, highly doped Si layers in close proximity to the metal-semiconductor interface has been studied. Intrinsic Si, Si doped by coevaporation of Ga, and epitaxial CoSi2 layers have all been grown in the same molecular-beam epitaxy system. Current-voltage and photoresponse characterization yield barrier heights ranging from 0.61 eV for a sample with no p(+) layer to 0.89 eV for a sample with a 20-nm-thick p(+) layer. These results are compared to theoretical values based on a one-dimensional solution of Poisson's equation under the depletion approximation.

Fathauer, R. W.↗

DOE OSTI2022

Accelerated steady-state electrostatic particle-in-cell simulation of Langmuir probes

First-principles particle-in-cell (PIC) simulation is a powerful tool for understanding plasma behavior, but this power often comes at great computational expense. Artificially reducing the ion/electron mass ratio is a time-honored practice to reduce simulation costs. Usually, this is a severe approximation. However, for steady-state collisionless, electrostatic (Vlasov–Poisson) systems, the solution with reduced mass ratio can be scaled to the solution for the real mass ratio, with no approximation. This “scaled mass” method, which works with already-existing PIC codes, can reduce the computation time for a large class of electrostatic PIC simulations by the square root of the mass ratio. The particle distributions of the resulting steady state must be trivially rescaled to yield the true distributions, but the self-consistent electrostatic field is independent of the mass ratio. This method is equivalent to “numerical timestepping,” an approach that evolves electron and ion populations with different time steps. Numerical timestepping can be viewed as a special case of the speed-limited PIC (SLPIC) method, which is not restricted to steady-state phenomena. Although the scaled-mass approach is simplest, numerical timestepping and SLPIC more easily generalize to include other effects, such as collisions. The equivalence of these new approaches is demonstrated by applying them to simulate a cylindrical Langmuir probe in electron–argon plasma, speeding up simulation by two orders of magnitude. Methods such as SLPIC can therefore play an invaluable role in interpreting probe measurements by including geometric effects, collisions, secondary emission, and non-Maxwellian distributions.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

NASA NTRS1990

A Poisson equation formulation for pressure calculations in penalty finite element models for viscous incompressible flows

The calculation of pressures when the penalty-function approximation is used in finite-element solutions of laminar incompressible flows is addressed. A Poisson equation for the pressure is formulated that involves third derivatives of the velocity field. The second derivatives appearing in the weak formulation of the Poisson equation are calculated from the C0 velocity approximation using a least-squares method. The present scheme is shown to be efficient, free of spurious oscillations, and accurate. Examples of applications are given and compared with results obtained using mixed formulations.

Sohn, J. L.↗

DOE OSTI2022

Zero-Truncated Poisson Tensor Decomposition for Sparse Count Data

We propose a novel statistical inference paradigm for zero-inflated multiway count data that dispenses with the need to distinguish between true and false zero counts. Our approach ignores all zero entries and applies zero-truncated Poisson regression on the positive counts. Inference is accomplished via tensor completion that imposes low-rank structure on the Poisson parameter space. Our main result shows that an $\textit{N}$-way rank-R parametric tensor 𝓜 ϵ (0, ∞) $I$Χ∙∙∙Χ$I$ generating Poisson observations can be accurately estimated from approximately $IR^2 \text{log}^2_2(I)$ non-zero counts for a nonnegative canonical polyadic decomposition. Several numerical experiments are presented demonstrating that our zero-truncated paradigm is comparable to the ideal scenario where the locations of false zero counts are known $\textit{a priori}$.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2023

Dimension Reduction and Redundancy Removal through Successive Schmidt Decompositions

Quantum computers are believed to have the ability to process huge data sizes, which can be seen in machine learning applications. In these applications, the data, in general, are classical. Therefore, to process them on a quantum computer, there is a need for efficient methods that can be used to map classical data on quantum states in a concise manner. On the other hand, to verify the results of quantum computers and study quantum algorithms, we need to be able to approximate quantum operations into forms that are easier to simulate on classical computers with some errors. Motivated by these needs, in this paper, we study the approximation of matrices and vectors by using their tensor products obtained through successive Schmidt decompositions. We show that data with distributions such as uniform, Poisson, exponential, or similar to these distributions can be approximated by using only a few terms, which can be easily mapped onto quantum circuits. The examples include random data with different distributions, the Gram matrices of iris flower, handwritten digits, 20newsgroup, and labeled faces in the wild. Similarly, some quantum operations, such as quantum Fourier transform and variational quantum circuits with a small depth, may also be approximated with a few terms that are easier to simulate on classical computers. Furthermore, we show how the method can be used to simplify quantum Hamiltonians: In particular, we show the application to randomly generated transverse field Ising model Hamiltonians. The reduced Hamiltonians can be mapped into quantum circuits easily and, therefore, can be simulated more efficiently.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2024

Modifying the Asynchronous Jacobi Method for Data Corruption Resilience

Moving scientific computation from high-performance computing (HPC) and cloud computing (CC) environments to devices on the edge, i.e., physically near instruments of interest, has received tremendous interest in recent years. Such edge computing environments can operate on data in situ, offering enticing benefits over data aggregation to HPC and CC facilities that include avoiding costs of transmission, increased data privacy, and real-time data analysis. Because of the inherent unreliability of edge computing environments, new fault-tolerant approaches must be developed before the benefits of edge computing can be realized. Motivated by algorithm-based fault tolerance, a variant of the asynchronous Jacobi (ASJ) method is developed that achieves resilience to data corruption by rejecting solution approximations from neighbor devices according to a bound derived from convergence theory. Numerical results on a two-dimensional Poisson problem show that the new rejection criterion, along with a novel approximation to the shortest path length on which the criterion depends, restores convergence for the ASJ variant in the presence of certain types data corruption. Numerical results are obtained for when the singular values in the analytic bound are approximated. Additional linear systems are also explored, one with a more dense sparsity pattern and one that includes advection. All results indicate that successful resilience to data corruption depends on whether the bound tightens fast enough to reject corrupted data before the iteration evolution deviates significantly from that predicted by the convergence theory defining the bound. This observation generalizes to future work on algorithm-based fault tolerance for other asynchronous algorithms, including upcoming approaches that leverage Krylov subspaces.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2021

Conservative numerical schemes with optimal dispersive wave relations: Part I. Derivation and analysis

An energy-conserving and an energy-and-enstrophy conserving numerical schemes are derived by approximating the Hamiltonian formulation of the inviscid shallow water flows based on the vorticity-divergence variables. These schemes also conserve the first-order moments such as mass and vorticity, as usual. The conservative properties of the schemes stem from the skew-symmetry and singularities of the Poisson brackets, which are carefully retained in the discrete approximations. Here, the schemes operate on unstructured orthogonal dual meshes, over bounded or unbounded domains, and they are also shown to possess the same optimal dispersive wave relations as those of the Z-grid scheme, which is a consequence of the use of the vorticity and divergence variables.

54 ENVIRONMENTAL SCIENCES↗

DOE OSTI2021

Photon-Sparse, Poisson Light-Sheet Microscopy

Light-sheet microscopy has revolutionized bioimaging by enabling approximately an order of magnitude reduction in specimen irradiance compared to confocal imaging. Here, we introduce a light-sheet imaging system that enables an additional order of magnitude reduction in specimen irradiance by operating at the Poisson limit. To operate at this limit, we integrated classical illumination with single-photon detection and wavelet-based image reconstruction. This integration enabled brightness quantification and object recognition from fewer than one detected photon per image pixel, corresponding to more than 10-fold lower irradiance levels than modern systems. We demonstrate how such photon-sparse imaging can eradicate photobleaching and enable both dim and bright object imaging, thus, further enhancing the related gains of light-sheet microscopy.

60 APPLIED LIFE SCIENCES↗

DOE OSTI2023

Tensor Decompositions for Count Data that Leverage Stochastic and Deterministic Optimization

There is growing interest to extend low-rank matrix decompositions to multi-way arrays, or tensors. One fundamental low-rank tensor decomposition is the canonical polyadic decomposition (CPD). The challenge of fitting a low-rank, nonnegative CPD model to Poisson-distributed count data is of particular interest. Several popular algorithms use local search methods to approximate the global maximum likelihood estimator from local minima. Simultaneously, a recent trend in theoretical computer science and numerical linear algebra leverages randomization to solve very large, hard problems. The typical approach is to use randomization for a fast approximation and determinism for refinement to yield effective algorithms with theoretical guarantees. Two popular algorithms for Poisson CPD reflect that emergent dichotomy: CP Alternating Poisson Regression is a deterministic algorithm and Generalized Canonical Polyadic decomposition makes use of stochastic algorithms in several variants. This work extends recent work to develop two new methods that leverage randomized and deterministic algorithms for improved accuracy and performance.

97 MATHEMATICS AND COMPUTING↗

NASA NTRS2014

Applying Flammability Limit Probabilities and the Normoxic Upward Limiting Pressure Concept to NASA STD-6001 Test 1

Repeated Test 1 extinction tests near the upward flammability limit are expected to follow a Poisson process trend. This Poisson process trend suggests that rather than define a ULOI and MOC (which requires two limits to be determined), it might be better to define a single upward limit as being where 1/e (where e (approx. equal to 2.7183) is the characteristic time of the normalized Poisson process) of the materials burn, or, rounding, where approximately 1/3 of the samples fail the test (and burn). Recognizing that spacecraft atmospheres will not bound the entire oxygen-pressure parameter space, but actually lie along the normoxic atmosphere control band, we can focus the materials flammability testing along this normoxic band. A Normoxic Upward Limiting Pressure (NULP) is defined that determines the minimum safe total pressure for a material within the constant partial pressure control band. Then, increasing this pressure limit by a factor of safety, we can define the material as being safe to use at the NULP + SF (where SF is on the order of 10 kilopascal, based on existing flammability data). It is recommended that the thickest material to be tested with the current Test 1 igniter should be 3 mm thick (1/8 inches) to avoid the problem of differentiating between an ignition limit and a true flammability limit.

flammability↗