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 361 records · Page 20
All sourcesNASA NTRSDOE OSTI
NASA NTRS1971

Modulation of ring-laser mode coupling.

This paper develops an analytical, algebraic formalism that predicts effects induced in ring lasers by phase modulation, corresponding both to mode-decoupling mechanisms deliberately incorporated in the ring laser and to naturally occurring periodic or random angular or linear accelerations. The analysis is based on an approach that seems potentially convenient in the analysis of other systems that are physically stable but mathematically nonlinear.

Whitney, C.↗
NASA NTRS1994

Numerical solution of the two-dimensional time-dependent incompressible Euler equations

A numerical method is presented for solving the artificial compressibility form of the 2D time-dependent incompressible Euler equations. The approach is based on using an approximate Riemann solver for the cell face numerical flux of a finite volume discretization. Characteristic variable boundary conditions are developed and presented for all boundaries and in-flow out-flow situations. The system of algebraic equations is solved using the discretized Newton-relaxation (DNR) implicit method. Numerical results are presented for both steady and unsteady flow.

Whitfield, David L.↗
NASA NTRS1999

The Microgravity Isolation Mount: A Linearized State-Space Model a la Newton and Kane

Vibration acceleration levels on large space platforms exceed the requirements of many space experiments. The Microgravity Vibration Isolation Mount (MIM) was built by the Canadian Space Agency to attenuate these disturbances to acceptable levels, and has been operational on the Russian Space Station Mir since May 1996. It has demonstrated good isolation performance and has supported several materials science experiments. The MIM uses Lorentz (voice-coil) magnetic actuators to levitate and isolate payloads at the individual experiment/sub-experiment (versus rack) level. Payload acceleration, relative position, and relative orientation (Euler-parameter) measurements are fed to a state-space controller. The controller, in turn, determines the actuator currents needed for effective experiment isolation. This paper presents the development of an algebraic, state-space model of the MIM, in a form suitable for optimal controller design. The equations are first derived using Newton's Second Law directly; then a second derivation (i.e., validation) of the same equations is provided, using Kane's approach.

Hampton, R. David↗
NASA NTRS2004

Textbook Multigrid Efficiency for Leading Edge Stagnation

A multigrid solver is defined as having textbook multigrid efficiency (TME) if the solutions to the governing system of equations are attained in a computational work which is a small (less than 10) multiple of the operation count in evaluating the discrete residuals. TME in solving the incompressible inviscid fluid equations is demonstrated for leading- edge stagnation flows. The contributions of this paper include (1) a special formulation of the boundary conditions near stagnation allowing convergence of the Newton iterations on coarse grids, (2) the boundary relaxation technique to facilitate relaxation and residual restriction near the boundaries, (3) a modified relaxation scheme to prevent initial error amplification, and (4) new general analysis techniques for multigrid solvers. Convergence of algebraic errors below the level of discretization errors is attained by a full multigrid (FMG) solver with one full approximation scheme (F.4S) cycle per grid. Asymptotic convergence rates of the F.4S cycles for the full system of flow equations are very fast, approaching those for scalar elliptic equations.

Diskin, Boris↗
NASA NTRS2004

Textbook Multigrid Efficiency for Leading Edge Stagnation

A multigrid solver is defined as having textbook multigrid efficiency (TME) if the solutions to the governing system of equations are attained in a computational work which is a small (less than 10) multiple of the operation count in evaluating the discrete residuals. TME in solving the incompressible inviscid fluid equations is demonstrated for leading-edge stagnation flows. The contributions of this paper include (1) a special formulation of the boundary conditions near stagnation allowing convergence of the Newton iterations on coarse grids, (2) the boundary relaxation technique to facilitate relaxation and residual restriction near the boundaries, (3) a modified relaxation scheme to prevent initial error amplification, and (4) new general analysis techniques for multigrid solvers. Convergence of algebraic errors below the level of discretization errors is attained by a full multigrid (FMG) solver with one full approximation scheme (FAS) cycle per grid. Asymptotic convergence rates of the FAS cycles for the full system of flow equations are very fast, approaching those for scalar elliptic equations.

Diskin, Boris↗
NASA NTRS2006

Development of Comprehensive Reduced Kinetic Models for Supersonic Reacting Shear Layer Simulations

