Search NASA⌕ Search

SEARCH · Search NASA

Results for “generalized algorithm”

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 361 records · Page 20

Recent developments of the NESSUS probabilistic structural analysis computer program

The NESSUS probabilistic structural analysis computer program combines state-of-the-art probabilistic algorithms with general purpose structural analysis methods to compute the probabilistic response and the reliability of engineering structures. Uncertainty in loading, material properties, geometry, boundary conditions and initial conditions can be simulated. The structural analysis methods include nonlinear finite element and boundary element methods. Several probabilistic algorithms are available such as the advanced mean value method and the adaptive importance sampling method. The scope of the code has recently been expanded to include probabilistic life and fatigue prediction of structures in terms of component and system reliability and risk analysis of structures considering cost of failure. The code is currently being extended to structural reliability considering progressive crack propagation. Several examples are presented to demonstrate the new capabilities.

Millwater, H.↗

Performance Analysis of SmallSat Aerocapture at Venus

Aerocapture is a method of spacecraft orbital insertion that has the potential to provide mass savings as compared to aerobraking. In particular, aerocapture at Venus is desirable due to high atmospheric density and potential for science return. While promising, accurate orbital insertion by means of aerocapture requires an active guidance, navigation, and control architecture. This paper documents the initial assessment of the performance of two guidance algorithms, a generalized numerical predictor corrector and the Fully-Numeric Predictor- corrector for Aerocapture Guidance, applied to smallsat aerocapture at Venus using two different simulation environments with equivalent simulation inputs. Nominal trajectory performance is assessed. In addition, Monte Carlo analysis is performed to compare each guidance algorithm’s performance under uncertainty.

aerocapture↗

Performance Analysis of SmallSat Aerocapture at Venus

Aerocapture is a method of spacecraft orbital insertion that has the potential to provide mass savings as compared to aerobraking. In particular, aerocapture at Venus is desirable due to high atmospheric density and potential for science return. While promising, accurate orbital insertion by means of aerocapture requires an active guidance, navigation, and control architecture. This paper documents the initial assessment of the performance of two guidance algorithms, a generalized numerical predictor corrector and the Fully-Numeric Predictor-corrector for Aerocapture Guidance, applied to smallsat aerocapture at Venus using two different simulation environments with equivalent simulation inputs. Nominal trajectory performance is assessed. In addition, Monte Carlo analysis is performed to compare each guidance algorithm’s performance under uncertainty.

aerocapture↗

Linear convergence of accelerated conditional gradient algorithms in spaces of measures

A class of generalized conditional gradient algorithms for the solution of optimization problem in spaces of Radon measures is presented. The method iteratively inserts additional Dirac-delta functions and optimizes the corresponding coefficients. Under general assumptions, a sub-linear [see formula in PDF] rate in the objective functional is obtained, which is sharp in most cases. To improve efficiency, one can fully resolve the finite-dimensional subproblems occurring in each iteration of the method. We provide an analysis for the resulting procedure: under a structural assumption on the optimal solution, a linear [see formula in PDF] convergence rate is obtained locally.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

Physical formulation and numerical algorithm for simulating N immiscible incompressible fluids involving general order parameters

We present a family of physical formulations, and a numerical algorithm, based on a class of general order parameters for simulating the motion of a mixture of N (N⩾2) immiscible incompressible fluids with given densities, dynamic viscosities, and pairwise surface tensions. The N-phase formulations stem from a phase field model we developed in a recent work based on the conservations of mass/momentum, and the second law of thermodynamics. The introduction of general order parameters leads to an extremely strongly-coupled system of (N−1) phase field equations. On the other hand, the general form enables one to compute the N-phase mixing energy density coefficients in an explicit fashion in terms of the pairwise surface tensions. We show that the increased complexity in the form of the phase field equations associated with general order parameters in actuality does not cause essential computational difficulties. Our numerical algorithm reformulates the (N−1) strongly-coupled phase field equations for general order parameters into 2(N−1) Helmholtz-type equations that are completely de-coupled from one another. This leads to a computational complexity comparable to that for the simplified phase field equations associated with certain special choice of the order parameters. We demonstrate the capabilities of the method developed herein using several test problems involving multiple fluid phases and large contrasts in densities and viscosities among the multitude of fluids. In particular, by comparing simulation results with the Langmuir–de Gennes theory of floating liquid lenses we show that the method using general order parameters produces physically accurate results for multiple fluid phases.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Rapid calculation of radiative heating rates and photodissociation rates in inhomogeneous multiple scattering atmospheres

