Search NASA⌕ Search

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.

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

At least 19 records

BATSE gamma-ray burst line search. 1: Search for narrow lines in spectroscopy detector data

Analysis of data from the Spectroscopy Detectors (SDs) of the Burst and Transient Source Experiment (BATSE) on the Compton Gamma Ray Observatory (GRO) has found no convincing line features in the spectra of gamma-ray bursts (GRBs) in almost 3 years of operation, in contrast to expectations based on results from other experiments. In this Letter we discuss the visual search for narrow lines in the SD data. The search has examined 192 bursts, of which approximately 18 were intense enough that lines similar to those seen by instruments on the Ginga satellite would have been visible between approximately 20 and approximately 100 keV. A simplified calculation shows that the BATSE and Ginga results are consistent at the 13% level.

Palmer, David M.↗

Venus. I - Carbon monoxide distribution and molecular-line searches

An observational program to study variations of the vertical distribution of CO in the Venus atmosphere is presented. Measurements of the J = 0 - 1 absorption line at 2.6 mm wavelength are reported for two phase angles in 1977, one near eastern elongation (February) and the other near inferior conjunction (April). The two spectra are significantly different, with the April absorption line being narrower and deeper. The results of numerical inversion calculations show that the CO mixing ratio increases by a factor of approximately 100 between 78 and 100 km and that the CO abundance above approximately 100 km is greatest on the night-side hemisphere. These conclusions are in qualitative agreement with theoretical models. In addition to the CO observations, a search for other molecules was made to provide further information on the composition of the Venus middle atmosphere. The J = 0 - 1 transition of (C-13)O was detected and upper limits were derived for nine other molecules.

Wilson, W. J.↗

BATSE gamma-ray burst line search. 2: Bayesian consistency methodology

We describe a Bayesian methodology to evaluate the consistency between the reported Ginga and Burst and Transient Source Experiment (BATSE) detections of absorption features in gamma-ray burst spectra. Currently no features have been detected by BATSE, but this methodology will still be applicable if and when such features are discovered. The Bayesian methodology permits the comparison of hypotheses regarding the two detectors' observations and makes explicit the subjective aspects of our analysis (e.g., the quantification of our confidence in detector performance). We also present non-Bayesian consistency statistics. Based on preliminary calculations of line detectability, we find that both the Bayesian and non-Bayesian techniques show that the BATSE and Ginga observations are consistent given our understanding of these detectors.

Band, D. L.↗

Analysis of the SiMPL Method for Density-Based Topology Optimization

We present a rigorous convergence analysis of a new method for density-based topology optimization that provides pointwise bound-preserving design updates and faster convergence than other popular first-order topology optimization methods. Due to its strong bound preservation, the method is exceptionally robust, as demonstrated in numerous examples here and in the companion article [D. Kim et al., Struct. Multidiscip. Optim., 68 (2025), 74]. Furthermore, it is easy to implement with clear structure and analytical expressions for the updates. Our analysis covers two versions of the method, characterized by the employed line search strategies. We consider a modified Armijo backtracking line search and a Bregman backtracking line search. For both line search algorithms, our algorithm delivers a strict monotone decrease in the objective function and further intuitive convergence properties, e.g., strong and pointwise convergence of the density variables on the active sets, norm convergence to zero of the increments, convergence of the Lagrange multipliers, and more. In addition, the numerical experiments demonstrate apparent mesh-independent convergence of the algorithm. Here, we refer to the new algorithm as the SiMPL method (pronounced “simple”), which stands for Sigmoidal Mirror descent with a Projected Latent variable.

97 MATHEMATICS AND COMPUTING↗

Optimization methods, flux conserving methods for steady state Navier-Stokes equation

Navier-Stokes equation as discretized by new flux conserving method proposed by Chang and Scott results in the system: vector F(vector x) = 0, where F is a vector valued function. The Optimization method we use is based on Quasi-Newton methods: given a nonlinear function vector F(vector x) = 0, we solve, Delta(vector x) = -BF(vector x), where Delta(vector x) is the correction term and B is the inverse Jacobian of F(x). Then, iteratively, vector(x(sub (i+1))) = vector(x (sub i)) + alpha.Delta(vector x(sub i)), where alpha is a line search correction term determined by a line search routine. We use the BFCG's update the Jacobian matrix B(sub k) at each iteration. It is well known that B(sub k) approaches B(*) at the solution X(*). This algorithm has several advantages over the Newton-Raphson method. For example, we do not need to calculate the Jacobian matrix at each iteration which is computationally very expensive.

Adeyeye, John↗

Surrogate Hessian accelerated structural optimization for stochastic electronic structure theories

