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.

SourceResearch connectionFrom yearThrough year

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

At least 307 records · Page 17

All sources NASA NTRS DOE OSTI

NASA NTRSDate not supplied

Interval Predictor Models for Robust System Identification

This paper proposes a framework for the identification and uncertainty quantification of plant models according to multivariable data. The only restriction imposed upon such models is for their outputs to depend continuously on their parameters. An Interval Predictor Model (IPM) prescribes the parameters of a computational model as a path-connected set thereby making each predicted output an interval-valued function of its inputs. The formulation proposed seeks the parameter set for which the predicted outputs tightly enclose the data. This set, which is modeled as a semi-algebraic set of low-degree polynomials, enables the characterization of possibly strong parameter dependencies commonly found in practice. This uncertainty characterization makes the resulting plant model amenable to robust control approaches using polynomial optimization. Furthermore, we use non-convex scenario theory to assess the reliability of the resulting IPM. This assessment yields a distribution-free upper bound on the probability that future data will fall outside the predicted intervals.

interval↗

NASA NTRS1999

Solving Upwind-Biased Discretizations: Multigrid Solver Using Semicoarsening - 2

This paper studies a novel multigrid approach to the solution for a second order upwind biased discretization of the convection equation in two dimensions. This approach is based on semi-coarsening and well balanced explicit correction terms added to coarse-grid operators to maintain on coarse-grid the same cross-characteristic interaction as on the target (fine) grid. Colored relaxation schemes are used on all the levels allowing a very efficient parallel implementation. The results of the numerical tests can be summarized as follows: 1) The residual asymptotic convergence rate of the proposed V(0, 2) multigrid cycle is about 3 per cycle. This convergence rate far surpasses the theoretical limit (4/3) predicted for standard multigrid algorithms using full coarsening. The reported efficiency does not deteriorate with increasing the cycle, depth (number of levels) and/or refining the target-grid mesh spacing. 2) The full multi-grid algorithm (FMG) with two V(0, 2) cycles on the target grid and just one V(0, 2) cycle on all the coarse grids always provides an approximate solution with the algebraic error less than the discretization error. Estimates of the total work in the FMG algorithm are ranged between 18 and 30 minimal work units (depending on the target (discretizatioin). Thus, the overall efficiency of the FMG solver closely approaches (if does not achieve) the goal of the textbook multigrid efficiency. 3) A novel approach to deriving a discrete solution approximating the true continuous solution with a relative accuracy given in advance is developed. An adaptive multigrid algorithm (AMA) using comparison of the solutions on two successive target grids to estimate the accuracy of the current target-grid solution is defined. A desired relative accuracy is accepted as an input parameter. The final target grid on which this accuracy can be achieved is chosen automatically in the solution process. the actual relative accuracy of the discrete solution approximation obtained by AMA is always better than the required accuracy; the computational complexity of the AMA algorithm is (nearly) optimal (comparable with the complexity of the FMG algorithm applied to solve the problem on the optimally spaced target grid).

Diskin, Boris↗

DOE OSTI2026

Algebraic Multigrid with Filtering: An Efficient Preconditioner for Interior Point Methods in Large-Scale Contact Mechanics Optimization

Large-scale contact mechanics simulations are crucial in many engineering fields such as structural design and manufacturing. In the frictionless case, contact can be modeled by minimizing an energy functional; however, these problems are often nonlinear, nonconvex, and increasingly difficult to solve as mesh resolution increases. In this work, we employ a Newton-based interior-point (IP) filter line-search method, an effective approach for large-scale constrained optimization. While this method converges rapidly, each iteration requires solving a large saddle-point linear system that becomes ill-conditioned as the optimization process converges, largely due to IP treatment of the contact constraints. Such ill-conditioning can hinder solver scalability and increase iteration counts with mesh refinement. Here, to address this, we introduce a novel preconditioner, algebraic multigrid with filtering (AMGF), tailored to the Schur complement of the saddle-point system. Building on the classical AMG solver, commonly used for elasticity, we augment it with a specialized subspace correction that filters near null space components introduced by contact interface constraints. Through theoretical analysis and numerical experiments on a range of linear and nonlinear contact problems, we demonstrate that the proposed solver achieves mesh independent convergence and maintains robustness against the ill-conditioning that notoriously plagues IP methods. These results indicate that AMGF makes contact mechanics simulations more tractable and broadens the applicability of Newton-based IP methods in challenging engineering scenarios. More broadly, AMGF is well suited for problems, optimization or otherwise, where solver performance is limited by a low-dimensional subspace, such as those arising from localized constraints, interface conditions, or model heterogeneities. This makes the method widely applicable beyond contact mechanics and constrained optimization.

