On some extremal positive definite functions.
Received radar signal power maximizing problems in planetary exploration, analyzing abelian group real line and circle problems
SEARCH · Search NASA
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.
Received radar signal power maximizing problems in planetary exploration, analyzing abelian group real line and circle problems
An asymptotic form is derived for the longitudinal correlation function for isotropic homogeneous turbulence in an incompressible fluid governed by the Navier-Stokes equation. The result is obtained from an analysis of the algebraic-differential structure of the two-point correlation tensor contained in the complex-valued Fourier transform of the probability measure over the turbulence ensemble, which reveals that the Hopf characteristic functional (the complex-valued Fourier transform of the probability measure) satisfies the Fourier interference inequality. Consequences of the expression obtained, in which the correlation function is a positive definite function of the inverse cube of the spatial coordinate as it approaches infinity, are shown to include the nonexistence of the Loitsianskii invariant, and the solution is shown to be consistent with empirical formulas.
The Gaussian process (GP) is a widely used method for analyzing large-scale data sets, including spatio-temporal measurements of nonlinear processes that are now commonplace in the environmental sciences. Traditional implementations of GPs involve stationary kernels (also termed covariance functions) that limit their flexibility, and exact methods for inference that prevent application to data sets with more than about 10,000 points. Modern approaches to address stationarity assumptions generally fail to accommodate large data sets, while all attempts to address scalability focus on approximating the Gaussian likelihood, which can involve subjectivity and lead to inaccuracies. In this work, we explicitly derive an alternative kernel that can discover and encode both sparsity and nonstationarity. We embed the kernel within a fully Bayesian GP model and leverage high-performance computing resources to enable the analysis of massive data sets. We demonstrate the favorable performance of our novel kernel relative to existing exact and approximate GP methods across a variety of synthetic data examples. Furthermore, we conduct space–time prediction based on more than 1 million measurements of daily maximum temperature and verify that our results outperform state-of-the-art methods in the Earth sciences. More broadly, having access to exact GPs that use ultra-scalable, sparsity-discovering, nonstationary kernels allows GP methods to truly compete with a wide variety of machine learning methods.
The two most commonly used definitions of strictly positive real (SPR) transfer functions are reviewed. Contrary to what has been suggested in the literature, it is proven that the least restrictive (weak) definition of the two is clearly related to the Yacubovich-Kalman lemma. The relationship between time- and frequency-domain conditions pertaining to the weak definition of SPR systems is established.
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.
A feedback controller for the stabilization of closed-loop systems is proposed which is based on the Liapunov stability criterion. A feedback control law is first generated for the linear portion of the system equation using linear control theory. A feedback control is then designed for the nonlinear portion of the system equation by making negative the time derivative of a positive definite Liapunov function.
We present a new method for density estimation based on Mercer kernels. The density estimate can be understood as the density induced on a data manifold by a mixture of Gaussians fit in a feature space. As is usual, the feature space and data manifold are defined with any suitable positive-definite kernel function. We modify the standard EM algorithm for mixtures of Gaussians to infer the parameters of the density. One benefit of the approach is it's conceptual simplicity, and uniform applicability over many different types of data. Preliminary results are presented for a number of simple problems.
Description of some recent extensions of the invariance principle to more generalized dynamical systems where the state space is not locally compact and the flow is unique only in the forward direction of time. A sufficient condition for asymptotic stability of an invariant set is obtained which does not require that the Liapunov function be positive-definite. A recently developed generalized invariance principle is described which is applicable to functional differential equations, partial differential equations, and, in particular, to certain stability problems arising in thermoelasticity, viscoelasticity, and distributed nonlinear networks.
Stability conditions for a class of interconnected systems modeled by linear abstract evolution equations and a memoryless nonlinearity are derived. These conditions are stated in terms of the passivity of each of the subsystems and can be considered as a partial generalization of the hyperstability theorem. A Liapunov function approach is used in the proof without requiring the positive definiteness of the Liapunov function. Application to the robustness analysis of the infinite-dimensional linear quadratic regulator is also discussed.
We intend to use SIM to make definitive measurements of fundamental structural and dynamical parameters of the Milky Way. The important niche in dynamical parameter space afforded by SIM can be exploited to resolve, with unprecedented precision, a number of classical problems of Galactic astronomy. In addition, we have developed new tests of the Galactic mass distribution specifically designed for data with the special properties of SIM products. Our proposed suite of experiments will utilize the SIM Astrometric Grid as well as complementary observations of star clusters and other strategically-selected, distant "test particles" for a definitive characterization of the major components (bulge, disk, halo, satellite system) of the Milky Way. Specifically, our goals will be: 1) The determination of two fundamental parameters that play a central role in virtually every problem in Galactic astronomy, namely (a) the solar distance to the center of the Milky Way, R(sub 0); (b) the solar angular velocity around the Galactic: center, omega(sub 0). 2) The measurement of fundamental dynamical properties of the Milky Way, among them (a) the pattern speed of the central bar (b) the rotation field and velocity-dispersion tensor in the disk (c) the kinematics (mean rotational velocity and velocity dispersion tensor) of the halo as a function of position 3. The definition of the mass distribution of the Galaxy, which is dominated by the presence of dark matter. We intend to measure (a) the relative contribution of the disk and halo to the gravitational potential (b) the local volume and surface mass density of the disk (c) the shape, mass and extent of the dark halo of the Milky Way out to 250 kpc.
The long range aircraft cruise problem is analyzed using a model intermediate in complexity between energy model and point mass model. It is shown that this formulation imbeds the classical steady state cruise as the central member along with several other oscillatory extremals. The oscillatory cruise trajectories are shown to exist if the Hessian of the function QD/VT with respect to altitude and airspeed is positive definite. An expression for predicting the frequency of oscillation is developed. Qualitative effects of increasing the vehicle thrust and improving the L/D are discussed. Numerical results for two fighter aircraft and a transport aircraft are given. While oscillatory cruise mode exists for the two fighter aircraft, steady state cruise at full throttle is found to be optimal for the transport aircraft. A second variation analysis to bring out the reason for fuel savings is developed. It is shown that whenever the Hessian of the function QD/VT is positive definite, the second variation will be zero along the classical steady state cruise arc, indicating that a neighboring extremal is competitive. Comparisons with the previous point mass and energy modeled results are given.
A variable-metric algorithm is described that uses both linear and quadratic penalty terms for handling nonlinear constraints. Quadratic penalty coefficients are adjusted in a process which maintains a positive-definite matrix of second partial derivatives of the function without generating the large positive eigenvalues which cause zigzagging and slow convergence. The schemes suggested use inferred second-order properties not only in terms of the variable metric of the Davidson-Fletcher-Powell algorithm (or its relatives) but by estimating of second directional derivatives by fitting cubics to various functions along search directions.
Finding the optimal position for the individual cells (also called functional modules) on the chip surface is an important and difficult step in the design of integrated circuits. This paper deals with the problem of relative placement, that is the minimization of a quadratic functional with a large, sparse, positive definite system matrix. The basic optimization problem must be augmented by constraints to inhibit solutions where cells overlap. Besides classical iterative methods, based on conjugate gradients (CG), we show that algebraic multigrid methods (AMG) provide an interesting alternative. For moderately sized examples with about 10000 cells, AMG is already competitive with CG and is expected to be superior for larger problems. Besides the classical 'multiplicative' AMG algorithm where the levels are visited sequentially, we propose an 'additive' variant of AMG where levels may be treated in parallel and that is suitable as a preconditioner in the CG algorithm.
Total gravitation field energy functional with one extremum
We present an alternative measurement of the Baryon Acoustic Oscillation (BAO) using the Legendre multipole representation of the Ly$α$ forest correlation functions from the second data release (DR2) of the Dark Energy Spectroscopic Instrument survey. Compressing the auto- and cross-correlation functions into Legendre multipoles yields a positive-definite covariance matrix without any smoothing -- unlike the baseline DR2 analysis -- thanks to a significantly reduced data vector size. We introduce the statistical corrections required to debias the finite-sample covariance matrix estimate and demonstrate that monopole and quadrupole terms for both auto- and cross-correlations can be used even when the correlation functions are distorted by continuum errors and contaminated by metals. This formalism has slightly diminished the constraining power of the BAO scale, while considerably weakening constraints on nuisance parameters. We measure the isotropic BAO scale with $0.93\%$ precision at $z_\mathrm{eff}=2.35$, the Hubble parameter $H(z_\mathrm{eff})=(239.5\pm3.4)~(147.09~\mathrm{Mpc}/r_d) ~\mathrm{km~s}^{-1}~\text{Mpc}^{-1}$, and the transverse comoving distance $D_M(z_\mathrm{eff})=(5.80 \pm 0.10)~(r_d/147.09~\mathrm{Mpc})$~Gpc for a given value of the sound horizon ($r_d$). Our BAO results are entirely consistent with the baseline DR2 analysis.
A technique is described which is utilized for modeling human operator dynamics. The technique is based upon a model-reference system configuration and a class of Liapunov functions formulated for this purpose which possess variable characteristics. It is shown how such a class of Liapunov functions and their time derivatives is formulated. The crux of the formulation lies in three variable positive definite matrices used for the construction of the class of Liapunov functions. The form and order of these matrices depend upon the form and order of the error differential equation of the human operator model-reference system. These matrices can be modified to include nonlinear functions of the human operator model.
A definition is presented of the circle positive realness of real rational functions relative to the unit circle in the complex variable plane. The problem of testing this kind of positive reality is reduced to the algebraic problem of determining the distribution of zeros of a real polynomial with respect to and on the unit circle. Such reformulation of the problem avoids the search for explicit information about imaginary poles of rational functions. The stated algebraic problem is solved by applying the polynomial criteria of Marden (1966) and Jury (1964), and a completely recursive algorithm for circle positive realness is obtained.
The trusted inertial terrain-aided navigation (TITAN) algorithm leverages an airborne vertical synthetic aperture radar to measure the range to the closest ground points along several prescribed iso-Doppler contours. These TITAN minimum-range, prescribed-Doppler measurements are the result of a constrained nonlinear optimization problem whose optimization function and constraints both depend on the radar position and velocity. Owing to the complexity of this measurement definition, analysis of the TITAN algorithm is lacking in prior work. This publication offers such an analysis, making the following three contributions: (1) an analytical solution to the TITAN constrained optimization measurement problem, (2) a derivation of the TITAN measurement function Jacobian, and (3) a derivation of the Cramér-Rao lower bound on the estimated position and velocity error covariance. These three contributions are verified via Monte Carlo simulations over synthetic terrain, which further reveal two remarkable properties of the TITAN algorithm: (1) the along-track positioning errors tend to be smaller than the cross-track positioning errors, and (2) the cross-track positioning errors are independent of the terrain roughness.