Tree encoding of memoryless time-discrete sources with a fidelity criterion.
Tree codes for memoryless time discrete sources with bounded fidelity criterion
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.
Tree codes for memoryless time discrete sources with bounded fidelity criterion
Upper bounds on probability of error achieved by using block codes on general time-discrete memoryless channel
Nonlinear perturbation theory for optimal estimation and control of time-discrete, stochastic, dynamic systems when measurement data is noisy
Robbins-Monro stochastic approximation method using algorithms for identifying finite memory time-discrete time-stationary linear system from noisy input-output measurements
A finite-element method for the solution of nonlinear hyperbolic systems of equations, such as those encountered in non-self-adjoint problems of transient phenomena in convection-diffusion or in the mixed representation of wave problems, is developed and demonstrated. The problem is rewritten in moving coordinates and reinterpolated to the original mesh by a Taylor expansion prior to a standard Galerkin spatial discretization, and it is shown that this procedure is equivalent to the time-discretization approach of Donea (1984). Numerical results for sample problems are presented graphically, including such shallow-water problems as the breaking of a dam, the shoaling of a wave, and the outflow of a river; compressible flows such as the isothermal flow in a nozzle and the Riemann shock-tube problem; and the two-dimensional scalar-advection, nonlinear-shallow-water, and Euler equations.
The purpose of this research effort was to begin the study of the application of hp-version finite elements to the numerical solution of optimal control problems. Under NAG-939, the hybrid MACSYMA/FORTRAN code GENCODE was developed which utilized h-version finite elements to successfully approximate solutions to a wide class of optimal control problems. In that code the means for improvement of the solution was the refinement of the time-discretization mesh. With the extension to hp-version finite elements, the degrees of freedom include both nodal values and extra interior values associated with the unknown states, co-states, and controls, the number of which depends on the order of the shape functions in each element. One possible drawback is the increased computational effort within each element required in implementing hp-version finite elements. We are trying to determine whether this computational effort is sufficiently offset by the reduction in the number of time elements used and improved Newton-Raphson convergence so as to be useful in solving optimal control problems in real time. Because certain of the element interior unknowns can be eliminated at the element level by solving a small set of nonlinear algebraic equations in which the nodal values are taken as given, the scheme may turn out to be especially powerful in a parallel computing environment. A different processor could be assigned to each element. The number of processors, strictly speaking, is not required to be any larger than the number of sub-regions which are free of discontinuities of any kind.
The purpose of this research effort is to develop a means to use, and to ultimately implement, hp-version finite elements in the numerical solution of optimal control problems. The hybrid MACSYMA/FORTRAN code GENCODE was developed which utilized h-version finite elements to successfully approximate solutions to a wide class of optimal control problems. In that code the means for improvement of the solution was the refinement of the time-discretization mesh. With the extension to hp-version finite elements, the degrees of freedom include both nodal values and extra interior values associated with the unknown states, co-states, and controls, the number of which depends on the order of the shape functions in each element.