A physically based hydrological connectivity algorithm for describing spatial patterns of soil moisture in the unsaturated zone
Explore the source record for details and available documents.
Jonggun Kim↗
SEARCH · Search NASA
Results for “CONNECT 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.
Moving body overset grid methods for complete aircraft tiltrotor simulations
A hypothetical, but realistic, set of flight conditions for the V-22 aircraft is established to facilitate rigorous testing of a new domain connectivity algorithm, and to carry out an overset grid proof-of-concept tiltrotor simulation. Relative motion and interference effects between the V-22 airframe and rotor-blades are directly simulated within the context of an unsteady, thin-layer Navier-Stokes computation. The domain connectivity algorithm is verified to perform at rates equal to or greater than those realized previously for store-separation-like applications. The feasibility of carrying out unsteady Navier-Stokes analyses of rotorcraft problems is demonstrated.
Meakin, Robert L.↗
Parallel algorithms for geometric connected component labeling on a hypercube multiprocessor
Different algorithms for the geometric connected component labeling (GCCL) problem are defined each of which involves d stages of message passing, for a d-dimensional hypercube. The major idea is that in each stage a hypercube multiprocessor increases its knowledge of domain. The algorithms under consideration include the QUAD algorithm for small number of processors and the Overlap Quad algorithm for large number of processors, subject to the locality of the connected sets. These algorithms differ in their run time, memory requirements, and message complexity. They were implemented on an Intel iPSC2/D4/MX hypercube.
Belkhale, K. P.↗
Improving Coastal Ocean Color Validation Capabilities through Application of Inherent Optical Properties (IOPs)
Understanding how the different components of seawater alter the path of incident sunlight through scattering and absorption is essential to using remotely sensed ocean color observations effectively. This is particularly apropos in coastal waters where the different optically significant components (phytoplankton, detrital material, inorganic minerals, etc.) vary widely in concentration, often independently from one another. Inherent Optical Properties (IOPs) form the link between these biogeochemical constituents and the Apparent Optical Properties (AOPs). understanding this interrelationship is at the heart of successfully carrying out inversions of satellite-measured radiance to biogeochemical properties. While sufficient covariation of seawater constituents in case I waters typically allows empirical algorithms connecting AOPs and biogeochemical parameters to behave well, these empirical algorithms normally do not hold for case I1 regimes (Carder et al. 2003). Validation in the context of ocean color remote sensing refers to in-situ measurements used to verify or characterize algorithm products or any assumption used as input to an algorithm. In this project, validation capabilities are considered those measurement capabilities, techniques, methods, models, etc. that allow effective validation. Enhancing current validation capabilities by incorporating state-of-the-art IOP measurements and optical models is the purpose of this work. Involved in this pursuit is improving core IOP measurement capabilities (spectral, angular, spatio-temporal resolutions), improving our understanding of the behavior of analytical AOP-IOP approximations in complex coastal waters, and improving the spatial and temporal resolution of biogeochemical data for validation by applying biogeochemical-IOP inversion models so that these parameters can be computed from real-time IOP sensors with high sampling rates. Research cruises supported by this project provides for collection and processing of seawater samples for biogeochemical (pigments, DOC and POC) and optical (CDOM and POM absorption coefficients) analyses to enhance our understanding of the linkages between in-water optical measurements (IOPs and AOPs) and biogeochemical constituents and to provide a more comprehensive suite of validation products.
Mannino, Antonio↗
The k-space formulation of the n-dimensional scattering problem
The n-dimensional scattering problem is solved by means of a k-space formulation of the field equations, thereby replacing the conventional integral equation formulation by a set of two algebraic equations in two unknowns in two spaces (the constitutive equation being an algebraic equation in x-space). These equations are solved by an iterative method with the aid of the fast Fourier transform (FFT) algorithm connecting the two spaces, requiring very simple initial approximations. Since algebraic and FFT equations are used, the number of arithmetic multiple-add operations and storage allocations required for a numerical solution are reduced from the order of N sq (for solving the matrix equations resulting from the conventional integral equations) to the order of N(log base 2 of N) and N, respectively (where N is the number of data points required for the specification of the problem). The advantage gained in speed and storage is thus of the order of N/log base 2 of N and N, respectively. This method is thus considerably more efficient than the conventional matrix method, and permits exact numerical solutions for much larger problems. Arguments are presented toward the view that the field equations are more fundamental in k-space. The details and some numerical results of the application of this method to the three-dimensional electromagnetic scattering problems are presented as an example.
Bojarski, N. N.↗
Selenographic control
Evaluation of selenographic data obtained with use of different observational means requires the formulation of rigorous algorithms connecting the systems of coordinates, which the various methods have been referred to. The lunar principal axes of inertia are suggested as most appropriate for reference in lunar mapping and selenographic coordinate catalogues. The connection between the instantaneous axis of lunar rotation (involved in laser ranging, radar studies, astronomical observations from the surface of the moon and VLBI observations of ALSEPs), the ecliptic system of coordinates (which in reductions of observations was considered as fixed in space), the 'Cassini' mean selenographic coordinates (to which physical libration measures were referred), the lunar principal axes of inertia, and the invariable plane of the solar system is discussed.
Moutsoulas, M. D.↗
Connecting Ground Validation and Algorithms
The Ground Validation (GV) component of the Global Precipitation Measurement (GPM) mission involved several field campaigns, involving aircraft, ground radars, and other instrument networks designed to measure various aspects of precipitation. In many cases, these instruments are still in operation at ongoing data collection sites at Wallops Flight Facility, VA and Marquette, MI. The data collected has been used for algorithm formulation and validation, but in many cases has been under-utilized. This presentation describes aspects of GPM algorithms that could benefit from GV data that has been collected and announces a workshop to be held for that purpose in March 2020.
Munchak, Stephen J.↗
Reverse time migration: A seismic processing application on the connection machine
The implementation of a reverse time migration algorithm on the Connection Machine, a massively parallel computer is described. Essential architectural features of this machine as well as programming concepts are presented. The data structures and parallel operations for the implementation of the reverse time migration algorithm are described. The algorithm matches the Connection Machine architecture closely and executes almost at the peak performance of this machine.
Fiebrich, Rolf-Dieter↗
Vertical Motion Simulator Experiment on Stall Recovery Guidance
A stall recovery guidance system was designed to help pilots improve their stall recovery performance when the current aircraft state may be unrecognized under various complicating operational factors. Candidate guidance algorithms were connected to the split-cue pitch and roll flight directors that are standard on large transport commercial aircraft. A new thrust guidance algorithm and cue was also developed to help pilots prevent the combination of excessive thrust and nose-up stabilizer trim. The overall system was designed to reinforce the current FAA recommended stall recovery procedure. A general transport aircraft model, similar to a Boeing 757, with an extended aerodynamic database for improved stall dynamics simulation fidelity was integrated into the Vertical Motion Simulator at NASA Ames Research Center. A detailed study of the guidance system was then conducted across four stall scenarios with 30 commercial and 10 research test pilots, and the results are reported.
Schuet, Stefan↗
Kanerva's sparse distributed memory: An associative memory algorithm well-suited to the Connection Machine
The advent of the Connection Machine profoundly changes the world of supercomputers. The highly nontraditional architecture makes possible the exploration of algorithms that were impractical for standard Von Neumann architectures. Sparse distributed memory (SDM) is an example of such an algorithm. Sparse distributed memory is a particularly simple and elegant formulation for an associative memory. The foundations for sparse distributed memory are described, and some simple examples of using the memory are presented. The relationship of sparse distributed memory to three important computational systems is shown: random-access memory, neural networks, and the cerebellum of the brain. Finally, the implementation of the algorithm for sparse distributed memory on the Connection Machine is discussed.
Rogers, David↗
Progress toward the analysis of complex propulsion installation flow phenomenon
A trend toward replacement of parametric model testing with parametric analysis for the design of aircraft is driven by the rapidly escalating cost of wind tunnel testing, the increasing availability of large fast computers, and powerful numerical flow algorithms. In connection with the complex flow phenomena characteristic of propulsion installations, it is now necessary to employ both parametric analysis and testing for design procedures. Powerful flow analysis techniques are available to predict local flow phenomena. However, the employment of these techniques is very expensive. It is, therefore, necessary to link these analyses with less powerful and less expensive procedures for an accurate analysis of propulsion installation flowfields. However, the interfacing and coupling processes needed are not available. The present investigation is concerned with progress made regarding the development of suitable linking methods. Attention is given to methods of analysis for predicting the flow around a nacelle coupled to a highly swept wing.
Kern, P. R. A.↗
Dynamical approach study of spurious steady-state numerical solutions of nonlinear differential equations. Part 1: The ODE connection and its implications for algorithm development in computational fluid dynamics
Spurious stable as well as unstable steady state numerical solutions, spurious asymptotic numerical solutions of higher period, and even stable chaotic behavior can occur when finite difference methods are used to solve nonlinear differential equations (DE) numerically. The occurrence of spurious asymptotes is independent of whether the DE possesses a unique steady state or has additional periodic solutions and/or exhibits chaotic phenomena. The form of the nonlinear DEs and the type of numerical schemes are the determining factor. In addition, the occurrence of spurious steady states is not restricted to the time steps that are beyond the linearized stability limit of the scheme. In many instances, it can occur below the linearized stability limit. Therefore, it is essential for practitioners in computational sciences to be knowledgeable about the dynamical behavior of finite difference methods for nonlinear scalar DEs before the actual application of these methods to practical computations. It is also important to change the traditional way of thinking and practices when dealing with genuinely nonlinear problems. In the past, spurious asymptotes were observed in numerical computations but tended to be ignored because they all were assumed to lie beyond the linearized stability limits of the time step parameter delta t. As can be seen from the study, bifurcations to and from spurious asymptotic solutions and transitions to computational instability not only are highly scheme dependent and problem dependent, but also initial data and boundary condition dependent, and not limited to time steps that are beyond the linearized stability limit.
Yee, H. C.↗
Eigensolution of finite element problems in a completely connected parallel architecture
A parallel algorithm is presented for the solution of the generalized eigenproblem in linear elastic finite element analysis. The algorithm is based on a completely connected parallel architecture in which each processor is allowed to communicate with all other processors. The algorithm is successfully implemented on a tightly coupled MIMD parallel processor. A finite element model is divided into m domains each of which is assumed to process n elements. Each domain is then assigned to a processor or to a logical processor (task) if the number of domains exceeds the number of physical processors. The effect of the number of domains, the number of degrees-of-freedom located along the global fronts, and the dimension of the subspace on the performance of the algorithm is investigated. For a 64-element rectangular plate, speed-ups of 1.86, 3.13, 3.18, and 3.61 are achieved on two, four, six, and eight processors, respectively.
Akl, F.↗
Eigensolution of finite element problems in a completely connected parallel architecture
A parallel algorithm for the solution of the generalized eigenproblem in linear elastic finite element analysis, (K)(phi)=(M)(phi)(omega), where (K) and (M) are of order N, and (omega) is of order q is presented. The parallel algorithm is based on a completely connected parallel architecture in which each processor is allowed to communicate with all other processors. The algorithm has been successfully implemented on a tightly coupled multiple-instruction-multiple-data (MIMD) parallel processing computer, Cray X-MP. A finite element model is divided into m domains each of which is assumed to process n elements. Each domain is then assigned to a processor, or to a logical processor (task) if the number of domains exceeds the number of physical processors. The macro-tasking library routines are used in mapping each domain to a user task. Computational speed-up and efficiency are used to determine the effectiveness of the algorithm. The effect of the number of domains, the number of degrees-of-freedom located along the global fronts and the dimension of the subspace on the performance of the algorithm are investigated. For a 64-element rectangular plate, speed-ups of 1.86, 3.13, 3.18 and 3.61 are achieved on two, four, six and eight processors, respectively.
Akl, Fred A.↗
Solving very large, sparse linear systems on mesh-connected parallel computers
The implementation of Pan and Reif's Parallel Nested Dissection (PND) algorithm on mesh connected parallel computers is described. This is the first known algorithm that allows very large, sparse linear systems of equations to be solved efficiently in polylog time using a small number of processors. How the processor bound of PND can be matched to the number of processors available on a given parallel computer by slowing down the algorithm by constant factors is described. Also, for the important class of problems where G(A) is a grid graph, a unique memory mapping that reduces the inter-processor communication requirements of PND to those that can be executed on mesh connected parallel machines is detailed. A description of an implementation on the Goodyear Massively Parallel Processor (MPP), located at Goddard is given. Also, a detailed discussion of data mappings and performance issues is given.
Opsahl, Torstein↗
Array architectures for iterative algorithms
Regular mesh-connected arrays are shown to be isomorphic to a class of so-called regular iterative algorithms. For a wide variety of problems it is shown how to obtain appropriate iterative algorithms and then how to translate these algorithms into arrays in a systematic fashion. Several 'systolic' arrays presented in the literature are shown to be specific cases of the variety of architectures that can be derived by the techniques presented here. These include arrays for Fourier Transform, Matrix Multiplication, and Sorting.
Jagadish, Hosagrahar V.↗
Practical aspects of variable reduction formulations and reduced basis algorithms in multidisciplinary design optimization
This paper discusses certain connections between nonlinear programming algorithms and the formulation of optimization problems for systems governed by state constraints. The major points of this paper are the detailed calculation of the sensitivities associated with different formulations of optimization problems and the identification of some useful relationships between different formulations. These relationships have practical consequences; if one uses a reduced basis nonlinear programming algorithm, then the implementations for the different formulations need only differ in a single step.
Lewis, Robert Michael↗
Connectivity and genus in three dimensions
Algorithms for labeling, counting, and computing connected objects in binary three dimensional array
Park, C. M.↗