ALBERT

All Library Books, journals and Electronic Records Telegrafenberg

X
feed icon rss

Your email was sent successfully. Check your inbox.

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

Proceed reservation?

Export
Filter
  • Articles  (5,306)
  • Springer  (4,109)
  • Oxford University Press  (1,074)
  • Cell Press  (123)
  • American Institute of Physics
  • International Union of Crystallography (IUCr)
  • 2010-2014
  • 2005-2009  (2,830)
  • 1985-1989
  • 1975-1979  (2,476)
  • 1945-1949
  • 2005  (2,830)
  • 1978  (2,476)
  • Computer Science  (2,931)
  • Process Engineering, Biotechnology, Nutrition Technology  (2,375)
Collection
  • Articles  (5,306)
Source
Keywords
Publisher
Years
  • 2010-2014
  • 2005-2009  (2,830)
  • 1985-1989
  • 1975-1979  (2,476)
  • 1945-1949
Year
Journal
Topic
  • 1
    Electronic Resource
    Electronic Resource
    Progressive global random search of continuous functions (1978)
    Springer
    Mathematical programming 15 (1978), S. 330-342 
    Details
    ISSN: 1436-4646
    Keywords: Global Optimization ; Random Search ; Convergence ; Sequential Minimization ; Lipschitz Functions ; Stochastic Programming
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Notes: Abstract A sequential random search method for the global minimization of a continuous function is proposed. The algorithm gradually concentrates the random search effort on areas neighboring the global minima. A modification is included for the case that the function cannot be exactly evaluated. The global convergence and the asymptotical optimality of the sequential sampling procedure are proved for both the stochastic and deterministic optimization problem.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF01609037
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 2
    Electronic Resource
    Electronic Resource
    Tenth International Symposium on Mathematical Programming (1978)
    Springer
    Mathematical programming 15 (1978), S. 364-364 
    Details
    ISSN: 1436-4646
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF01609044
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 3
    Electronic Resource
    Electronic Resource
    Least distance methods for the scheme of polytopes (1978)
    Springer
    Mathematical programming 15 (1978), S. 1-11 
    Details
    ISSN: 1436-4646
    Keywords: APL-Codes ; Polytope ; Point Set ; Vertices ; Faces ; Facets ; Quadratic Programming ; Distance ; Decomposition
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Notes: Abstract Methods are described and APL-codes are supplied to find vertices, edges, other faces and facets of polytopes given by point sets. The basic subroutine is a simplicial decomposition version of least distance, i.e. quadratic, programming. Computational experience indicates high efficiency.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF01608995
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 4
    Electronic Resource
    Electronic Resource
    Editorial policy (1978)
    Springer
    Mathematical programming 14 (1978), S. 127-127 
    Details
    ISSN: 1436-4646
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF01588960
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 5
    Electronic Resource
    Electronic Resource
    Algorithms for nonlinear constraints that use lagrangian functions (1978)
    Springer
    Mathematical programming 14 (1978), S. 224-248 
    Details
    ISSN: 1436-4646
    Keywords: Augmented Lagrangian ; Lagrangian Function ; Nonlinear Constraints ; Nonlinear Programming ; Optimization Algorithm
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Notes: Abstract Lagrangian functions are the basis of many of the more successful methods for nonlinear constraints in optimization calculations. Sometimes they are used in conjunction with linear approximations to the constraints and sometimes penalty terms are included to allow the use of algorithms for unconstrained optimization. Much has been discovered about these techniques during the last eight years and this paper gives a view of the progress and understanding that has been achieved and its relevance to practical algorithms. A particular method is recommended that seems to be more powerful than the author believed to be possible at the beginning of 1976.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF01588967
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 6
    Electronic Resource
    Electronic Resource
    The Mathematical Programming Society (1978)
    Springer
    Mathematical programming 14 (1978), S. 262-262 
    Details
    ISSN: 1436-4646
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF01588969
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 7
    Electronic Resource
    Electronic Resource
    The reformulation of two mixed integer programming problems (1978)
    Springer
    Mathematical programming 14 (1978), S. 325-331 
    Details
    ISSN: 1436-4646
    Keywords: Integer Programming ; Formulation ; Models
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Notes: Abstract Two practical problems are described, each of which can be formulated in more than one way as a mixed integer programming problem. The computational experience with two formulations of each problem is given. It is pointed out how in each case a reformulation results in the associated linear programming problem being more constrained. As a result the reformulated mixed integer problem is easier to solve. The problems are a multi-period blending problem and a mining investment problem.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF01588974
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 8
    Electronic Resource
    Electronic Resource
    Numerically stable methods for quadratic programming (1978)
    Springer
    Mathematical programming 14 (1978), S. 349-372 
    Details
    ISSN: 1436-4646
    Keywords: Indefinite Quadratic Programming ; Matrix Factorizations ; Numerical Software
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Notes: Abstract Numerically stable algorithms for quadratic programming are discussed. A new algorithm is described for indefinite quadratic programming which utilizes methods for updating positivedefinite factorizations only. Consequently all the updating procedures required are common to algorithms for linearly-constrained optimization. The new algorithm can be used for the positive-definite case without loss of efficiency.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF01588976
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 9
    Electronic Resource
    Electronic Resource
    A mathematical programming system for preference and compatibility maximized menu planning and scheduling (1978)
    Springer
    Mathematical programming 15 (1978), S. 63-76 
    Details
    ISSN: 1436-4646
    Keywords: Menu Planning ; Separation Scheduling ; Menu Scheduling ; Decomposition ; Non-linear Programming ; Binary Knapsack Problem ; Lagrangian Relaxation ; Transportation Problem ; Branch and Bound
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Notes: Abstract In this paper, the analytical representation of food preference is used in a separable non-linear program to yield the serving frequencies of menu items for a finite time horizon. The frequencies obtained in this way insure cost and nutritional control. Subsequently, the scheduling problem dealing with item assignments to meals and days is formulated as an integer program consisting of several transportation problems linked by weekly nutritional constraints. This problem is solved using a branch and bound algorithm which employs Lagrangian relaxation to obtain bounds and to decide on branching strategy.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF01609000
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 10
    Electronic Resource
    Electronic Resource
    On equivalent representations of certain multicommodity networks as single commodity flow problems (1978)
    Springer
    Mathematical programming 15 (1978), S. 92-99 
    Details
    ISSN: 1436-4646
    Keywords: Network Flows ; Multicommodity Networks
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Notes: Abstract Several classes of multicommodity networks have been shown to have the property that they can be transformed to equivalent uncapacitated single commodity flow problems. We show that many of these networks can be further reduced to smaller, semi-capacitated flow problems using the inverse of a result of Ford and Fulkerson. This appears to be a useful computationally-oriented tool for developing practically efficient algorithms. These concepts are also used to establish a generalization of a previous result concerning multicommodity transportation problems.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF01609003
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 11
    Electronic Resource
    Electronic Resource
    Formation of the international association for statistical computing (1978)
    Springer
    Mathematical programming 15 (1978), S. 119-120 
    Details
    ISSN: 1436-4646
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF01609008
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 12
    Electronic Resource
    Electronic Resource
    A parametric linear complementarity problem involving derivatives (1978)
    Springer
    Mathematical programming 15 (1978), S. 146-154 
    Details
    ISSN: 1436-4646
    Keywords: Linear Complementarity Problem ; Principal Pivoting Algorithm
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Notes: Abstract The problem considered in this paper is given by the conditions:w = q + tp + Mz, w ≥ 0,ż ≥ 0,w T ż = 0, where a dot denotes the derivative with respect to the scalar parametert ≥ 0. In this problem,q, p aren-vectors withq ≥ 0 andM is an byn P-matrix. This problem arises in a certain basic problem in the field of structural mechanics. The main result in this paper is the existence and uniqueness theorem of a solution to this problem. The existence proof is constructive providing a computational method of obtaining the solution asymptotically.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF01609013
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 13
    Electronic Resource
    Electronic Resource
    A subgradient algorithm for certain minimax and minisum problems (1978)
    Springer
    Mathematical programming 15 (1978), S. 130-145 
    Details
    ISSN: 1436-4646
    Keywords: Minimax Problems ; Minisum Problems ; Nondifferentiable Optimization ; Subgradients ; Location Problems ; Linear Approximation Problems
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Notes: Abstract We present a subgradient algorithm for minimizing the maximum of a finite collection of functions. It is assumed that each function is the sum of a finite collection of basic convex functions and that the number of different subgradient sets associated with nondifferentiable points of each basic function is finite on any bounded set. Problems belonging to this class include the linear approximation problem and both the minimax and minisum problems of location theory. Convergence of the algorithm to an epsilon-optimal solution is proven and its effectiveness is demonstrated by solving a number of location problems and linear approximation problems.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF01609012
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 14
    Electronic Resource
    Electronic Resource
    On optimality conditions in nondifferentiable programming (1978)
    Springer
    Mathematical programming 14 (1978), S. 73-86 
    Details
    ISSN: 1436-4646
    Keywords: Gradient ; Subdifferential ; Generalized Gradient ; Optimality Conditions ; Nondifferentiability
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Notes: Abstract This paper is devoted to necessary optimality conditions in a mathematical programming problem without differentiability or convexity assumptions on the data. The main tool of this study is the concept of generalized gradient of a locally Lipschitz function (and more generally of a lower semi-continuous function). In the first part, we consider local extremization problems in the unconstrained case for objective functions taking values in (−∞, +∞]. In the second part, the constrained case is considered by the way of the cone of adherent displacements. In the presence of inequality constraints, we derive in the third part optimality conditions in the Kuhn—Tucker form under a constraint qualification.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF01588951
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 15
    Electronic Resource
    Electronic Resource
    A quadratic network optimization model for equilibrium single commodity trade flows (1978)
    Springer
    Mathematical programming 14 (1978), S. 98-107 
    Details
    ISSN: 1436-4646
    Keywords: Network Flows ; Equilibrium Trade ; Quadratic Programming
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Notes: Abstract When supply and demand curves for a single commodity are approximately linear in each ofN regions and interregional transportation costs are linear, then equilibrium trade flows can be computed by solving a quadratic program of special structure. An equilibrium trade flow exists in which the routes carrying positive flow form a forest, and this solution can be efficiently computed by a tree growing algorithm.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF01588953
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 16
    Electronic Resource
    Electronic Resource
    Referees 1977 (1978)
    Springer
    Mathematical programming 14 (1978), S. 125-125 
    Details
    ISSN: 1436-4646
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF01588958
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 17
    Electronic Resource
    Electronic Resource
    The Mathematical Programming Society (1978)
    Springer
    Mathematical programming 14 (1978), S. 126-126 
    Details
    ISSN: 1436-4646
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF01588959
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 18
    Electronic Resource
    Electronic Resource
    Second order characterizations of pseudoconvex functions (1978)
    Springer
    Mathematical programming 14 (1978), S. 170-185 
    Details
    ISSN: 1436-4646
    Keywords: Nonlinear Programming ; Pseudoconvexity ; Second order Characterizations ; Extended Hessians ; Bordered Determinants ; Quadratic Functions
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Notes: Abstract Second order characterizations for (strictly) pseudoconvex functions are derived in terms of extended Hessians and bordered determinants. Additional results are presented for quadratic functions.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF01588964
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 19
    Electronic Resource
    Electronic Resource
    Editorial policy (1978)
    Springer
    Mathematical programming 14 (1978), S. 263-263 
    Details
    ISSN: 1436-4646
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF01588970
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 20
    Electronic Resource
    Electronic Resource
    Symposium on constructive approaches to Mathematical Models (1978)
    Springer
    Mathematical programming 14 (1978), S. 378-378 
    Details
    ISSN: 1436-4646
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF01588978
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 21
    Electronic Resource
    Electronic Resource
    International Symposium on systems optimization and analysis (1978)
    Springer
    Mathematical programming 14 (1978), S. 380-380 
    Details
    ISSN: 1436-4646
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF01588980
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 22
    Electronic Resource
    Electronic Resource
    The Mathematical Programming Society (1978)
    Springer
    Mathematical programming 14 (1978), S. 381-381 
    Details
    ISSN: 1436-4646
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF01588981
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 23
    Electronic Resource
    Electronic Resource
    Convex optimization and lagrange multipliers (1978)
    Springer
    Mathematical programming 15 (1978), S. 87-91 
    Details
    ISSN: 1436-4646
    Keywords: Lagrange Multipliers ; Constrained Convex Optimization ; Kuhn—Tucker Theorem ; Duality
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Notes: Abstract The duality theorem of linear programming is used to prove several results on convex optimization. This is done without using separating hyerplane theorems.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF01609002
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 24
    Electronic Resource
    Electronic Resource
    A note on a theorem of Yamamuro (1978)
    Springer
    Mathematical programming 15 (1978), S. 110-113 
    Details
    ISSN: 1436-4646
    Keywords: Fixed Point Computation
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Notes: Abstract Conditions are presented which are necessary for the existence of a regular fixed point of aC 1 map.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF01609006
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 25
    Electronic Resource
    Electronic Resource
    Editorial policy (1978)
    Springer
    Mathematical programming 15 (1978), S. 122-122 
    Details
    ISSN: 1436-4646
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF01609010
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 26
    Electronic Resource
    Electronic Resource
    A generalized knapsack problem with variable coefficients (1978)
    Springer
    Mathematical programming 15 (1978), S. 162-176 
    Details
    ISSN: 1436-4646
    Keywords: Mixed Integer Programming ; Knapsack Problem ; Branch and Bound Method
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Notes: Abstract The ordinary knapsack problem is to find the optimal combination of items to be packed in a knapsack under a single constraint on the total allowable resources, where all coefficients in the objective function and in the constraint are constant. In this paper, a generalized knapsack problem with coefficients depending on variable parameters is proposed and discussed. Developing an effective branch and bound algorithm for this problem, the concept of relaxation and the efficiency function introduced here will play important roles. Furthermore, a relation between the algorithm and the dynamic programming approach is discussed, and subsequently it will be shown that the ordinary 0–1 knapsack problem, the linear programming knapsack problem and the single constrained linear programming problem with upper-bounded variables are special cases of the interested problem. Finally, practical applications of the problem and its computational experiences will be shown.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF01609015
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 27
    Electronic Resource
    Electronic Resource
    A continuous variable representation of the traveling salesman problem (1978)
    Springer
    Mathematical programming 15 (1978), S. 211-213 
    Details
    ISSN: 1436-4646
    Keywords: Traveling Salesman Problem ; Cardinality Constraints ; Hamiltonian Circuits ; Network Flow Problems
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Notes: Abstract The classic traveling salesman problem is characterized in terms of continuous flows on a specially constructed non-conservative network, in 2n − 1 linear constraints and a cardinality constraint. It is shown that every solution to the network problem is a hamiltonian circuit.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF01609019
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 28
    Electronic Resource
    Electronic Resource
    A note on ‘monotone optimal policies for markov decision processes’ (1978)
    Springer
    Mathematical programming 15 (1978), S. 220-222 
    Details
    ISSN: 1436-4646
    Keywords: Dynamic Decision Model ; Monotone Optimal Decision Functions
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Notes: Abstract The purpose of this short note is to correct some oversights in [1]. More precisely, we point out that stronger assumptions have to be imposed on the decision model (in order to use results in [2]) and present a counterexample to a comment to [1, Theorem 3.1].
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF01609021
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 29
    Electronic Resource
    Electronic Resource
    A note on ‘new algorithms for constrained minimax optimization’ (1978)
    Springer
    Mathematical programming 15 (1978), S. 239-242 
    Details
    ISSN: 1436-4646
    Keywords: Minimax Optimization ; Nonlinear Programming
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Notes: Abstract An unconstrained minimax algorithm of Charalambous and Conn is easily modified to solve the constrained case. Here we present some numerical results and find that this algorithm compares favourably to those of Dutta and Vidyasagar.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF01609026
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 30
    Electronic Resource
    Electronic Resource
    Optimal conditioning in the convex class of rank two updates (1978)
    Springer
    Mathematical programming 15 (1978), S. 247-260 
    Details
    ISSN: 1436-4646
    Keywords: Quasi-Newton Method ; Optimal Conditioning ; Rank-two Update
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Notes: Abstract Davidon's new quasi-Newton optimization algorithm selects the new inverse Hessian approximation $$\bar H$$ at each step to be the “optimally conditioned” member of a certain one-parameter class of rank two updates to the last inverse Hessian approximationH. In this paper we show that virtually the same goals of conditioning can be achieved while restricting $$\bar H$$ to the convex class of updates, which are bounded by the popular DFP and BFGS updates. This suggests the computational testing of alternatives to the “optimal conditioning” strategy.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF01609030
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 31
    Electronic Resource
    Electronic Resource
    An implementation of some implicit function theorems with applications to sensitivity analysis (1978)
    Springer
    Mathematical programming 15 (1978), S. 261-267 
    Details
    ISSN: 1436-4646
    Keywords: Sensitivity Analysis in Nonlinear Programming ; Computational Aspects ; Chemical Equilibrium Problems ; Entropy Maximization Problems
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Notes: Abstract This paper presents an implementation of some recent results of Bigelow and Shapiro [1]. These implicit function theorems are shown to provide a convenient means of performing certain types of sensitivity analysis, in particular updating the lagrange multipliers, associated with particular classes of problems. As a result we extend the usual sensitivity analysis results to include improving estimates of the effect of changing the right-hand sides of constraints. Examples of chemical equilibrium and entropy maximization models are used to illustrate the results.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF01609031
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 32
    Electronic Resource
    Electronic Resource
    A lower bound for the controlling parameters of the exact penalty functions (1978)
    Springer
    Mathematical programming 15 (1978), S. 278-290 
    Details
    ISSN: 1436-4646
    Keywords: Constrained Optimization ; Exact Penalty Functions ; Nondifferentiable Functions
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Notes: Abstract The purpose of this paper is to present new exact penalty functions and discuss their properties. A lower bound on the controlling parameters is given, for which above this value, the optimum of the exact penalty function coincides with the optimum of the nonlinear programming problem.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF01609033
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 33
    Electronic Resource
    Electronic Resource
    Testing of a large-scale network optimization program (1978)
    Springer
    Mathematical programming 15 (1978), S. 291-314 
    Details
    ISSN: 1436-4646
    Keywords: Network Flow Problems ; Computational Results—Efficiency—Comparison ; Specific problems in mathematical programming ; Computational Experiments ; Pivotal Selection Methods ; Starting Strategies ; Scaling Procedure
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Notes: Abstract This paper describes the experimental results of testing a “large-scale” program for solving minimum-cost network flow problems. With this program, general structure transshipment problems with over ten thousand nodes and thirty thousand arcs have been easily solved without resorting to auxiliary storage. The algorithm is a variant of the primal revised simplex method; the computer code is called LPNET illustrating the close connection between linear programming and network graphs. This approach substantially improves computer processing timeand core storage, especially for relatively large network problems. The results of these experiments are provided. It is emphasized that an organized experimental design and a detailed series of empirical tests are crucial for an efficient implementation.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF01609034
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 34
    Electronic Resource
    Electronic Resource
    The decomposition of nonlinear problems (1978)
    Springer
    Mathematical programming 15 (1978), S. 360-362 
    Details
    ISSN: 1436-4646
    Keywords: Nonlinear Decomposition ; Nonlinear Programming
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Notes: Abstract We show that under certain conditions nonlinear programming problems can be decomposed into a series of smaller problems. A Decomposition Theorem and example are presented.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF01609042
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 35
    Electronic Resource
    Electronic Resource
    Nominations for 1979 elections (1978)
    Springer
    Mathematical programming 15 (1978), S. 363-363 
    Details
    ISSN: 1436-4646
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF01609043
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 36
    Electronic Resource
    Electronic Resource
    Mathematical programming study 9 Mathematical Programming in use (1978)
    Springer
    Mathematical programming 15 (1978), S. 365-368 
    Details
    ISSN: 1436-4646
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF01609045
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 37
    Electronic Resource
    Electronic Resource
    Optimal design of a manpower system (1978)
    Springer
    Mathematical programming 15 (1978), S. 26-35 
    Details
    ISSN: 1436-4646
    Keywords: Manpower Planning ; Column Generation ; Network Flows ; Shortest Path ; System Design
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Notes: Abstract An equilibrium model of a manpower system is developed based on the notion of a career flow. Institutional constraints and measures of system performance are linear functions of the career flow. A typical optimal design problem is formulated and a solution procedure is developed. The optimization problem is a generalized linear program in which columns are generated by solving a shortest path problem. Upper and lower bounds on the optimal value function can be developed at each stage of the calculations.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF01608997
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 38
    Electronic Resource
    Electronic Resource
    Piecewise convex programs (1978)
    Springer
    Mathematical programming 15 (1978), S. 53-62 
    Details
    ISSN: 1436-4646
    Keywords: Convex Program ; Decomposition ; Cutting Plane Algorithm ; Stochastic Quadratic Program with Recourse
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Notes: Abstract A piecewise convex program is a convex program such that the constraint set can be decomposed in a finite number of closed convex sets, called the cells of the decomposition, and such that on each of these cells the objective function can be described by a continuously differentiable convex function. In a first part, a cutting hyperplane method is proposed, which successively considers the various cells of the decomposition, checks whether the cell contains an optimal solution to the problem, and, if not, imposes a convexity cut which rejects the whole cell from the feasibility region. This elimination, which is basically a dual decomposition method but with an efficient use of the specific structure of the problem is shown to be finitely convergent. The second part of this paper is devoted to the study of some special cases of piecewise convex program and in particular the piecewise quadratic program having a polyhedral constraint set. Such a program arises naturally in stochastic quadratic programming with recourse, which is the subject of the last section.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF01608999
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 39
    Electronic Resource
    Electronic Resource
    Ein Verfahren zur iterativen Einschließung des positiven Eigenvektors einer irreduziblen, nichtnegativen Matrix (1978)
    Springer
    Computing 20 (1978), S. 27-34 
    Details
    ISSN: 1436-5057
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Description / Table of Contents: Abstract We develop a new iteration scheme giving bounds for the positive eigenvector of a nonnegative and irreducible matrix and the corresponding eigenvalue and test it on some examples.
    Notes: Zusammenfassung Wir geben ein neues Iterationsverfahren an, das Schranken für den positiven Eigenvektor einer nichtnegativen, irreduziblen Matrix und des zugehörigen Eigenwerts liefert.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF02241899
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 40
    Electronic Resource
    Electronic Resource
    Über eine Wahl des Parameters beim Parallelenverfahren (Parallel-Chord-Method) (1978)
    Springer
    Computing 20 (1978), S. 17-26 
    Details
    ISSN: 1436-5057
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Description / Table of Contents: Abstract Due to the free parameter in the fixed-point equation of the parallel-chord-method, it is possible to reduce the Lipschitz constant of the contraction mapping. By use of this reduction, it is possible in suitable cases to generate the contraction property of the mapping. If the mapping possesses this property, then this is also true for the mapping with the parameter determined here. In addition, both an improved error estimate for the sequences of iterates and a smaller convergence factor are obtained. An example is presented.
    Notes: Zusammenfassung Mit Hilfe des freien Parameters in der Fixpunktgleichung des Parallelenverfahrens ist es möglich, die Lipschitz-Konstante der kontrahierenden Abbildung zu verkleinern. Durch diese Verkleinerung kann in geeigneten Fällen eine kontrahierende Abbildung erzeugt werden. Ist die Abbildung bereits kontrahierend, ist sie auch kontrahierend für den berechneten Wert des Parameters. Ferner ergibt sich neben einer verbesserten Fehlerabschätzung für die Iterationsfolgen auch ein kleinerer Konvergenzfaktor. Das Verfahren wird an Hand eines Beispiels erläutert.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF02241898
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 41
    Electronic Resource
    Electronic Resource
    Zur Approximation von Schalen mit hybriden Elementen (1978)
    Springer
    Computing 20 (1978), S. 75-94 
    Details
    ISSN: 1436-5057
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Description / Table of Contents: Abstract A theory of hybrid finite element approximation is developed for a class of shell problems. Though it is applied only to the special case of clamped shallow shells with regular triangularization the results may be of larger interest comparing the predicted convergence rate with the numerical outcome of some applications of the hybrid finite element method. The convergence speed can only be increased by higher degrees of the approximation and the stresses at the edges correspondingly. The use of a so-called rank condition plays a fundamental role in the study. Weak coerciveness of the under lyigg bilinear form for the derivation of hybrid elements is proved by showing the existence of a stationary point.
    Notes: Zusammenfassung Dieser Beitrag liefert eine Theorie der Finite-Element-Approximation für eine Klasse von Schalenproblemen. Obgleich diese nur für den Fall der eingespannten flachen Schale mit regulärer Triangulierung ausführlich dargestellt wird, sind die Ergebnisse darüberhinaus von Interesse, da die abgeleiteten Konvergenzordnungen das Verhalten numerischer Näherungslösungen aus anderen Anwendungen der hybriden Finite-Element-Methode erklären helfen. Die Konvergenzgeschwindigkeit kann nur verbessert werden durch gleichzeitige Erhöhung der Ansatzgrade für die Verschiebungen im Elementinnern und für die Spannungen auf den Rändern. Die Einhaltung einer sogenannten Rangbedingung hat zentrale Bedeutung. Die schwache Koerzitivität der für die Ableitung hybrider Elemente verwendeten Bilinearform ist durch den Nachweis der Existenz eines stationären Werts gesichert.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF02241903
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 42
    Electronic Resource
    Electronic Resource
    Interval forms of Newtons method (1978)
    Springer
    Computing 20 (1978), S. 153-163 
    Details
    ISSN: 1436-5057
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Description / Table of Contents: Zusammenfassung Eine verbesserte Darstellung Newtonscher Intervall-Verfahren wird diskutiert. Es wird dabei gezeigt, daß man bestimmte Intervalle in den Verfahren durch reelle Zahlen ersetzen kann. Dadurch werden die Konvergenzeigenschaften der Verfahren verbessert.
    Notes: Abstract Improved forms of some interval Newton Methods are given. It is shown that certain intervals in the methods can be replaced by real numbers. This improves the convergence properties of the methods.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF02252344
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 43
    Electronic Resource
    Electronic Resource
    Eine rundungsgenaue Formel zur maschinellen Berechnung der Prager-Oettli-Schranke (1978)
    Springer
    Computing 20 (1978), S. 177-182 
    Details
    ISSN: 1436-5057
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Description / Table of Contents: Abstract The bound of Prager-Oettli for the input error of a linear system of equations is computed via a new formula which guarantees strictness of the bound in spite of roundoff errors.
    Notes: Zusammenfassung Die Schranke von Prager-Oettli für den Eingangsfehler eines linearen Gleichungssystems wird über eine neue Formel berechnet, die trotz der Rundungsfehler die Schärfe der Schranke sichert.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF02252346
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 44
    Electronic Resource
    Electronic Resource
    Iterated defect correction for differential equations part I: theoretical results (1978)
    Springer
    Computing 20 (1978), S. 207-228 
    Details
    ISSN: 1436-5057
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Description / Table of Contents: Zusammenfassung Die Iterierte Defektkorrektur (IDeC) ist ein Verfahren zur schrittweisen Verbesserung einer Näherungslösung eines gegebenen ProblemsFy=0. Eines der wichtigsten Anwendungsgebiete dieses Prinzips sind Differentialgleichungen. Die IDeC kann dort als Methode zur Verbesserung der Ordnung eines Diskretisierungsverfahrens, und damit zur Verbesserung der Genauigkeit eingesetzt werden. In der vorliegenden Arbeit wird ein Metaalgorithmus für die Klasse, der IDeC-Verfahren für Differential-gleichungen vorgestellt und analysiert. Für jeden “Baustein” dieses Metaalgorithmus werden Bedingungen angegeben, die es gewährleisten, daß eine bestimmte Ordnung erreicht wird. Diese Bedingungen sind von großer praktischer Bedeutung, wenn IDeC-Verfahren als Computer-Programme implementiert werden sollen.
    Notes: Abstract Iterated Defect Correction (IDeC) is a technique for improving successively an approximate solution of a given problemFy=0. One of the most important fields of application of this principle are differential equations. Here, IDeC can be used as a technique for increasing the order of a discretization method and thus for improving the accuracy. In this paper a metalgorithm for the class of IDeC-methods for differential equations is presented and analyzed. For every component of this metalgorithm conditions are given which guarantee a certain order of accuracy. These conditions are of particular importance for practical applications, as far as the implementation of IDeC-methods is concerned.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF02251946
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 45
    Electronic Resource
    Electronic Resource
    Ein Abbrechkriterium für einen numerischen Algorithmus (1978)
    Springer
    Computing 20 (1978), S. 257-265 
    Details
    ISSN: 1436-5057
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Description / Table of Contents: Abstract A termination criterion by Nickel (Theorem 6, [1]) for guaranteeing the numerical convergence for locally stable and consistent algorithms is generalized. The assumption |x ν+2,x ν+1|≤L|x ν+1,x ν| (0≤L〈1,L real constant) of the approximation sequence {x ν} to the solution is replaced by the convergence of the progression $$\sum\limits_{v = 1}^\infty {|x,x_{v + 1} |/Q^v (0〈 Q〈 1)} $$ . Therefore the theorem of this paper is applicable to a large number of numerical procedures, for which untill now no termination criterion has been known (for example: Rombergprocedure). In particular this weakening is important for the computation of approximation solutions for integral equations.
    Notes: Zusammenfassung Ein Abbrechkriterium von Nickel (Satz 6, [1]) zur Sicherung der numerischen Konvergenz bei lokal stabilen und konsistenten Algorithmen wird verallgemeinert. Statt der Eigenschaft |x ν+2,x ν+1|≤L|x ν+1,x ν| (0≤L〈1,L von ν ∈ ℕ unabhängig) der Näherungsfolge {x ν} zur Lösungx reicht die Konvergenz der Reihe $$\sum\limits_{v = 1}^\infty {|x,x_{v + 1} |/Q^v (0〈 Q〈 1)} $$ aus. Damit ist der Satz dieser Arbeit bei einer großen Klasse von numerischen Verfahren anwendbar, für die bisher noch kein Abbrechkriterium bekannt ist (z. B. dem Romberg-Verfahren). Insbesondere ist diese Abschwächung zur Berechnung von Näherungslösungen bei Integralgleichungen wichtig.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF02251949
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 46
    Electronic Resource
    Electronic Resource
    The nonlinear Volterra equation of Abel's kind and its numerical treatment (1978)
    Springer
    Computing 20 (1978), S. 307-324 
    Details
    ISSN: 1436-5057
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Description / Table of Contents: Zusammenfassung Ausgehend von einem Existenz- und Eindeutigkeitssatz für die Lösung einer verallgemeinerten Volterra-Integralgleichung zweiter Art wird die Existenz und Eindeutigkeit der Lösung der hier behandelten nichtlinearen, schwach singulären Volterra-Integralgleichung erster Art untersucht. Es wird ein numerisches Verfahren der Ordnung 2 bzw. 3 angegeben. Der Konvergenzbeweis basiert in beiden Fällen auf einem Lemma über die Beschränktheit einer speziellen Differenzenungleichung. An zwei numerischen Beispielen werden die theoretischen Ergebnisse demonstriert.
    Notes: Abstract Starting from an existence and uniqueness theorem for a generalized nonsingular second kind Volterra equation existence and uniqueness for the solution of the nonlinear, weakly singular first kind Volterra equation is examined. A new type of numerical method is developed. A basic lemma concerning the boundedness of a special difference inequality is given and order two or three convergence of the method is shown. Two numerical examples illustrate the theoretical results.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF02252379
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 47
    Electronic Resource
    Electronic Resource
    Über A (α)-stabile Verfahren hoher Konsistenzordnung (1978)
    Springer
    Computing 20 (1978), S. 343-350 
    Details
    ISSN: 1436-5057
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Description / Table of Contents: Abstract For each α ε (0, π/2), the existence ofA (α)-stable linear multistep methods with arbitrary order of consistency is shown by an explicit construction. Some characteristic data of the methods and numerical results are given.
    Notes: Zusammenfassung Es wird in einer expliziten Konstruktion gezeigt, daß für jedes α ε (0, π/2)A (α)-stabile lineare Mehrschrittverfahren beliebiger Konsistenzordnung existieren. Einige charakteristische Daten der Verfahren und numerische Rechnungen werden angegeben.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF02252382
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 48
    Electronic Resource
    Electronic Resource
    A performance model for preplanned disk sorting (1978)
    Springer
    Computing 21 (1978), S. 17-35 
    Details
    ISSN: 1436-5057
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Description / Table of Contents: Zusammenfassung Der Ansatz, Strings, die zusammengemischt werden, auf Magnetplatten vorzuplanen, wird unter Leistungsgesichtspunkten untersucht. Konzepte für die interne Pufferzuordnung, für die Erzeugung der anfänglichen Strings durch ein internes Sortierverfahren, und für die Stringverteilung auf Magnetplatten werden ausgewertet. Ein Algorithmus beschreibt die Konstruktion von suboptimalen Mischbäumen, die planbare Mischbäume genannt werden. Ein Kostenmodell, das auf detaillierte Annahmen der Zuordnung vonk Eingabeplatten und der Planung einesr-Wege-Mischens beruht, wird für das exakte Vorplanen aufgestellt. Zeitbetrachtungen für Sortieren und Mischen, die Hardware-Eigenschaften von Magnetplatten einschließen, zeigen signifikante Zeitgewinne verglichen mit weitverbreiteten Sortier- und Mischverfahren.
    Notes: Abstract The idea of preplanning strings on disks which are merged together is investigated from a performance point of view. Schemes of internal buffer allocation, initial string creation by an internal sort, and string distribution on disks are evaluated. An algorithm is given for the construction of suboptimal merge trees called plannable merge trees. A cost model is presented for accurate preplanning which consists of detailed assumptions on disk allocation fork input disks andr-way merge planning. Timing considerations for sort and merge including hardware characteristics of moveable head disks show a significant gain of time compared to widely used sort/merge applications.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF02252192
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 49
    Electronic Resource
    Electronic Resource
    Convergence acceleration on a general class of power series (1978)
    Springer
    Computing 21 (1978), S. 53-69 
    Details
    ISSN: 1436-5057
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Description / Table of Contents: Zusammenfassung In dieser Arbeit werden mehrere effiziente Methoden zur Berechnung von Funktionen, die durch Potenzenreihen definiert sind, präsentiert. Einfache Computerprogramme für zwei schnelle Algorithmen werden in einem eigenen Beitrag ([9]) angegeben. Die Konvergenzgeschwindigkeiten der vorgeschlagenen Verfahren werden theoretisch untersucht und die erhaltenen Ergebnisse werden an numerischen Beispielen erläutert.
    Notes: Abstract In this paper we present several efficient methods for evaluating functions defined by power series expansions. Simple computer codes for two rapid algorithms are given in a companion paper. The convergence rates of the proposed computational schemes are investigated theoretically and the results are illustrated by numerical examples.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF02252194
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 50
    Electronic Resource
    Electronic Resource
    On the determination of the weights in multi-dimensional numerical quadrature (1978)
    Springer
    Computing 21 (1978), S. 71-79 
    Details
    ISSN: 1436-5057
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Description / Table of Contents: Zusammenfassung Mit Hilfe der Pseudoinversen eines beschränkten linearen Operators von ℝ n inl 2 wird eine Methode zur Konstruktion von Quadraturformeln für die Integration über einem beliebigen beschränktenm-dimensionalen GebietB⊂ℝ m hergeleitet, mit der Eigenschaft, daß der mittlere Fehler in einer vorgeschriebenen FamilieF sowie die Varianz der Rundungsfehler gemäß Sard [8] minimal werden. Sodann wählen wirF als gewichtete Monome und behandeln als Beispiel Integration auf der Oberfläche derm-Kugel.
    Notes: Abstract Using the concept of the generalized inverse of a bounded linear transformation between ℝ n andl 2, a method is given for constructing quadrature rules for integration over an arbitrary boundedm-dimensional regionB⊂ℝ m with the property that the average error over the prescribed familyF of the functions continuous inB as well as the variance of the rounding errors according to Sard [8] are minimal. Then we specializeF to the weighted monomials and treat as an example integration on the surface of them-sphere.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF02252195
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 51
    Electronic Resource
    Electronic Resource
    Algorithm 38 two computer codes for convergence acceleration (1978)
    Springer
    Computing 21 (1978), S. 87-91 
    Details
    ISSN: 1436-5057
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Description / Table of Contents: Zusammenfassung In dieser Arbeit werden zwei Computerprogramme für die Berechnung der Summe einer Potenzenreihe, die einer allgemeinen Klasse zugehört, beschrieben. Die Verwendung der Programme ist mit einem Beispiel erläutert.
    Notes: Abstract This paper describes two computer codes for calculating the sum of power series, belonging to a certain general class. The use of the codes for an illustrative test example is explained.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF02252197
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 52
    Electronic Resource
    Electronic Resource
    Runge-Kutta integration algorithms with built-in estimates of the accumulated truncation error (1978)
    Springer
    Computing 20 (1978), S. 1-16 
    Details
    ISSN: 1436-5057
    Keywords: Integration ; Runge-Kutta integration ; truncation error ; error estimates ; accumulated error ; accumulated error estimates ; accumulated truncation error ; true error
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Description / Table of Contents: Zusammenfassung Es wird eine Methode für die Entwicklung von Runge-Kutta-Integrationsalgorithmen angegeben, die die Schätzung des globalen Verfahrensfehlers ermöglichen. Mehrere neue Algorithmen 2., 3. und 4. Ordnung werden angeführt. Die Rechenarbeit pro Schritt ist identisch für die neuen Algorithmen und für Algorithmen, die nur eine Schätzung des lokalen Verfahrensfehlers ermöglichen. Numerische Versuche mit den neuen Algorithmen ergeben, daß der geschätzte Fehler den wahren akkumulierten Fehler gut wiedergibt. Außerdem ist der Fehler von derselben Ordnung wie bei gewöhnlichen Runge-Kutta-Algorithmen.
    Notes: Abstract A method is presented for developing Runge-Kutta integration algorithms with built-in estimates of the accumulated truncation error. Several new 2-nd, 3-rd, and 4-th order algorithms are given. The computation per step of the new algorithms is identical to that of algorithms which provide only an estimate of the local truncation error. Numerical experimentation with the new algorithms shows that the estimated error compares very well with the true accumulated error. Further, the error is of the same order as that incurred using traditional Runge-Kutta algorithms.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF02241897
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 53
    Electronic Resource
    Electronic Resource
    On a method of characteristics for solving a hyperbolic equation of second order (1978)
    Springer
    Computing 20 (1978), S. 47-60 
    Details
    ISSN: 1436-5057
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Description / Table of Contents: Zusammenfassung Das Anfangsrandwertproblem für die hyperbolische Differentialgleichunga(t,x,u)u tt +2b(t,x,u)u tx +c(t,x,u)u xx =d(t,x,u,u t ,u x ) zweiter Ordnung wird mit Hilfe eines Charakteristikenverfahrens gelöst, das keine Differenzengleichungen füru t undu x benutzt. Die Lösung des diskretisierten Problems besitzt eine asymptotische Entwicklung nach geraden Potenzen der Schrittweite. Daher können die numerischen Ergebnisse durch Extrapolation verbessert werden.
    Notes: Abstract The hyperbolic initial-boundary value problem for the second order equationa(t,x,u)u tt +2b(t,x,u)u tx +c(t,x,u)u xx =d(t,x,u,u t ,u x ) is solved by a special method of characteristics involving no difference equations foru t andu x . The discrete solution has an asymptotic expansion in even powers of the step size. Therefore, the numerical results can be improved by extrapolation to the limit.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF02241901
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 54
    Electronic Resource
    Electronic Resource
    Polynomial least square interval approximation (1978)
    Springer
    Computing 20 (1978), S. 165-176 
    Details
    ISSN: 1436-5057
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Description / Table of Contents: Zusammenfassung Das folgende Problem wird behandelt: gegeben sei eine Menge vonm rechteckigen Gebieten in der Ebene, man finde ein Intervall-Polynom vom Gradn〉m durch diese Gebiete. Dies ist eine Verallgemeinerung des diskreten Problems der kleinsten Quadrate. Drei Verallgemeinerungen der gewöhnlichen Methode der kleinsten Quadrate für Polynome werden betrachtet und an numerischen Beispielen verglichen. Eine dieser Methoden wird empfohlen, da sie in allen Testbeispielen bessere Ergebnisse gibt.
    Notes: Abstract The following problem is treated: given a set ofm rectangular regions in the plane, fit an interval polynomial of degreen〉m through the regions. This is a generalization of the discrete polynomial least squares problem. Three generalizations of the standard methods for the discrete polynomial least squares are considered and compared on numerical examples. One of the methods is recommended since it gives superior results in all cases tested.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF02252345
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 55
    Electronic Resource
    Electronic Resource
    On scheduling multi-processor systems with algebraic objectives (1978)
    Springer
    Computing 20 (1978), S. 189-205 
    Details
    ISSN: 1436-5057
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Description / Table of Contents: Zusammenfassung Eines der am besten beschriebenen Modelle kombinatorischer Optimierung ist das Scheduling Problem, bei dem eine endliche Anzahl von Tätigkeiten auf einer festen Anzahl von Maschinen so ausgeführt werden muß, daß eine gegebene Zielfunktion minimiert wird. Jede Tätigkeit benötigt charakteristische Daten wie Bearbeitungszeit, Fertigsteillungstermin, Strafkosten und technologische Nachfolgebeziehungen. Ein algebraischer Ansatz für die Zielfunktion führt zu einem allgemeinen Problem, das alle in der Literatur bekannten klassischen Fälle von Summen und Maximum Zielfunktionen einschließt. Durch die Lösung eines algebraischen Transportproblems wird eine untere Schranke für den Zielfunktionswert bestimmt. Um eine Optimallösung zu erhalten, verwenden wir ein Branch and Bound Verfahren. Weiterhin betrachten wir das allgemeine Job Shop Scheduling Problem mit algebraischer Zielfunktion.
    Notes: Abstract One of the well-studied models of combinatorial optimization is the scheduling problem dealing with a finite set of tasks, which have to be executed on a fixed number of machines so that a given objective is minimized. Each task requires a set of characteristic data like operating time, due date, penalty cost and technological requirements. An algebraic approach to the objective leads to a general problem which includes all classical cases of sum and bottleneck objectives known in literature. By solving an algebraic transportation problem a lower bound for the objective value can be determined. To obtain an optimal solution we employ a branch and bound procedure. Furthermore we consider the general job shop scheduling problem with algebraic objective function.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF02251945
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 56
    Electronic Resource
    Electronic Resource
    Minimierung der Rechenzeit bei der Berechnung von Lösungen nichtlinearer Integralgleichungen (1978)
    Springer
    Computing 20 (1978), S. 325-331 
    Details
    ISSN: 1436-5057
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Description / Table of Contents: Abstract The result of this paper is the economizing of cpu-time by identical guaranteed precision of the approximate solution. This is possible by an optimal selection ofn j in every iteration stepj, wheren j is the number of subintervals for the numerical integration. The determination ofn 1,n 2, ... is reduced to the solution of a solvable convex optimization job.
    Notes: Zusammenfassung Es wird die Einsparung von Rechenzeit bei gleicher garantierter Genauigkeit der Näherungslösung ermöglicht. Dies wird erreicht durch eine optimale Wahl vonn j bei jedem Iterationsschrittj, wobein j die Zahl der Teilintervalle für die Quadratur ist. Die Bestimmung vonn 1,n 2,... wird auf die Lösung einer lösbaren konvexen Optimierungsaufgabe zurückgeführt.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF02252380
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 57
    Electronic Resource
    Electronic Resource
    Komplexitätserfordernisse von Modellen zur optimalen Indexselektion für Datenbanken (1978)
    Springer
    Computing 20 (1978), S. 279-290 
    Details
    ISSN: 1436-5057
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Description / Table of Contents: Abstract It is one of the basic questions in designing a database system to determine which attributes to invert. The literature presents a variety of models to solve this question. This paper attempts to give a guideline, under which conditions a primitive model considering only retrieve operations, suffices to determine an optimal solution. The relevance of that question lies in the smaller costs of simpler models.
    Notes: Zusammenfassung Eine wesentliche Fragestellung beim Aufbau eines Datenbanksystems ist die Auswahl der Schlüsselattribute. Bei Inverted-File Systemen ist dies äquivalent zur Auswahl der zu invertierenden Attribute. In diesem Aufsatz wird versucht darzustellen, unter welchen Bedingungen Modelle, die lediglich das Retrieve-Verhalten des Benutzers berücksichtigen, zuverlässige Resultate liefern können. Die Relevanz dieser Fragestellung liegt vor allem in den durch das einfachere Modell verminderten Kosten der Datenbeschaffung und Datenanalyse im DB-Designprozeß.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF02252377
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 58
    Electronic Resource
    Electronic Resource
    On the convergence of multistep methods for the Cauchy problem for ordinary differential equations (1978)
    Springer
    Computing 20 (1978), S. 351-361 
    Details
    ISSN: 1436-5057
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Description / Table of Contents: Zusammenfassung Es wird ein allgemeines, quasilineares, nichtstationäresk-Schrittverfahren für die Lösung des Cauchy-Problems für gewöhnliche Differentialgleichungen untersucht. Ein Konvergenzsatz mit ziemlich schwachen Bedingungen wird angegeben. Die Inkrementfunktion muß nicht Lipschitz-stetig sein; es genügt, wenn diese Funktion die Perron-Bedingung aus der Eindeutigkeitstheorie für das Cauchy-Problem mit nichtabnehmender Vergleichfunktion erfüllt. Das Ergebnis ist eine Erweiterung der Theorie von G. Dahlquist und des letzten Resultats von K. Taubert.
    Notes: Abstract The general form of a quasilinear nonstationaryk-step method for solving of the Cauchy problem for ordinary differential equations is discussed. The convergence theorem is stated under rather weak conditions. It is not assumed that the increment function is Lipschitz-continuous but only that it satisfies the Perron type condition appearing in the uniqueness theory for the Cauchy problem with a nondecreasing comparison function. The result established in the paper is an extension of the theory given by G. Dahlquist and the recent result of K. Taubert.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF02252383
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 59
    Electronic Resource
    Electronic Resource
    Algorithm 36 SNIFF: Efficient self-tuning algorithm for numerical integration (1978)
    Springer
    Computing 20 (1978), S. 363-375 
    Details
    ISSN: 1436-5057
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Description / Table of Contents: Zusammenfassung Hier wird ein neuer selbsteichender Algorithmus für die Integration der analytischen Funktionen dargestellt. Der Algorithmus wirkt auf das Integrationsintervall indem er örtliche Unterintervalle hervorruft, deren Länge durch ein neues System überwacht wird. Die Überwachung ergibt sich aus einer Formel, die von einer analytischen Basis abgeleitet wird und für jede beliebige Integrationsregel gilt: mit zwei verschiedenen Annäherungen eines Integrals wird die Intervallänge berechnet, die notwendig ist, um eine Integralannäherung mit der innerhalb zugelassener Fehlergrenzen notwendigen Genauigkeit zu erreichen. Die daraus entstehende Methode für die Erzeugung der Unterintervalle und eine wirksame Auswahl der Fehlerverteilung unter die Unterintervalle bringen einen selbstanpassenden Algorithmus hervor, der über einen genauen und höchst günstigen Integrationsprozeß verfügt. Darauf wird der besondere Algorithmus betrachtet, der sich mit Hilfe der 6-Punkte-Gauß-Legendre-Integrationsregel ergibt. Außerdem wird er mit den besten unter den anderen Integrationsalgorithmen verglichen.
    Notes: Abstract A new adaptive algorithm for the integration of analytic functions is presented. The algorithm processes the integration interval by generating local subintervals whose length is controlled through a feedback loop. Control is performed by means of a relation derived on an analytical basis and valid for an arbitrary integration rule: two different estimates of an integral are used to compute the interval length necessary to obtain an integral estimate with accuracy within the assigned error bounds. The implied method for local generation of subintervals and an effective assumption of error partition among subintervals give rise to an adaptive algorithm provided with an accurate and very efficient integration process. The particular algorithm obtained by choosing the 6-point Gauß-Legendre integration rule is considered and extensive comparisons are made with other outstanding integration algorithms.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF02252384
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 60
    Electronic Resource
    Electronic Resource
    Zur praktischen Behandlung linearer diskreter Approximationsprobleme in der Maximumsnorm (1978)
    Springer
    Computing 21 (1978), S. 37-52 
    Details
    ISSN: 1436-5057
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Description / Table of Contents: Abstract Direct methods for the solution of linear approximation problems tend to fail in practice because of numerical instabilities. Difficulties arise from an undesired accumulation of round-off errors. In [3] and in chapter 2 of this paper effective and inexpensive tests are developed to recognize numerical difficulties and stabilize numerical methods by iterative refinement and restart procedures, if necessary. On the ground of this, a stabilized version of a modified revised dual simplex algorithm can be developed capable of solving the approximation problems under consideration. The technical details of this method and a FORTRAN implementation are given in [4]. Numerical examples are discussed to illustrate that the developed method is superior to commonly used algorithms not only by a broader range of applications and more stability, but also by considerably less storage requirement (for large problems), while the execution times are comparable or less.
    Notes: Zusammenfassung Anhäufungen von Rundungsfehlern führen in der Praxis häufig dazu, daß direkte simplexartige Methoden zur Lösung linearer Approximationsprobleme in der Maximumsnorm versagen. Vor dem approximationstheoretischen Hintergrund des Problems werden in der vorliegenden Arbeit einfach durchzuführende Tests entwickelt, die numerische Schwierigkeitenim voraus anzeigen und so Gegenmaßnahmen ermöglichen. Anhand einer Reihe von Beispielen werden Stabilität, Anwendungsbereich und Grenzen darauf aufbauender Algorithmen diskutiert.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF02252193
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 61
    Electronic Resource
    Electronic Resource
    Algorithm 37 Algorithm for the solution of the 0–1 single knapsack problem (1978)
    Springer
    Computing 21 (1978), S. 81-86 
    Details
    ISSN: 1436-5057
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Description / Table of Contents: Zusammenfassung Für das „0–1 single Knapsack Problem” wird eine FORTRAN-Implementierung eines wirkungsvollen Lösungsverfahrens angegeben. Die angeführten Rechenergebnisse zeigen, daß die vorgeschlagene Methode den derzeit besten bekannten Algorithmen überlegen ist.
    Notes: Abstract The FORTRAN implementation of an efficient algorithm which solves the 0–1 single knapsack problem is given. Computational results are presented, showing the proposed method to be generally superior to the best known algorithms.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF02252196
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 62
    Electronic Resource
    Electronic Resource
    A property of continuous unbounded algorithms (1978)
    Springer
    Mathematical programming 14 (1978), S. 373-377 
    Details
    ISSN: 1436-4646
    Keywords: Nonlinear Programming ; Algorithms ; Continuous Unbounded Algorithms ; Global Convergence of Algorithms
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF01588977
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 63
    Electronic Resource
    Electronic Resource
    Summer School in Combinatorial Optimization (1978)
    Springer
    Mathematical programming 14 (1978), S. 379-379 
    Details
    ISSN: 1436-4646
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF01588979
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 64
    Electronic Resource
    Electronic Resource
    On solving optimization problems with proportion-constraints (1978)
    Springer
    Mathematical programming 15 (1978), S. 77-86 
    Details
    ISSN: 1436-4646
    Keywords: Proportion-Constraints ; Symmetry ; Converging Matrices ; Mathematical Programming ; Bounded Matrices
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Notes: Abstract The purpose of this paper is to establish sufficient conditions for the existence of solutions to mathematical programs where the variables of the solution satisfy given proportions. These conditions rely on convergence properties of powers of nonnegative matrices when these powers form a bounded sequence. We assume that if an arbitrary vectorx is premultiplied by elements of this sequence, the limit of the sequence (which might be a Cesaro (C, 1) limit) gives an improvement of the objective.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF01609001
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 65
    Electronic Resource
    Electronic Resource
    An alternative method for a global analysis of quadratic programs in a finite number of steps (1978)
    Springer
    Mathematical programming 15 (1978), S. 105-109 
    Details
    ISSN: 1436-4646
    Keywords: Quadratic Programming
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Notes: Abstract This paper considers the global analysis of general quadratic programs in a finite number of steps. A procedure is presented for recursively finding either the global minimum or a halfline of the constraint set along which the minimand is unbounded below.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF01609005
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 66
    Electronic Resource
    Electronic Resource
    Mathematical programming study 7 complementarity and fixed point problems (1978)
    Springer
    Mathematical programming 15 (1978), S. 114-118 
    Details
    ISSN: 1436-4646
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF01609007
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 67
    Electronic Resource
    Electronic Resource
    On a conjecture of Dixon and other topics in variable metric methods (1978)
    Springer
    Mathematical programming 15 (1978), S. 123-129 
    Details
    ISSN: 1436-4646
    Keywords: Unconstrained Optimization ; Variable Metric Methods ; Quasi-Newton Methods ; Optimal Conditioning ; Round-off Errors
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Notes: Abstract A conjecture of Dixon relating to the behaviour of variable metric methods on functions with special symmetry is validated under suitable onditions. The relation between Huang's class and Oren's class is explored. Then the equivalence of Davidon's and Oren and Spedicato's approaches to optimal conditioning is demonstrated.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF01609011
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 68
    Electronic Resource
    Electronic Resource
    Using cutting planes to solve the symmetric Travelling Salesman problem (1978)
    Springer
    Mathematical programming 15 (1978), S. 177-188 
    Details
    ISSN: 1436-4646
    Keywords: Travelling Salesman Problem ; Hamiltonian Cycle ; Branch and Bound ; Cutting Planes
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Notes: Abstract Two algorithms using cutting planes are developed for solving the Travelling Salesman Problem. In both algorithms the problem is started with a subset of the set of constraints that define the problem (apart from integrality requirements). However, the two algorithms differ in the order in which the omitted constraints and the cutting planes that are required are generated. The computational experience obtained suggests that cutting planes can provide a competitive approach to other efficient methods of solving the problem.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF01609016
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 69
    Electronic Resource
    Electronic Resource
    More with the Lemke complementarity algorithm (1978)
    Springer
    Mathematical programming 15 (1978), S. 214-219 
    Details
    ISSN: 1436-4646
    Keywords: Linear Complementarity ; Bi-matrix Games ; Multi-period Programs
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Notes: Abstract In the case that the matrix of a linear complementarity problem consists of the sum of a positive semi-definite matrix and a co-positive matrix a general condition is deduced implying that the Lemke algorithm will terminate with a complementarity solution. Applications are presented on bi-matrix games, convex quadratic programming and multi-period programs.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF01609020
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 70
    Electronic Resource
    Electronic Resource
    Announcement (1978)
    Springer
    Mathematical programming 15 (1978), S. 243-244 
    Details
    ISSN: 1436-4646
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF01609027
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 71
    Electronic Resource
    Electronic Resource
    Solution of the linear inverse vector optimization problem by a single linear program (1978)
    Springer
    Mathematical programming 15 (1978), S. 232-235 
    Details
    ISSN: 1436-4646
    Keywords: Vector Optimization ; Linear Programming ; Efficient Points
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Notes: Abstract It is shown that finding a solution to a linear vector optimization problem which is efficient with respect to the constraints as well as to the objectives is equivalent to solving a single linear program.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF01609024
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 72
    Electronic Resource
    Electronic Resource
    An algorithm for the 0/1 Knapsack problem (1978)
    Springer
    Mathematical programming 14 (1978), S. 1-10 
    Details
    ISSN: 1436-4646
    Keywords: Integer Programming ; Reduction Method ; Branch and Bound Method ; Knapsack
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Notes: Abstract The Knapsack problem (maximize a linear function, subject to a unique constraint, all being in integers), although of thenp-complete type, is a well solved case in combinatorial programming. The reason for this is twofold: (i) an upper bound of the objective function is easy to compute (ii) it is quite simple to construct feasible solutions. They give lower bounds of the optimum. This makes it possible to know rapidly the optimal value of many variables, and therefore to reduce the problem. Several studies have appeared recently on the subject [5, 9, 12, 18]. We present a program by which Knapsacks involving up to 60 000 boolean variables were solved in a matter of seconds, on an I.B.M. 370-168.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF01588947
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 73
    Electronic Resource
    Electronic Resource
    Bimatrix games—an addendum (1978)
    Springer
    Mathematical programming 14 (1978), S. 112-115 
    Details
    ISSN: 1436-4646
    Keywords: Bimatrix Games ; Complementary Pivot Algorithms
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF01588955
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 74
    Electronic Resource
    Electronic Resource
    Tight bounds for christofides' traveling salesman heuristic (1978)
    Springer
    Mathematical programming 14 (1978), S. 116-121 
    Details
    ISSN: 1436-4646
    Keywords: Traveling Salesman Problem ; Heuristics
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Notes: Abstract Christofides [1] proposes a heuristic for the traveling salesman problem that runs in polynomial time. He shows that when the graphG = (V, E) is complete and the distance matrix defines a function onV × V that is metric, then the length of the Hamiltonian cycle produced by the heuristic is always smaller than 3/2 times the length of an optimal Hamiltonian cycle. The purpose of this note is to refine Christofides' worst-case analysis by providing a tight bound for everyn ≥ 3, wheren is the number of vertices of the graph. We also show that these bounds are still tight when the metric is restricted to rectilinear distances, or to Euclidean distances for alln ≥ 6.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF01588956
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 75
    Electronic Resource
    Electronic Resource
    Matrix conditioning and nonlinear optimization (1978)
    Springer
    Mathematical programming 14 (1978), S. 149-160 
    Details
    ISSN: 1436-4646
    Keywords: Unconstrained optimization ; Variable metric methods ; SSVM methods ; Quasi-Newton methods
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Notes: Abstract In a series of recent papers, Oren, Oren and Luenberger, Oren and Spedicato, and Spedicato have developed the self-scaling variable metric algorithms. These algorithms alter Broyden's single parameter family of approximations to the inverse Hessian to a double parameter family. Conditions are given on the new parameter to minimize a bound on the condition number of the approximated inverse Hessian while insuring improved step-wise convergence. Davidon has devised an update which also minimizes the bound on the condition number while remaining in the Broyden single parameter family. This paper derives initial scalings for the approximate inverse Hessian which makes members of the Broyden class self-scaling. The Davidon, BFGS, and Oren—Spedicato updates are tested for computational efficiency and stability on numerous test functions, with the results indicating strong superiority computationally for the Davidon and BFGS update over the self-scaling update, except on a special class of functions, the homogeneous functions.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF01588962
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 76
    Electronic Resource
    Electronic Resource
    A class of methods for linear programming (1978)
    Springer
    Mathematical programming 14 (1978), S. 161-169 
    Details
    ISSN: 1436-4646
    Keywords: Linear Programming Methods ; Simplex Method ; Reduced Gradient Method ; Feasible Direction
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Notes: Abstract A class of methods is presented for solving standard linear programming problems. Like the simplex method, these methods move from one feasible solution to another at each iteration, improving the objective function as they go. Each such feasible solution is also associated with a basis. However, this feasible solution need not be an extreme point and the basic solution corresponding to the associated basis need not be feasible. Nevertheless, an optimal solution, if one exists, is found in a finite number of iterations (under nondegeneracy). An important example of a method in the class is the reduced gradient method with a slight modification regarding selection of the entering variable.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF01588963
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 77
    Electronic Resource
    Electronic Resource
    Power, prices, and incomes in voting systems (1978)
    Springer
    Mathematical programming 14 (1978), S. 129-148 
    Details
    ISSN: 1436-4646
    Keywords: Simple Games ; Voting Power ; Linear Programming ; Lobbying
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Notes: Abstract The power of voters in a voting game (simple game) is viewed as the amount they would be paid by a lobbyist buying their votes. Equilibrium prices for the voters are shown to exist whenever there is no veto player, and the expected incomes of the voters are compared with other measures of their voting power.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF01588961
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 78
    Electronic Resource
    Electronic Resource
    A tandem queueing system with priorities (1978)
    Springer
    Computing 19 (1978), S. 203-208 
    Details
    ISSN: 1436-5057
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Description / Table of Contents: Zusammenfassung Es wird eine serielle Anordnung vonN unbeschränkten Warteschlangen undN zeitdiskreten Bedienungsstationen untersucht. Der Eingangsstrom besteht ausN stochastischen Prozessen, wobei die Anforderungen, die zumi-ten Prozess gehören, das System verlassen, nachdem sie von den ersteni Bedienungsstationen bedient worden sind. Die Verteilung der Verweilzeiten können mit Hilfe eines Äquivalenzsatzes berechnet werden, wenn die Bedienungszeiten gewisse Bedingungen erfüllen.
    Notes: Abstract A system ofN unlimited queues andN time-discrete servers in series, is investigated. The input consists ofN stochastic processes where requests which have been generated according to thei-th process leave the system after they have received serivice by servers 1, 2, ...,i. The holding-time distributions can be calculated by means of an equivalence theorem which holds under certain conditions for the service times.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF02252199
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 79
    Electronic Resource
    Electronic Resource
    Das Stabilitätsproblem bei der numerischen Behandlung von Differentialgleichungen (1978)
    Springer
    Computing 19 (1978), S. 221-231 
    Details
    ISSN: 1436-5057
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Description / Table of Contents: Abstract In this paper we deal with a few definitions of stability of finite-difference methods for the approximation of differential equations, integro-differential equations etc. These definitions have been presented by Stummel [17], Spijker [14], Dahlquist [3], Ansorge [1] and Kreth [9]. We present conditions on which the stability of a special finite-difference method in some sense follows from the stability in another sense.
    Notes: Zusammenfassung Gegenstand dieser Arbeit sind einige Stabilitätsdefinitionen bei Differenzenverfahren zur Approximation von Differentialgleichungen, Integro-Differentialgleichungen usw. Wir finden diese Definitionen bei Stummel [17], Spijker [14], Dahlquist [3], Ansorge [1] und Kreth [9]. Wir geben Bedingungen an, unter denen die Stabilität eines speziellen Differenzenverfahrens im Sinne eines Autors aus der Stabilität im Sinne eines anderen Autors folgt.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF02252201
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 80
    Electronic Resource
    Electronic Resource
    A hybrid approach to discrete mathematical programming (1978)
    Springer
    Mathematical programming 14 (1978), S. 21-40 
    Details
    ISSN: 1436-4646
    Keywords: Integer Programming ; Dynamic Programming ; Branch-and-Bound ; Discrete Optimization
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Notes: Abstract The dynamic programming and branch-and-bound approaches are combined to produce a hybrid algorithm for separable discrete mathematical programs. Linear programming is used in a novel way to compute bounds. Every simplex pivot permits a bounding test to be made on every active node in the search tree. Computational experience is reported.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF01588949
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 81
    Electronic Resource
    Electronic Resource
    A finite procedure for determining if a quadratic form is bounded below on a closed polyhedral convex set (1978)
    Springer
    Mathematical programming 14 (1978), S. 122-124 
    Details
    ISSN: 1436-4646
    Keywords: Quadratic Form ; Kuhn—Tucker Point ; Quadratic Programming
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF01588957
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 82
    Electronic Resource
    Electronic Resource
    The computation of a general equilibrium in a public goods economy (1978)
    Springer
    Mathematical programming 14 (1978), S. 186-207 
    Details
    ISSN: 1436-4646
    Keywords: Fixed Point Algorithm ; Mathematical Economics ; Computing Equilibria ; General Equilibrium ; Scarf Algorithm ; Public Goods Economy
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Notes: Abstract This paper presents an algorithm for computing approximations to a certain subset of Pareto optimal allocations in a public goods economy. Consumers are partitioned into a number of exogenous governmental jurisdictions, which provide public goods locally and raise revenue to cover their costs by means of a proportional wealth tax. The Pareto optimal allocations studied are consistent with profit maximization on the part of producers, and utility maximization over private goods bundles subject to after-tax budget constraints by consumers. The computational routine is based on the Scarf algorithm for computing fixed points.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF01588965
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 83
    Electronic Resource
    Electronic Resource
    Finding all efficient extreme points for multiple objective linear programs (1978)
    Springer
    Mathematical programming 14 (1978), S. 249-261 
    Details
    ISSN: 1436-4646
    Keywords: Linear Programming ; Efficient Vertices ; Multiple Objectives
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Notes: Abstract In this paper we develop a method for finding all efficient extreme points for multiple objective linear programs. Simple characterizations of the efficiency of an edge incident to a nondegenerate or a degenerate efficient vertex are given. These characterizations form the basis of an algorithm for enumerating all efficient vertices. The algorithm appears to have definite computational advantages over other methods. Some illustrative examples are included.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF01588968
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 84
    Electronic Resource
    Electronic Resource
    A modification of todd's triangulationJ 3 (1978)
    Springer
    Mathematical programming 15 (1978), S. 223-227 
    Details
    ISSN: 1436-4646
    Keywords: Triangulations ; Fixed Point Computing Methods ; Complementary Pivoting Methods ; Piecewise Linear Homotopy
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Notes: Abstract When we apply the fixed point computing method to mappings which are affine in some variables, we show that, to generate a sequence which converges to a fixed point, the mesh size need not be decreased in these coordinates. This paper modifies the triangulationJ 3 with continuous refinement of mesh size to a triangulation $$\bar J_3$$ such that the mesh size of $$\bar J_3$$ in some given coordinates is constant and the mesh size in the other coordinates shrinks to zero.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF01609022
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 85
    Electronic Resource
    Electronic Resource
    On line perfect graphs (1978)
    Springer
    Mathematical programming 15 (1978), S. 236-238 
    Details
    ISSN: 1436-4646
    Keywords: Line-Graph ; Perfect Graph ; Edge-Coloring ; Alternating Chain
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Notes: Abstract Line-perfect graphs have been defined by L.E. Trotter as graphs whose line-graphs are perfect. They are characterized by the property of having no elementary odd cycle of size larger than 3. L.E. Trotter showed constructively that the maximum cardinality of a set of mutually non-adjacent edges (matching) is equal to the minimum cardinality of a collection of sets of mutually adjacent edges which cover all edges. The purpose of this note is to give an algorithmic proof that the chromatic index of these graphs is equal to the maximum cardinality of a set of mutually adjacent edges.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF01609025
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 86
    Electronic Resource
    Electronic Resource
    Optimal design of a membrane separation process using signomial programming (1978)
    Springer
    Mathematical programming 15 (1978), S. 12-25 
    Details
    ISSN: 1436-4646
    Keywords: Engineering Design ; Optimal Design ; Process Optimization ; Signomial Programming ; Geometric Programming
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Notes: Abstract A multistage membrane separation process for hydrogen recovery is described and formulated as a signomial programming problem. Two different configurations are examined. A 3-stage and a 5-stage process design problem are solved. The optimal solution to these programs is computed from an initial point that does not satisfy the mass balance or transport constraints of the process, using a primal-based geometric programming code. Also examined is the sensitivity of the optimal solution to changes in purity requirements. In all cases, computation times are very reasonable ranging from 2 to 4 seconds of IBM 370/165 CPU time.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF01608996
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 87
    Electronic Resource
    Electronic Resource
    The application of advanced technology to scholarly communication in the humanities (1978)
    Springer
    Computers and the humanities 12 (1978), S. 237-246 
    Details
    ISSN: 1572-8412
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Media Resources and Communication Sciences, Journalism
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF02400084
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 88
    Electronic Resource
    Electronic Resource
    CAI in college english (1978)
    Springer
    Computers and the humanities 12 (1978), S. 281-285 
    Details
    ISSN: 1572-8412
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Media Resources and Communication Sciences, Journalism
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF02400089
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 89
    Electronic Resource
    Electronic Resource
    The ninth conference on computers in the undergraduate curricula: A report (1978)
    Springer
    Computers and the humanities 12 (1978), S. 293-293 
    Details
    ISSN: 1572-8412
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Media Resources and Communication Sciences, Journalism
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF02400092
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 90
    Electronic Resource
    Electronic Resource
    Formulaic analysis of the computer-accessible corpus of Latvian sun-songs (1978)
    Springer
    Computers and the humanities 12 (1978), S. 329-339 
    Details
    ISSN: 1572-8412
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Media Resources and Communication Sciences, Journalism
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF02400105
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 91
    Electronic Resource
    Electronic Resource
    Zur Erstellung einer computerunterstützten Grammatik “Flexionsmorphologie des Frühneuhochdeutschen” (1978)
    Springer
    Computers and the humanities 12 (1978), S. 33-42 
    Details
    ISSN: 1572-8412
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Media Resources and Communication Sciences, Journalism
    Notes: Abstract The inflectional morphology of Early New High German is the subject of research at the Forschungsvorhaben Grammatik des Frühneuhochdeutschen at the University of Bonn. Because the High German of the period 1350–1700 shows strong graphemic and morphemic variation, we could not use improved computational lemmatizing alogorithms for computer-assisted analysis. Instead, the data base was extended by philological information manually analyzed. To illustrate our proceeding in setting up the paradigms requires explaining the different algorithms for analyzing verb and noun inflection. The numerous grammatical positions, for most of which little evidence is given, and the prevailing inflected structure precluded an automatic segmentation of verb forms. The program for establishing verb paradigms is based on extended informations (for instance, those about endings, historical inflection classes, preterite suffixes, etc.), and consists of steps for sorting, collecting, and printing. For nouns, the automatic segmentation can be carried out by using as a word-stem the nominative singular form, which always shows a zero-morpheme. In a lemmatizing procedure different from those already in use, the nominative plural form (singular stem + plural formative) is taken as word-stem in order to segmentize the plural cases, and thus avoid the problem of stem variation which is due to the “Pluralumlaut.” A noun class is defined by the combination of a singular paradigm, which is characterized by a genitive formative and a plural formative.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF02392914
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 92
    Electronic Resource
    Electronic Resource
    The study of Chaucer's vocabulary (1978)
    Springer
    Computers and the humanities 12 (1978), S. 61-69 
    Details
    ISSN: 1572-8412
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Media Resources and Communication Sciences, Journalism
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF02392917
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 93
    Electronic Resource
    Electronic Resource
    Dictio probatoria as fingerprint: Computer discovery of manuscript provenances (1978)
    Springer
    Computers and the humanities 12 (1978), S. 89-92 
    Details
    ISSN: 1572-8412
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Media Resources and Communication Sciences, Journalism
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF02392920
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 94
    Electronic Resource
    Electronic Resource
    The cognitive basis of late medieval religious biographies (1978)
    Springer
    Computers and the humanities 12 (1978), S. 145-154 
    Details
    ISSN: 1572-8412
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Media Resources and Communication Sciences, Journalism
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF02392927
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 95
    Electronic Resource
    Electronic Resource
    From microfilm to computer: 15th century cadastral and notarial archives (1978)
    Springer
    Computers and the humanities 12 (1978), S. 165-175 
    Details
    ISSN: 1572-8412
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Media Resources and Communication Sciences, Journalism
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF02392929
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 96
    Electronic Resource
    Electronic Resource
    Records of early english drama and the computer (1978)
    Springer
    Computers and the humanities 12 (1978), S. 183-188 
    Details
    ISSN: 1572-8412
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Media Resources and Communication Sciences, Journalism
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF02392931
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 97
    Electronic Resource
    Electronic Resource
    The computer in social history: Historical demography in Germany (1978)
    Springer
    Computers and the humanities 12 (1978), S. 227-236 
    Details
    ISSN: 1572-8412
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Media Resources and Communication Sciences, Journalism
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF02400083
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 98
    Electronic Resource
    Electronic Resource
    The Mt. Angel Abbey manuscript and rare books project: Cataloguing with FAMULUS (1978)
    Springer
    Computers and the humanities 12 (1978), S. 215-222 
    Details
    ISSN: 1572-8412
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Media Resources and Communication Sciences, Journalism
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF02392934
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 99
    Electronic Resource
    Electronic Resource
    Sur la confection d'un lexique pour l'analyse automatique (1978)
    Springer
    Computers and the humanities 12 (1978), S. 321-328 
    Details
    ISSN: 1572-8412
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Media Resources and Communication Sciences, Journalism
    Notes: Abstract The goodness of the results to be obtained from a system for syntactic analysis of a natural language by computer (with French as an example) depends crucially on the way the lexicon is constructed. To avoid incorrect parses of a correct sentence, verbal selection rules are required. These rules are just the acceptability constraints observed between verb and subject and between verb and object in sentences of the formN 1 tV N 2 andN 1 tV N 2 P N 3. It is well known that not every noun subclass is an acceptable subject (or object) for every verb in such sentences; those that are constitute the selection of the verb. By a careful definition of each subclass of nouns, verbs, adjectives, etc., these rules can be incorporated into Harris' string grammar, which is used here. The definitions should, insofar as possible, be based on formal distributional criteria, so that the classification will be independent of intuitive judgments. The main conclusions are that both the lexicon and the grammar must be very detailed if one wishes to eliminate all incorrect parses; that no automatic word classification is possible, for example, via a dialogue with the computer; and finally, that the computer can be used fruitfully to investigate distributional phenomena in as-yet-unexplored subdomains, for example, by analyzing scientific text.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF02400104
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 100
    Electronic Resource
    Electronic Resource
    Abstracts and brief notices (1978)
    Springer
    Computers and the humanities 12 (1978), S. 373-380 
    Details
    ISSN: 1572-8412
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Media Resources and Communication Sciences, Journalism
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF02400109
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
Close ⊗
This website uses cookies and the analysis tool Matomo. More information can be found here...