Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “algebraic approach”

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 415 records · Page 23
All sourcesNASA NTRSDOE OSTI
NASA NTRS2007

Slip Validation and Prediction for Mars Exploration Rovers

This paper presents a novel technique to validate and predict the rover slips on Martian surface for NASA's Mars Exploration Rovers. Different from the traditional approach, the proposed method uses the actual velocity profile of the wheels and the digital elevation map (DEM) from the stereo images of the terrain to formulate simplified equations of motion of the rovers. A weighted factor to the wheel-ground speed from the empirical data comprises the velocity equations of the simplified differential-algebraic system of the rover motion. Applying the discretization operator to these equations, the full kinematics state of the rover is then resolved by the configuration kinematics solution in the Robot Sequencing and Visualization Program (RSVP). This method produced accurate simulation of the rover movements compared with these of the earth testing vehicle. Using the telemetry from the onboard Visual Odometry, the simulated rover path also compares well with the actual track of the vehicle. Preliminary results indicated that the proposed computational method is very effective in planning the path of the rovers on the high-slope areas.

Mars Rovers↗
DOE OSTI2022

OpenMP Target Task: Tasking and Target Offloading on Heterogeneous Systems

This work evaluated the use of OpenMP tasking with target GPU offloading as a potential solution for programming productivity and performance on heterogeneous systems. Also, it is proposed a new OpenMP specification to make the implementation of heterogeneous codes simpler by using OpenMP target task, which integrates both OpenMP tasking and target GPU offloading in a single OpenMP pragma. As a test case, the authors used one of the most popular and widely used Basic Linear Algebra Subprogram Level-3 routines: triangular solver (TRSM). To benefit from the heterogeneity of the current high-performance computing systems, the authors propose a different parallelization of the algorithm by using a nonuniform decomposition of the problem. This work used target GPU offloading inside OpenMP tasks to address the heterogeneity found in the hardware. This new approach can outperform the state-of-the-art algorithms, which use a uniform decomposition of the data, on both the CPU-only and hybrid CPU-GPU systems, reaching speedups of up to one order of magnitude. The performance that this approach achieves is faster than the IBM ESSL math library on CPU and competitive relative to a highly optimized heterogeneous CUDA version. One node of Oak Ridge National Laboratory’s supercomputer, Summit, was used for performance analysis.

Valero Lara, Pedro↗
DOE OSTI2024

Fast explicit solutions for neutrino-electron scattering: Explicit asymptotic methods

Here, we present results of explicit asymptotic approximations applied to neutrino-electron scattering in a representative model of neutrino population evolution under conditions characteristic of core-collapse supernova explosions or binary neutron star mergers. It is shown that this approach provides stable solutions of these stiff systems of equations, with accuracy and time stepping comparable to that for standard implicit treatments such as backward Euler, fixed point iteration, and Anderson-accelerated fixed point iteration. Because each time step can be computed more rapidly with the explicit asymptotic approximation than with implicit methods, this suggests that algebraically stabilized explicit integration methods could be used to compute neutrino evolution coupled to hydrodynamics more efficiently in stellar explosions and mergers than the methods currently in use.

79 ASTRONOMY AND ASTROPHYSICS↗
NASA NTRS1991

Development of iterative techniques for the solution of unsteady compressible viscous flows

