SEARCH · Search NASA

Results for “Line search”

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 37 records · Page 2

All sources NASA NTRS DOE OSTI

NASA NTRS1988

MHOST: An efficient finite element program for inelastic analysis of solids and structures

An efficient finite element program for 3-D inelastic analysis of gas turbine hot section components was constructed and validated. A novel mixed iterative solution strategy is derived from the augmented Hu-Washizu variational principle in order to nodally interpolate coordinates, displacements, deformation, strains, stresses and material properties. A series of increasingly sophisticated material models incorporated in MHOST include elasticity, secant plasticity, infinitesimal and finite deformation plasticity, creep and unified viscoplastic constitutive model proposed by Walker. A library of high performance elements is built into this computer program utilizing the concepts of selective reduced integrations and independent strain interpolations. A family of efficient solution algorithms is implemented in MHOST for linear and nonlinear equation solution including the classical Newton-Raphson, modified, quasi and secant Newton methods with optional line search and the conjugate gradient method.

Nakazawa, S.↗

NASA NTRS1984

The man/machine interface in information retrieval: Providing access to the casual user

This study is concerned with the difficulties encountered by casual users wishing to employ Information Storage and Retrieval Systems. A casual user is defined as a professional who has neither time nor desire to pursue in depth the study of the numerous and varied retrieval systems. His needs for on-line search are only occasional, and not limited to any particular system. The paper takes a close look at the state of the art of research concerned with aiding casual users of Information Storage and Retrieval Systems. Current experiments such as LEXIS, CONIT, IIDA, CITE, and CCL are presented and discussed. Comments and proposals are offered, specifically in the areas of training, learning and cost as experienced by the casual user. An extensive bibliography of recent works on the subject follows the text.

Dominick, Wayne D.↗

NASA NTRS1990

Probabilistic Determination Of Motions Of Robots

Heuristic-path-planner method reduces computing time. Probability of successful motion of robot through region of space obtained from geometric model and captures effects of objects in region and kinematics of robot arm. Information used to guide on-line search and results, in most cases, in successful determination of path within reasonably short time.

Balaram, J.↗

NASA NTRS1990

Fast secant methods for the iterative solution of large nonsymmetric linear systems

A family of secant methods based on general rank-1 updates was revisited in view of the construction of iterative solvers for large non-Hermitian linear systems. As it turns out, both Broyden's good and bad update techniques play a special role, but should be associated with two different line search principles. For Broyden's bad update technique, a minimum residual principle is natural, thus making it theoretically comparable with a series of well known algorithms like GMRES. Broyden's good update technique, however, is shown to be naturally linked with a minimum next correction principle, which asymptotically mimics a minimum error principle. The two minimization principles differ significantly for sufficiently large system dimension. Numerical experiments on discretized partial differential equations of convection diffusion type in 2-D with integral layers give a first impression of the possible power of the derived good Broyden variant.

Deuflhard, Peter↗

NASA NTRS1992

Two neural network algorithms for designing optimal terminal controllers with open final time

Multilayer neural networks, trained by the backpropagation through time algorithm (BPTT), have been used successfully as state-feedback controllers for nonlinear terminal control problems. Current BPTT techniques, however, are not able to deal systematically with open final-time situations such as minimum-time problems. Two approaches which extend BPTT to open final-time problems are presented. In the first, a neural network learns a mapping from initial-state to time-to-go. In the second, the optimal number of steps for each trial run is found using a line-search. Both methods are derived using Lagrange multiplier techniques. This theoretical framework is used to demonstrate that the derived algorithms are direct extensions of forward/backward sweep methods used in N-stage optimal control. The two algorithms are tested on a Zermelo problem and the resulting trajectories compare favorably to optimal control results.

Plumer, Edward S.↗

NASA NTRS1995

Robust integration schemes for generalized viscoplasticity with internal-state variables. Part 1: Theoretical developments and applications

