Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “clustering algorithm”

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 433 records · Page 24
All sourcesNASA NTRSDOE OSTI
NASA NTRS1995

Numerical Simulations of High Enthalpy Pulse Facilities

Axisymmetric flows within shock tubes and expansion tubes are simulated including the effects of finite rate chemistry and both laminar and turbulent boundary layers. The simulations demonstrate the usefulness of computational fluid dynamics for characterizing the flows in high enthalpy pulse facilities. The modeling and numerical requirements necessary to simulate these flows accurately are also discussed. Although there is a large body of analysis which explains and quantifies the boundary layer growth between the shock and the interface in a shock tube, there is a need for more detailed solutions. Phenomena such as thermochemical nonequilibrium. or turbulent transition behind the shock are excluded in the assumptions of Mirels' analysis. Additionally there is inadequate capability to predict the influence of the boundary layer on the expanded gas behind the interface. Quantifying the gas in this region is particularly important in expansion tubes because it is the location of the test gas. Unsteady simulations of the viscous flow in shock tubes are computationally expensive because they must follow features such as a shock wave over the length of the facility and simultaneously resolve the small length scales within the boundary layer. As a result, efficient numerical algorithms are required. The numerical approach of the present work is to solve the axisymmetric gas dynamic equations using an finite-volume formulation where the inviscid fluxes are computed with a upwind TVD scheme. Multiple species equations are included in the formulation so that finite-rate chemistry can be modeled. The simulations cluster grid points at the shock and interface and translate this clustered grid with these features to minimize numerical errors. The solutions are advanced at a CFL number of less than one based on the inviscid gas dynamics. To avoid limitations on the time step due to the viscous terms, these terms are treated implicitly. This requires a block tri-diagonal matrix inversion along each line of cells normal to the wall. The cost of this inversion is more than offset by the larger allowable time step. The source terms representing the finite-rate chemical kinetics are also treated implicitly. An algebraic turbulence model for compressible flow is used. The flow in a low pressure shock tube is computed and the results are compared with Mirels'analysis. The driven gas is nitrogen at 70 Pa, and the incident shock speed is approximately 2.9 km/sec so that there is little dissociation. The simulations include a laminar boundary layer and are run until the limiting flow regime is achieved. At this limit, the shock and interface travel at the same velocity because the amount of driven gas between these two features remains the same: the mass flow across the shock is equal to the mass of gas being entrained at the interface by the boundary layer. Simulations with several grids are presented to establish the grid independence of the solution, Good agreement is achieved between Mirels' correlations and the computations. This is expected since the flow conditions are chosen to be consistent with the assumptions used in Mirels' analysis. This comparison adds credibility to the numerical approach and highlights some of the differences between the theory and the detailed simulations. In addition, simulations of the HYPULSE expansion tube are presented for two operating conditions and the computations are compared to experimental data. The operating gas for both cases is nitrogen. One test condition is at a total enthalpy of 15.2 MJ/Kg and a relatively low pressure of 2 kPa. This case is characterized by a laminar boundary layer and significant chemical nonequilibrium. in the acceleration gas. The second test condition is at a total enthalpy of 10.2 MJ/Kg and a pressure of 38 kPa and is characterized by a turbulent boundary layer. The simulations compare well with experiment and reveal that the nonuniformity in pressure observed during the test time is related to variations in the boundary layer displacement thickness.

Wilson, Gregory J.↗
NASA NTRS2007

Automated Knowledge Discovery From Simulators