The solution of the generalized two-stream approximation for radiative transfer in homogeneous multiple scattering atmospheres is extended to vertically inhomogeneous atmospheres in a manner which is numerically stable and computationally efficient. It is shown that solar energy deposition rates, photolysis rates, and infrared cooling rates all may be calculated with the simple modifications of a single algorithm. The accuracy of the algorithm is generally better than 10 percent, so that other uncertainties, such as in absorption coefficients, may often dominate the error in calculation of the quantities of interest to atmospheric studies.

Toon, Owen B.↗

Two novel automatic frequency tracking loops

Two automatic-frequency-control (AFC) loops are introduced and analyzed in detail. The algorithms are generalizations of the well known cross-product AFC loop with improved performance. The first estimator uses running overlapping discrete Fourier transforms to create a discriminator curve proportional to the frequency estimation error, whereas the second one preprocesses the received data and then uses an extended Kalman filter to estimate the input frequency. The algorithms are tested by computer simulations in a highly dynamic environment at low carrier/noise ratio (CNR). The algorithms are suboptimum tracking schemes with a larger frequency-error variance compared to an optimum strategy, but they offer simplicity of mechanization and a CNR with a very low operating threshold.

Aguirre, Sergio↗

A quantum eigenvalue solver based on tensor networks

Electronic ground states are of central importance in chemical simulations, but have remained beyond the reach of efficient classical algorithms except in cases of weak electron correlation or one-dimensional spatial geometry. We introduce a hybrid quantum-classical eigenvalue solver that constructs a wavefunction ansatz from a linear combination of matrix product states in rotated orbital bases, enabling the characterization of strongly correlated ground states with arbitrary spatial geometry. The energy is converged via a gradient-free generalized sweep algorithm based on quantum subspace diagonalization, with a potentially exponential speedup in the off-diagonal matrix element contractions upon translation into compact quantum circuits of linear depth in the number of qubits. Chemical accuracy is attained in numerical experiments for both a stretched water molecule and an octahedral arrangement of hydrogen atoms, achieving substantially better correlation energies compared to a unitary coupled-cluster benchmark, with orders of magnitude reductions in quantum resource estimates and a surprisingly high tolerance to shot noise. This proof-of-concept study suggests a promising new avenue for scaling up simulations of strongly correlated chemical systems on near-term quantum hardware.

chemistry↗

Distributed-memory Parallel Algorithms for Matching and Coloring

Graph matching and coloring constitute two fundamental classes of combinatorial problems having numerous established as well as emerging applications in computational science and engineering, high-performance computing, and informatics. We provide a snapshot of an on-going work on the design and implementation of new highly-scalable distributed-memory parallel algorithms for two prototypical problems from these classes, edge-weighted matching and distance-1 vertex coloring. Graph algorithms in general have low concurrency and poor data locality, making it challenging to achieve scalability on massively parallel machines. We overcome this challenge by employing a variety of techniques, including approximation, speculation and iteration, optimized communication, and randomization, in concert. We present preliminary results on weak and strong scalability studies conducted on an IBM Blue Gene/P machine employing up to tens of thousands of processors. The results show that the algorithms hold strong potential for computing at petascale.

Combinatorial scientific computing↗

Stochastic Filtering of Rain Profiles Using Radar, Surface-Referenced Radar, or Combined Radar-Radiometer Measurements

This paper describes a computationally efficient nearly optimal Bayesian algorithm to estimate rain (and drop size distribution) profiles, given a radar reflectivity profile at a single attenuating wavelength. In addition to estimating the averages of all the mutually ambiguous combinations of rain parameters that can produce the data observed, the approach also calculates the n-ns uncertainty in its estimates (this uncertainty thus quantifies "the amount of ambiguity" in the "solution"). The paper also describes a more general approach that can make estimates based on a radar reflectivity profile together with an approximate measurement of the path-integrated attenuation, or a radar reflectivity profile and a set of passive microwave brightness temperatures. This more general "combined" algorithm is currently being adapted for the Tropical Rainfall Measuring Mission.

Haddad, Ziad S.↗

A generalized 2D pencil beam scaling algorithm for proton dose calculation in heterogeneous slab geometries

