Search NASA⌕ Search

SEARCH · Search NASA

Results for “Euclidean”

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 325 records · Page 18

Applications of partial orderings to the study of positive definiteness, monotonicity, and convergence of iterative methods for linear systems.

Most of the known results concerning convergence of iterative methods for solving linear systems involve either positive definiteness or monotonicity. In this paper a new concept, called K-semipositivity, is introduced, which provides a link between convergence theory, monotonicity, and positive definiteness. By using this concept, together with partial orderings in Euclidean n-space, several new convergence theorems are proved. Application to Jacobi's methods and the theory of regular splittings shows the usefulness of these new results.

Vandergraft, J. S.↗

Controllability of nonlinear systems.

Discussion of the controllability of nonlinear systems described by the equation dx/dt - F(x,u). Concepts formulated by Chow (1939) and Lobry (1970) are applied to establish criteria for F and its derivatives to obtain qualitative information on sets which can be obtained from x which denotes a variable of state in an arbitrary, real, analytical manifold. It is shown that controllability implies strong accessibility for a large class of manifolds including Euclidean spaces.-

Sussmann, H. J.↗

Davidon-Broyden rank-one minimization methods in Hilbert space with application to optimal control problems

The Davidon-Broyden class of rank one, quasi-Newton minimization methods is extended from Euclidean spaces to infinite-dimensional, real Hilbert spaces. For several techniques of choosing the step size, conditions are found which assure convergence of the associated iterates to the location of the minimum of a positive definite quadratic functional. For those techniques, convergence is achieved without the problem of the computation of a one-dimensional minimum at each iteration. The application of this class of minimization methods for the direct computation of the solution of an optimal control problem is outlined. The performance of various members of the class are compared by solving a sample optimal control problem. Finally, the sample problem is solved by other known gradient methods, and the results are compared with those obtained with the rank one quasi-Newton methods.

Straeter, T. A.↗

Spline smoothing of histograms by linear programming

An algorithm for an approximating function to the frequency distribution is obtained from a sample of size n. To obtain the approximating function a histogram is made from the data. Next, Euclidean space approximations to the graph of the histogram using central B-splines as basis elements are obtained by linear programming. The approximating function has area one and is nonnegative.

Bennett, J. O.↗

Separation of variables in the special diagonal Hamilton-Jacobi equation: Application to the dynamical problem of a particle constrained on a moving surface

For a time-dependent, n-dimensional, special diagonal Hamilton-Jacobi equation a necessary and sufficient condition for the separation of variables to yield a complete integral of the form was established by specifying the admissible forms in terms of arbitrary functions. A complete integral was then expressed in terms of these arbitrary functions and also the n irreducible constants. As an application of the results obtained for the two-dimensional Hamilton-Jacobi equation, analysis was made for a comparatively wide class of dynamical problems involving a particle moving in Euclidean three-dimensional space under the action of external forces but constrained on a moving surface. All the possible cases in which this equation had a complete integral of the form were obtained and these are tubulated for reference.

Blanchard, D. L.↗

A counter example in linear feature selection theory

The linear feature selection problem in multi-class pattern recognition is described as that of linearly transforming statistical information from n-dimensional (real Euclidean) space into k-dimensional space, while requiring that average interclass divergence in the transformed space decrease as little as possible. Divergence is the expected interclass divergence derived from Hajek two-class divergence; it is known that there always exists a k x n matrix B such that the transformation determined by B maximizes the divergence in k-dimensional space. It is known that, if Q is any k x k invertible matrix, and B is as defined above, then QB again maximizes the divergence in k-space. It is shown that the converse of this result is false: two matrices exist, B sub 1 and B sub 2, each of which maximizes transformed divergence, which are not related in the fashion B sub 2 = QB sub 1 for any k x k matrix Q.

Brown, D. R.↗

Optimal control of multiplicative control systems arising from cancer therapy