Efficient iterative solution methods are being developed for the numerical solution of two- and three-dimensional compressible Navier-Stokes equations. Iterative time marching methods have several advantages over classical multi-step explicit time marching schemes, and non-iterative implicit time marching schemes. Iterative schemes have better stability characteristics than non-iterative explicit and implicit schemes. Thus, the extra work required by iterative schemes can also be designed to perform efficiently on current and future generation scalable, missively parallel machines. An obvious candidate for iteratively solving the system of coupled nonlinear algebraic equations arising in CFD applications is the Newton method. Newton's method was implemented in existing finite difference and finite volume methods. Depending on the complexity of the problem, the number of Newton iterations needed per step to solve the discretized system of equations can, however, vary dramatically from a few to several hundred. Another popular approach based on the classical conjugate gradient method, known as the GMRES (Generalized Minimum Residual) algorithm is investigated. The GMRES algorithm was used in the past by a number of researchers for solving steady viscous and inviscid flow problems with considerable success. Here, the suitability of this algorithm is investigated for solving the system of nonlinear equations that arise in unsteady Navier-Stokes solvers at each time step. Unlike the Newton method which attempts to drive the error in the solution at each and every node down to zero, the GMRES algorithm only seeks to minimize the L2 norm of the error. In the GMRES algorithm the changes in the flow properties from one time step to the next are assumed to be the sum of a set of orthogonal vectors. By choosing the number of vectors to a reasonably small value N (between 5 and 20) the work required for advancing the solution from one time step to the next may be kept to (N+1) times that of a noniterative scheme. Many of the operations required by the GMRES algorithm such as matrix-vector multiplies, matrix additions and subtractions can all be vectorized and parallelized efficiently.

Sankar, Lakshmi N.↗
NASA NTRS1990

Recursive dynamics for flexible multibody systems using spatial operators

Due to their structural flexibility, spacecraft and space manipulators are multibody systems with complex dynamics and possess a large number of degrees of freedom. Here the spatial operator algebra methodology is used to develop a new dynamics formulation and spatially recursive algorithms for such flexible multibody systems. A key feature of the formulation is that the operator description of the flexible system dynamics is identical in form to the corresponding operator description of the dynamics of rigid multibody systems. A significant advantage of this unifying approach is that it allows ideas and techniques for rigid multibody systems to be easily applied to flexible multibody systems. The algorithms use standard finite-element and assumed modes models for the individual body deformation. A Newton-Euler Operator Factorization of the mass matrix of the multibody system is first developed. It forms the basis for recursive algorithms such as for the inverse dynamics, the computation of the mass matrix, and the composite body forward dynamics for the system. Subsequently, an alternative Innovations Operator Factorization of the mass matrix, each of whose factors is invertible, is developed. It leads to an operator expression for the inverse of the mass matrix, and forms the basis for the recursive articulated body forward dynamics algorithm for the flexible multibody system. For simplicity, most of the development here focuses on serial chain multibody systems. However, extensions of the algorithms to general topology flexible multibody systems are described. While the computational cost of the algorithms depends on factors such as the topology and the amount of flexibility in the multibody system, in general, it appears that in contrast to the rigid multibody case, the articulated body forward dynamics algorithm is the more efficient algorithm for flexible multibody systems containing even a small number of flexible bodies. The variety of algorithms described here permits a user to choose the algorithm which is optimal for the multibody system at hand. The availability of a number of algorithms is even more important for real-time applications, where implementation on parallel processors or custom computing hardware is often necessary to maximize speed.

Jain, A.↗
NASA NTRS1992

A Regression Method for Comparing Launch Zone Ranges Derived From Different Sources

In modern fighter aircraft air-to-air missile launch acceptable ranges (LARs) are provided to the pilot for his launch decision. These LARs are calculated in the avionic software, using very simple algebraic equations and algorithms, that attempt to model complex missile behavior. Frequently these algorithms are revised to reflect inaccuracies discovered, when comparisons are made with missile six degree-of-freedom (6-DOF) simulations. The process of modifying this software has become expensive. In the past, these simple LAR generators were modified based only on subjective judgmental approach, with little regard to the missile range design limits. With reduced budgets a more rational methodology should be taken to assess whether or not simple fighter LAR generators need to be modified. Any LAR generator can produce large amounts of range (minimum and maximum) data over the board engagement limits of modem fighter and air-to-air missiles. This infinite population lends itself to some statistical methodology to access simple LAR accuracy and the need for software modification. The methodology should produce statistical parameters for use in the decision making process of modifying a simple fighter LAR generator. This paper presents a regression method, based on a missile range design limit philosophy. Acceptance criteria from the regression method are given that provide simple statistical parameters to aid in this decision making process.

Flight Testing↗
DOE OSTI2026

GP Cosmology Surrogate v1.0