Purpose: Pencil beam algorithms are commonly used for proton therapy dose calculations. Szymanowski and Oelfke ['Two-dimensional pencil beam scaling: An improved proton dose algorithm for heterogeneous media,' Phys. Med. Biol. 47, 3313-3330 (2002)] developed a two-dimensional (2D) scaling algorithm which accurately models the radial pencil beam width as a function of depth in heterogeneous slab geometries using a scaled expression for the radial kernel width in water as a function of depth and kinetic energy. However, an assumption made in the derivation of the technique limits its range of validity to cases where the input expression for the radial kernel width in water is derived from a local scattering power model. The goal of this work is to derive a generalized form of 2D pencil beam scaling that is independent of the scattering power model and appropriate for use with any expression for the radial kernel width in water as a function of depth. Methods: Using Fermi-Eyges transport theory, the authors derive an expression for the radial pencil beam width in heterogeneous slab geometries which is independent of the proton scattering power and related quantities. The authors then perform test calculations in homogeneous and heterogeneous slab phantoms using both the original 2D scaling model and the new model with expressions for the radial kernel width in water computed from both local and nonlocal scattering power models, as well as a nonlocal parameterization of Moliere scattering theory. In addition to kernel width calculations, dose calculations are also performed for a narrow Gaussian proton beam. Results: Pencil beam width calculations indicate that both 2D scaling formalisms perform well when the radial kernel width in water is derived from a local scattering power model. Computing the radial kernel width from a nonlocal scattering model results in the local 2D scaling formula under-predicting the pencil beam width by as much as 1.4 mm (21%) at the depth of the Bragg peak for a 220 MeV proton beam in homogeneous water. This translates into a 32% dose discrepancy for a 5 mm Gaussian proton beam. Similar trends were observed for calculations made in heterogeneous slab phantoms where it was also noted that errors tend to increase with greater beam penetration. The generalized 2D scaling model performs well in all situations, with a maximum dose error of 0.3% at the Bragg peak in a heterogeneous phantom containing 3 cm of hard bone. Conclusions: The authors have derived a generalized form of 2D pencil beam scaling which is independent of the proton scattering power model and robust to the functional form of the radial kernel width in water used for the calculations. Sample calculations made with this model show excellent agreement with expected values in both homogeneous water and heterogeneous phantoms.

61 RADIATION PROTECTION AND DOSIMETRY↗

A fast algorithm for sparse matrix computations related to inversion

We have developed a fast algorithm for computing certain entries of the inverse of a sparse matrix. Such computations are critical to many applications, such as the calculation of non-equilibrium Green’s functions G{sup r} and G{sup <} for nano-devices. The FIND (Fast Inverse using Nested Dissection) algorithm is optimal in the big-O sense. However, in practice, FIND suffers from two problems due to the width-2 separators used by its partitioning scheme. One problem is the presence of a large constant factor in the computational cost of FIND. The other problem is that the partitioning scheme used by FIND is incompatible with most existing partitioning methods and libraries for nested dissection, which all use width-1 separators. Our new algorithm resolves these problems by thoroughly decomposing the computation process such that width-1 separators can be used, resulting in a significant speedup over FIND for realistic devices — up to twelve-fold in simulation. The new algorithm also has the added advantage that desired off-diagonal entries can be computed for free. Consequently, our algorithm is faster than the current state-of-the-art recursive methods for meshes of any size. Furthermore, the framework used in the analysis of our algorithm is the first attempt to explicitly apply the widely-used relationship between mesh nodes and matrix computations to the problem of multiple eliminations with reuse of intermediate results. This framework makes our algorithm easier to generalize, and also easier to compare against other methods related to elimination trees. Finally, our accuracy analysis shows that the algorithms that require back-substitution are subject to significant extra round-off errors, which become extremely large even for some well-conditioned matrices or matrices with only moderately large condition numbers. When compared to these back-substitution algorithms, our algorithm is generally a few orders of magnitude more accurate, and our produced round-off errors stay at a reasonable level.

97 MATHEMATICS AND COMPUTING↗

Examination of a Practical Aerobraking Guidance Algorithm

A practical real time guidance algorithm has been developed for aerobraking vehicles that minimizes the post-aeropass Delta V requirements for orbit insertion while nearly minimizing the maximum heating rate and the maximum structural loads. The algorithm is general in the sense that a minimum of assumptions is made, thus greatly reducing the number of parameters that must be determined prior to a given mission. An interesting feature is that in-plane guidance performance is tuned by adjusting one mission-dependent parameter, the bank margin; similarly, the out-of-plane guidance performance is tuned by adjusting a plane controller time constant. Other features of the algorithm are simplicity, efficiency, and ease of use. The algorithm is designed for, but not restricted to, a trimmed vehicle with bank angle modulation as the method of trajectory control. Performance of this guidance algorithm during flight in Earth's atmosphere is examined by its use in an aerobraking testbed program. The performance inquiry extends to a wide range of entry speeds covering a number of potential mission applications. Favorable results have been obtained with a minimum of development effort, and directions for improvement of performance are indicated.

Evans, Steven W.↗

The Caltech Concurrent Computation Program - Project description

