Search NASA⌕ Search

SEARCH · Search NASA

Results for “Problem Solving”

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 1,063 records · Page 59
All sourcesNASA NTRSDOE OSTI
NASA NTRS1995

Closed-form Static Analysis with Inertia Relief and Displacement-Dependent Loads Using a MSC/NASTRAN DMAP Alter

Solving for the displacements of free-free coupled systems acted upon by static loads is commonly performed throughout the aerospace industry. Many times, these problems are solved using static analysis with inertia relief. This solution technique allows for a free-free static analysis by balancing the applied loads with inertia loads generated by the applied loads. For some engineering applications, the displacements of the free-free coupled system induce additional static loads. Hence, the applied loads are equal to the original loads plus displacement-dependent loads. Solving for the final displacements of such systems is commonly performed using iterative solution techniques. Unfortunately, these techniques can be time-consuming and labor-intensive. Since the coupled system equations for free-free systems with displacement-dependent loads can be written in closed-form, it is advantageous to solve for the displacements in this manner. Implementing closed-form equations in static analysis with inertia relief is analogous to implementing transfer functions in dynamic analysis. Using a MSC/NASTRAN DMAP Alter, displacement-dependent loads have been included in static analysis with inertia relief. Such an Alter has been used successfully to solve efficiently a common aerospace problem typically solved using an iterative technique.

Barnett, Alan R.↗
NASA NTRS2012

Direct Method Transcription for a Human-Class Translunar Injection Trajectory Optimization

This paper presents a new trajectory optimization software package developed in the framework of a low-to-high fidelity 3 degrees-of-freedom (DOF)/6-DOF vehicle simulation program named Mission Analysis Simulation Tool in Fortran (MASTIF) and its application to a translunar trajectory optimization problem. The functionality of the developed optimization package is implemented as a new "mode" in generalized settings to make it applicable for a general trajectory optimization problem. In doing so, a direct optimization method using collocation is employed for solving the problem. Trajectory optimization problems in MASTIF are transcribed to a constrained nonlinear programming (NLP) problem and solved with SNOPT, a commercially available NLP solver. A detailed description of the optimization software developed is provided as well as the transcription specifics for the translunar injection (TLI) problem. The analysis includes a 3-DOF trajectory TLI optimization and a 3-DOF vehicle TLI simulation using closed-loop guidance.

Witzberger, Kevin E.↗
DOE OSTI2025

Coefficient-to-Basis Network: a fine-tunable operator learning framework for inverse problems with adaptive discretizations and theoretical guarantees

We propose a Coefficient-to-Basis Network (C2BNet), a novel framework for solving inverse problems within the operator learning paradigm. C2BNet efficiently adapts to different discretizations through fine-tuning, using a pre-trained model to significantly reduce computational cost while maintaining high accuracy. Unlike traditional approaches that require retraining from scratch for new discretizations, our method enables seamless adaptation without sacrificing predictive performance. Furthermore, we establish theoretical approximation and generalization error bounds for C2BNet by exploiting low-dimensional structures in the underlying datasets. Our analysis demonstrates that C2BNet adapts to low-dimensional structures without relying on explicit encoding mechanisms, highlighting its robustness and efficiency. To validate our theoretical findings, we conducted extensive numerical experiments that showcase the superior performance of C2BNet on several inverse problems. The results confirm that C2BNet effectively balances computational efficiency and accuracy, making it a promising tool to solve inverse problems in scientific computing and engineering applications.

97 MATHEMATICS AND COMPUTING↗
NASA NTRS1983

Robust penalty method for structural synthesis

The Sequential Unconstrained Minimization Technique (SUMT) offers an easy way of solving nonlinearly constrained problems. However, this algorithm frequently suffers from the need to minimize an ill-conditioned penalty function. An ill-conditioned minimization problem can be solved very effectively by posing the problem as one of integrating a system of stiff differential equations utilizing concepts from singular perturbation theory. This paper evaluates the robustness and the reliability of such a singular perturbation based SUMT algorithm on two different problems of structural optimization of widely separated scales. The report concludes that whereas conventional SUMT can be bogged down by frequent ill-conditioning, especially in large scale problems, the singular perturbation SUMT has no such difficulty in converging to very accurate solutions.

Kamat, M. P.↗
NASA NTRS1971

Parameter identification using a creeping-random-search algorithm

A creeping-random-search algorithm is applied to different types of problems in the field of parameter identification. The studies are intended to demonstrate that a random-search algorithm can be applied successfully to these various problems, which often cannot be handled by conventional deterministic methods, and, also, to introduce methods that speed convergence to an extremal of the problem under investigation. Six two-parameter identification problems with analytic solutions are solved, and two application problems are discussed in some detail. Results of the study show that a modified version of the basic creeping-random-search algorithm chosen does speed convergence in comparison with the unmodified version. The results also show that the algorithm can successfully solve problems that contain limits on state or control variables, inequality constraints (both independent and dependent, and linear and nonlinear), or stochastic models.