In this work, we present an efficient energy-based method for structural optimization with stochastic electronic structure theories, such as diffusion quantum Monte Carlo (DMC). This method is based on robust line-search energy minimization in reduced parameter space, exploiting approximate but accurate Hessian information from a surrogate theory, such as density functional theory. The surrogate theory is also used to characterize the potential energy surface, allowing for simple but reliable ways to maximize statistical efficiency while retaining controllable accuracy. We demonstrate the method by finding the minimum DMC energy structures of the selected flake-like aromatic molecules, such as benzene, coronene, and ovalene, represented by 2, 6, and 19 structural parameters, respectively. In each case, the energy minimum is found within two parallel line-search iterations. The method is near-optimal for a line-search technique and suitable for a broad range of applications. It is easily generalized to any electronic structure method where forces and stresses are still under active development and implementation, such as diffusion Monte Carlo, auxiliary-field Monte Carlo, and stochastic configuration interaction, as well as deterministic approaches such as the random-phase approximation. Accurate and efficient means of geometry optimization could shed light on a broad class of materials and molecules, showing high sensitivity of induced properties to structural variables.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Si XIII and Si XIV line emission search with the ANS crystal spectrometer

The final results of the search for Si XIII and Si XIV line emission, using the ANS Bragg crystal spectrometer, are presented. No positive line detection was achieved in any of the measurements made on several types of cosmic object; i.e., a transient X-ray source, close binary systems, supernova remnants, GX sources, and clusters of galaxies. Three-sigma upper limits for discrete line emission from these objects are reported and compared with line strengths inferred from other proportional-counter and Bragg spectrometer data. The present upper limit of 1.0 eV for the equivalent width of a narrow Si XIV line emission from the X-ray nova A0620-00 is an order of magnitude lower than previous limits set by other experiments.

Parsignault, D. R.↗

Low-Thrust Trajectory Optimization with Simplified SQP Algorithm

The problem of low-thrust trajectory optimization in highly perturbed dynamics is a stressing case for many optimization tools. Highly nonlinear dynamics and continuous thrust are each, separately, non-trivial problems in the field of optimal control, and when combined, the problem is even more difficult. This paper de-scribes a fast, robust method to design a trajectory in the CRTBP (circular restricted three body problem), beginning with no or very little knowledge of the system. The approach is inspired by the SQP (sequential quadratic programming) algorithm, in which a general nonlinear programming problem is solved via a sequence of quadratic problems. A few key simplifications make the algorithm presented fast and robust to initial guess: a quadratic cost function, neglecting the line search step when the solution is known to be far away, judicious use of end-point constraints, and mesh refinement on multiple shooting with fixed-step integration.In comparison to the traditional approach of plugging the problem into a “black-box” NLP solver, the methods shown converge even when given no knowledge of the solution at all. It was found that the only piece of information that the user needs to provide is a rough guess for the time of flight, as the transfer time guess will dictate which set of local solutions the algorithm could converge on. This robustness to initial guess is a compelling feature, as three-body orbit transfers are challenging to design with intuition alone. Of course, if a high-quality initial guess is available, the methods shown are still valid.We have shown that endpoints can be efficiently constrained to lie on 3-body repeating orbits, and that time of flight can be optimized as well. When optimizing the endpoints, we must make a trade between converging quickly on sub-optimal endpoints or converging more slowly on end-points that are arbitrarily close to optimal. It is easy for the mission design engineer to adjust this trade based on the problem at hand.The biggest limitation to the algorithm at this point is that multi-revolution transfers (greater than 2 revolutions) do not work nearly as well. This restriction comes in because the relationship between node 1 and node N becomes increasingly nonlinear as the angular distance grows. Trans-fers with more than about 1.5 complete revolutions generally require the line search to improve convergence. Future work includes: Comparison of this algorithm with other established tools; improvements to how multiple-revolution transfers are handled; parallelization of the Jacobian computation; in-creased efficiency for the line search; and optimization of many more trajectories between a variety of 3-body orbits.

Parrish, Nathan L.↗

On-Line Literature Search and Full Articles in the NASA ADS

The ADS provides free world-wide on-line access to over 2.2 million abstracts and over 1 million scanned pages of the astronomical and planetary literature plus over 4 million links to other relevant on-line information at http://ads.harvard.edu. Additional information is contained in the original extended abstract.

Eichhorn, G.↗

The chromospheres of classical Cepheids. II - High-resolution profiles of the Mg II h and k lines. III - A search for transition region emission lines

The profiles of the Mg II h and k lines near 2900 A are studied on the basis of IUE long wavelength camera high resolution spectra for a number of phases of each of five Cepheids. An emission feature often appears at the centers of the two lines, and there are central absorption features as well, due to interstellar or circumstellar gas, which are often multiple and may or may not originate in a region which is at least several tenths of a stellar radius in extent. While the mean flux of the emission is lower than for nonvariable stars of similar temperature and luminosity, the maximum strength of the emission is in keeping with the instantaneous temperature. In the second part of this paper, it is noted that little significant chromospheric emission could be found in the short wavelength region for the shortest period star in the sample, Delta Cep. In order to detect the emissions or place lower limits on the fluxes, longer exposures have been obtained at several critical phases for three of the five stars. While the strength, when detected, is similar to that of nonvariables, the upper limits at other places indicate smaller fluxes than those observed in nonvariable stars.

Schmidt, E. G.↗

A unified funnel restoration SQP algorithm

