The subject of this paper is a uniform structuring of the resource management. Possible variations of this management are determined by the different resource types, the operating goals and some organizational aspects...
详细信息
The subject of this paper is a uniform structuring of the resource management. Possible variations of this management are determined by the different resource types, the operating goals and some organizational aspects. For various models of resource management, operations with an invariable basic structure are developed. This is done by partly extending resp. modifying the known synchronization operations.
This paper describes a method for solving the two-dimensional problem. The integral approach, acting only on functions defined on the boundary, leads to an always uniquely solvable compact operator equation. In solvin...
详细信息
This paper describes a method for solving the two-dimensional problem. The integral approach, acting only on functions defined on the boundary, leads to an always uniquely solvable compact operator equation. In solving this equation integral operators occur which are split into a periodic continuous and a periodic logarithmic singular term. FollowingK. E. Atkinson these integrals are approximated by appropriate “generalized” quadrature formulas which are developed by trigonometric interpolation because of the periodic character of the integrand. An example shows that good results are obtained by the method described here.
Quadrature rules for the approximate evaluation of derivatives of Cauchy principal value integrals (with respect to the free variable inside the integral) can be obtained by formal differentiations of the right sides ...
详细信息
Quadrature rules for the approximate evaluation of derivatives of Cauchy principal value integrals (with respect to the free variable inside the integral) can be obtained by formal differentiations of the right sides of the corresponding quadrature rules (without derivatives). The justification of this method, under appropriate conditions, is presented in this short communication. The results of this short communication are also appl.cable to the numerical evaluation of a class of finite-part integrals and to the numerical solution of singular integrodifferential equations.
作者：
BARTH, WTH VIENNA
INST INFORMATION SYSTKARLSPLATZ 13A-1040 VIENNAAUSTRIA UNIV HEIDELBERG
RECHENZENTRUMFRIEDRICH EBERT PLATZ 2D-6900 HEIDELBERGWEST GERMANY
There are treated linear systems, the coefficients of that are intervals. We must distinguish between the set of solutions and an intervalextension of it, specially the optimal extension. If the matrix of the system i...
详细信息
There are treated linear systems, the coefficients of that are intervals. We must distinguish between the set of solutions and an intervalextension of it, specially the optimal extension. If the matrix of the system is an interval ofM-matrices, methods of elimination and iteration lead to the optimal extension. With elimination the right hand sides of the system must be non-negativ.
ZusammenfassungDie Konstruktion verbindet die Vorteile der Kurvendarstellung von Bézier mit denen derB-Splines, für deren Entwicklung nach Bernstein-Polynomen ein einfacher Algorithmus angegeben wird. Damit ...
详细信息
Zusammenfassung
Die Konstruktion verbindet die Vorteile der Kurvendarstellung von Bézier mit denen derB-Splines, für deren Entwicklung nach Bernstein-Polynomen ein einfacher Algorithmus angegeben wird. Damit zerfällt der bekannte Algorithmus von de Boor zur Bestimmung der Splinepunkte in zwei Teile: eine vom Kurvenpunkt unabhängige Bestimmung der Koeffizienten der Entwicklung und eine von der Segmentierung unabhängige Bestimmung der Kurvenpunkte.
In this paper we derive a new, simple and generally appl.cable method, which can be used for the establishment ofRunge-Kutta formulas of arbitrary order for the characteristic and theCauchy initial value problem of th...
详细信息
In this paper we derive a new, simple and generally appl.cable method, which can be used for the establishment ofRunge-Kutta formulas of arbitrary order for the characteristic and theCauchy initial value problem of the differential equationu xy =f(x, y, u, p, q). There are given some explicitRunge-Kutta formulas of order 0 (h5). We present also the results of some examples for both problems performed on a computer „Siemens 2002”.
The „Virtuelle Z-Baum-Technik” is a method for balancing trees whose nodes contain α≥1 keys and have a maximum degree of α+1. The balancing is done by adjusting the tree with a VZB (Virtual Z-Tree) which is evalua...
详细信息
The „Virtuelle Z-Baum-Technik” is a method for balancing trees whose nodes contain α≥1 keys and have a maximum degree of α+1. The balancing is done by adjusting the tree with a VZB (Virtual Z-Tree) which is evaluated out of the distribution of the keys. During a deletion or insertion of a key the maintenance of the balance requires substitutions of some keys along one path in the tree and a reorganization of one node of the tree.
For solving the nonlinear systemF(x)=0 by using a continuation method a functionz implicitly defined byH(z, t)=0 has to be determined. In order to obtain approximationszk toz(t k ) the algorithmzk+1:=zk−τ k p(zk,t k...
详细信息
For solving the nonlinear systemF(x)=0 by using a continuation method a functionz implicitly defined byH(z, t)=0 has to be determined. In order to obtain approximationszk toz(t k ) the algorithmzk+1:=zk−τ k p(zk,t k , τ k ),tk+1:=t k +τ k , is used. The order of such a functionp is defined in this paper, and for certain classes of algorithms the corresponding orders are determined.
The general duality theory of Rockafellar will be appl.ed to some convex optimization problems in order to get duality, existence and characterization theorems for optimal solutions. Among other things, in this way on...
详细信息
The general duality theory of Rockafellar will be appl.ed to some convex optimization problems in order to get duality, existence and characterization theorems for optimal solutions. Among other things, in this way one recovers some well-known results in a very simple manner.
There are two advantages of the algorithm given in the paper: (I) It appl.es to bipartite as well as to nonbipartite graphs and (II) it is easy to implement it on a computer. A computer program based on the algorithm ...
详细信息
There are two advantages of the algorithm given in the paper: (I) It appl.es to bipartite as well as to nonbipartite graphs and (II) it is easy to implement it on a computer. A computer program based on the algorithm has been tested using various graphs.
暂无评论