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.↗

An inertia-free filter line-search algorithm for large-scale nonlinear programming

We present a filter line-search algorithm that does not require inertia information of the linear system. This feature enables the use of a wide range of linear algebra strategies and libraries, which is essential to tackle large-scale problems on modern computing architectures. The proposed approach performs curvature tests along the search step to detect negative curvature and to trigger convexification. We prove that the approach is globally convergent and we implement the approach within a parallel interior-point framework to solve large-scale and highly nonlinear problems. Our numerical tests demonstrate that the inertia-free approach is as efficient as inertia detection via symmetric indefinite factorizations. We also demonstrate that the inertia-free approach can lead to reductions in solution time because it reduces the amount of convexification needed.

Chiang, Nai-Yuan↗

Curved-line search algorithm for ab initio atomic structure relaxation

Ab initio atomic relaxations often take large numbers of steps and long times to converge, especially when the initial atomic configurations are far from the local minimum or there are curved and narrow valleys in the multidimensional potentials. An atomic relaxation method based on on-the-flight force learning and a corresponding curved-line search algorithm is presented to accelerate this process. In this work, results demonstrate the superior performance of this method for metal and magnetic clusters when compared with the conventional conjugate-gradient method.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗

A return mapping algorithm for isotropic and anisotropic plasticity models using a line search method

The numerical integration of constitutive models in computational solid mechanics codes allows for the solution of boundary value problems involving complex material behavior. Metal plasticity models, in particular, have been instrumental in the development of these codes. Here, most plasticity models implemented in computational codes use an isotropic von Mises yield surface. The von Mises, of J 2 , yield surface has a simple predictor-corrector algorithm - the radial return algorithm - to integrate the model.

36 MATERIALS SCIENCE↗

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.↗

A line search algorithm for wind field adjustment with incomplete data and RBF approximation

The problem of concern in this work is the construction of free divergence fields given scattered horizontal components. As customary, the problem is formulated as a PDE constrained least squares problem. The novelty of our approach is to construct the so-called adjusted field, as the unique solution along an appropriately chosen descent direction. The latter is obtained by the adjoint equation technique. It is shown that the classical adjusted field of Sasaki’s is a particular case. On choosing descent directions, the underlying mass consistent model leads to the solution of an elliptic problem which is solved by means of a radial basis functions method. Finally, some numerical results for wind field adjustment are presented.

97 MATHEMATICS AND COMPUTING↗

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↗

Gamma ray tests of Minimal Dark Matter

We reconsider the model of Minimal Dark Matter (a fermionic, hypercharge-less quintuplet of the EW interactions) and compute its gamma ray signatures. We compare them with a number of gamma ray probes: the galactic halo diffuse measurements, the galactic center line searches and recent dwarf galaxies observations. We find that the original minimal model, whose mass is fixed at 9.4 TeV by the relic abundance requirement, is constrained by the line searches from the Galactic Center: it is ruled out if the Milky Way possesses a cuspy profile such as NFW but it is still allowed if it has a cored one. Observations of dwarf spheroidal galaxies are also relevant (in particular searches for lines), and ongoing astrophysical progresses on these systems have the potential to eventually rule out the model. We also explore a wider mass range, which applies to the case in which the relic abundance requirement is relaxed. Most of our results can be safely extended to the larger class of multi-TeV WIMP DM annihilating into massive gauge bosons.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Blind Millimeter Line Emitter Search using ALMA Data Toward Gravitational Lensing Clusters

We present the results of a blind millimeter line emitter search using ALMA Band 6 data with a single-frequency tuning toward four gravitational lensing clusters (RXJ1347.5−1145, Abell S0592, MACS J0416.1−2403, and Abell 2744). We construct 3D signal-to-noise ratio (S/N) cubes with 60 and 100 MHz binning, and search for millimeter line emitters. We do not detect any line emitters with a peak S/N > 5, although we do find a line emitter candidate with a peak S/N ≃ 4.5. These results provide upper limits to the CO(3−2), CO(4−3), CO(5−4), and [C ii] luminosity functions at z ≃ 0.3, 0.7, 1.2, and 6, respectively. Because of the magnification effect of gravitational lensing clusters, the new data provide the first constraints on the CO and [C ii] luminosity functions at unprecedentedly low luminosity levels, i.e., down to ≲10{sup −3} – 10{sup −1} Mpc{sup −3} dex{sup −1} at L{sub CO}{sup ′}∼10{sup 8}--10{sup 10} K km s{sup −1} pc{sup 2} and ≲10{sup −3}–10{sup −2} Mpc{sup −3} dex{sup −1} at L{sub [CII]}∼10{sup 8}--10{sup 10} L{sub ⊙}, respectively. Although the constraints to date are not yet stringent, we find that the evolution of the CO and [C ii] luminosity functions are broadly consistent with the predictions of semi-analytical models. This study demonstrates that the wide observations with a single-frequency tuning toward gravitational lensing clusters are promising for constraining the CO and [C ii] luminosity functions.

79 ASTRONOMY AND ASTROPHYSICS↗

A variant nonmonotone smoothing algorithm with improved numerical results for large-scale LWCPs

This paper considers the linear weighted complementarity problem (denoted by LWCP) introduced by Potra (SIAM J Optim 22:1634–1654, 2012). Based on two weighted smoothing functions, we propose a new nonmonotone smoothing algorithm for solving the LWCP and establish its global and local quadratic convergence without the strict complementarity assumption. Compared to existing nonmonotone smoothing algorithms, the proposed algorithm solves the linear system only approximately which can save the computation work when one solves large-scale LWCPs. Moreover, the nonmonotone line search technique adopted in this paper includes the usual monotone line search and some existing nonmonotone line searches as special cases. Numerical results show that our algorithm is considerably efficient for solving large-scale LWCPs.

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↗