Large-scale simulations of multi-dimensional unsteady turbulent reacting flows with detailed chemistry and transport can be computationally extremely intensive even on distributed computing architectures. With the development of suitable reduced chemical kinetic models, the number of scalar variables to be integrated can be decreased, leading to a significant reduction in the computational time required for the simulation with limited loss of accuracy in the results. A general MATLAB-based automated mechanism reduction procedure is presented to reduce any complex starting mechanism (detailed or skeletal) with minimal human intervention. Based on the application of the quasi steady-state (QSS) approximation for certain chemical species and on the elimination of the fast reaction rates in the mechanism, several comprehensive reduced models, capable of handling different fuels such as C2H4, CH4 and H2, have been developed and thoroughly tested for several combustion problems (ignition, propagation and extinction) and physical conditions (reactant compositions, temperatures, and pressures). A key feature of the present reduction procedure is the explicit solution of the concentrations of the QSS species, needed for the evaluation of the elementary reaction rates. In contrast, previous approaches relied on an implicit solution due to the strong coupling between QSS species, requiring computationally expensive inner iterations. A novel algorithm, based on the definition of a QSS species coupling matrix, is presented to (i) introduce appropriate truncations to the QSS algebraic relations and (ii) identify the optimal sequence for the explicit solution of the concentration of the QSS species. With the automatic generation of the relevant source code, the resulting reduced models can be readily implemented into numerical codes.

Zambon, A. C.↗
DOE OSTI2026

A projection method for particle resampling

Particle discretizations of partial differential equations are advantageous for high-dimensional kinetic models in phase-space due to their better scalability than continuum approaches with respect to dimension. Complex processes collectively referred to as particle noise hamper long time simulations with particle methods. One approach to address this problem is particle mesh adaptivity, or remapping, known as particle resampling and remeshing. Here, this work introduces a resampling method that projects particles to and from a (finite element) function space. The method is simple, using standard sparse linear algebra and finite element techniques, and it preserves all moments up to the order of a polynomial represented exactly by the continuum function space. It is distinguished from most other mesh-based methods in that new particle positions and number are decoupled from the mesh, allowing particle and continuum meshes to be adapted relatively independently. While this work is developed with structured particle and continuum phase-space grids on 1X + 1V Vlasov-Poisson models of Landau damping and two-stream instability, the method is well-suited to unstructured grids. Stable long time dynamics are demonstrated up to time T = 500. Reproducibility artifacts and data are publicly available.

Kinetic methods↗
NASA NTRS1988

Recursive mass matrix factorization and inversion: An operator approach to open- and closed-chain multibody dynamics

This report advances a linear operator approach for analyzing the dynamics of systems of joint-connected rigid bodies.It is established that the mass matrix M for such a system can be factored as M=(I+H phi L)D(I+H phi L) sup T. This yields an immediate inversion M sup -1=(I-H psi L) sup T D sup -1 (I-H psi L), where H and phi are given by known link geometric parameters, and L, psi and D are obtained recursively by a spatial discrete-step Kalman filter and by the corresponding Riccati equation associated with this filter. The factors (I+H phi L) and (I-H psi L) are lower triangular matrices which are inverses of each other, and D is a diagonal matrix. This factorization and inversion of the mass matrix leads to recursive algortihms for forward dynamics based on spatially recursive filtering and smoothing. The primary motivation for advancing the operator approach is to provide a better means to formulate, analyze and understand spatial recursions in multibody dynamics. This is achieved because the linear operator notation allows manipulation of the equations of motion using a very high-level analytical framework (a spatial operator algebra) that is easy to understand and use. Detailed lower-level recursive algorithms can readily be obtained for inspection from the expressions involving spatial operators. The report consists of two main sections. In Part 1, the problem of serial chain manipulators is analyzed and solved. Extensions to a closed-chain system formed by multiple manipulators moving a common task object are contained in Part 2. To retain ease of exposition in the report, only these two types of multibody systems are considered. However, the same methods can be easily applied to arbitrary multibody systems formed by a collection of joint-connected regid bodies.

Rodriguez, G.↗
NASA NTRS1989

The weight distribution and randomness of linear codes

Finding the weight distributions of block codes is a problem of theoretical and practical interest. Yet the weight distributions of most block codes are still unknown except for a few classes of block codes. Here, by using the inclusion and exclusion principle, an explicit formula is derived which enumerates the complete weight distribution of an (n,k,d) linear code using a partially known weight distribution. This expression is analogous to the Pless power-moment identities - a system of equations relating the weight distribution of a linear code to the weight distribution of its dual code. Also, an approximate formula for the weight distribution of most linear (n,k,d) codes is derived. It is shown that for a given linear (n,k,d) code over GF(q), the ratio of the number of codewords of weight u to the number of words of weight u approaches the constant Q = q(-)(n-k) as u becomes large. A relationship between the randomness of a linear block code and the minimum distance of its dual code is given, and it is shown that most linear block codes with rigid algebraic and combinatorial structure also display certain random properties which make them similar to random codes with no structure at all.