Parrish, R. V.↗
NASA NTRS1992

Inference in infinite-dimensional inverse problems - Discretization and duality

Many techniques for solving inverse problems involve approximating the unknown model, a function, by a finite-dimensional 'discretization' or parametric representation. The uncertainty in the computed solution is sometimes taken to be the uncertainty within the parametrization; this can result in unwarranted confidence. The theory of conjugate duality can overcome the limitations of discretization within the 'strict bounds' formalism, a technique for constructing confidence intervals for functionals of the unknown model incorporating certain types of prior information. The usual computational approach to strict bounds approximates the 'primal' problem in a way that the resulting confidence intervals are at most long enough to have the nominal coverage probability. There is another approach based on 'dual' optimization problems that gives confidence intervals with at least the nominal coverage probability. The pair of intervals derived by the two approaches bracket a correct confidence interval. The theory is illustrated with gravimetric, seismic, geomagnetic, and helioseismic problems and a numerical example in seismology.

Stark, Philip B.↗
DOE OSTI2026

A fourth order sharp immersed method for the incompressible Navier-Stokes equations with stationary and moving boundaries and interfaces

We propose a fourth order Navier-Stokes solver based on the immersed interface method (IIM), for flow problems with stationary and one-way coupled moving boundaries and interfaces. Our algorithm employs a Runge-Kutta-based projection method that maintains high-order temporal accuracy in both velocity and pressure for steady and unsteady velocity boundary conditions. Fourth order spatial accuracy is achieved through a novel fifth order IIM discretization scheme for the advection term, as well as existing high-order interface-corrected finite difference schemes for the other differential operators. Using a set of manufactured flow problems with stationary and moving boundaries, we demonstrate fourth order convergence of velocity and pressure in the infinity norm, both inside the domain and on the immersed boundaries. The solver’s performance is further validated through a range of practical flow simulations, highlighting its efficiency over a second order scheme. Finally, we showcase the ability of our immersed discretization scheme to handle interface-coupled multiphysics problems by solving a conjugate heat transfer problem with multiple immersed solids. Overall, the proposed approach robustly combines the efficiency of high order discretization schemes with the flexibility of immersed discretizations for flow problems with complex, moving boundaries and interfaces.

42 ENGINEERING↗
NASA NTRS1977

Advances in optimal routing through computer networks

The optimal routing problem is defined. Progress in solving the problem during the previous decade is reviewed, with special emphasis on technical developments made during the last few years. The relationships between the routing, the throughput, and the switching technology used are discussed and their future trends are reviewed. Economic aspects are also briefly considered. Modern technical approaches for handling the routing problems and, more generally, the flow control problems are reviewed.

Paz, I. M.↗
NASA NTRS1985

Absorbing boundary conditions for exterior problems

Elliptic and hyperbolic problems in unbounded regions are considered. These problems, when one wants to solve them numerically, have the difficulty of prescribing boundary conditions at infinity. Computationally, one needs a finite region in which to solve these problems. The corresponding conditions at infinity imposed on the finite distance boundaries should dictate the boundary condition at infinity and be accurate with respect to the interior numerical scheme. Such boundary conditions are commonly referred to as absorbing boundary conditions. A treatment is given of these boundary conditions for wave-like equations.

Hariharan, S. I.↗
NASA NTRS1985

Nonlinear acoustic wave propagation in atmosphere. Absorbing boundary conditions for exterior problems

Elliptic and hyperbolic problems in unbounded regions are considered. These problems, when one wants to solve them numerically, have the difficulty of prescribing boundary conditions at infinity. Computationally, one needs a finite region in which to solve these problems. The corresponding conditions at infinity imposed on the finite distance boundaries should dictate the boundary conditions at infinity and be accurate with respect to the interior numerical scheme. The treatment of these boundary conditions for wave-like equations is discussed.

Hariharan, S. I.↗
NASA NTRS1987

Control of Spacecraft Control Laboratory Experiment (SCOLE) slew maneuvers

This is the second report of a set of two reports on the dynamics and control of slewing maneuvers of NASA Spacecraft Control Laboratory Experiment (SCOLE). The control problem of slewing maneuvers of SCOLE is developed in terms of an arbitrary maneuver about any given axis. The control system is developed for the combined problem of rigid-body slew maneuver and vibration suppression of flexible appendage. The control problem is formulated by incorporating the nonlinear equations derived in the previous report and is expressed in terms of a two-point boundary value problem utilizing a quadratic type of performance index. The two-point boundary value problem is solved as a hierarchical control problem with the overall system being split in terms of two subsystems, namely the slewing of the entire assembly and the vibration suppression of the flexible antenna. The coupling variables between the two dynamical subsystems are identified and these two subsystems for control purposes are treated independently in parallel at the first level. Then the state-space trajectory of the combined problem is optimized at the second level.

