In this paper we give the optimum parameters for the Accelerated Overrelaxation (AOR) method in the special case where the matrix coefficient of the linear system, which is solved, is consistently ordered with nonvanishing diagonal elements. Under certain assumptions, concerning the eigenvalues of the corresponding Jacobi matrix, it is shown that the optimum AOR method gives better convergence ...

A method for finding an optimum n-dimensional commutative group code of a given order M is presented. The approach explores the structure of lattices related to these codes and provides a significant reduction in the number of non-isometric cases to be analyzed. The classical factorization of matrices into Hermite and Smith normal forms and also basis reduction of lattices are used to character...

In this paper we solve the following problem: Given a positive integer f and L weights (real numbers), nd a partition with f classes of the multiset of weights such that the sum of the costs of the optimum m-ary Hu man trees built for every class of is minimum. An application to the optimal extendibility problem for pre x codes is proposed.

finding the optimum overrelaxation parameter o¡¡, is an important and often a difficult part of the problem [1, p. 257]. When A is a 2-cyclic, consistently ordered, real symmetric, positive-definite matrix (this will be assumed in the rest of the paper), only the spectral radius p(£i) of the associated Gauss-Seidel iteration matrix £i is needed to determine the optimum parameter co¡, [2, p. 109...

We describe a modiication of the Hu{Tucker algorithm for constructing an optimal alphabetic tree that runs in O(n) time for several classes of inputs. These classes can be described in simple terms and can be detected in linear time. We also give simple conditions and a linear algorithm for determining, in some cases, if two adjacent nodes will be combined in the optimal alphabetic tree.

When a firm starts a new monthly customer account, they typically will bill new customers one month from the start of the new account. However, if they have the opportunity to choose the date of the first bill, this results in missing an opportunity for additional profit. This paper calculates the initial billing period that maximizes the net present value to the firm, and calculates the net ga...

Inheritances create a second distinguishing characteristic of individuals, in addition to earning abilities. We incorporate this fact into an optimum income taxation model with bequests motivated by joy of giving, and show that a tax on inherited wealth is equivalent to a tax on expenditures, i. e. to a uniform tax on consumption plus bequests. These taxes have a positive effect on intertempora...

The recently studied planar-doped triangular barrier structure is analyzed theoretically for a possible application as a barrier injection transit time device (BARMT). The small signal impedance as well as the large-signal power characteristics are calculated. Compared to the conventional Bm structures the new device offers a sign&ant improvement in its frequency range and generated power. The ...

— The microstructure identification problem is treated : given certain phases in given volume fractions, how to mix them in aperiodic cell so that the effective material constants of the periodic composite lie the closest possible to certain prescribed values ? The problem is studied for the linear conduction équation. It is stated in terms of optimal con trol theory ; the admissible micro geom...

Given a set of nodes N (i 1, 2, ..., n) which may represent cities and a set of requirements ria which may represent the number of telephone calls between N and N j, the problem is to build a spanning tree connecting these n nodes such that the total cost of communication of the spanning tree is a minimum among all spanning trees. The cost of communication for a pair of nodes is r;a multiplied ...