A computational method, SimLearn, has been devised to facilitate efficient knowledge discovery from simulators. Simulators are complex computer programs used in science and engineering to model diverse phenomena such as fluid flow, gravitational interactions, coupled mechanical systems, and nuclear, chemical, and biological processes. SimLearn uses active-learning techniques to efficiently address the "landscape characterization problem." In particular, SimLearn tries to determine which regions in "input space" lead to a given output from the simulator, where "input space" refers to an abstraction of all the variables going into the simulator, e.g., initial conditions, parameters, and interaction equations. Landscape characterization can be viewed as an attempt to invert the forward mapping of the simulator and recover the inputs that produce a particular output. Given that a single simulation run can take days or weeks to complete even on a large computing cluster, SimLearn attempts to reduce costs by reducing the number of simulations needed to effect discoveries. Unlike conventional data-mining methods that are applied to static predefined datasets, SimLearn involves an iterative process in which a most informative dataset is constructed dynamically by using the simulator as an oracle. On each iteration, the algorithm models the knowledge it has gained through previous simulation trials and then chooses which simulation trials to run next. Running these trials through the simulator produces new data in the form of input-output pairs. The overall process is embodied in an algorithm that combines support vector machines (SVMs) with active learning. SVMs use learning from examples (the examples are the input-output pairs generated by running the simulator) and a principle called maximum margin to derive predictors that generalize well to new inputs. In SimLearn, the SVM plays the role of modeling the knowledge that has been gained through previous simulation trials. Active learning is used to determine which new input points would be most informative if their output were known. The selected input points are run through the simulator to generate new information that can be used to refine the SVM. The process is then repeated. SimLearn carefully balances exploration (semi-randomly searching around the input space) versus exploitation (using the current state of knowledge to conduct a tightly focused search). During each iteration, SimLearn uses not one, but an ensemble of SVMs. Each SVM in the ensemble is characterized by different hyper-parameters that control various aspects of the learned predictor - for example, whether the predictor is constrained to be very smooth (nearby points in input space lead to similar output predictions) or whether the predictor is allowed to be "bumpy." The various SVMs will have different preferences about which input points they would like to run through the simulator next. SimLearn includes a formal mechanism for balancing the ensemble SVM preferences so that a single choice can be made for the next set of trials.

Burl, Michael↗
NASA NTRS1987

A study of the feasibility of using sea and wind information from the ERS-1 satellite. Part 1: Wind scatterometer data

The use of scatterometer and altimeter data in wind and wave assimilation, and the benefits this offers for quality assurance and validation of ERS-1 data were examined. Real time use of ERS-1 data was simulated through assimilation of Seasat scatterometer data. The potential for quality assurance and validation is demonstrated by documenting a series of substantial problems with the scatterometer data, which are known but took years to establish, or are new. A data impact study, and an analysis of the performance of ambiguity removal algorithms on real and simulated data were conducted. The impact of the data on analyses and forecasts is large in the Southern Hemisphere, generally small in the Northern Hemisphere, and occasionally large in the Tropics. Tests with simulated data give more optimistic results than tests with real data. Errors in ambiguity removal results occur in clusters. The probabilities which can be calculated for the ambiguous wind directions on ERS-1 contain more information than is given by a simple ranking of the directions.

Anderson, D.↗
NASA NTRS1989

On polynomial preconditioning for indefinite Hermitian matrices

The minimal residual method is studied combined with polynomial preconditioning for solving large linear systems (Ax = b) with indefinite Hermitian coefficient matrices (A). The standard approach for choosing the polynomial preconditioners leads to preconditioned systems which are positive definite. Here, a different strategy is studied which leaves the preconditioned coefficient matrix indefinite. More precisely, the polynomial preconditioner is designed to cluster the positive, resp. negative eigenvalues of A around 1, resp. around some negative constant. In particular, it is shown that such indefinite polynomial preconditioners can be obtained as the optimal solutions of a certain two parameter family of Chebyshev approximation problems. Some basic results are established for these approximation problems and a Remez type algorithm is sketched for their numerical solution. The problem of selecting the parameters such that the resulting indefinite polynomial preconditioners speeds up the convergence of minimal residual method optimally is also addressed. An approach is proposed based on the concept of asymptotic convergence factors. Finally, some numerical examples of indefinite polynomial preconditioners are given.

Freund, Roland W.↗
NASA NTRS2011

Evolutionary Computational Methods for Identifying Emergent Behavior in Autonomous Systems

A technique based on Evolutionary Computational Methods (ECMs) was developed that allows for the automated optimization of complex computationally modeled systems, such as autonomous systems. The primary technology, which enables the ECM to find optimal solutions in complex search spaces, derives from evolutionary algorithms such as the genetic algorithm and differential evolution. These methods are based on biological processes, particularly genetics, and define an iterative process that evolves parameter sets into an optimum. Evolutionary computation is a method that operates on a population of existing computational-based engineering models (or simulators) and competes them using biologically inspired genetic operators on large parallel cluster computers. The result is the ability to automatically find design optimizations and trades, and thereby greatly amplify the role of the system engineer.

Terrile, Richard J.↗
NASA NTRS2016