Mathematics and Computing↗

DOE OSTI2020

Phase identification using co‐association matrix ensemble clustering

Calibrating distribution system models to aid in the accuracy of simulations such as hosting capacity analysis is increasingly important in the pursuit of the goal of integrating more distributed energy resources. The recent availability of smart meter data is enabling the use of machine learning tools to automatically achieve model calibration tasks. This research focuses on applying machine learning to the phase identification task, using a co‐association matrix‐based, ensemble spectral clustering approach. The proposed method leverages voltage time series from smart meters and does not require existing or accurate phase labels. This work demonstrates the success of the proposed method on both synthetic and real data, surpassing the accuracy of other phase identification research.

24 POWER TRANSMISSION AND DISTRIBUTION↗

NASA NTRS1978

Approach guidance logic for a tilt-rotor aircraft

The distinctive feature of a tilt-rotor aircraft is that the pilot can change the rotor mast angles to go from a helicopter configuration for take-off and landing to an airplane configuration for high cruise speeds and vice-versa. An approach path for such an aircraft is proposed and the logic required to fly along this path in the presence of wind is determined. The main contribution of this work is an efficient and, to my knowledge, new method for generating the nominal state and control histories taking into account an estimate of the mean wind velocity and direction. The method requires the solution of algebraic (mostly linear) equations to generate a 'universal nominal', and feedforward and feedback gains. Then, in flight the additional state and control corrections due to deviation in descent rate, deceleration, and flight in a steady wind are obtained by multiplying simple precalculated functions of time by descent rate, deceleration or sine and cosine components of the mean wind vector. Simulations of approach flights for different wind conditions, assuming perfect state information in the feedback signal, indicated satisfactory performance.

Beser, J.↗

DOE OSTI2024

Perturbative quantum evolution of the gravitational state and dressing in general backgrounds

This paper sets up a perturbative treatment of the evolving quantum state of a gravitational system, in a Schrödinger-like picture, working about a general background. This connects gauge symmetry, the constraints, gravitational dressing, and evolution. Starting with a general time slicing, we give a simple derivation of the relation between the constraints, the Hamiltonian, and its well-known boundary term. Among different approaches to quantization with constraints, we focus on a “gauge-invariant canonical quantization,” which is developed perturbatively in the gravitational coupling. The leading-order solution of the constraints (including the Wheeler-DeWitt equation) for perturbations about the background is given in terms of an explicit construction of gravitational dressings built using certain generalized Green’s functions; different such dressings corresponding to adding propagating gravitational waves to a particular solution of the constraints. Dressed operators commute with the constraints, expressing their gauge invariance, and have an algebraic structure differing significantly from the undressed operators of the underlying field theory. These operators can act on the vacuum to create dressed states, and evolution of general such states is then generated by the boundary Hamiltonian, and alternately may be characterized using other relational observables. This provides a concrete approach to studying perturbative time evolution, including the leading gravitational backreaction, of quantum states of black holes with flat or anti–de-Sitter asymptotics, for example on horizon-crossing slices. This description of evolution in turn provides a starting point for investigating possibly important corrections to quantum evolution, that go beyond quantized general relativity. Published by the American Physical Society 2024

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

DOE OSTI2020