We consider nonlinearly constrained optimization problems and discuss a generic double-loop framework consisting of basic algorithmic ingredients that unifies a broad range of nonlinear optimization solvers. This framework has been implemented in the open-source solver Uno, a Swiss Army knife-like C++ optimization framework that unifies many nonlinearly constrained nonconvex optimization solvers. We illustrate the framework with a sequential quadratic programming (SQP) algorithm that maintains an acceptable upper bound on the constraint violation, called a funnel, that is monotonically decreased to control the feasibility of the iterates. Infeasible quadratic subproblems are handled by a feasibility restoration strategy. Globalization is controlled by a line search or a trust-region method. We prove global convergence of the trust-region funnel SQP method, building on known results from filter methods. We implement the algorithm in Uno, and we provide extensive test results for the trust-region line-search funnel SQP on small CUTEst instances.

Kiessling, David [Katholieke Univ. Leuven, Heverle↗

Neglecting Model Parametric Uncertainty Can Drastically Underestimate Flood Risks

Abstract Floods drive dynamic and deeply uncertain risks for people and infrastructures. Uncertainty characterization is a crucial step in improving the predictive understanding of multi‐sector dynamics and the design of risk‐management strategies. Current approaches to estimate flood hazards often sample only a relatively small subset of the known unknowns, for example, the uncertainties surrounding the model parameters. This approach neglects the impacts of key uncertainties on hazards and system dynamics. Here we mainstream a recently developed method for Bayesian inference to calibrate a computationally expensive distributed hydrologic model. We compare three different calibration approaches: (a) stepwise line search, (b) precalibration or screening, and (c) the Fast Model Calibrations (FaMoS) approach. FaMoS deploys a particle‐based approach that takes advantage of the massive parallelization afforded by modern high‐performance computing systems. We quantify how neglecting parametric uncertainty and data discrepancy can drastically underestimate extreme flood events and risks. Precalibration improves prediction skill score over a stepwise line search. The Bayesian calibration improves the uncertainty characterization of model parameters and flood risk projections.

54 ENVIRONMENTAL SCIENCES↗

Inexact Newton-CG algorithms with complexity guarantees

Abstract We consider variants of a recently developed Newton-CG algorithm for nonconvex problems (Royer, C. W. & Wright, S. J. (2018) Complexity analysis of second-order line-search algorithms for smooth nonconvex optimization. SIAM J. Optim., 28, 1448–1477) in which inexact estimates of the gradient and the Hessian information are used for various steps. Under certain conditions on the inexactness measures, we derive iteration complexity bounds for achieving $\epsilon $-approximate second-order optimality that match best-known lower bounds. Our inexactness condition on the gradient is adaptive, allowing for crude accuracy in regions with large gradients. We describe two variants of our approach, one in which the step size along the computed search direction is chosen adaptively, and another in which the step size is pre-defined. To obtain second-order optimality, our algorithms will make use of a negative curvature direction on some steps. These directions can be obtained, with high probability, using the randomized Lanczos algorithm. In this sense, all of our results hold with high probability over the run of the algorithm. We evaluate the performance of our proposed algorithms empirically on several machine learning models. Our approach is a first attempt to introduce inexact Hessian and/or gradient information into the Newton-CG algorithm of Royer & Wright (2018, Complexity analysis of second-order line-search algorithms for smooth nonconvex optimization. SIAM J. Optim., 28, 1448–1477).

Mathematics↗

Geometry-independent microstructure optimization for electron beam powder bed fusion additive manufacturing

The ability to manipulate the formation of microstructure is one of the potential advantages of additive manufacturing. Yet, the additive manufacturing process is riddled with complex interactions between processing parameters, geometry, and spot melting sequence which makes the task of controlling microstructure challenging. This paper proposes a method to solve the microstructure texture optimization problem by leveraging established optimization techniques and increasingly fast and accurate analytical heat transfer models. Respectively, we apply two different optimization algorithms, genetic algorithm and concurrent greedy line search, in order to induce arbitrarily shaped microstructure regions and we use a heat transfer model to evaluate the fitness of solutions in an iterative approach that is far more efficient than pure trial and error. The objective of the optimization algorithm is to control local thermal conditions – hence microstructure formation – during the melting process by manipulating the order and the dwell time of all the points of the infill pattern sequence. We then analyze the optimized sequence to determine important path characteristics that affect the microstructure formation. Through examples, we show that relative order and frequency, as measured by weighted average and variance of spot order, are important factors that influence the final characteristics.

36 MATERIALS SCIENCE↗

Spectroscopy of an unusual emission line M star

Moderate-resolution spectroscopy of an unusual late-type faint emission-line star, PC 0025 + 0047, is reported. A very strong (greater than 250 A equivalent width) an H-alpha emission line was detected by the present automated line search algorithm. The spectrum was found to have two unresolved emission lines (H-alpha and H-beta) near zero velocity, superposed on the absorption spectrum of a very red M dwarf which has strong K I, and relatively weak bands of TiO. From the weakness of the subordinate lines of Na I (8192 A) and other spectral features, it is inferred that it is definitely a cooler, and probably fainter, analog of LHS 2924. The strength of the emission lines indicates that PC 0025 + 0447 is very young and may be a fading predecessor brown drawf at an estimated M(bol) approaching 14m at a distance of about 60 pc.

Schneider, Donald P.↗