DeepSAT: A Deep Learning Approach to Tree-Cover Delineation in 1-m NAIP Imagery for the Continental United States

High resolution tree cover classification maps are needed to increase the accuracy of current land ecosystem and climate model outputs. Limited studies are in place that demonstrates the state-of-the-art in deriving very high resolution (VHR) tree cover products. In addition, most methods heavily rely on commercial softwares that are difficult to scale given the region of study (e.g. continents to globe). Complexities in present approaches relate to (a) scalability of the algorithm, (b) large image data processing (compute and memory intensive), (c) computational cost, (d) massively parallel architecture, and (e) machine learning automation. In addition, VHR satellite datasets are of the order of terabytes and features extracted from these datasets are of the order of petabytes. In our present study, we have acquired the National Agriculture Imagery Program (NAIP) dataset for the Continental United States at a spatial resolution of 1-m. This data comes as image tiles (a total of quarter million image scenes with ~60 million pixels) and has a total size of ~65 terabytes for a single acquisition. Features extracted from the entire dataset would amount to ~8-10 petabytes. In our proposed approach, we have implemented a novel semi-automated machine learning algorithm rooted on the principles of "deep learning" to delineate the percentage of tree cover. Using the NASA Earth Exchange (NEX) initiative, we have developed an end-to-end architecture by integrating a segmentation module based on Statistical Region Merging, a classification algorithm using Deep Belief Network and a structured prediction algorithm using Conditional Random Fields to integrate the results from the segmentation and classification modules to create per-pixel class labels. The training process is scaled up using the power of GPUs and the prediction is scaled to quarter million NAIP tiles spanning the whole of Continental United States using the NEX HPC supercomputing cluster. An initial pilot over the state of California spanning a total of 11,095 NAIP tiles covering a total geographical area of 163,696 sq. miles has produced true positive rates of around 88 percent for fragmented forests and 74 percent for urban tree cover areas, with false positive rates lower than 2 percent for both landscapes.

Imagery↗
NASA NTRSDate not supplied

NASA/GEWEX SRB Surface Radiation Budget Fluxes Through the Prism of Weather States

The NASA/GEWEX Surface Radiation Budget Version 4 (SRB Rel4) product is now publicly available, covering the period from July 1983 through June 2017. This supersedes the SRB Rel3 (Stackhouse et al., 2011) product which has been used in the community for a wide variety of applications, including climate model validation, agriculture, solar energy, and architecture. SRB Rel4 uses the newly recalibrated and processed ISCCP HXS product as its primary input for cloud and radiance data, replacing ISCCP DX with a ninefold increase in pixel count (10km instead of 30km). This version retains a 1°x1° resolution but benefits from a much larger number of samples per grid box than the SRB Rel3. ISCCP also provides an atmospheric temperature and moisture dataset known as nnHIRS which we use here, along with Seaflux and Landflux surface and near-surface meteorological parameters. Rel4 incorporates several important algorithm improvements. These include recalculated shortwave (SW) atmospheric transmissivities and reflectivities yielding a somewhat less transmissive atmosphere. Both shortwave and longwave (LW) now also include variable aerosol composition and radiative properties, allowing for the use of a detailed aerosol history from the Max Planck Institute Aerosol Climatology (MACv1). LW and SW algorithms now produce pristine sky fluxes, allowing the aerosol flux effects to be quantified. For SW, ocean albedo and snow/ice albedo are improved from Release 3. Total solar irradiance is now variable, and reduced to an average of 1361 Wm-2. The radiative treatment of ice cloud is improved. For the LW, a climatological monthly varying spectral surface emissivity is added. Here we evaluate the SRB Rel4 top of atmosphere (TOA) and surface fluxes in the context of weather states and oceanic regions. Weather states (Tselioudis et al., 2013, Tselioudis et al., 2021) are defined by K-means clustering 2-D histograms of satellite-retrieved cloud optical depths and cloud top pressures. The most recent (Tselioudis et al., 2021) weather states derived from the International Satellite Cloud Climatology Project (ISCCP) H-series data results in eight cloud weather states and one clear sky weather state, for a total of nine weather states. We examine the statistics of SRB Rel4 fluxes for each weather state and a variety of relevant land and ocean regions. We compare to similar analyses performed on CERES EBAF and SYN1Deg flux products, and validate against Baseline Surface Radiometer Network (BSRN) land stations and Pacific Marine Environmental Laboratory (PMEL) ocean buoy data. It is demonstrated that the weather state concept is valuable when examining the comparative strengths and weaknesses of satellite radiative flux algorithms.