Simulation-driven optimization of high-order meshes in ALE hydrodynamics

Here we propose tools for high-order mesh optimization and demonstrate their benefits in the context of multi-material Arbitrary Lagrangian-Eulerian (ALE) compressible shock hydrodynamic applications. The mesh optimization process is driven by information provided by the simulation which uses the optimized mesh, such as shock positions, material regions, known error estimates, etc. These simulation features are usually represented discretely, for instance, as finite element functions on the Lagrangian mesh. The discrete nature of the input is critical for the practical applicability of the algorithms we propose and distinguishes this work from approaches that strictly require analytical information. Our methods are based on node movement through a high-order extension of the Target-Matrix Optimization Paradigm (TMOP). The proposed formulation is fully algebraic and relies only on local Jacobian matrices, so it is applicable to all types of mesh elements, in 2D and 3D, and any order of the mesh. We discuss the notions of constructing adaptive target matrices and obtaining their derivatives, reconstructing discrete data in intermediate meshes, node limiting that enables improvement of global mesh quality while preserving space-dependent local mesh features, and appropriate normalization of the objective function. The adaptivity methods are combined with automatic ALE triggers that can provide robustness of the mesh evolution and avoid excessive remap procedures. The benefits of the new high-order TMOP technology are illustrated on several simulations performed in the high-order ALE application BLAST.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2025

Semi-implicit continuum kinetic modeling of weakly collisional parallel transport in a magnetic mirror

We present implicit-explicit (IMEX) kinetic simulations of weakly collisional parallel plasma transport in magnetic mirror configurations using the continuum code COGENT. The numerical scheme employs a Jacobian-free Newton–Krylov method with algebraic multigrid preconditioning to overcome the severe time step limitations imposed by strong mirror forces in fully explicit schemes. Applied to parameters relevant to the Wisconsin HTS Axisymmetric Mirror experiment, the IMEX approach enables time steps up to 2.5×10 4 times larger than those permitted by explicit methods, resulting in a 2500× speedup in 1D–2V simulations of parallel transport with kinetic ions and Boltzmann electrons. Additionally, a reduced bounce-averaged model for a square mirror is implemented to support the computationally intensive fully kinetic simulations. The bounce-averaged formulation is used to evaluate the numerical convergence of the velocity-space discretization algorithms and to assess the role of the collision model by comparing simulations employing the nonlinear Fokker–Planck and the simplified Lenard–Bernstein–Dougherty collision operators.

Collision theories↗

NASA NTRS1994

A brief survey of constrained mechanics and variational problems in terms of differential forms

There has been considerable interest recently in constrained mechanics and variational problems. This is in part due to applied interests (such as 'non-holonomic mechanics in robotics') and in other part due to the fact that several schools of 'pure' mathematics have found that this classical subject is of importance for what they are trying to do. I have made various attempts at developing these subjects since my Lincoln lab days of the late 1950's. In this Chapter, I will sketch a Unified point of view, using Cartan's approach with differential forms. This has the advantage from the C-O-R viewpoint being developed in this Volume that the extension from 'smooth' to 'generalized' data is very systematic and algebraic. (I will only deal with the 'smooth' point of view in this Chapter; I will develop the 'generalized function' material at a later point.) The material presented briefly here about Variational Calculus and Constrained Mechanics can be found in more detail in my books, 'Differential Geometry and the Calculus of Variations', 'Lie Algebras and Quantum Mechanics', and 'Geometry, Physics and Systems'.

Hermann, Robert↗

NASA NTRS2006

Application of p-Multigrid to Discontinuous Galerkin Formulations of the Poisson Equation