Cheung, K.-M.↗
NASA NTRS1992

Computational aspects of helicopter trim analysis and damping levels from Floquet theory

Helicopter trim settings of periodic initial state and control inputs are investigated for convergence of Newton iteration in computing the settings sequentially and in parallel. The trim analysis uses a shooting method and a weak version of two temporal finite element methods with displacement formulation and with mixed formulation of displacements and momenta. These three methods broadly represent two main approaches of trim analysis: adaptation of initial-value and finite element boundary-value codes to periodic boundary conditions, particularly for unstable and marginally stable systems. In each method, both the sequential and in-parallel schemes are used and the resulting nonlinear algebraic equations are solved by damped Newton iteration with an optimally selected damping parameter. The impact of damped Newton iteration, including earlier-observed divergence problems in trim analysis, is demonstrated by the maximum condition number of the Jacobian matrices of the iterative scheme and by virtual elimination of divergence. The advantages of the in-parallel scheme over the conventional sequential scheme are also demonstrated.

Gaonkar, Gopal H.↗
NASA NTRS1993

Helicopter trim analysis by shooting and finite element methods with optimally damped Newton iterations

Helicopter trim settings of periodic initial state and control inputs are investigated for convergence of Newton iteration in computing the settings sequentially and in parallel. The trim analysis uses a shooting method and a weak version of two temporal finite element methods with displacement formulation and with mixed formulation of displacements and momenta. These three methods broadly represent two main approaches of trim analysis: adaptation of initial-value and finite element boundary-value codes to periodic boundary conditions, particularly for unstable and marginally stable systems. In each method, both the sequential and in-parallel schemes are used, and the resulting nonlinear algebraic equations are solved by damped Newton iteration with an optimally selected damping parameter. The impact of damped Newton iteration, including earlier-observed divergence problems in trim analysis, is demonstrated by the maximum condition number of the Jacobian matrices of the iterative scheme and by virtual elimination of divergence. The advantages of the in-parallel scheme over the conventional sequential scheme are also demonstrated.

Achar, N. S.↗
DOE OSTI2024

Parallel Randomized Tucker Decomposition Algorithms

The Tucker tensor decomposition is a natural extension of the singular value decomposition (SVD) to multiway data. Here, we propose to accelerate Tucker tensor decomposition algorithms by using randomization and parallelization. We present two algorithms that scale to large data and many processors, significantly reduce both computation and communication cost compared to previous deterministic and randomized approaches, and obtain nearly the same approximation errors. The key idea in our algorithms is to perform randomized sketches with Kronecker-structured random matrices, which reduces computation compared to unstructured matrices and can be implemented using a fundamental tensor computational kernel. We provide probabilistic error analysis of our algorithms and implement a new parallel algorithm for the structured randomized sketch. Our experimental results demonstrate that our combination of randomization and parallelization achieves accurate Tucker decompositions much faster than alternative approaches. We observe up to a 16X speedup over the fastest deterministic parallel implementation on 3D simulation data.

Tucker decompositions↗
NASA NTRS1989

Numerical solution of a two-dimensional jet in a supersonic crossflow using an upwind relaxation scheme

A numerical scheme for predicting complex two-dimensional viscous flow fields is presented. The algorithm uses Roe's method for defining the inviscid fluxes and a line relaxation scheme to solve the resulting discrete approximation. The effects of turbulence are modelled using an algebraic eddy viscosity model. An adaptive grid scheme is employed to improve the resolution of complex flow field phenomena. The algorithm is applied to the solution of a sonic jet in a supersonic crossflow. Numerical results are compared with experimental data to validate the numerical approach.

Thompson, D. S.↗
DOE OSTI2022

On the Convergence of Inexact Predictor-Corrector Methods for Linear Programming

Interior point methods (IPMs) are a common approach for solving linear programs (LPs) with strong theoretical guarantees and solid empirical performance. The time complexity of these methods is dominated by the cost of solving a linear system of equations at each iteration. In common applications of linear programming, particularly in machine learning and scientific computing, the size of this linear system can become prohibitively large, requiring the use of iterative solvers, which provide an approximate solution to the linear system. However, approximately solving the linear system at each iteration of an IPM invalidates the theoretical guarantees of common IPM analyses. To remedy this, we theoretically and empirically analyze (slightly modified) predictor-corrector IPMs when using approximate linear solvers: our approach guarantees that, when certain conditions are satisfied, the number of IPM iterations does not increase and that the final solution remains feasible. We also provide practical instantiations of approximate linear solvers that satisfy these conditions for special classes of constraint matrices using randomized linear algebra.