This two-part report is concerned with the development of a general framework for the implicit time-stepping integrators for the flow and evolution equations in generalized viscoplastic models. The primary goal is to present a complete theoretical formulation, and to address in detail the algorithmic and numerical analysis aspects involved in its finite element implementation, as well as to critically assess the numerical performance of the developed schemes in a comprehensive set of test cases. On the theoretical side, the general framework is developed on the basis of the unconditionally-stable, backward-Euler difference scheme as a starting point. Its mathematical structure is of sufficient generality to allow a unified treatment of different classes of viscoplastic models with internal variables. In particular, two specific models of this type, which are representative of the present start-of-art in metal viscoplasticity, are considered in applications reported here; i.e., fully associative (GVIPS) and non-associative (NAV) models. The matrix forms developed for both these models are directly applicable for both initially isotropic and anisotropic materials, in general (three-dimensional) situations as well as subspace applications (i.e., plane stress/strain, axisymmetric, generalized plane stress in shells). On the computational side, issues related to efficiency and robustness are emphasized in developing the (local) interative algorithm. In particular, closed-form expressions for residual vectors and (consistent) material tangent stiffness arrays are given explicitly for both GVIPS and NAV models, with their maximum sizes 'optimized' to depend only on the number of independent stress components (but independent of the number of viscoplastic internal state parameters). Significant robustness of the local iterative solution is provided by complementing the basic Newton-Raphson scheme with a line-search strategy for convergence. In the present first part of the report, we focus on the theoretical developments, and discussions of the results of numerical-performance studies using the integration schemes for GVIPS and NAV models.

Saleeb, Atef F.↗

NASA NTRS1995

Robust integration schemes for generalized viscoplasticity with internal-state variables. Part 2: Algorithmic developments and implementation

This two-part report is concerned with the development of a general framework for the implicit time-stepping integrators for the flow and evolution equations in generalized viscoplastic models. The primary goal is to present a complete theoretical formulation, and to address in detail the algorithmic and numerical analysis aspects involved in its finite element implementation, as well as to critically assess the numerical performance of the developed schemes in a comprehensive set of test cases. On the theoretical side, the general framework is developed on the basis of the unconditionally-stable, backward-Euler difference scheme as a starting point. Its mathematical structure is of sufficient generality to allow a unified treatment of different classes of viscoplastic models with internal variables. In particular, two specific models of this type, which are representative of the present start-of-art in metal viscoplasticity, are considered in applications reported here; i.e., fully associative (GVIPS) and non-associative (NAV) models. The matrix forms developed for both these models are directly applicable for both initially isotropic and anisotropic materials, in general (three-dimensional) situations as well as subspace applications (i.e., plane stress/strain, axisymmetric, generalized plane stress in shells). On the computational side, issues related to efficiency and robustness are emphasized in developing the (local) interative algorithm. In particular, closed-form expressions for residual vectors and (consistent) material tangent stiffness arrays are given explicitly for both GVIPS and NAV models, with their maximum sizes 'optimized' to depend only on the number of independent stress components (but independent of the number of viscoplastic internal state parameters). Significant robustness of the local iterative solution is provided by complementing the basic Newton-Raphson scheme with a line-search strategy for convergence. In the present second part of the report, we focus on the specific details of the numerical schemes, and associated computer algorithms, for the finite-element implementation of GVIPS and NAV models.

Li, Wei↗

NASA NTRS1998

Accelerated Training for Large Feedforward Neural Networks

In this paper we introduce a new training algorithm, the scaled variable metric (SVM) method. Our approach attempts to increase the convergence rate of the modified variable metric method. It is also combined with the RBackprop algorithm, which computes the product of the matrix of second derivatives (Hessian) with an arbitrary vector. The RBackprop method allows us to avoid computationally expensive, direct line searches. In addition, it can be utilized in the new, 'predictive' updating technique of the inverse Hessian approximation. We have used directional slope testing to adjust the step size and found that this strategy works exceptionally well in conjunction with the Rbackprop algorithm. Some supplementary, but nevertheless important enhancements to the basic training scheme such as improved setting of a scaling factor for the variable metric update and computationally more efficient procedure for updating the inverse Hessian approximation are presented as well. We summarize by comparing the SVM method with four first- and second- order optimization algorithms including a very effective implementation of the Levenberg-Marquardt method. Our tests indicate promising computational speed gains of the new training technique, particularly for large feedforward networks, i.e., for problems where the training process may be the most laborious.

Stepniewski, Slawomir W.↗

NASA NTRS1999

Method of Conjugate Radii for Solving Linear and Nonlinear Systems