We investigate p-multigrid as a solution method for several different discontinuous Galerkin (DG) formulations of the Poisson equation. Different combinations of relaxation schemes and basis sets have been combined with the DG formulations to find the best performing combination. The damping factors of the schemes have been determined using Fourier analysis for both one and two-dimensional problems. One important finding is that when using DG formulations, the standard approach of forming the coarse p matrices separately for each level of multigrid is often unstable. To ensure stability the coarse p matrices must be constructed from the fine grid matrices using algebraic multigrid techniques. Of the relaxation schemes, we find that the combination of Jacobi relaxation with the spectral element basis is fairly effective. The results using this combination are p sensitive in both one and two dimensions, but reasonable convergence rates can still be achieved for moderate values of p and isotropic meshes. A competitive alternative is a block Gauss-Seidel relaxation. This actually out performs a more expensive line relaxation when the mesh is isotropic. When the mesh becomes highly anisotropic, the implicit line method and the Gauss-Seidel implicit line method are the only effective schemes. Adding the Gauss-Seidel terms to the implicit line method gives a significant improvement over the line relaxation method.

Helenbrook, B. T.↗

NASA NTRS1990

On three dimensional object recognition and pose-determination: An abstraction based approach

A method of computing reliable Gaussian and mean curvature sign-map descriptors from the polynomial approximation of surfaces was demonstrated. Such descriptors which are invariant under perspective variation are suitable for hypothesis generation. A means for determining the pose of constructed geometric forms whose algebraic surface descriptors are nonlinear in terms of their orienting parameters was developed. This was done by means of linear functions which are capable of approximating nonlinear forms and determining their parameters. It was shown that biquadratic surfaces are suitable companion linear forms for cylindrical approximation and parameter estimation. The estimates provided the initial parametric approximations necessary for a nonlinear regression stage to fine tune the estimates by fitting the actual nonlinear form to the data. A hypothesis-based split-merge algorithm for extraction and pose determination of cylinders and planes which merge smoothly into other surfaces was developed. It was shown that all split-merge algorithms are hypothesis-based. A finite-state algorithm for the extraction of the boundaries of run-length regions was developed. The computation takes advantage of the run list topology and boundary direction constraints implicit in the run-length encoding.

Quek, Kok How Francis↗

NASA NTRS1987

Response of joint dominated space structures

An efficient linearization method is presented for calculating the transient response of nonlinear systems due to initial disturbances. The method is an extension of the describing function approach in which the steady state response of the system is calculated by representing the nonlinear element, typically joints in the case of space structures, by impedances which are functions of the amplitude of response. Thus, the problem of solving the differential equation for the steady state response becomes one of solving a set of nonlinear algebraic equations involving the steady state amplitudes and phases of the system. It is shown that for the transient case the steady state impedances can be averaged over the range of responses in order to provide equivalent values of stiffness and damping that, for a given set of initial displacements, may be treated as being constant for purposes of calculating system response. Single degree of freedom system are used to demonstrate the method and to develop an approach for optimizing the joint's characteristics so as to minimize transient response times. The use of this method for response estimation and optimization in multiple degree of freedom systems is investigated.

Source record↗

DOE OSTI2026

Particle-hole symmetric slave-boson method for the mixed valence problem

We introduce an analytic slave-boson method for treating the finite-𝑈 Anderson impurity model. Our approach introduces two bosons to track both 𝑄 ⇌ 𝑄 ± 1 valence fluctuations and reduces to a single symmetric 𝑠 boson in the effective action, encoding all the high-energy atomic physics information in the boson's kinematics, while the low-energy part of the action remains unchanged across finite-𝑈, infinite-𝑈, and Kondo limits. We recover the infinite-𝑈- and Kondo-limit actions from our approach and show that the Kondo resonance already develops in the normal state when the slave boson has yet to condense. We show that the slave rotor and 𝑠 boson have the same algebraic structure, and we establish a unified functional integral framework connecting the 𝑠-boson and slave-rotor representations for the single-impurity Anderson model.

Anderson impurity model↗

NASA NTRS1971

Applications of symbolic computing methods to the dynamic analysis of large systems

