The graph-theoretic field model— II. application of multi-terminal representations to field problems

This paper is a sequel to a paper entitled “The Graph-Theoretic Field Model—I: Modelling and Formulations” (1). Herein, the Theory of Multi-Terminal Representations is applied to the Graph-Theoretic Field Model to provide mathematical models of finite elements. The element models are obtained solely from the algebraic building blocks of the Graph-Theoretic Field Model, without recourse to any functional mathematics. The theory of Multi-Terminal Representations is developed for both linear and non-linear problems. Examples of the application of the theory to one- and two-dimensional field problems are presented from heat conduction and electrostatics.     

Distributed-parameter optimal control via mathematical programming

In this paper a variety of optimal control (OC) problems for distributed- parameter (DP) systems are approached using mathematical programming (MP). First, the principal DP models in current use are given, a variety of DP objective functions is provided, and the OC problems based on them are formulated. Second, these models and objective functions are converted in algebraic form, as required by MP, and the solution procedure of the OC problems via MP is outlined. Third, a representative set of nonlinear programming results applied to DP systems is presented, and finally, a numvber of application examples is given.     

On metrics matched to the discrete memoryless channel

A sequence of metrics {D_N} is said to be additive and matched to a discrete memoryless channel (DMC) if D_N is the sum on its coordinates of N single letter metrics and if the maximum likelihood decoder for sequences of length N is a minimum D_N-distance decoder. Necessary and sufficient conditions on the transition probabilities of a DMC for the existence of a sequence of additive metrics matched to it are given. In the case of the binary channel these are shown to be equivalent to the channel being symmetric. Explicit transition probabilities are given for a large class of ternary DMCs with an associated sequence of additive matched metrics. The problem solved here may be considered a generalization of the problem of finding the DMCs matched to the Lee metric solved by Chiang and Wolf in 1971 (2).