This study deals with ways of curtailing the rapid growth of cancer cell populations. The performance functional that measures the size of the population at the terminal time as well as the control effort is devised. With use of the discrete maximum principle, the Hamiltonian for this problem is determined and the condition for optimal solutions are developed. The optimal strategy is shown to be a bang-bang control. It is shown that the optimal control for this problem must be on the vertices of an N-dimensional cube contained in the N-dimensional Euclidean space. An algorithm for obtaining a local minimum of the performance function in an orderly fashion is developed. Application of the algorithm to the design of antitumor drug and X-irradiation schedule is discussed.

Bahrami, K.↗

Algorithms for isolating worst case systematic data errors

Two separate algorithms are derived for testing filter sensitivity to systematic data errors. One algorithm provides the absolute minimum Euclidean norm data error for a given estimate component error. The second algorithm can be used to find the minimum norm data error which can be generated by restricted degree Legendre polynomials. A specific very long baseline interferometry (VLBI) baseline estimation is analyzed with the algorithm. It is found that the local vertical is the most sensitive component to error in the data space. The efficiency of a data error sequence linear in elevation angle is within 7% that of the absolute worst case sequence. Elevation angle dependent errors are explored and the special case of a mismodeled troposphere is treated.

Curkendall, D. W.↗

Ultimate boundedness stability and controllability of hereditary systems

By generalizing the Liapunov-Yoshizawa techniques, necessary and sufficient conditions are given for uniform boundedness and uniform ultimate boundedness of a rather general class of nonlinear differential equations of neutral type. Among the applications treated by the methods are the Lienard equation of neutral type and hereditary systems of Lurie type. The absolute stability of this later equation is also investigated. A certain existence result of a solution of a neutral functional differential inclusion with two point boundary values is applied to study the exact function space controllability of a nonlinear neutral functional differential control system. A geometric growth condition is used to characterize both the function space and Euclidean controllability of another nonlinear delay system which has a compact and convex control set. This yields conditions under which perturbed nonlinear delay controllable systems are controllable.

Chukwu, E. N.↗

Evaluation of several schemes for classification of remotely sensed data: Their parameters and performance

The author has identified the following significant results. Data sets for corn, soybeans, winter wheat, and spring wheat were used to evaluate the following schemes for crop identification: (1) per point Gaussian maximum classifier; (2) per point sum of normal densities classifiers; (3) per point linear classifier; (4) per point Gaussian maximum likelihood decision tree classifiers; and (5) texture sensitive per field Gaussian maximum likelihood classifier. Test site location and classifier both had significant effects on classification accuracy of small grains; classifiers did not differ significantly in overall accuracy, with the majority of the difference among classifiers being attributed to training method rather than to the classification algorithm applied. The complexity of use and computer costs for the classifiers varied significantly. A linear classification rule which assigns each pixel to the class whose mean is closest in Euclidean distance was the easiest for the analyst and cost the least per classification.

Scholz, D.↗

Controllability of delay systems with restrained controls

Using a geometric growth condition, both the function space and Euclidean controllability of a nonlinear delay system which has a compact and convex control set are characterized. This extends analogous results for ordinary differential systems, and it yields conditions under which perturbed nonlinear delay controllable systems are controllable.

Chukwu, E. N.↗

Cosmic plasma

Attention is given to experimental and theoretical approaches to plasma physics, plasma phenomena in laboratory and space, field and particle aspects of plasmas, the present state of the classical theory, boundary conditions and circuit dependence, and cosmology. Electric currents in space plasmas are considered, taking into account dualism in physics, particle-related phenomena in plasma physics, magnetic field lines, filaments, local plasma properties and the circuit, electric double layers, field-aligned currents as 'cables', an expanding circuit, different types of plasma regions, the cellular structure of space, and the fine structure of active plasma regions. Other topics discussed are related to circuits, the theory of cosmic plasmas, the origin of the solar system, the coexistence of matter and antimatter, annihilation as a source of energy, the Hubble expansion in a Euclidean space, and a model for the evolution of the Metagalaxy.

Alfven, H.↗