Since the symbolic computing language is very well suited to the operations with algebraic equations, techniques use the transfer function concept as a tool for the analysis of large linear dynamic systems. Techniques were coded in the experimental symbolic computer language FORMAC. The first of these approaches, REDUCE 1, establishes the techniques and a computer program to symbolically reduce arbitrary block diagrams associated with large systems for desired transfer functions. Symbolic closed form solutions are determined in several forms including an expanded form in terms of the driving frequencies and system constants. Programs are also written to numerically evaluate the symbolic solutions. A second computer program, REDUCE 2, is also based on the use of symbolic computing methods and was written to accommodate large engineering systems.

Lorenzo, C. F.↗

NASA NTRS1983

The determination of the elastodynamic fields of an ellipsoidal inhomogeneity

The determination of the elastodynamic fields of an ellipsoidal inhomogeneity is studied in detail via the eigenstrain approach. A complete formulation and a treatment of both types of eigenstrains for equivalence between the inhomogeneity problem and the inclusion problem are given. This approach is shown to be mathematically identical to other approaches such as the direct volume integral formulation. Expanding the eigenstrains and applied strains in the polynomial form in the position vector and satisfying the equivalence conditions at every point, the governing simultaneous algebraic equations for the unknown coefficients in the eigenstrain expansion are derived. The elastodynamic field outside an ellipsoidal inhomogeneity in a linear elastic isotropic medium is given as an example. The angular and frequency dependence of the induced displacement field, as well as the differential and total cross sections are formally given in series expansion form for the case of uniformly distributed eigenstrains.

Fu, L. S.↗

NASA NTRS1987

Simultaneous analysis and design for eigenvalue maximization

A simultaneous analysis and design approach to the maximization of buckling or vibration eigenvalues is presented. Both unimodal and bimodal optimum solutions are considered. A discretization of the structure and response is used to obtain sets of nonlinear algebraic equations which are solved numerically. The formulation is applied to the solution of the optimum design of a beam-column supported by an elastic foundation for maximum buckling load. Two cases are considered: the optimum design of the column for a given foundation and the optimum design of the foundation for a given column. Results are compared to published solutions when possible.

Plaut, Raymond H.↗

NASA NTRS1990

Time-optical spinup maneuvers of flexible spacecraft

Attitude controllers for spacecraft have been based on the assumption that the bodies being controlled are rigid. Future spacecraft, however, may be quite flexible. Many applications require spinning up/down these vehicles. In this work the minimum time control of these maneuvers is considered. The time-optimal control is shown to possess an important symmetry property. Taking advantage of this property, the necessary and sufficient conditions for optimality are transformed into a system of nonlinear algebraic equations in the control switching times during one half of the maneuver, the maneuver time, and the costates at the mid-maneuver time. These equations can be solved using a homotopy approach. Control spillover measures are introduced and upper bounds on these measures are obtained. For a special case these upper bounds can be expressed in closed form for an infinite dimensional evaluation model. Rotational stiffening effects are ignored in the optimal control analysis. Based on a heuristic argument a simple condition is given which justifies the omission of these nonlinear effects. This condition is validated by numerical simulation.

Singh, G.↗

NASA NTRS2001

Lagrangian Approach to Jet Mixing and Optimization of the Reactor for Production of Carbon Nanotubes

This study was motivated by an attempt to optimize the High Pressure carbon oxide (HiPco) process for the production of carbon nanotubes from gaseous carbon oxide, The goal is to achieve rapid and uniform heating of catalyst particles by an optimal arrangement of jets. A mixed Eulerian and Lagrangian approach is implemented to track the temperature of catalyst particles along their trajectories as a function of time. The FLUENT CFD software with second-order upwind approximation of convective terms and an algebraic multigrid-based solver is used. The poor performance of the original reactor configuration is explained in terms of features of particle trajectories. The trajectories most exposed to the hot jets appear to be the most problematic for heating because they either bend towards the cold jet interior or rotate upwind of the mixing zone. To reduce undesirable slow and/or oscillatory heating of catalyst particles, a reactor configuration with three central jets is proposed and the optimal location of the central and peripheral nozzles is determined.

Povitsky, Alex↗