Kakad, Y. P.↗
NASA NTRS1988

Static stereo vision depth distortions in teleoperation

A major problem in high-precision teleoperation is the high-resolution presentation of depth information. Stereo television has so far proved to be only a partial solution, due to an inherent trade-off among depth resolution, depth distortion and the alignment of the stereo image pair. Converged cameras can guarantee image alignment but suffer significant depth distortion when configured for high depth resolution. Moving the stereo camera rig to scan the work space further distorts depth. The 'dynamic' (camera-motion induced) depth distortion problem was solved by Diner and Von Sydow (1987), who have quantified the 'static' (camera-configuration induced) depth distortion. In this paper, a stereo image presentation technique which yields aligned images, high depth resolution and low depth distortion is demonstrated, thus solving the trade-off problem.

Diner, D. B.↗
NASA NTRS1989

Dynamics and control of flexible spacecraft during and after slewing maneuvers

The dynamics and control of slewing maneuvers of NASA Spacecraft COntrol Laboratory Experiment (SCOLE) are analyzed. The control problem of slewing maneuvers of SCOLE is formulated in terms of an arbitrary maneuver about any given axis. The control system is developed for the combined problem of rigid-body slew maneuver and vibration suppression of the flexible appendage. The control problem formulation incorporates the nonlinear dynamical equations derived previously, and is expressed in terms of a two-point boundary value problem utilizing a quadratic type of performance index. The two-point boundary value problem is solved as a hierarchical control problem with the overall system being split in terms of two subsystems, namely the slewing of the entire assembly and the vibration suppression of the flexible antenna. The coupling variables between the two dynamical subsystems are identified and these two subsystems for control purposes are treated independently in parallel at the first level. Then the state-space trajectory of the combined problem is optimized at the second level.

Kakad, Yogendra P.↗
NASA NTRS1990

A unified motion planning approach for redundant and non-redundant manipulators with actuator constraints

The term trajectory planning has been used to refer to the process of determining the time history of joint trajectory of each joint variable corresponding to a specified trajectory of the end effector. The trajectory planning problem was solved as a purely kinematic problem. The drawback is that there is no guarantee that the actuators can deliver the effort necessary to track the planned trajectory. To overcome this limitation, a motion planning approach which addresses the kinematics, dynamics, and feedback control of a manipulator in a unified framework was developed. Actuator constraints are taken into account explicitly and a priori in the synthesis of the feedback control law. Therefore the result of applying the motion planning approach described is not only the determination of the entire set of joint trajectories but also a complete specification of the feedback control strategy which would yield these joint trajectories without violating actuator constraints. The effectiveness of the unified motion planning approach is demonstrated on two problems which are of practical interest in manipulator robotics.

Chung, Ching-Luan↗
NASA NTRS1991

Space station internal propagation

The Space Station Freedom (SSF) is planned with a wireless communication system in place for the transmission of information between crew members on board. The clarity of transmission is paramount to an effective system of communication. A short overview is presented of the system including the requirements of interest, and a statement of the problem. The theory used to solve the problem is explored. The results given are for the experiments performed on a mockup of the proposed structure at NASA-Marshall. The requirements on the signal level are that there is a 45 dB signal to noise ratio from end to end, and that coverage over 99 pct. of the volume be maintained. The Rice probability distribution function, a simple extension of the Rayleigh distribution, is used to estimate the field strength inside a volume, where a significant line of sight from the transmitter to the receiver exists. For the SSF, this distribution will correspond to the summation of a coherent line of sight path between the transmitter and the receiver and an incoherent portion. The incoherent portion is the sum of reflections from the walls and the equipment inside the SSF. The Rice distribution was found to be the optimal distribution from the results.

Richie, J. E.↗
NASA NTRS1991

A globally convergent matrix-free algorithm for implicit time-marching schemes arising in finite element analysis in fluids

A solution procedure for solving nonlinear time-marching problems is presented. The nonsymmetric systems of equations arising from a Newton-type linearization of these time-marching problems are solved using an iterative strategy based on the generalized minimal residual (GMRES) algorithm. Matrix-free techniques leading to reduction in storage are presented. Incorporation of a linesearch algorithm in the Newton-GMRES scheme is discussed. An automatic time-increment control strategy is developed to increase the stability of the time-marching process. High-speed flow computations demonstrate the effectiveness of these algorithms.

Johan, Zdenek↗