This paper describes a method to solve a system of N linear equations in N steps. A quadratic form is developed involving the sum of the squares of the residuals of the equations. Equating the quadratic form to a constant yields a surface which is an ellipsoid. For different constants, a family of similar ellipsoids can be generated. Starting at an arbitrary point an orthogonal basis is constructed and the center of the family of similar ellipsoids is found in this basis by a sequence of projections. The coordinates of the center in this basis are the solution of linear system of equations. A quadratic form in N variables requires N projections. That is, the current method is an exact method. It is shown that the sequence of projections is equivalent to a special case of the Gram-Schmidt orthogonalization process. The current method enjoys an advantage not shared by the classic Method of Conjugate Gradients. The current method can be extended to nonlinear systems without modification. For nonlinear equations the Method of Conjugate Gradients has to be augmented with a line-search procedure. Results for linear and nonlinear problems are presented.

Nachtsheim, Philip R.↗

NASA NTRS2011

Enhanced Fuel-Optimal Trajectory-Generation Algorithm for Planetary Pinpoint Landing

An enhanced algorithm is developed that builds on a previous innovation of fuel-optimal powered-descent guidance (PDG) for planetary pinpoint landing. The PDG problem is to compute constrained, fuel-optimal trajectories to land a craft at a prescribed target on a planetary surface, starting from a parachute cut-off point and using a throttleable descent engine. The previous innovation showed the minimal-fuel PDG problem can be posed as a convex optimization problem, in particular, as a Second-Order Cone Program, which can be solved to global optimality with deterministic convergence properties, and hence is a candidate for onboard implementation. To increase the speed and robustness of this convex PDG algorithm for possible onboard implementation, the following enhancements are incorporated: 1) Fast detection of infeasibility (i.e., control authority is not sufficient for soft-landing) for subsequent fault response. 2) The use of a piecewise-linear control parameterization, providing smooth solution trajectories and increasing computational efficiency. 3) An enhanced line-search algorithm for optimal time-of-flight, providing quicker convergence and bounding the number of path-planning iterations needed. 4) An additional constraint that analytically guarantees inter-sample satisfaction of glide-slope and non-sub-surface flight constraints, allowing larger discretizations and, hence, faster optimization. 5) Explicit incorporation of Mars rotation rate into the trajectory computation for improved targeting accuracy. These enhancements allow faster convergence to the fuel-optimal solution and, more importantly, remove the need for a "human-in-the-loop," as constraints will be satisfied over the entire path-planning interval independent of step-size (as opposed to just at the discrete time points) and infeasible initial conditions are immediately detected. Finally, while the PDG stage is typically only a few minutes, ignoring the rotation rate of Mars can introduce 10s of meters of error. By incorporating it, the enhanced PDG algorithm becomes capable of pinpoint targeting.

Acikmese, Behcet↗

NASA NTRS2019

High-Resolution Spectroscopy of Titan with SOFIA/EXES

We present the first observation of Titan with the high resolution Echelon cross-Echelle Spectrograph(EXES) instrument on the Stratospheric Observatory for Infrared Astronomy (SOFIA, Fig. 1). These show clear detection of multiple spectral lines in the R-branch of the acetylene vibrational band at 13 m. These are compared to similar observations with the ground-based sister instrument TEXES (Texas Echelon cross-Echelle Spectrograph) on the IRTF(Infrared Telescope Facility), showing that EXES will have access to an enlarged spectral range as expected, through reduced atmospheric opacity. In future EXES will be used to complement TEXES for spectral line searches on Titan, geared to detect new molecular species, focusing on spectral regions that are inaccessible from the ground.

Nixon, Conor A.↗

NASA NTRS1986

A Search for Metal Lines in the Spectra of DA White Dwarfs

A theoretical analysis was carried out in order to interpret the ultraviolet spectra of DB white dwarfs obtained earlier with the International Ultraviolet Explorer (IUE) satellite. Here the results of the IUE ultraviolet spectroscopy combined with visual data and model atmospheres of DB white dwarfs are reported. In particular, a search for spectra lines due to the element carbon using the ultraviolet was made. In no case is there a positive detection of carbon and from these data, and upper limits for carbon by number relative to helium are derived in the range of C: He 10 to the minus 5 power to 10 to the minus 7 power for the 16 DB stars with ultraviolet spectra in the temperature range 11400 K T sub EFF less than 2300 K. The low carbon abundances found in the atmospheres of the DB stars agree well with the hypothesis that the atmospheric carbon observed in the cooler DQ members of the helium-rich white dwarf sequence is produced by a convective dredging mechanism.