Atmospheric Radiation↗
NASA NTRS1988

Transonic Navier-Stokes computations of strake-generated vortex interactions for a fighter-like configuration

Transonic Euler/Navier-Stokes computations are accomplished for wing-body flow fields using a computer program called Transonic Navier-Stokes (TNS). The wing-body grids are generated using a program called ZONER, which subdivides a coarse grid about a fighter-like aircraft configuration into smaller zones, which are tailored to local grid requirements. These zones can be either finely clustered for capture of viscous effects, or coarsely clustered for inviscid portions of the flow field. Different equation sets may be solved in the different zone types. This modular approach also affords the opportunity to modify a local region of the grid without recomputing the global grid. This capability speeds up the design optimization process when quick modifications to the geometry definition are desired. The solution algorithm embodied in TNS is implicit, and is capable of capturing pressure gradients associated with shocks. The algebraic turbulence model employed has proven adequate for viscous interactions with moderate separation. Results confirm that the TNS program can successfully be used to simulate transonic viscous flows about complicated 3-D geometries.

Reznick, Steve↗
NASA NTRS1991

Analytic gradients for coupled-cluster energies that include noniterative connected triple excitations - Application to cis- and trans-HONO

An efficient formulation of the analytic energy gradient for the single and double excitation coupled-cluster method that includes a perturbational estimate of the effects of connected triple excitations is presented. The formulation has a small computational cost, and the algebraic manipulations may be applied generally to the analytic gradient of Moller-Plesset perturbation theory energies. The new formulation has been implemented in an efficient set of programs that utilize highly vectorized algorithms and has been used to investigate the equilibrium structures, harmonic vibrational frequencies, IR intensities, and energy separation of cis- and trans-HONO.

Lee, Timothy J.↗
NASA NTRS1993

Design of partially supervised classifiers for multispectral image data

A partially supervised classification problem is addressed, especially when the class definition and corresponding training samples are provided a priori only for just one particular class. In practical applications of pattern classification techniques, a frequently observed characteristic is the heavy, often nearly impossible requirements on representative prior statistical class characteristics of all classes in a given data set. Considering the effort in both time and man-power required to have a well-defined, exhaustive list of classes with a corresponding representative set of training samples, this 'partially' supervised capability would be very desirable, assuming adequate classifier performance can be obtained. Two different classification algorithms are developed to achieve simplicity in classifier design by reducing the requirement of prior statistical information without sacrificing significant classifying capability. The first one is based on optimal significance testing, where the optimal acceptance probability is estimated directly from the data set. In the second approach, the partially supervised classification is considered as a problem of unsupervised clustering with initially one known cluster or class. A weighted unsupervised clustering procedure is developed to automatically define other classes and estimate their class statistics. The operational simplicity thus realized should make these partially supervised classification schemes very viable tools in pattern classification.

Jeon, Byeungwoo↗
NASA NTRS2013

Mixture-Tuned, Clutter Matched Filter for Remote Detection of Subpixel Spectral Signals

Mapping localized spectral features in large images demands sensitive and robust detection algorithms. Two aspects of large images that can harm matched-filter detection performance are addressed simultaneously. First, multimodal backgrounds may thwart the typical Gaussian model. Second, outlier features can trigger false detections from large projections onto the target vector. Two state-of-the-art approaches are combined that independently address outlier false positives and multimodal backgrounds. The background clustering models multimodal backgrounds, and the mixture tuned matched filter (MT-MF) addresses outliers. Combining the two methods captures significant additional performance benefits. The resulting mixture tuned clutter matched filter (MT-CMF) shows effective performance on simulated and airborne datasets. The classical MNF transform was applied, followed by k-means clustering. Then, each cluster s mean, covariance, and the corresponding eigenvalues were estimated. This yields a cluster-specific matched filter estimate as well as a cluster- specific feasibility score to flag outlier false positives. The technology described is a proof of concept that may be employed in future target detection and mapping applications for remote imaging spectrometers. It is of most direct relevance to JPL proposals for airborne and orbital hyperspectral instruments. Applications include subpixel target detection in hyperspectral scenes for military surveillance. Earth science applications include mineralogical mapping, species discrimination for ecosystem health monitoring, and land use classification.