The Caltech Concurrent Computation Program wwhich studies basic issues in computational science is described. The research builds on initial work where novel concurrent hardware, the necessary systems software to use it and twenty significant scientific implementations running on the initial 32, 64, and 128 node hypercube machines have been constructed. A major goal of the program will be to extend this work into new disciplines and more complex algorithms including general packages that decompose arbitrary problems in major application areas. New high-performance concurrent processors with up to 1024-nodes, over a gigabyte of memory and multigigaflop performance are being constructed. The implementations cover a wide range of problems in areas such as high energy and astrophysics, condensed matter, chemical reactions, plasma physics, applied mathematics, geophysics, simulation, CAD for VLSI, graphics and image processing. The products of the research program include the concurrent algorithms, hardware, systems software, and complete program implementations.

Fox, G.↗

Probabilistic Look-ahead Contingency Analysis Integration with Commercial Tool and Practical Data

This paper presents an initial effort of integrating a smart sampling-based probabilistic look-ahead contingency analysis algorithm with General Electric (GE) Grid Solutions’ commercial energy management system (EMS) tool as a proof-of-concept for a seamless research tool integration using real world large-scale grid data. With the increasing impact of random forces such as variable generation and load, their stochastic behaviors cannot be ignored. However, the current practices are still dominated by deterministic tools. They are becoming increasingly inadequate for the future grid. The developed look-ahead contingency analysis algorithm incorporates forecast errors of variable energy and load to address the challenges brought by the increasing uncertainty of power system. The algorithm can reveal the potential violations caused by the variance of variable energy and load that are not normally detected by traditional deterministic approaches. To test its performance under practical environments ( real data with real commercial tool), significant efforts have been made to prepare test cases, modify GE EMS tool, and adapt an extreme value distribution algorithm to analyze the GE EMS’s violation-only outputs. The test results clearly demonstrate the effectiveness of the developed algorithm as new transformer violations that were not previously detected have been identified. This performance provides better situational awareness to engineers for their decision-making process under uncertainty. Moreover, with the discussion of computational performance and future work, this paper has shown a clear path for integrating the probabilistic algorithm with commercial tools to make us better equipped for the changing power system.

Modeling and simulation of power systems, constrai↗

Universal framework for simultaneous tomography of quantum states and SPAM noise

We present a general denoising algorithm for performing simultaneous tomography of quantum states and measurement noise. This algorithm allows us to fully characterize state preparation and measurement (SPAM) errors present in any quantum system. Our method is based on the analysis of the properties of the linear operator space induced by unitary operations. Given any quantum system with a noisy measurement apparatus, our method can output the quantum state and the noise matrix of the detector up to a single gauge degree of freedom. We show that this gauge freedom is unavoidable in the general case, but this degeneracy can be generally broken using prior knowledge on the state or noise properties, thus fixing the gauge for several types of state-noise combinations with no assumptions about noise strength. Such combinations include pure quantum states with arbitrarily correlated errors, and arbitrary states with block independent errors. This framework can further use available prior information about the setting to systematically reduce the number of observations and measurements required for state and noise detection. Our method effectively generalizes existing approaches to the problem, and includes as special cases common settings considered in the literature requiring an uncorrelated or invertible noise matrix, or specific probe states.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

A parallel algorithm for the eigenvalues and eigenvectors for a general complex matrix

A new parallel Jacobi-like algorithm is developed for computing the eigenvalues of a general complex matrix. Most parallel methods for this parallel typically display only linear convergence. Sequential norm-reducing algorithms also exit and they display quadratic convergence in most cases. The new algorithm is a parallel form of the norm-reducing algorithm due to Eberlein. It is proven that the asymptotic convergence rate of this algorithm is quadratic. Numerical experiments are presented which demonstrate the quadratic convergence of the algorithm and certain situations where the convergence is slow are also identified. The algorithm promises to be very competitive on a variety of parallel architectures.

Shroff, Gautam↗

All-quad meshing without cleanup

Here, we present an all-quad meshing algorithm for general domains. We start with a strongly balanced quadtree. In contrast to snapping the quadtree corners onto the geometric domain boundaries, we move them away from the geometry. Then we intersect the moved grid with the geometry. The resulting polygons are converted into quads with midpoint subdivision. Moving away avoids creating any flat angles, either at a quadtree corner or at a geometry–quadtree intersection. We are able to handle two-sided domains, and more complex topologies than prior methods. The algorithm is provably correct and robust in practice. It is cleanup-free, meaning we have angle and edge length bounds without the use of any pillowing, swapping, or smoothing. Thus, our simple algorithm is fast and predictable. This paper has better quality bounds, and the algorithm is demonstrated over more complex domains, than our prior version.

97 MATHEMATICS AND COMPUTING↗