Wegner, G. A.↗

NASA NTRS1992

Search for spectral lines in cosmic gamma-ray bursts

Time-integrated spectra from 177 gamma-ray bursts observed by the Gamma Ray Spectrometer (GRS) on NASA's Solar Maximum Mission satellite (SMM) have been systematically searched for evidence of emission lines in the range 300 keV and higher. The distribution of fitted line strengths is consistent with what is expected from a random sample of data, suggesting that there are no statistically significant narrow or moderately broadened line features in any of the bursts.

Messina, Daniel C.↗

NASA NTRS1972

Search for coronal line emission from the Cygnus Loop.

The flux from the edges of the Cygnus Loop in the forbidden Fe XIV coronal line at 5303 A is measured to be less than 5 nanoergs per sq cm per sterad per sec (0.017 R) in a 3 A band centered on the line. This upper limit is an order of magnitude lower than the predicted total flux in the line and implies that there must be substantial broadening of the line profile by mass motion or that the temperature is somewhat higher than the present best estimate from X-ray data.

Kurtz, D. W.↗

NASA NTRS1982

A search for UV line variability in R136a

The brightest object in the central cluster of stars in the 30 Doradus nebula is R136a. Optical imaging and ultraviolet spectroscopy show that a luminosity originates in a volume less than 0.1 pc across. A very tight cluster of approximately 30 luminous O and WR stars produces this energy. An alternative interpretation is the possibility that a single supermassive object dominates the light. The visual spectrum is classified as WN 4.5. A common characteristic of WN spectra is variability of the emission lines, especially He II lambda 4686.

Ebbets, D. C.↗

NASA NTRS1984

Search for emission lines in the gaseous halo of edge-on galaxies

Careful reductions of the short wave prime camera (SWP) spectrum was carried out. A line by line inspection of the spectrum was used to eliminate spurious spikes and a median filter applied to eliminate high frequency noise. Upper limits were obtained for far ultraviolet emission from a hot galactic halo.

Bixler, J.↗

NASA NTRS1992

Search for infrared absorption lines of atmospheric chlorine monoxide (ClO)

A search for features of the ClO (1-0) vibration-rotation band has been conducted based on a 5000 signal-to-rms noise ratio IR spectrum derived by coadding 39 high-quality 0.0053/cm resolution solar spectra recorded with the McMath Fourier transform spectrometer on Kitt Peak. Evidence for absorption has been found at the locations of several of the stronger ClO P-branch lines with minimal interference. Detailed results are presented for the P(8.5) and P(7.5) 2Pi3/2-2Pi3/2 lines of Cl-35O at 833.2974 and 834.6249/cm, respectively. If ClO is present in the stratosphere at the concentrations indicated by other methods, our analysis indicates that modest improvements in signal-to-noise ratio and spectral resolution would permit a definitive detection of ClO in IR ground-based spectra.

Rinsland, Curtis P.↗

NASA NTRS2007

AIRSAR Web-Based Data Processing

The AIRSAR automated, Web-based data processing and distribution system is an integrated, end-to-end synthetic aperture radar (SAR) processing system. Designed to function under limited resources and rigorous demands, AIRSAR eliminates operational errors and provides for paperless archiving. Also, it provides a yearly tune-up of the processor on flight missions, as well as quality assurance with new radar modes and anomalous data compensation. The software fully integrates a Web-based SAR data-user request subsystem, a data processing system to automatically generate co-registered multi-frequency images from both polarimetric and interferometric data collection modes in 80/40/20 MHz bandwidth, an automated verification quality assurance subsystem, and an automatic data distribution system for use in the remote-sensor community. Features include Survey Automation Processing in which the software can automatically generate a quick-look image from an entire 90-GB SAR raw data 32-MB/s tape overnight without operator intervention. Also, the software allows product ordering and distribution via a Web-based user request system. To make AIRSAR more user friendly, it has been designed to let users search by entering the desired mission flight line (Missions Searching), or to search for any mission flight line by entering the desired latitude and longitude (Map Searching). For precision image automation processing, the software generates the products according to each data processing request stored in the database via a Queue management system. Users are able to have automatic generation of coregistered multi-frequency images as the software generates polarimetric and/or interferometric SAR data processing in ground and/or slant projection according to user processing requests for one of the 12 radar modes.

Chu, Anhua↗