GP Cosmology Surrogate is a Python library for building and training a generalized multi-output Gaussian process (GP) framework of @takhtaganov2021cosmic. In this approach, the surrogate is constructed sequentially, guided by a Bayesian optimization acquisition function that targets reduction of emulation error in the regions most consistent with the observational data. This adaptive design concentrates computational resources where they have the greatest impact on inference accuracy. The library supports efficient training for separable GP kernels, which allows the use of Kronecker algebra to handle high-dimensional input spaces and large numbers of correlated outputs. This makes it well suited for applications such as modeling cosmological power spectra, large-scale physical simulations, and multi-output hyperparameter tuning. By combining scalable multi-output GP modeling with data-driven adaptive sampling, GPsurrogate enables parameter inference and optimization with substantially fewer simulations than conventional space-filling designs.

Lukic, Zarija [Lawrence Berkeley National Laborato↗
NASA NTRS2014

Bifurcation Analysis Using Rigorous Branch and Bound Methods

For the study of nonlinear dynamic systems, it is important to locate the equilibria and bifurcations occurring within a specified computational domain. This paper proposes a new approach for solving these problems and compares it to the numerical continuation method. The new approach is based upon branch and bound and utilizes rigorous enclosure techniques to yield outer bounding sets of both the equilibrium and local bifurcation manifolds. These sets, which comprise the union of hyper-rectangles, can be made to be as tight as desired. Sufficient conditions for the existence of equilibrium and bifurcation points taking the form of algebraic inequality constraints in the state-parameter space are used to calculate their enclosures directly. The enclosures for the bifurcation sets can be computed independently of the equilibrium manifold, and are guaranteed to contain all solutions within the computational domain. A further advantage of this method is the ability to compute a near-maximally sized hyper-rectangle of high dimension centered at a fixed parameter-state point whose elements are guaranteed to exclude all bifurcation points. This hyper-rectangle, which requires a global description of the bifurcation manifold within the computational domain, cannot be obtained otherwise. A test case, based on the dynamics of a UAV subject to uncertain center of gravity location, is used to illustrate the efficacy of the method by comparing it with numerical continuation and to evaluate its computational complexity.

Smith, Andrew P.↗
NASA NTRS1987

A new approach for shaping of dual-reflector antennas

The shaping of 2-D dual-reflector antenna systems to generate a prescribed distribution with uniform phase at the aperture of the second reflector is examined. This method is based on the geometrical nature of Cassegrain and Gregorian dual-reflector antennas. The method of syntheses satisfies the principles of geometrical optics which are the foundations of dual-reflector designs. Instead of setting up differential equations or heuristically designing the subreflector, a set of algebraic equations is formulated and solved numerically to obtain the desired surfaces. The caustics of the reflected rays from the subreflector can be obtained and examined. Several examples of 2-D dual-reflector shaping are shown to validate the study. Geometrical optics and physical optics are used to calculate the scattered fields from the reflectors.

Lee, Teh-Hong↗
NASA NTRS1972

A finite element procedure for nonlinear prebuckling and initial postbuckling analysis

A procedure cast in a form appropriate to the finite element method is presented for geometrically nonlinear prebuckling and postbuckling structural analysis, including the identification of snap-through type of buckling. The principal features of this procedure are the use of direct iteration for solution of the nonlinear algebraic equations in the prebuckling range, an interpolation scheme for determination of the initial bifurcation point, a perturbation method in definition of the load-displacement behavior through the postbuckling regime, and extrapolation in determination of the limit point for snap-through buckling. Three numerical examples are presented in illustration of the procedure and in comparison with alternative approaches.

Mau, S. T.↗
NASA NTRS1985

A first-order time-domain Green's function approach to supersonic unsteady flow

A time-domain Green's Function Method for unsteady supersonic potential flow around complex aircraft configurations is presented. The focus is on the supersonic range wherein the linear potential flow assumption is valid. The Green's function method is employed in order to convert the potential-flow differential equation into an integral one. This integral equation is then discretized, in space through standard finite-element technique, and in time through finite-difference, to yield a linear algebraic system of equations relating the unknown potential to its prescribed co-normalwash (boundary condition) on the surface of the aircraft. The arbitrary complex aircraft configuration is discretized into hyperboloidal (twisted quadrilateral) panels. The potential and co-normalwash are assumed to vary linearly within each panel. Consistent with the spatial linear (first-order) finite-element approximations, the potential and co-normalwash are assumed to vary linearly in time. The long range goal of our research is to develop a comprehensive theory for unsteady supersonic potential aerodynamics which is capable of yielding accurate results even in the low supersonic (i.e., high transonic) range.

Freedman, M. I.↗
NASA NTRS1992

A comparative study of turbulence models for overset grids

The implementation of two different types of turbulence models for a flow solver using the Chimera overset grid method is examined. Various turbulence model characteristics, such as length scale determination and transition modeling, are found to have a significant impact on the computed pressure distribution for a multielement airfoil case. No inherent problem is found with using either algebraic or one-equation turbulence models with an overset grid scheme, but simulation of turbulence for multiple-body or complex geometry flows is very difficult regardless of the gridding method. For complex geometry flowfields, modification of the Baldwin-Lomax turbulence model is necessary to select the appropriate length scale in wall-bounded regions. The overset grid approach presents no obstacle to use of a one- or two-equation turbulence model. Both Baldwin-Lomax and Baldwin-Barth models have problems providing accurate eddy viscosity levels for complex multiple-body flowfields such as those involving the Space Shuttle.

Renze, Kevin J.↗
NASA NTRS1993

On curve veering and flutter of rotating blades

The eigenvalues of rotating blades usually change with rotation speed according to the Stodola-Southwell criterion. Under certain circumstances, the loci of eigenvalues belonging to two distinct modes of vibration approach each other very closely, and it may appear as if the loci cross each other. However, our study indicates that the observable frequency loci of an undamped rotating blade do not cross, but must either repel each other (leading to 'curve veering'), or attract each other (leading to 'frequency coalescence'). Our results are reached by using standard arguments from algebraic geometry--the theory of algebraic curves and catastrophe theory. We conclude that it is important to resolve an apparent crossing of eigenvalue loci into either a frequency coalescence or a curve veering, because frequency coalescence is dangerous since it leads to flutter, whereas curve veering does not precipitate flutter and is, therefore, harmless with respect to elastic stability.

Afolabi, Dare↗
NASA NTRS1996

Elliptic Volume Grid Generation for Viscous CFD Parametric Design Studies

This paper presents a robust method for the generation of zonal volume grids of design parametrics for aerodynamic configurations. The process utilizes simple algebraic techniques with parametric splines coupled with elliptic volume grid generation to generate isolated zonal grids for changes in body configuration needed to perform parametric design studies. Speed of the algorithm is maximized through the algebraic methods and reduced number of grid points to be regenerated for each design parametric without sacrificing grid quality and continuity within the volume domain. The method is directly applicable to grid reusability, because it modifies existing ow adapted volume grids and enables the user to restart the CFD solution process with an established flow field. Use of this zonal approach reduces computer usage time to create new volume grids for design parametric studies by an order of magnitude, as compared to current methods which require the regeneration of an entire volume grid. A sample configuration of a proposed Single Stage-to-Orbit Vehicle is used to illustrate an application of this method.

Alter, Stephen J.↗
NASA NTRS2013

Shape and Stress Sensing of Multilayered Composite and Sandwich Structures Using an Inverse Finite Element Method

The marked increase in the use of composite and sandwich material systems in aerospace, civil, and marine structures leads to the need for integrated Structural Health Management systems. A key capability to enable such systems is the real-time reconstruction of structural deformations, stresses, and failure criteria that are inferred from in-situ, discrete-location strain measurements. This technology is commonly referred to as shape- and stress-sensing. Presented herein is a computationally efficient shape- and stress-sensing methodology that is ideally suited for applications to laminated composite and sandwich structures. The new approach employs the inverse Finite Element Method (iFEM) as a general framework and the Refined Zigzag Theory (RZT) as the underlying plate theory. A three-node inverse plate finite element is formulated. The element formulation enables robust and efficient modeling of plate structures instrumented with strain sensors that have arbitrary positions. The methodology leads to a set of linear algebraic equations that are solved efficiently for the unknown nodal displacements. These displacements are then used at the finite element level to compute full-field strains, stresses, and failure criteria that are in turn used to assess structural integrity. Numerical results for multilayered, highly heterogeneous laminates demonstrate the unique capability of this new formulation for shape- and stress-sensing.

Cerracchio, Priscilla↗
DOE OSTI2020

Fast Computational Algorithms for Partial Differential Equations and Uncertainty Quantifications

This project concerned the construction, testing and analysis of computational algorithms for solving parameterized and stochastic partial differential equations. The study and understanding of equations of this type is of fundamental importance in numerous engineering and scientific applications. Examples include simulation of plasma dynamics in models of electric propulsion and nuclear fusion, simulation of multiphase flows, such as the flow of water, gas and oil in reservoirs, and structural analysis of the dependence of structures on materials. Parametrization is used in such settings when properties of the models such as viscosity of fluids or electric resistivity of materials are not precisely understood and instead are treated as random variables. The resulting solutions are themselves random, and having such solutions will enable engineers to use probabilistic methods to assess the likelihood of events, for example, whether a pollutant in a liquid will exceed a limit, and to use such analyses to develop ways to ensure positive outcomes. Construction of accurate (high resolution) computational solutions is expensive, requiring significant computer time and computational resources, and there is need to reduce computational cost to make simulation useful and effective. The aim of the project was to construct algorithms to efficiently compute surrogate solutions to parameterized problems to allow for efficient and accurate simulation. The technical approach used focused on two related strategies, based on rank-reduction methods and reduced-order models. These methods construct surrogate solutions of parameter-dependent models by projection or interpolation into low-dimensional approximation spaces. Cost savings are achieved if the low-dimensional spaces can be identified and constructed efficiently and if the resulting low-dimensional algebraic systems can be solved cheaply. Accomplishments include: Theoretical and empirical demonstration of the effectiveness of fast multigrid solution strategies for computing low-rank representations of parameter-dependent solutions to discrete partial differential equations, including the first proof establishing so-called textbook convergence properties for low-rank methods. Development of efficient solution algorithms for solving nonlinear parameter-dependent partial differential equations used in models of fluid dynamics. Developent of efficient algorithms for low-rank representation of solutions of time-dependent simulations of fluid dynamics using multi-dimensional tensor representations of solutions.

97 MATHEMATICS AND COMPUTING↗
NASA NTRS1976

New convergence criteria for the vortex-lattice models of the leading-edge separation

The convergence criterion for the vortex-lattice technique which deals with delta wings exhibiting significant leading-edge separation was studied. It was shown that one can predict pressure distributions without irregularities which agree fairly well with experimental data (which show some irregularities of their own) by replacing the system of discrete vortex lines with a single concentrated core. This core has a circulation equal to the algebraic sum of the circulations around the discrete lines and is located at the centroid of these lines. Moreover, there is a requirement that the position and strength of the core must converge as the number of elements increases. Because the calculation of the position and strength of the core is much less involved than the calculation of the loads, this approach has the additional desirable feature of requiring less computational time.

Kandil, O. A.↗
DOE OSTI2021

Decomposition of Feynman integrals by multivariate intersection numbers

We present a detailed description of the recent idea for a direct decomposition of Feynman integrals onto a basis of master integrals by projections, as well as a direct derivation of the differential equations satisfied by the master integrals, employing multivariate intersection numbers. We discuss a recursive algorithm for the computation of multivariate intersection numbers, and provide three different approaches for a direct decomposition of Feynman integrals, which we dub the straight decomposition, the bottom-up decomposition, and the top-down decomposition. These algorithms exploit the unitarity structure of Feynman integrals by computing intersection numbers supported on cuts, in various orders, thus showing the synthesis of the intersection-theory concepts with unitarity-based methods and integrand decomposition. We perform explicit computations to exemplify all of these approaches applied to Feynman integrals, paving a way towards potential applications to generic multi-loop integrals.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