Thompson, David R.↗
NASA NTRS2003

Parallel Signal Processing and System Simulation using aCe

Recently, networked and cluster computation have become very popular for both signal processing and system simulation. A new language is ideally suited for parallel signal processing applications and system simulation since it allows the programmer to explicitly express the computations that can be performed concurrently. In addition, the new C based parallel language (ace C) for architecture-adaptive programming allows programmers to implement algorithms and system simulation applications on parallel architectures by providing them with the assurance that future parallel architectures will be able to run their applications with a minimum of modification. In this paper, we will focus on some fundamental features of ace C and present a signal processing application (FFT).

Dorband, John E.↗
NASA NTRS2010

Extracting Independent Local Oscillatory Geophysical Signals by Geodetic Tropospheric Delay

Zenith Tropospheric Delay (ZTD) due to water vapor derived from space geodetic techniques and numerical weather prediction simulated-reanalysis data exhibits non-linear and non-stationary properties akin to those in the crucial geophysical signals of interest to the research community. These time series, once decomposed into additive (and stochastic) components, have information about the long term global change (the trend) and other interpretable (quasi-) periodic components such as seasonal cycles and noise. Such stochastic component(s) could be a function that exhibits at most one extremum within a data span or a monotonic function within a certain temporal span. In this contribution, we examine the use of the combined Ensemble Empirical Mode Decomposition (EEMD) and Independent Component Analysis (ICA): the EEMD-ICA algorithm to extract the independent local oscillatory stochastic components in the tropospheric delay derived from the European Centre for Medium-Range Weather Forecasts (ECMWF) over six geodetic sites (HartRAO, Hobart26, Wettzell, Gilcreek, Westford, and Tsukub32). The proposed methodology allows independent geophysical processes to be extracted and assessed. Analysis of the quality index of the Independent Components (ICs) derived for each cluster of local oscillatory components (also called the Intrinsic Mode Functions (IMFs)) for all the geodetic stations considered in the study demonstrate that they are strongly site dependent. Such strong dependency seems to suggest that the localized geophysical signals embedded in the ZTD over the geodetic sites are not correlated. Further, from the viewpoint of non-linear dynamical systems, four geophysical signals the Quasi-Biennial Oscillation (QBO) index derived from the NCEP/NCAR reanalysis, the Southern Oscillation Index (SOI) anomaly from NCEP, the SIDC monthly Sun Spot Number (SSN), and the Length of Day (LoD) are linked to the extracted signal components from ZTD. Results from the synchronization analysis show that ZTD and the geophysical signals exhibit (albeit subtle) site dependent phase synchronization index.

Botai, O. J.↗
NASA NTRS1995

Computational strategies for three-dimensional flow simulations on distributed computer systems

This research effort is directed towards an examination of issues involved in porting large computational fluid dynamics codes in use within the industry to a distributed computing environment. This effort addresses strategies for implementing the distributed computing in a device independent fashion and load balancing. A flow solver called TEAM presently in use at Lockheed Aeronautical Systems Company was acquired to start this effort. The following tasks were completed: (1) The TEAM code was ported to a number of distributed computing platforms including a cluster of HP workstations located in the School of Aerospace Engineering at Georgia Tech; a cluster of DEC Alpha Workstations in the Graphics visualization lab located at Georgia Tech; a cluster of SGI workstations located at NASA Ames Research Center; and an IBM SP-2 system located at NASA ARC. (2) A number of communication strategies were implemented. Specifically, the manager-worker strategy and the worker-worker strategy were tested. (3) A variety of load balancing strategies were investigated. Specifically, the static load balancing, task queue balancing and the Crutchfield algorithm were coded and evaluated. (4) The classical explicit Runge-Kutta scheme in the TEAM solver was replaced with an LU implicit scheme. And (5) the implicit TEAM-PVM solver was extensively validated through studies of unsteady transonic flow over an F-5 wing, undergoing combined bending and torsional motion. These investigations are documented in extensive detail in the dissertation, 'Computational Strategies for Three-Dimensional Flow Simulations on Distributed Computing Systems', enclosed as an appendix.

Sankar, Lakshmi N.↗
NASA NTRS2012

