ALBERT

All Library Books, journals and Electronic Records Telegrafenberg

Your email was sent successfully. Check your inbox.

An error occurred while sending the email. Please try again.

Proceed reservation?

Export
Filter
  • Articles  (19,802)
  • 1970-1974  (19,802)
  • Computer Science  (19,802)
Collection
  • Articles  (19,802)
Years
Year
Journal
  • 1
    Electronic Resource
    Electronic Resource
    Springer
    Mathematical programming 1 (1971), S. 58-67 
    ISSN: 1436-4646
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Notes: Abstract The discussion will center mainly on some work on two solution concepts: the core for gaines without side payments and the nucleolus for games with side payments (characteristic funtion games). The core has become an important equilibrium concept in mathematical economics. The nucleolus is related to the theory of bargaining sets.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 2
    Electronic Resource
    Electronic Resource
    Springer
    Mathematical programming 1 (1971), S. 117-120 
    ISSN: 1436-4646
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 3
    Electronic Resource
    Electronic Resource
    Springer
    Mathematical programming 1 (1971), S. 123-125 
    ISSN: 1436-4646
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 4
    Electronic Resource
    Electronic Resource
    Springer
    Mathematical programming 1 (1971), S. 153-167 
    ISSN: 1436-4646
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Notes: Abstract We consider a quadratic program equivalent to the general problem of minimizing a convex quadratic function of many variables subject to linear inequality constraints. In previous work [12], one of us presented an algorithm related to such problems, and classified them under “combinatorial equivalence”. The classification contained linear programs at one end (where the function has zero quadratic part) and least-distance programs at the other. A least-distance program is a problem of finding a point of a convex polyhedron which is at least distance from a given point; such programs have been studied by one of us [15, 17] and were shown to correspond to that case of the general problem where the function has positive definite quadratic part. We now extend the work on least-distance programs to those programs intermediate between linear and least-distance (called “essentially bisymmetric” in [12]), and show that such programs are really “hybrids”, with traits inherited from both parent programs: linear and leastdistance.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 5
    Electronic Resource
    Electronic Resource
    Springer
    Mathematical programming 1 (1971), S. 275-290 
    ISSN: 1436-4646
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Notes: Abstract An algorithm is given for solving the optimum potential problem, which is the dual of the classical “out-of-kilter” algorithm for flow problems. Moreover, a new proof of finiteness is provided, which holds even for non-rational data; it applies to all the algorithms of network theory which include a labeling process.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 6
    Electronic Resource
    Electronic Resource
    Springer
    Mathematical programming 2 (1972), S. 130-132 
    ISSN: 1436-4646
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 7
    Electronic Resource
    Electronic Resource
    Springer
    Mathematical programming 2 (1972), S. 133-165 
    ISSN: 1436-4646
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Notes: Abstract An algorithm for minimization of functions of many variables, subject possibly to linear constraints on the variables, is described. In it a subproblem is solved in which a quadratic approximation is made to the object function and minimized over a region in which the approximation is valid. A strategy for deciding when this region should be expanded or contracted is given. The quadratic approximation involves estimating the hessian of the object function by a matrix which is updated at each iteration by a formula recently reported by Powell [6]. This formula enables convergence of the algorithm from any feasible point to be proved. Use of such an approximation, as against using exact second derivatives, also enables a reduction of about 60% to be made in the number of operations to solve the subproblem. Numerical evidence is reported showing that the algorithm is efficient in the number of function evaluations required to solve well known test problems.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 8
    Electronic Resource
    Electronic Resource
    Springer
    Mathematical programming 3 (1972), S. 178-192 
    ISSN: 1436-4646
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Notes: Abstract We study quasi-convex and pseudo-convex quadratic functions on solid convex sets. This generalizes Martos' results in [12] and [13] by using Koecher's results in [8].
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 9
    Electronic Resource
    Electronic Resource
    Springer
    Mathematical programming 3 (1972), S. 157-177 
    ISSN: 1436-4646
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Notes: Abstract A partitioning algorithm for solving the general minimum cost multicommodity flow problem for directed graphs is presented in the framework of a network flow method and the dual simplex method. A working basis which is considerably smaller than the number of capacitated arcs in the given network is employed and a set of simple secondary constraints is periodically examined. Some computational aspects and preliminary experimental results are discussed.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 10
    Electronic Resource
    Electronic Resource
    Springer
    Mathematical programming 3 (1972), S. 396-396 
    ISSN: 1436-4646
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 11
    Electronic Resource
    Electronic Resource
    Springer
    Mathematical programming 3 (1972), S. 1-22 
    ISSN: 1436-4646
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Notes: Abstract Given a point to set mapf on a simplex with certain conditions, an algorithm for computing fixed points is described. The algorithm operates by following the fixed point as an initially affine function is deformed towardsf.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 12
    Electronic Resource
    Electronic Resource
    Springer
    Mathematical programming 1 (1971), S. 68-75 
    ISSN: 1436-4646
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Notes: Abstract Using a fixed point theorem of Browder, the basic existence theorem of Lemke in linear complementarity theory is generalized to the nonlinear case.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 13
    Electronic Resource
    Electronic Resource
    Springer
    Mathematical programming 1 (1971), S. 113-116 
    ISSN: 1436-4646
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 14
    Electronic Resource
    Electronic Resource
    Springer
    Mathematical programming 1 (1971), S. 127-136 
    ISSN: 1436-4646
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Notes: Abstract Linear-algebra rank is the solution to an especially tractable optimization problem. This tractability is viewed abstractly, and extended to certain more general optimization problems which are linear programs relative to certain derived polyhedra.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 15
    Electronic Resource
    Electronic Resource
    Springer
    Mathematical programming 1 (1971), S. 217-238 
    ISSN: 1436-4646
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Notes: Abstract The relative merits of using sequential unconstrained methods for solving: minimizef(x) subject tog i (x) ⩾ 0, i = 1, ⋯, m, h j (x) = 0, j = 1, ⋯, p versus methods which handle the constraints directly are explored. Nonlinearly constrained problems are emphasized. Both classes of methods are analyzed as to parameter selection requirements, convergence to first and second-order Kuhn-Tucker Points, rate of convergence, matrix conditioning problems and computations required.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 16
    Electronic Resource
    Electronic Resource
    Springer
    Mathematical programming 1 (1971), S. 301-306 
    ISSN: 1436-4646
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Notes: Abstract Consider the problem of finding the minimum value of a scalar objective function whose arguments are theN components of 2 N vector elements partially ordered as a Boolean lattice. If the function is strictly decreasing along any shortest path from the minimum point to its logical complement, then the minimum can be located precisely after sequential measurement of the objective function atN + 1 points. This result suggests a new line of research on discrete optimization problems.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 17
    Electronic Resource
    Electronic Resource
    Springer
    Mathematical programming 1 (1971), S. 376-376 
    ISSN: 1436-4646
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 18
    Electronic Resource
    Electronic Resource
    Springer
    Mathematical programming 4 (1973), S. 118-119 
    ISSN: 1436-4646
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 19
    Electronic Resource
    Electronic Resource
    Springer
    Mathematical programming 4 (1973), S. 144-154 
    ISSN: 1436-4646
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Notes: Abstract This article deals mainly with a comparison of certain computational techniques used for the solution of non-linear constrained mathematical programming problems.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 20
    Electronic Resource
    Electronic Resource
    Springer
    Mathematical programming 4 (1973), S. 1-20 
    ISSN: 1436-4646
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Notes: Abstract This paper shows that the linear programming formulation of the two-commodity network flow problem leads to a direct derivation of the known results concerning this problem. An algorithm for solving the problem is given which essentially consists of two applications of the Ford—Fulkerson max flow computation. Moreover, the algorithm provides constructive proofs for the results. Some new facts concerning feasible integer flows are also given.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 21
    Electronic Resource
    Electronic Resource
    Springer
    Mathematical programming 5 (1973), S. 88-124 
    ISSN: 1436-4646
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Notes: Abstract The solution of the Chinese postman problem using matching theory is given. The convex hull of integer solutions is described as a linear programming polyhedron. This polyhedron is used to show that a good algorithm gives an optimum solution. The algorithm is a specialization of the more generalb-matching blossom algorithm. Algorithms for finding Euler tours and related problems are also discussed.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 22
    Electronic Resource
    Electronic Resource
    Springer
    Mathematical programming 5 (1973), S. 127-127 
    ISSN: 1436-4646
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 23
    Electronic Resource
    Electronic Resource
    Springer
    Mathematical programming 5 (1973), S. 381-384 
    ISSN: 1436-4646
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 24
    Electronic Resource
    Electronic Resource
    Springer
    Mathematical programming 5 (1973), S. 386-386 
    ISSN: 1436-4646
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 25
    Electronic Resource
    Electronic Resource
    Springer
    Mathematical programming 5 (1973), S. 387-387 
    ISSN: 1436-4646
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 26
    Electronic Resource
    Electronic Resource
    Springer
    Mathematical programming 5 (1973), S. 388-388 
    ISSN: 1436-4646
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 27
    Electronic Resource
    Electronic Resource
    Springer
    Mathematical programming 5 (1973), S. 385-385 
    ISSN: 1436-4646
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 28
    Electronic Resource
    Electronic Resource
    Springer
    Mathematical programming 5 (1973), S. 1-28 
    ISSN: 1436-4646
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Notes: Abstract Pivot column and row selection methods used by the Devex code since 1965 are published here for the first time. After a fresh look at the iteration process, the author introduces dynamic column weighting factors as a means of estimating gradients for the purpose of selecting a maximum gradient column. The consequent effect of this column selection on rounding error is observed. By allowing that a constraint may not be positioned so exactly as its precise representation in the computer would imply, a wider choice of pivot row is made available, so making room for a further selection criterion based on pivot size. Three examples are given of problems having between 2500 and 5000 rows, illustrating the overall time and iteration advantages over the standard simplex methods used today. The final illustration highlights why these standard methods take so many iterations. These algorithms were originally coded for the Atlas computer and were re-coded in 1969 for the Univac 1108.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 29
    Electronic Resource
    Electronic Resource
    Springer
    Mathematical programming 5 (1973), S. 41-53 
    ISSN: 1436-4646
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Notes: Abstract This paper studies how the solution of the problem of minimizingQ(x) = 1/2x T Kx − k T x subject toGx ≦ g andDx = d behaves whenK, k, G, g, D andd are perturbed, say by terms of size∈, assuming thatK is positive definite. It is shown that in general the solution moves by roughly∈ ifG, g, D andd are not perturbed; whenG, g, D andd are in fact perturbed, much stronger hypotheses allow one to show that the solution moves by roughly∈. Many of these results can be extended to more general, nonquadratic, functionals.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 30
    Electronic Resource
    Electronic Resource
    Springer
    Mathematical programming 5 (1973), S. 29-40 
    ISSN: 1436-4646
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Notes: Abstract Jack Edmonds developed a new way of looking at extremal combinatorial problems and applied his technique with a great success to the problems of the maximal-weight degreeconstrained subgraphs. Professor C. St. J.A. Nash-Williams suggested to use Edmonds' approach in the context of hamiltonian graphs. In the present paper, we determine a new set of inequalities (the “comb inequalities”) which are satisfied by the characteristic functions of hamiltonian circuits but are not explicit in the straightforward integer programming formulation. A direct application of the linear programming duality theorem then leads to a new necessary condition for the existence of hamiltonian circuits; this condition appears to be stronger than the ones previously known. Relating linear programming to hamiltonian circuits, the present paper can also be seen as a continuation of the work of Dantzig, Fulkerson and Johnson on the traveling salesman problem.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 31
    Electronic Resource
    Electronic Resource
    Springer
    Mathematical programming 5 (1973), S. 73-87 
    ISSN: 1436-4646
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Notes: Abstract The problem considered here is that of fitting a linear function to a set of points. The criterion normally used for this is least squares. We consider two alternatives, viz., least sum of absolute deviations (called the L1 criterion) and the least maximum absolute deviation (called the Chebyshev criterion). Each of these criteria give rise to a linear program. We develop some theoretical properties of the solutions and in the light of these, examine the suitability of these criteria for linear estimation. Some of the estimates obtained by using them are shown to be counter-intuitive.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 32
    Electronic Resource
    Electronic Resource
    Springer
    Mathematical programming 5 (1973), S. 54-72 
    ISSN: 1436-4646
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Notes: Abstract For linear multiple-objective problems, a necessary and sufficient condition for a point to be efficient is employed in the development of a revised simplex algorithm for the enumeration of the set of efficient extreme points. Five options within this algorithm were tested on a variety of problems. Results of these tests provide indications for effective use of the algorithm.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 33
    Electronic Resource
    Electronic Resource
    Springer
    Mathematical programming 6 (1974), S. 234-240 
    ISSN: 1436-4646
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 34
    Electronic Resource
    Electronic Resource
    Springer
    Mathematical programming 6 (1974), S. 229-233 
    ISSN: 1436-4646
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Notes: Abstract A particular case of a mathematical theorem of F. Browder on the behavior of the fixed point set of a mapping under variations of a parameter has recently found applications in programming theory in connection with the abstract (non-linear) complementarity problem (see Eaves, [2, 3]). Two relevant extensions of Browder's result are provided: The first asserts that, under smoothness assumptions, the connected set of fixed points one gets from Browder's theorem is “generically” an arc; the second gives a generalization to the case where the mapping is an upper hemicontinuous contractible valued correspondence.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 35
    Electronic Resource
    Electronic Resource
    Springer
    Mathematical programming 6 (1974), S. 371-371 
    ISSN: 1436-4646
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 36
    Electronic Resource
    Electronic Resource
    Springer
    Mathematical programming 6 (1974), S. 360-364 
    ISSN: 1436-4646
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Notes: Abstract This paper investigates some convergence properties of Fiacco and McCormick's SUMT algorithm. A convex programming problem is given for which the SUMT algorithm generates a unique unconstrained minimizing trajectory having an infinite number of accumulation points, each a global minimizer to the original convex programming problem.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 37
    Electronic Resource
    Electronic Resource
    Springer
    Mathematical programming 6 (1974), S. 1-13 
    ISSN: 1436-4646
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Notes: Abstract A simple algorithm is described for constructing a maximum packing of cuts directed away from a distinguished vertex, called the root, in a directed graph, each of whose edges has a nonnegative weight, and it is shown that the maximum packing value is equal to the weight of a minimum-weight spanning arborescence directed away from the root.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 38
    Electronic Resource
    Electronic Resource
    Springer
    Mathematical programming 6 (1974), S. 42-47 
    ISSN: 1436-4646
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Notes: Abstract In this paper we re-examine some of the available methods for pricing out the columns in the simplex method and point out their potential advantages and disadvantages. In particular, we show that a simple formula for updating the pricing vector can be used with some advantage in the standard product form simplex algorithm and with very considerable advantage in two recent developments: P.M.J. Harris' dynamic scaling method and the Forrest—Tomlin method for maintaining triangular factors of the basis.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 39
    Electronic Resource
    Electronic Resource
    Springer
    Mathematical programming 7 (1974), S. 223-235 
    ISSN: 1436-4646
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Notes: Abstract The purpose of this paper is to present sufficient conditions for the existence of optimal solutions to integer and mixed-integer programming problems in the absence of upper bounds on the integer variables. It is shown that (in addition to feasibility and boundedness of the objective function) (1) in the pure integer case a sufficient condition is that all of the constraints (other than non-negativity and integrality of the variables) beequalities, and (2) that in the mixed-integer caserationality of the constraint coefficients is sufficient. Some computational implications of these results are also given.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 40
    Electronic Resource
    Electronic Resource
    Springer
    Mathematical programming 7 (1974), S. 253-258 
    ISSN: 1436-4646
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 41
    Electronic Resource
    Electronic Resource
    Springer
    Mathematical programming 7 (1974), S. 262-262 
    ISSN: 1436-4646
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 42
    Electronic Resource
    Electronic Resource
    Springer
    Mathematical programming 7 (1974), S. 376-379 
    ISSN: 1436-4646
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 43
    Electronic Resource
    Electronic Resource
    Springer
    Mathematical programming 7 (1974), S. 351-367 
    ISSN: 1436-4646
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Notes: Abstract This paper addresses the problem of selecting the parameter in a family of algorithms for unconstrained minimization known as Self Scaling Variable Metric (SSVM) Algorithms. This family, that has some very attractive properties, is based on a two parameter formula for updating the inverse Hessian approximation, in which the parameters can take any values between zero and one. Earlier results obtained for SSVM algorithms apply to the entire family and give no indication of how the choice of parameter may affect the algorithm's performance. In this paper, we examine empirically the effect of varying the parameters and relaxing the line-search. Theoretical consideration also leads to a switching tule for these parameters. Numerical results obtained for the SSVM algorithm indicate that with proper parameter selection it is superior to the DFP algorithm, particularly for high-dimensional problems.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 44
    Electronic Resource
    Electronic Resource
    Springer
    Mathematical programming 7 (1974), S. 388-388 
    ISSN: 1436-4646
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 45
    Electronic Resource
    Electronic Resource
    Springer
    Mathematical programming 7 (1974), S. 384-387 
    ISSN: 1436-4646
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Notes: Abstract Some properties of “Davidon”, or variable metric, methods are studied from the viewpoint of convex analysis; they depend on the convexity of the function to be minimized rather than on its being approximately quadratic. An algorithm is presented which generalizes the variable metric method, and its convergence is shown for a large class of convex functions.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 46
    Electronic Resource
    Electronic Resource
    Springer
    Computing 10 (1972), S. 23-31 
    ISSN: 1436-5057
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Description / Table of Contents: Abstract Rounding errors which are inevitably made during the evaluation of a function by a computer lead to the problem of calculating zeros of an approximately computed function. We describe some methods generating simultaneously lower and upper bounds for zeros including all round-off errors automatically. A comparison with running error analysis [19] is given.
    Notes: Zusammenfassung Betrachtet wird die Aufgabe der Nullstelleneingrenzung von nur näherungsweise berechenbaren Funktionen. Dazu werden Verfahren verwendet, welche sowohl die unvermeidlichen Rundungsfehler als auch Ungenauigkeiten in den Ausgangsdaten automatisch miterfassen. Nach einer Beschreibung der zugrundeliegenden Methoden wird ein Vergleich mit anderen bekannten Vorgehensweisen, insbesondere mit running error analysis [19], gezogen.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 47
    Electronic Resource
    Electronic Resource
    Springer
    Computing 10 (1972), S. 107-109 
    ISSN: 1436-5057
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Description / Table of Contents: Abstract Given a graph by a node-node-matrix. One finds the distanced ij of two nodesP i andP j by using binary operations between the rows of the node-node-matrix.
    Notes: Zusammenfassung Ein Graph sei gegeben durch seine Knoten-Knoten-Matrix. Den Abstandd ij von zwei KnotenP i undP j des Graphen bestimmt man mit Hilfe von binären Verknüpfungen der Zeilen der Knoten-Knoten-Matrix.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 48
    Electronic Resource
    Electronic Resource
    Springer
    Computing 10 (1972), S. 97-106 
    ISSN: 1436-5057
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Description / Table of Contents: Zusammenfassung Der Effekt der Rundungsfehler in einem algebraischen Prozeß wird oft mit einer sogenannten Rückwärtsanalyse untersucht. Wir wollen hier die Möglichkeit untersuchen, diese Analyse auf einem Computer auszuführen. Wir beginnen mit einer genauen Definition eines stabilen Algorithmus, oder aber eines Algorithmus der relativ unempfindlich auf Rundungsfehler reagiert.
    Notes: Abstract The effect of rounding errors on an algebraic process is often investigated by means of a so-called backward analysis. In this paper we will discuss the possibility of performing such an analysis on a computer. We begin with a precise definition of a stable algorithm, i.e., an algorithm which is relatively insensitive to rounding errors.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 49
    Electronic Resource
    Electronic Resource
    Springer
    Computing 10 (1972), S. 137-152 
    ISSN: 1436-5057
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 50
    Electronic Resource
    Electronic Resource
    Springer
    Computing 10 (1972), S. 167-175 
    ISSN: 1436-5057
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Description / Table of Contents: Abstract When solving linear equations with elimination methods, pivotal strategies are used to improve numerical precision. In this paper some new pivotal strategies are suggested and compared with known strategies by means of numerical experiments.
    Notes: Zusammenfassung Bei der Lösung linearer Gleichungssysteme mit Eliminationsmethoden verwendet man Pivot-Strategien zur Steigerung der numerischen Genauigkeit. In dieser Arbeit werden einige neue Pivot-Strategien vorgeschlagen und mit bekannten Strategien an Hand numerischer Experimente verglichen.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 51
    Electronic Resource
    Electronic Resource
    Springer
    Computing 10 (1972), S. 189-190 
    ISSN: 1436-5057
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 52
    ISSN: 1436-5057
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Description / Table of Contents: Abstract A coherence is pointed out between a general spline-approximation and the dynamic programming. In this way it is possible to construct a numerical method for the solution of complicated approximation problems. For instance eachLp-approximation including the Tschebyscheff-approximation problem may be solved regarding inequality constraints between the element parameters of the spline function and varying the generally fixed spline knots. Moreover it is possible to treat more general problems arising from optimisation calculations during the design of roads.
    Notes: Zusammenfassung Es wird ein Zusammenhang hergestellt zwischen einer verallgemeinerten Spline-Approximation und der dynamischen Optimierung. Dadurch ist es möglich, ein numerisches Verfahren zur Lösung von komplizierten Approximationsaufgaben anzugeben. Beispielsweise läßt sich damit jedeLp-Approximation einschließlich der Tschebyscheff-Approximation numerisch behandeln unter Berücksichtigung von Ungleichungsnebenbedingungen zwischen den Elementparametern der Spline-Funktion und unter Freigabe der üblicherweise festgehaltenen Spline-Knoten. Darüber hinaus lassen sich dadurch allgemeinere Aufgaben lösen, die bei Optimierungsberechnungen während der Entwurfsbearbeitung von Straßen auftreten können.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 53
    Electronic Resource
    Electronic Resource
    Springer
    Computing 11 (1973), S. 175-177 
    ISSN: 1436-5057
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Description / Table of Contents: Zusammenfassung Eine Menge vonn geordneten reellen Zahlen wird mittels vollständiger Enumeration ink Teilmengen (Cluster) derart zerlegt, daß die Summe der Summe der Abweichungsquadrate vom Mittelwert innerhalb jeder Teilmenge minimiert wird.
    Notes: Abstract A set ofn ordered real numbers is partitioned by complete enumeration intok clusters such that the sum of the sum of squared deviations from the mean-value within each cluster is minimized.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 54
    Electronic Resource
    Electronic Resource
    Springer
    Computing 11 (1973), S. 179-180 
    ISSN: 1436-5057
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 55
    Electronic Resource
    Electronic Resource
    Springer
    Computing 11 (1973), S. 213-220 
    ISSN: 1436-5057
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Description / Table of Contents: Abstract The situation of the hardwaretechnic enables also computers of average-performance to install the multiprogramming operational-mode. The structure and the strategy of a supplementary program for the semi-automatical multiprogramming operation will be stated. By these means the computers may be used more economically with only small additional display of software.
    Notes: Zusammenfassung Der Stand der Hardwaretechnik erlaubt durchaus auch für DV-Anlagen mittlerer Leistung die Einführung des Multiprogramming-Betriebsmodus. Es wird die Struktur und die Strategie eines Zusatzprogrammes zum halbautomatischen Multiprogrammingbetrieb angegeben. Dadurch können DV-Anlagen bei geringem zusätzlichem Softwareaufwand rationeller als bisher genutzt werden.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 56
    Electronic Resource
    Electronic Resource
    Springer
    Computing 11 (1973), S. 249-254 
    ISSN: 1436-5057
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Description / Table of Contents: Abstract The paper describes a surprisingly occuring rounding error in Gomory's all-integer algorithm for the solution of linear integer programming problems. A modification for the numerical stabilization of the algorithm is quoted.
    Notes: Zusammenfassung Die Arbeit beschreibt einen überraschenderweise bei Gomorys ganzzahligem Algorithmus zur Lösung rein-ganzzahliger linearer Optimierungsprobleme auftretenden Rundungsfehler. Eine Modifikation zur numerischen Stabilisierung des Verfahrens wird angegeben.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 57
    Electronic Resource
    Electronic Resource
    Springer
    Computing 11 (1973), S. 305-306 
    ISSN: 1436-5057
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 58
    Electronic Resource
    Electronic Resource
    Springer
    Computing 11 (1973), S. 315-325 
    ISSN: 1436-5057
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Description / Table of Contents: Zusammenfassung Zuerst wird ein explizites Differenzenverfahren beschrieben, das die eindimensionale Wärmeleitungs-gleichung approximiert und bei willkürlicher Wahl des Differenzengitters stabil ist. Dann folgt die Beschreibung eines Glättungsverfahrens, das die praktische Anwendung dieser Methode ermöglicht.
    Notes: Abstract An explicit difference approximation of the one-dimensional diffusion equation equation, which is stable for any choice of the difference gird and has a comparatively small truncation error, is described. A smoothing formula, which makes the practical use of this method possible, is given.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 59
    Electronic Resource
    Electronic Resource
    Springer
    Computing 11 (1973), S. 353-363 
    ISSN: 1436-5057
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Description / Table of Contents: Abstract Choosing an internal floating-point representation for a binary computer with given word-length is influenced by two factors: the size of the range of admissible numbers and the precision of the respective floating-point arithmetic. In this paper “precision” is defined by a statistical model of rounding errors. According to this definition base 4 floating-point arithmetic on an average produces smaller rounding errors than all other floating-point arithmetics with a base 2k, provided that the ranges of numbers have equal size.
    Notes: Zusammenfassung Bei der Auswahl einer internen Gleitkomma-Darstellung für einen binären Computer mit gegebener Wortlänge sind zwei Gesichtspunkte maßgebend: erstens die Größe des zulässigen Zahlbereichs und zweitens die Genauigkeit der zugehörigen Gleitkomma-Arithmetik. In dieser Arbeit wird der Begriff Genauigkeit über ein statistisches Rundungsfehlermodell definiert. Dann wird gezeigt, daß bei binären Computern Gleitkomma-Arithmetik zur Basis 4 durchschnittlich kleinere Rundungsfehler liefert als alle anderen Gleitkomma-Arithmetiken zu einer Basis 2k bei gleicher Größe des zulässigen Zahlbereichs.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 60
    ISSN: 1436-5057
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Description / Table of Contents: Abstract In this paper we consider finite difference operators which approximate the dirichlet problem of general nonlinear elliptic equations. For such nonlinear operators we give several criteria which insure the validity of an discrete monotonicity and maximum principle. In the case of linear difference operators one of these criteria is known as a necessary and sufficient condition.
    Notes: Zusammenfassung In der vorliegenden Arbeit werden Differenzenoperatoren als Approximationen des Dirichletproblems allgemeiner nichtlinearer elliptischer Differentialgleichungen betrachtet. Für diese nichtlinearen Operatoren werden verschiedene Kriterien angegeben, welche die Gültigkeit eines diskreten Monotonie- und Randmaximumprinzips sichern. Eines dieser Kriterien ist bei linearen Differenzenoperatoren bekannt als notwendige und hinreichende Bedingung.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 61
    Electronic Resource
    Electronic Resource
    Springer
    Computing 12 (1974), S. 17-41 
    ISSN: 1436-5057
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Description / Table of Contents: Abstract Several kinds of differentiability are defined, which are adapted to the study of a large class of optimization problems. A theory is constructed with special respect to problems with nonsmooth target-functions and side conditions.
    Notes: Zusammenfassung Es werden Differenzierbarkeitsbegriffe eingeführt, die sich zum Studium einer großen Klasse von Optimierungsaufgaben eignen. Besondere Berücksichtigung finden dabei Aufgaben mit nichtglatten Zielfunktionen und Nebenbedingungen.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 62
    Electronic Resource
    Electronic Resource
    Springer
    Computing 12 (1974), S. 67-73 
    ISSN: 1436-5057
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Description / Table of Contents: Abstract Generalized norms are used to define hypernormballs in linear spaces. It turns out that the intervals, intervalvectors, intervalmatrices and intervalfunctions of Interval Analysis are special hypernormballs. Then the induced algebraic structure in the space of hypernormballs is investigated.
    Notes: Zusammenfassung In linearen Räumen werden mittels eines verallgemeinerten Normbegriffes gewisse Teilmengen ausgezeichnet, die Hypernormbälle. Es zeigt sich, daß die in der Intervallrechnung auftretenden Intervalle, Intervallvektoren, Intervallmatrizen und Intervallfunktionen spezielle Hypernormbälle sind. Sodann wird die induzierte algebraische Struktur im Raum der Hypernormbälle untersucht.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 63
    Electronic Resource
    Electronic Resource
    Springer
    Computing 10 (1972), S. 83-95 
    ISSN: 1436-5057
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Description / Table of Contents: Abstract As well known, Gauss-quadrature formulas are constructed by integration of suitably choosen Hermitian interpolating polynomials. At first, a general linear interpolating operator and its error-term are given. Integrating this operator, one yields quadrature formulas containing some first derivatives of the integrand-function. By the requirement, that the weights of these derivatives should vanish all together, we get general quadrature formulas of Gauss-type. For some special basic functions of the interpolating operator, vanishing of the weights of the derivatives is necessary for minimization of the quadrature error. The general Gauss-quadratures may be determinated algebraically if sufficiently many fix-elements of the interpolating operator are known. As special cases one has, besides the known usual Gauss-quadratures and Wilf's quadrature procedure, a very surprising result.
    Notes: Zusammenfassung Die Gaußschen Quadraturformeln erhält man bekanntlich durch Integration geeignet gewählter Hermitescher Interpolationspolynome. Zunächst wird hier ein allgemeiner linearer Interpolationsoperator mit Restglied angegeben. Durch Integration dieses Operators erhält man Quadraturformeln die neben Funktionswerten auch Werte der 1. Ableitung des Integranden enthalten. Fordert man, daß die Gewichte dieser Ableitungswerte sämtlich verschwinden, so erhält man allgemeine Gaußsche Quadraturformeln. Bei speziellen Arten von Basisfunktionen des Interpolationsoperators ist das Verschwinden der Gewichte der Ableitungswerte notwendig für die Minimierung des Quadraturrestes. Die allgemeinen Gaußschen Quadraturformeln lassen sich bei Kenntnis von hinreichend vielen Fixelementen des Interpolations-operators auch algebraisch herleiten. Als Sonderfälle erhält man neben der bekannten gewöhnlichen Gauß-Quadratur das Wilfsche Quadraturverfahren, ein sehr überraschendes Ergebnis.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 64
    Electronic Resource
    Electronic Resource
    Springer
    Computing 10 (1972), S. 121-136 
    ISSN: 1436-5057
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Description / Table of Contents: Abstract In Part I is shown, how to decompose a connected graph into triply connected components in a canonical manner and how to compute a standard form of an arbitrary graph from standard forms of triply connected graphs. Hence, in part II a method is given, which allows to construct a standard form of triply connected planar graphs. Besides that, an ALGOL-program is presented which realizes both this method and a planarity criterium.
    Notes: Zusammenfassung In Teil I wird gezeigt, wie ein zusammenhängender Graph in kanonischer Weise in dreifach-zusammenhängende Komponenten zerlegt werden kann, und wie man aus Normalformen dreifach-zusammenhängender Graphen Normalformen beliebiger Graphen erhält. In Teil II wird dann eine Methode zur Gewinnung von Normalformen dreifach-zusammenhängender Graphen dargestellt. Außerdem wird ein ALGOL-Programm angegeben, das diese Methode sowie ein Planaritätskriterium realisiert.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 65
    Electronic Resource
    Electronic Resource
    Springer
    Computing 10 (1972), S. 231-244 
    ISSN: 1436-5057
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Description / Table of Contents: Abstract In this paper an intervalanalytic generalization of the theorem ofPrager-Oettli is used to characterize the solution-set of an, n-system of linear equations with interval coefficients as union of convex polyhedra with special properties. Then it is shown how to deduce from the theorem ofPrager-Oettli a nearly optimaln-interval contained in the solution-set. On the other hand the problem of finding with reasonable expense sharpn-intervals containing the solution-set is solved only for special cases. Some results on this problem are discussed; a numerical example shows the importance of criteria, under which sharpn-intervals can be computed with reasonable effort.
    Notes: Zusammenfassung In der vorliegenden Arbeit wird mit Hilfe einer intervallanalytischen Verallgemeinerung des Satzes vonPrager-Oettli die Lösungsmenge von Intervallgleichungssystemen als Vereinigung von konvexen Polyedern mit speziellen Eigenschaften charakterisiert. Anschließend wird gezeigt, wie sich aus dem Satz vonPrager-Oettli brauchbare Innenabschätzungen der Lösungsmenge ableiten lassen. Dagegen ist das Problem, möglichst scharfe Außenabschätzungen mit vertretbarem Aufwand zu bestimmen, vorerst nur unter gewissen Voraussetzungen gelöst. Einige Ergebnisse zu diesem Problem werden diskutiert; ein numerisches Beispiel verdeutlicht die Bedeutung von Kriterien, unter denen scharfe Außenabschätzungen mit vertretbarem Aufwand berechnet werden können.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 66
    Electronic Resource
    Electronic Resource
    Springer
    Computing 10 (1972), S. 271-283 
    ISSN: 1436-5057
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Description / Table of Contents: Abstract Floyd developed a matrix algorithm to find all shortest paths in a network. If we modify the algebraic structure of the network the same algorithm can be applied to large number of other problems. A general theory for these algorithms is developed and applied to numerous problems.
    Notes: Zusammenfassung Floyd entwickelte einen Matrixalgorithmus zur Bestimmung der Längen aller kürzesten Wege in einem Netzwerk. In der vorliegenden Arbeit wird gezeigt, daß, falls man den Begriff des Netzwerkes etwas verallgemeinert, sich mit Hilfe des gleichen Verfahrens eine Fülle von grundverschiedenen Problemen lösen läßt. Es wird eine entsprechende Theorie entwickelt und an Beispielen erläutert.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 67
    Electronic Resource
    Electronic Resource
    Springer
    Computing 10 (1972), S. 317-333 
    ISSN: 1436-5057
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Description / Table of Contents: Abstract The paper describes an automatic drawing algorithm permitting every planar graph to be displayed with straight lines in the plane, if the cyclic order of the adjacent vertices for every vertex of the graph is found out by a topological algorithm for planarity. In this connection also a sufficient condition is proved for the uniqueness of the above mentioned cyclic order in every drawing without crossings.
    Notes: Zusammenfassung Es wird ein automatischer Zeichenalgorithmus beschrieben, der es gestattet, jeden planaren Graphen geradlinig in die Ebene abzubilden, wenn die zyklische Reihenfolge der Nachbarknoten nach einem topologischen Planarisierungsalgorithmus für jeden Knoten des Graphen bekannt ist. In diesem Zusammenhang wird auch eine hinreichende Bedingung dafür angegeben, daß die oben erwähnte zyklische Reihenfolge in einer kreuzungsfreien Zeichung des Graphen durch diesen eindeutig bestimmt ist.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 68
    Electronic Resource
    Electronic Resource
    Springer
    Computing 10 (1972), S. 335-351 
    ISSN: 1436-5057
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Description / Table of Contents: Zusammenfassung Verteilt man geometrische Objekte in zufälliger Lage im Raum oder in der Ebene, so bilden sich durch Überlappen sogenannteKlumpen. In der vorliegenden Arbeit wird die asymptotische Verteilung der Anzahl von Klumpen gegebener Größe und topologischer Struktur innerhalb des folgenden Modells untersucht: Sindx 1, ...,x n Punkte im ℝ n und istU=-U⊂ℝ eine symmetrische Menge, dannüberlappen sich die Punktex i undx j , oder besser, sie bilden eineU-Koinzidenz, genau dann, wennx i −x j ∈U gilt. Wir ordnen den Punktenx 1, ...,x n undU den sogenanntenKoinzidenzgraphen G(x 1, ...,x n ;U)≔≔({1, ...,n}, {[i, j]:1≤i〈j≤n, x i −x j ∈U}) zu und fragen nach der AnzahlL(x 1, ...,x n ;U, H) zusammenhängender Komponenten vonG(...), die zu einem festen GraphenH isomorph sind. In der vorliegenden Arbeit wird die asymptotische Verteilung vonL(...) unter verschiedenen Voraussetzungen über die Verteilung der Punktex 1, ...,x n sowie die Größe vonU untersucht. In Abhängigkeit von diesen Voraussetzungen ist die asymptotische Verteilung vonL(...) entweder eine Normal- oder eine Poisson-Verteilung.
    Notes: Abstract When objects are scattered at random in the plane or in space, some of them overlap to form clumps. It is the object of the present paper to study the asymptotic distribution of the number of clumps of given size and topological structure generated within the following model: Ifx 1, ...,x n are points in ℝ n andU=-U⊂ℝ n is a symmetric set, then the pointsx i andx j are said tooverlap or rather to form aU-coincidence, ifx i −x j ∈U. Adjoining tox 1, ...,x n andU, the graphG(x 1, ...,x n ;U)≔({1, ..., n}, {[i, j]:1≤i〈j≤n;x i −x j ∈U}), the so calledcoincidence-graph, we ask for the number of connected components of this graph isomorphic to a given graphH and call this numberL9x 1, ...x n ;U, H). In the paper, the asymptotic distribution ofL(...) under various assumptions about the distribution of the pointsx 1, ...,x n and the size ofU is studied. Depending on these assumptions, we prove that the asymptotic distribution ofL(...) is either Poisson or normal.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 69
    Electronic Resource
    Electronic Resource
    Springer
    Mathematical programming 6 (1974), S. 105-109 
    ISSN: 1436-4646
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 70
    Electronic Resource
    Electronic Resource
    Springer
    Mathematical programming 6 (1974), S. 118-118 
    ISSN: 1436-4646
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 71
    Electronic Resource
    Electronic Resource
    Springer
    Mathematical programming 6 (1974), S. 121-140 
    ISSN: 1436-4646
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Notes: Abstract This nested decomposition algorithm is intended for solving linear programs with the staircase structure that is characteristic of dynamic multi-sector models for economic development. Staircase problems represent a special case of the discrete-time optimal control problem. Our method is based upon the same principles as that of Glassey [5], but appears easier to describe and to relate to control theory. Computational experience is reported for a series of test problems. The algorithm has been coded in MPL, an experimental language for mathematical programming. This translator has made it possible to obtain a more readable program — and with fewer instructions — than one written in a conventional language. However, because the present version of MPL does not permit the use of slow access memory, this has prevented us from exploring the full potential of nested decomposition for solving larger problems than can be handled by conventional simplex techniques.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 72
    Electronic Resource
    Electronic Resource
    Springer
    Mathematical programming 6 (1974), S. 167-179 
    ISSN: 1436-4646
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Notes: Abstract In earlier results by Sposito and David, Kuhn—Tucker duality was established over nondegenerate cone domains (not necessarily polyhedral) without differentiability under a certain natural modification of the Slater condition, in addition to the convexity of a certain auxiliary set. This note extends Kuhn—Tucker duality to optimization problems with both nondegenerate and degenerate cone domains. Moreover, under a different condition than presented in earlier results by the author, this note develops Kuhn—Tucker duality for a certain class of nonlinear problems with linear constraints and an arbitrary objective function.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 73
    Electronic Resource
    Electronic Resource
    Springer
    Computing 13 (1974), S. 385-387 
    ISSN: 1436-5057
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 74
    ISSN: 1436-5057
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Description / Table of Contents: Abstract An elastic body in contact with an elastic or rigid subgrade is represented by Finite Elements. The total potential energy of the system under consideration of linearly elastic material and small deformations is now a quadratic function of the nodal deformations and the nodal values of the contact pressure which is approximated by a polynomial. Only a part of the surface of the body must be proposed which includes the real contact surface. After evaluation of the equilibrium equations and the contact condition in an inequality and a linear transformation of the nodal variables, all relations are now so formulated, that minimization of total potential energy can be expressed as a Quadratic Program in the unknown nodal deformations and nodal values of contact pressure. Standard Programs can now be used for solution.
    Notes: Zusammenfassung Der mit einer elastischen oder starren Unterlage in Kontakt tretende Körper wird durch finite Elemente repräsentiert. Die totale potentielle Energie des Systems ist bei elastischem Materialverhalten und kleinen Verformungen eine quadratische Funktion in den Knotenvariablen und den Knotenpunktsordinaten der durch ein Polynom approximierten Kontaktdruckverteilung. Dazu ist nur ein Bereich auf der Oberfläche des Körpers festzulegen, innerhalb dessen die aktuelle Kontaktfläche liegen muß. Nach Ermittlung der Gleichgewichtsbedingungen und der entsprechenden Kontaktbedingung als Ungleichung sowie einer linearen Transformation der Knotenvariablen werden num sämtliche Beziehungen so formuliert, daß sich die Minimierung der totalen potentiellen Energie als ein Quadratisches Programm in den Knotenvariablen und den entsprechenden Ordinaten der Kontaktdruckverteilung darstellen läßt. Die Lösung des quadratischen Programmes kann mit Standardprogrammen durchgeführt werden.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 75
    Electronic Resource
    Electronic Resource
    Springer
    Mathematical programming 7 (1974), S. 260-261 
    ISSN: 1436-4646
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 76
    Electronic Resource
    Electronic Resource
    Springer
    Mathematical programming 7 (1974), S. 263-282 
    ISSN: 1436-4646
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Notes: Abstract For a given inequality with 0–1 variables, there are many other “equivalent” inequalities with exactly the same 0–1 feasible solutions. The set of all equivalent inequalities is characterized, and methods to construct the equivalent inequality with smallest coefficients are described.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 77
    Electronic Resource
    Electronic Resource
    Springer
    Mathematical programming 7 (1974), S. 283-310 
    ISSN: 1436-4646
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Notes: Abstract An algorithm for the linear complementarity problem is developed which uses principal pivots only. The algorithm is shown to be equivalent to Lemke's algorithm. The advantage of the proposed algorithm is that infeasibility tests may be made after each principal pivot. One such test is equivalent to a check whether the matrix satisfies the “plus” condition of copositive plus matrices or the condition of classL 2 of Eaves.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 78
    Electronic Resource
    Electronic Resource
    Springer
    Mathematical programming 7 (1974), S. 368-375 
    ISSN: 1436-4646
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Notes: Abstract The theorem of this paper is of the same general class as Farkas' Lemma, Stiemke's Theorem, and the Kuhn—Fourier Theorem in the theory of linear inequalities. LetV be a vector subspace ofR n , and let intervalsI 1,⋯, I n of real numbers be prescribed. A necessary and sufficient condition is given for existence of a vector (x 1 ,⋯, x n ) inV such thatx i ∈I i (i = 1, ⋯,n); this condition involves the “elementary vectors” (nonzero vectors with minimal support) ofV ⊥. The proof of the theorem uses only elementary linear algebra.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 79
    Electronic Resource
    Electronic Resource
    Springer
    Mathematical programming 7 (1974), S. 389-389 
    ISSN: 1436-4646
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 80
    Electronic Resource
    Electronic Resource
    Springer
    Mathematical programming 7 (1974), S. 390-390 
    ISSN: 1436-4646
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 81
    Electronic Resource
    Electronic Resource
    Springer
    Mathematical programming 7 (1974), S. 17-31 
    ISSN: 1436-4646
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Notes: Abstract A nonlinear generalization of square matrices with non-positive off-diagonal elements is presented, and an algorithm to solve the corresponding complementarity problem is suggested. It is shown that the existence of a feasible solution implies the existence of a least solution which is also a complementary solution. A potential application of this nonlinear setup in extending the well-known linear Leontief input—output systems is discussed.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 82
    Electronic Resource
    Electronic Resource
    Springer
    Mathematical programming 7 (1974), S. 46-59 
    ISSN: 1436-4646
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Notes: Abstract This paper presents a new algorithm for the continuous modular design problem. The method is based on and can be combined with preceding work by Passy, and Shaftel and Thompson. The proposed algorithm guarantees a strict decrease of the objective function's value at every iteration and converges in a finite number of steps.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 83
    Electronic Resource
    Electronic Resource
    Springer
    Computing 5 (1970), S. 6-16 
    ISSN: 1436-5057
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Description / Table of Contents: Summary This paper deals with a characterization of special cases when the distributive law is satisfied in interval arithmetic, a question first formulated byMoore [1]. To find a solution, the basic problem is subdivided into eight cases; in three of them distributivity ever holds, while in other three cases the law is failing. The conditions concerning the remaining cases are combined to a general characterization.
    Notes: Zusammenfassung Diese Arbeit behandelt die vonMoore [1] aufgeworfene Frage nach einer Charakterisierung der Sonderfälle, für die das distributive Gesetz in der Intervallarithmetik Gültigkeit hat. Das Ausgangsproblem wird in acht Fälle unterteilt, die einzeln behandelt werden; in dreien gilt das Gesetz immer, in weiteren dreien versagt es. Die Bedingungen, die sich für die beiden restlichen Fälle angeben lassen, werden zu einer allgemeinen Charakterisierung zusammengefaßt.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 84
    Electronic Resource
    Electronic Resource
    Springer
    Computing 5 (1970), S. 57-70 
    ISSN: 1436-5057
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Description / Table of Contents: Summary A class of automata with tape has been defined and considered as recognition devices. Our automaton can use its working tape only as a buffer, i. e. in a “first-in-first-out” manner. Some modifications of the general model are considered, especially the deterministic, real-time version. The position in theChomsky hierarchy of the class of languages accepted by such automata and some operations with these languages have been investigated. Some results on decidability questions are cited.
    Notes: Zusammenfassung Es wird ein Automat mit Speicherband eingeführt und in seiner Eigenschaft als erkennender Automat untersucht. Er kann sein Arbeitsband nur als Puffer benutzen, d. h. was zuerst eingelesen wird, wird auch zuerst wieder ausgelesen. Es werden verschiedene Modifikationen des Grundmodells, insbesondere aber die deterministische, in Realzeit arbeitende Version betrachtet, sowohl hinsichtlich der Lage der durch den Automatentyp definierten Sprachklasse in derChomsky-Hierarchie, als auch das Verhalten dieser Sprachen gegenüber gewissen Operationen. Einige Resultate über Entscheidbarkeitsfragen werden zitiert.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 85
    Electronic Resource
    Electronic Resource
    Springer
    Computing 5 (1970), S. 89-96 
    ISSN: 1436-5057
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 86
    Electronic Resource
    Electronic Resource
    Springer
    Computing 5 (1970), S. 17-26 
    ISSN: 1436-5057
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Description / Table of Contents: Summary In the first part of this paper a method is given, which permits enclosing the first eigenvalue of positive completely continuous Operators in a separableHilbert space. The interval of enclosing, constructed by the orthogonal-invariants does not need arbitrary initial elements but needs knowledge of variety of the first eigenvalue. For numerical computation of the variety a method is proposed which supposes knowledge of estimation of the quotient of the first and second eigenvalue. The problem of enclosing higher order eigenvalues is treated in the second part of this paper.
    Notes: Zusammenfassung Im ersten Teil dieser Arbeit soll ein Verfahren angegeben werden, das es gestattet, den ersten Eigenwert eines positiven, vollstetigen Operators in einem separablenHilbert-Raum einzuschließen. Das mit Hilfe der Orthogonalinvarianten konstruierte Einschließungsintervall bedarf keinerlei willkürlicher Anfangselemente, benötigt aber die Kenntnis der Vielfachheit des ersten Eigenwertes. Zur numerischen Berechnung der Vielfachheit wird ein Verfahren vorgeschlagen, das die Kenntnis einer Abschätzung des Quotienten aus dem ersten und zweiten Eigenwert voraussetzt. Die Einschließung der höheren Eigenwerte wird im zweiten Teil der vorliegenden Arbeit behandelt.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 87
    Electronic Resource
    Electronic Resource
    Springer
    Computing 5 (1970), S. 82-88 
    ISSN: 1436-5057
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 88
    Electronic Resource
    Electronic Resource
    Springer
    Computing 5 (1970), S. 119-127 
    ISSN: 1436-5057
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Description / Table of Contents: Summary The construction of intervals of enclosing for higher order eigenvalues of positiveHilbert-Schmidt operators in a separableHilbert space is reduced to the problem of the interval of enclosing for the first order eigenvalue of a positiveHilbert-Schmidt operator.
    Notes: Zusammenfassung Die Konstruktion von Einschließungsintervallen für die höheren Eigenwerte positiverHilbert-Schmidtscher Operatoren in separablenHilberträumen wird auf die Aufgabe zurückgeführt, ein Einschließungsintervall für den ersten Eigenwert eines positivenHilbert-Schmidtschen Operators anzugeben.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 89
    Electronic Resource
    Electronic Resource
    Springer
    Computing 5 (1970), S. 184-184 
    ISSN: 1436-5057
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 90
    Electronic Resource
    Electronic Resource
    Springer
    Computing 5 (1970), S. 349-355 
    ISSN: 1436-5057
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Description / Table of Contents: Summary In 1967Cheney andGoldstein presented a paper on mean square approximation by generalized rational functions. The problem of uniqueness of the best approximation remained unsolved. In this paper it is shown, that there may be several different rational functions which are bestL p -approximation (1≤p〈∞) of a given function.
    Notes: Zusammenfassung In einer Arbeit vonCheney undGoldstein aus dem Jahre 1967 wurden die Probleme untersucht, die sich im Zusammenhang mit der rationalen Approximation einer gegebenen stetigen Funktion in derL 2-Norm stellen. In der vorliegenden Arbeit soll unter anderem die vonCheney undGoldstein offengelassene Frage der Eindeutigkeit der besten rationalen Approximation untersucht werden.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 91
    Electronic Resource
    Electronic Resource
    Springer
    Computing 5 (1970), S. 394-394 
    ISSN: 1436-5057
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 92
    Electronic Resource
    Electronic Resource
    Springer
    Computing 5 (1970), S. 312-323 
    ISSN: 1436-5057
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 93
    Electronic Resource
    Electronic Resource
    Springer
    Computing 5 (1970), S. 332-332 
    ISSN: 1436-5057
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 94
    Electronic Resource
    Electronic Resource
    Springer
    Computing 5 (1970), S. 71-81 
    ISSN: 1436-5057
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Description / Table of Contents: Summary Iteration methods are given for the solution of nonlinear equations in normed spaces requiring functionvalues and first-order divided differences. The latter may be replaced by derivations. The linear equations of each iteration step are solved only approximatively but this does not diminish the order of convergence.
    Notes: Zusammenfassung Zur Lösung von nichtlinearen Gleichungen in normierten Räumen werden Iterationsverfahren angegeben, die Funktionswerte und Steigungen erster Ordnung benutzen. Es ist möglich, die Steigungen durch Ableitungen zu ersetzen. Die linearen Gleichungen, die in jedem Iterationsschritt auftreten, werden nur näherungsweise gelöst. Dabei ist es wichtig, daß hierdurch keine Verringerung der Konvergenzgeschwindigkeit eintritt.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 95
    Electronic Resource
    Electronic Resource
    Springer
    Computing 5 (1970), S. 128-135 
    ISSN: 1436-5057
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Description / Table of Contents: Summary The intelligent behavior of a highschool student, who constructs triangles from three given pieces shows that he generates auxiliary points of a tree-like structure by means of geometric loci. The formalization of this leads to a system of points, geometric loci and rules. In each case the mechine is able to decide whether and how the triangle can be contructed and this leads to the decision-procedure we called the „Dreiecksalgorithmus”.
    Notes: Zusammenfassung Analysiert man das Verhalten eines intelligenten Schülers bei der Konstruktion eines Dreiecks aus drei gegebenen Stücken, so erkennt man, daß er mittels geometrischer Örter Hilfspunkte eines baumartigen Gebildes erzeugt. Eine Formalisierung dessen führt auf Listen von Punkten, geometrischen Örtern und auf ein Regelsystem. Die Maschine kann damit in jedem Fall entscheiden, ob und wie das Dreieck aus den gegebenen Stücken konstruierbar ist, und das ist das Entscheidungsverfahren, das wir „Dreiecksalgorithmus” genannt haben.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 96
    Electronic Resource
    Electronic Resource
    Springer
    Computing 6 (1970), S. 97-103 
    ISSN: 1436-5057
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Description / Table of Contents: Zusammenfassung Es wird eine Methode zur Definition und Charakterisierung der Zusammenhangs- und Repetitionsstruktur von Matrizen vorgeschlagen.—Im Anschluß an die Definition des “Vokabulars” der einzelnen Zeilen (Spalten) werden die numerischen Invarianten (Betti-Zahlen) eines simplizialen Komplexes bestimmt, der als der sogenannte “Nerv” des Systems der Zeilen-(Spalten-)Vokabulare erhalten wird. Die Berechnung erfolgt über die Inzidenzmatrizen des Nervs. Einige Hinweise auf Anwendungsmöglichkeiten und ein elementares Beispiel beschließen die Note.
    Notes: Summary A method is proposed for characterising the connectivity- and repetitivity-structure of matrices. After defining the “vocabularies” of the single rows (columns) we calculate the numerical invariants (Betti-numbers) of a simplicial complex, the “nerve” of the system of vocabularies, via incidencematrices.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 97
    Electronic Resource
    Electronic Resource
    Springer
    Computing 6 (1970), S. 104-106 
    ISSN: 1436-5057
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Description / Table of Contents: Summary In two previous papers [3] and [4] were deduced some statements for certain interval equations over the real number field concerning the existence and uniqueness of the solution and the convergence of iteration methods for the evaluation of the solution. This paper shows, how these statements and their proofs can be extended to analogous interval equations over the complex number field.
    Notes: Zusammenfassung In früheren Arbeiten [3] und [4] wurden für gewisse Intervallgleichungssysteme über dem Körper der reellen Zahlen Kriterien für die Existenz und Eindeutigkeit einer Lösung sowie die Konvergenz von Iterationsverfahren zur Bestimmung der Lösung bewiesen. Die vorliegende Arbeit zeigt, wie diese Kriterien und ihre Beweise zu verallgemeinern sind, damit sie auch für entsprechende Intervallgleichungssysteme über den komplexen Zahlen gelten.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 98
    Electronic Resource
    Electronic Resource
    Springer
    Computing 6 (1970), S. 107-120 
    ISSN: 1436-5057
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Description / Table of Contents: Summary Mathematical description of traffic flow has been tried repeatedly. Two types of theories are to be distinguished: Discrete traffic flow theories start from a system of differential equations for functionsx n (t) describing the routes of single cars. Continuous flow models require solution of a partial differential equation for the velocityv (x, t) and determination of trajectoriesx (t; c) of the velocity field thus obtained. In this paper these integrations for general initial and boundary conditions of a continuous flow model are performed. Treatment of a special case is added, yielding a flexible graphic method for solution of traffic flow problems. As an example of application, a frequently occurring traffic situation is analysed with this theory.
    Notes: Zusammenfassung Die Beschreibung des Kraftfahrzeugverkehrs in mathematischer Form ist mehrfach versucht worden. Es lassen sich zwei Typen von Ansätzen unterscheiden: Die diskreten Fahrzeugfolgetheorien gehen von einem Differentialgleichungssystem für die Bahnkurvenx n (t) der einzelnen Fahrzeuge aus. Die kontinuierlichen Strömungsmodelle verlangen die Lösung einer partiellen Differentialgleichung für die Strömungsgeschwindigkeitv (x, t) sowie die Ermittlung der Trajektorienx (t; c) im so entstandenen Geschwindigkeitsfeld, die als Bahnkurven der Fahrzeuge interpretiert werden. In der vorliegenden Arbeit werden für ein kontinuierliches Modell die genannten Integrationen bei allgeneinen Anfangs- und Randbedingungen geschlossen durchgeführt. Daran schließt sich die Behandlung eines Spezialfalles an, aus dem sich ein flexibles graphisches Verfahren zur Lösung von Kraftfahrzeugströmungsproblemen gewinnen läßt. Als Beispiel einer Anwendung wird ein im Verkehr häufig auftretender Effekt mit Hilfe dieser Theorie graphisch untersucht.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 99
    Electronic Resource
    Electronic Resource
    Springer
    Computing 6 (1970), S. 139-160 
    ISSN: 1436-5057
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Description / Table of Contents: Zusammenfassung Es wird ein neues Stichprobenverfahren vorgeschlagen, das zur Untersuchung von zulässigen Gebieten in der Optimalsynthese dient. Die Methode ist gekennzeichnet durch einen größeren Wirkungsgrad der Stichproben und bevorzugt die Grenze und ihrer Nachbarschaft gegenüber dem Inneren des zulässigen Gebietes. Der Algorithmus des Irren-Prozesses und die Untersuchungsresultate werden beschrieben. Die Anwendung wird durch Beispiele illustriert. Die Resultate bei der Anwendung verschiedener Methoden werden verglichen. Die verwendeten Rechenautomaten waren GIER und ZAM-2 Computer.
    Notes: Summary A new method is proposed for the random checking of the region of admissible solutions of synthesis problems by means of digital computers. This method is characterized by increasing efficiency of random checking and by preference of the boundary and its neighbourhood to the interior of the region. The algorithm of the stray process is described. The paper contains also the test results of the influence of various parameters on the process. The application of the method is illustrated by examples. The results obtained by different methods are confronted. The computers used were the GIER and ZAM-2 computers.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 100
    Electronic Resource
    Electronic Resource
    Springer
    Computing 6 (1970), S. 161-172 
    ISSN: 1436-5057
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Description / Table of Contents: Summary By means of monoton decomposable operators,Collatz, Albrecht andSchröder have considered a variety of iterative methods, by which they get inclusion sets for the solution of system of simultaneous linear or nonlinear equations for example. It is shown, that these methods are special cases of basic iterative methods for equations with interval coefficients. In the concluding part of this paper a general convergence theorem in aRieszian-space is given.
    Notes: Zusammenfassung Vor allem vonCollatz, Schröder undAlbrecht wurden mit Hilfe des Begriffes des monotonen Operators verschiedene Iterationsverfahren betrachtet, welche Einschließungsmengen zum Beispiel für die Lösung eines linearen oder nichtlinearen Gleichungssystems liefern. Im folgenden wird der Zusammenhang zwischen diesen Verfahren und der Intervallrechnung hergestellt. Es zeigt sich, daß diese Verfahren als Spezialfälle in den auf Intervallbasis gebildeten Iterationsverfahren enthalten sind. Im abschließenden Teil der Arbeit wird ein allgemeiner Konvergenzsatz in einemRieszschen Raum angegeben.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
Close ⊗
This website uses cookies and the analysis tool Matomo. More information can be found here...