Dexter, Gregory↗
DOE OSTI2022

Physics-Informed Sparse Gaussian Process for Probabilistic Stability Analysis of Large-Scale Power System with Dynamic PVs and Loads

This work proposes a physics-informed sparse Gaussian process (SGP) for probabilistic stability assessment of large-scale power systems in the presence of uncertain dynamic PVs and loads. The differential and algebraic equations considering uncertainties from dynamic PVs and loads are reformulated to a nonlinear mapping relationship that allows the application of SGP. Thanks to the nonparametric characteristic of Gaussian process, the proposed framework does not require distributions of uncertain inputs and this distinguishes it from existing approaches. As the original Gaussian process is not scalable to large-scale systems with high dimensional uncertain inputs, this paper develops the SGP with a stochastic variational inference technique. It leads to approximately two orders of complex reduction. A data pre-processing step is also introduced to tackle the coexistence of stable and unstable cases by sample clustering and constructing separate SGPs. The probabilistic transient stability index is analyzed to assess system stability under different uncertain dynamics loads and PVs. Comparisons are performed with the sampling-based, the polynomial chaos expansion-based, and traditional Gaussian process-based methods on the modified IEEE 118-bus and Texas 2000-bus systems under various scenarios, including different levels of uncertainties and the existence of nonlinear correlations among dynamic PVs. The impacts of data quality and quantity issues are also investigated. It is shown that the proposed SGP achieves significantly improved computational efficiency while maintaining high accuracy with a limited number of data.

24 POWER TRANSMISSION AND DISTRIBUTION↗
NASA NTRS1977

A singularity free analytical solution of artificial satellite motion with drag

The connection between the existing Delaunay-Similar and Poincare-Similar satellite theories in the true anomaly version is outlined for the J(2) perturbation and the new drag approach. An overall description of the concept of the approach is given while the necessary expansions and the procedure to arrive at the computer program for the canonical forces is delineated. The procedure for the analytical integration of these developed equations is described. In addition, some numerical results are given. The computer program for the algebraic multiplication of the Fourier series which creates the FORTRAN coding in an automatic manner is described and documented.

Scheifele, G.↗
NASA NTRS1985

On the electromagnetic scattering from infinite rectangular conducting grids

The study and development of two numerical techniques for the analysis of electromagnetic scattering from a rectangular wire mesh are described. Both techniques follow from one basic formulation and they are both solved in the spectral domain. These techniques were developed as a result of an investigation towards more efficient numerical computation for mesh scattering. These techniques are efficient for the following reasons: (a1) make use of the Fast Fourier Transform; (b2) they avoid any convolution problems by converting integrodifferential equations into algebraic equations; and (c3) they do not require inversions of any matrices. The first method, the SIT or Spectral Iteration Technique, is applied for regions where the spacing between wires is not less than two wavelengths. The second method, the SDCG or Spectral Domain Conjugate Gradient approach, can be used for any spacing between adjacent wires. A study of electromagnetic wave properties, such as reflection coefficient, induced currents and aperture fields, as functions of frequency, angle of incidence, polarization and thickness of wires is presented. Examples and comparisons or results with other methods are also included to support the validity of the new algorithms.

Christodoulou, C.↗
NASA NTRS1993

Grid and design variables sensitivity analyses for NACA four-digit wing-sections

Two distinct parameterization procedures are developed for investigating the grid sensitivity with respect to design parameters of a wing-section example. The first procedure is based on traditional (physical) relations defining NACA four-digit wing-sections. The second is advocating a novel (geometrical) parameterization using spline functions such as NURBS (Non-Uniform Rational B-Splines) for defining the wing-section geometry. An interactive algebraic grid generation technique, known as Hermite Cubic Interpolation, is employed to generate C-type grids around wing-sections. The grid sensitivity of the domain with respect to design and grid parameters has been obtained by direct differentiation of the grid equations. A hybrid approach is proposed for more geometrically complex configurations. A comparison of the sensitivity coefficients with those obtained using a finite-difference approach has been made to verify the feasibility of the approach. The aerodynamic sensitivity coefficients are obtained using the compressible two-dimensional thin-layer Navier-Stokes equations.

Sadrehaghighi, Ideen↗