Implementation and Testing of the First Prompt Search for Electromagnetic Counterparts to Gravitational Wave Transients

A transient astrophysical event observed in both gravitational wave (OW) and electromagnetic (EM) channels would yield rich scientific rewards. A first program initiating EM follow-ups to possible transient OW events has been developed and exercised by the LIGO and Virgo community in association with several partners. In this paper, we describe and evaluate the methods used to promptly identify and localize OW event candidates and to request images of targeted sky locations. Methods. During two observing periods (Dec 172009 to Jan 8 2010 and Sep 2 to Oct 20 2010), a low-latency analysis pipeline was used to identify OW event candidates and to reconstruct maps of possible sky locations. A catalog of nearby galaxies and Milky Way globular clusters was used to select the most promising sky positions to be imaged, and this directional information was delivered to EM observatories with time lags of about thirty minutes. A Monte Carlo simulation has been used to evaluate the low-latency OW pipeline's ability to reconstruct source positions correctly. Results. For signals near the detection threshold, our low-latency algorithms often localized simulated GW burst signals to tens of square degrees, while neutron star/neutron star inspirals and neutron star/black hole inspirals were localized to a few hundred square degrees. Localization precision improves for moderately stronger signals. The correct sky location of signals well above threshold and originating from nearby galaxies may be observed with approx.50% or better probability with a few pointings of wide-field telescopes. Key words. gravitational waves - methods: observational

Camp, Jordan↗
NASA NTRS2011

Implementation and Testing of the First Prompt for Electromagnetic Counterparts to Gravitational Wave Transients

A transient astrophysical event observed in both gravitational wave (GW) and electromagnetic (EM) channels would yield rich scientific rewards. A first program initiating EM follow-ups to possible transient GW events has been developed and exercised by the LIGO and Virgo community in association with several partners. In this paper, we describe and evaluate the methods used to promptly identify and localize GW event candidates and to request images of targeted sky locations. Methods. During two observing periods (Dec 17 2009 to Jan 8 2010 and Sep 2 to Oct 20 2010), a low-latency analysis pipeline was used to identify GW-event candidates and to reconstruct-maps of possible sky locations. A catalog of nearby galaxies and Milky Way globular clusters was used to select the most promising sky positions to be imaged, and this directional information was delivered to EM observatories with time lags of about thirty minutes. A Monte Carlo simulation has been used to evaluate the low-latency GW pipeline s ability to reconstruct source positions correctly. Results. For signals near the detection threshold, our low-latency algorithms often localized simulated GW burst signals to tens of square degrees, while neutron star/neutron star inspirals and neutron star/black hole inspirals were localized to a few hundred square degrees. Localization precision improves for moderately stronger signals. The correct sky location of signals well above threshold and originating from nearby galaxies may be observed with 50% or better probability with a few pointings of wide-field telescopes.

Abadie, J.↗
NASA NTRS2012

Implementation and Testing of the First Prompt Search for Gravitational Wave Transients with Electromagnetic Counterparts

Aims. A transient astrophysical event observed in both gravitational wave (GW) and electromagnetic (EM) channels would yield rich scientific rewards. A first program initiating EM follow-ups to possible transient GW events has been developed and exercised by the LIGO and Virgo community in association with several partners. In this paper, we describe and evaluate the methods used to promptly identify and localize GW event candidates and to request images of targeted sky locations. Methods. During two observing periods (Dec. 17, 2009 to Jan. 8, 2010 and Sep. 2 to Oct. 20, 2010), a low-latency analysis pipeline was used to identify GW event candidates and to reconstruct maps of possible sky locations. A catalog of nearby galaxies and MilkyWay globular clusters was used to select the most promising sky positions to be imaged, and this directional information was delivered to EM observatories with time lags of about thirty minutes. A Monte Carlo simulation has been used to evaluate the low-latency GW pipeline's ability to reconstruct source positions correctly. Results. For signals near the detection threshold, our low-latency algorithms often localized simulated GW burst signals to tens of square degrees, while neutron star/neutron star inspirals and neutron star/black hole inspirals were localized to a few hundred square degrees. Localization precision improves for moderately stronger signals. The correct sky location of signals well above threshold and originating from nearby galaxies may be observed with ∼50% or better probability with a few pointings of wide-field telescopes.

testing↗