A complete X-ray sample of the high latitude sky from HEAO-1 A-2: log N lo S and luminosity functions

An experiment was performed in which a complete X-ray survey of the 8.2 steradians of the sky at galactic latitudes where the absolute value of b is 20 deg down to a limiting sensitivity of 3.1 x ten to the minus 11th power ergs/sq cm sec in the 2-10 keV band. Of the 85 detected sources 17 were identified with galactic objects, 61 were identified with extragalactic objects, and 7 remain unidentified. The log N - log S relation for the non-galactic objects is well fit by the Euclidean relationship. The X-ray spectra of these objects were used to construct log N - log S in physical units. The complete sample of identified sources was used to construct X-ray luminosity functions, using the absolute maximum likelihood method, for clusters galaxies and active galactic nuclei.

Piccinotti, G.↗

Evolving nucleotide binding surfaces

An analysis is presented of the stability and nature of binding of a nucleotide to several known dehydrogenases. The employed approach includes calculation of hydrophobic stabilization of the binding motif and its intermolecular interaction with the ligand. The evolutionary changes of the binding motif are studied by calculating the Euclidean deviation of the respective dehydrogenases. Attention is given to the possible structural elements involved in the origin of nucleotide recognition by non-coded primordial polypeptides.

Kieber-Emmons, T.↗

CROP type analysis using Landsat digital data

Classification and statistical sampling techniques for crop type discrimination using Landsat digital data have been developed by the University of California in cooperation with NASA and the California Department of Water Resources. Ratioed bands (MSS 7/5 and 5/4) and a sun-angle corrected Euclidean albedo band were prepared from data for the Sacramento Valley for five different dates. The test area was stratified into general crop groupings based on the particular patterns of irrigation timing for each crop. Data classified within each stratum were used to produce a crop type map. Comparison with ground data indicates that certain crops and crop groups are discernable. Small grains and rice are easily identifiable, as are deciduous fruit varieties as a group. However, it is not feasible to separate various fruit and nut varieties, or separate vegetable crops with these techniques at present.

Brown, C. E.↗

Applications of the contravariant form of the Navier-Stokes equations

The contravariant Navier-Stokes equations in weak conservation form are well suited to certain fluid flow analysis problems. Three dimensional contravariant momentum equations may be used to obtain Navier-Stokes equations in weak conservation form on a nonplanar two dimensional surface with varying streamsheet thickness. Thus a three dimensional flow can be simulated with two dimensional equations to obtain a quasi-three dimensional solution for viscous flow. When the Navier-Stokes equations on the two dimensional nonplanar surface are transformed to a generalized body fitted mesh coordinate system, the resulting equations are similar to the equations for a body fitted mesh coordinate system on the Euclidean plane. Contravariant momentum components are also useful for analyzing compressible, three dimensional viscous flow through an internal duct by parabolic marching. This type of flow is efficiently analyzed by parabolic marching methods, where the streamwise momentum equation is uncoupled from the two crossflow momentum equations. This can be done, even for ducts with a large amount of turning, if the Navier-Stokes equations are written with contravariant components.

Katsanis, T.↗

Control of nonlinear time-varying systems

Necessary and sufficient conditions are given for a time-varying nonlinear system of specific form to be transformed into a time-invariant controllable linear system. Since the present work will be in a neighborhood of the origin, it is unnecessary to name specific sets and it is assumed that all assumptions, conditions and results hold in an open set in the appropriate Euclidean space that contains the origin. This theory can be combined with the global inverse function theorems to produce global results.

Hunt, L. R.↗

A Systolic VLSI Design of a Pipeline Reed-solomon Decoder

A pipeline structure of a transform decoder similar to a systolic array was developed to decode Reed-Solomon (RS) codes. An important ingredient of this design is a modified Euclidean algorithm for computing the error locator polynomial. The computation of inverse field elements is completely avoided in this modification of Euclid's algorithm. The new decoder is regular and simple, and naturally suitable for VLSI implementation.

Shao, H. M.↗