ALBERT

All Library Books, journals and Electronic Records Telegrafenberg

Your email was sent successfully. Check your inbox.

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

Proceed reservation?

Export
Filter
  • Articles  (2,869)
  • Springer  (2,869)
  • 1970-1974  (2,869)
  • Computer Science  (2,869)
Collection
  • Articles  (2,869)
Years
Year
Journal
  • 1
    Electronic Resource
    Electronic Resource
    Springer
    Mathematical programming 6 (1974), S. 234-240 
    ISSN: 1436-4646
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 2
    Electronic Resource
    Electronic Resource
    Springer
    Mathematical programming 6 (1974), S. 229-233 
    ISSN: 1436-4646
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Notes: Abstract A particular case of a mathematical theorem of F. Browder on the behavior of the fixed point set of a mapping under variations of a parameter has recently found applications in programming theory in connection with the abstract (non-linear) complementarity problem (see Eaves, [2, 3]). Two relevant extensions of Browder's result are provided: The first asserts that, under smoothness assumptions, the connected set of fixed points one gets from Browder's theorem is “generically” an arc; the second gives a generalization to the case where the mapping is an upper hemicontinuous contractible valued correspondence.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 3
    Electronic Resource
    Electronic Resource
    Springer
    Mathematical programming 6 (1974), S. 371-371 
    ISSN: 1436-4646
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 4
    Electronic Resource
    Electronic Resource
    Springer
    Mathematical programming 6 (1974), S. 360-364 
    ISSN: 1436-4646
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Notes: Abstract This paper investigates some convergence properties of Fiacco and McCormick's SUMT algorithm. A convex programming problem is given for which the SUMT algorithm generates a unique unconstrained minimizing trajectory having an infinite number of accumulation points, each a global minimizer to the original convex programming problem.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 5
    Electronic Resource
    Electronic Resource
    Springer
    Mathematical programming 6 (1974), S. 1-13 
    ISSN: 1436-4646
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Notes: Abstract A simple algorithm is described for constructing a maximum packing of cuts directed away from a distinguished vertex, called the root, in a directed graph, each of whose edges has a nonnegative weight, and it is shown that the maximum packing value is equal to the weight of a minimum-weight spanning arborescence directed away from the root.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 6
    Electronic Resource
    Electronic Resource
    Springer
    Mathematical programming 6 (1974), S. 42-47 
    ISSN: 1436-4646
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Notes: Abstract In this paper we re-examine some of the available methods for pricing out the columns in the simplex method and point out their potential advantages and disadvantages. In particular, we show that a simple formula for updating the pricing vector can be used with some advantage in the standard product form simplex algorithm and with very considerable advantage in two recent developments: P.M.J. Harris' dynamic scaling method and the Forrest—Tomlin method for maintaining triangular factors of the basis.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 7
    Electronic Resource
    Electronic Resource
    Springer
    Mathematical programming 7 (1974), S. 223-235 
    ISSN: 1436-4646
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Notes: Abstract The purpose of this paper is to present sufficient conditions for the existence of optimal solutions to integer and mixed-integer programming problems in the absence of upper bounds on the integer variables. It is shown that (in addition to feasibility and boundedness of the objective function) (1) in the pure integer case a sufficient condition is that all of the constraints (other than non-negativity and integrality of the variables) beequalities, and (2) that in the mixed-integer caserationality of the constraint coefficients is sufficient. Some computational implications of these results are also given.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 8
    Electronic Resource
    Electronic Resource
    Springer
    Mathematical programming 7 (1974), S. 253-258 
    ISSN: 1436-4646
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 9
    Electronic Resource
    Electronic Resource
    Springer
    Mathematical programming 7 (1974), S. 262-262 
    ISSN: 1436-4646
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 10
    Electronic Resource
    Electronic Resource
    Springer
    Mathematical programming 7 (1974), S. 376-379 
    ISSN: 1436-4646
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 11
    Electronic Resource
    Electronic Resource
    Springer
    Mathematical programming 7 (1974), S. 351-367 
    ISSN: 1436-4646
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Notes: Abstract This paper addresses the problem of selecting the parameter in a family of algorithms for unconstrained minimization known as Self Scaling Variable Metric (SSVM) Algorithms. This family, that has some very attractive properties, is based on a two parameter formula for updating the inverse Hessian approximation, in which the parameters can take any values between zero and one. Earlier results obtained for SSVM algorithms apply to the entire family and give no indication of how the choice of parameter may affect the algorithm's performance. In this paper, we examine empirically the effect of varying the parameters and relaxing the line-search. Theoretical consideration also leads to a switching tule for these parameters. Numerical results obtained for the SSVM algorithm indicate that with proper parameter selection it is superior to the DFP algorithm, particularly for high-dimensional problems.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 12
    Electronic Resource
    Electronic Resource
    Springer
    Mathematical programming 7 (1974), S. 388-388 
    ISSN: 1436-4646
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 13
    Electronic Resource
    Electronic Resource
    Springer
    Mathematical programming 7 (1974), S. 384-387 
    ISSN: 1436-4646
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Notes: Abstract Some properties of “Davidon”, or variable metric, methods are studied from the viewpoint of convex analysis; they depend on the convexity of the function to be minimized rather than on its being approximately quadratic. An algorithm is presented which generalizes the variable metric method, and its convergence is shown for a large class of convex functions.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 14
    Electronic Resource
    Electronic Resource
    Springer
    Computing 12 (1974), S. 17-41 
    ISSN: 1436-5057
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Description / Table of Contents: Abstract Several kinds of differentiability are defined, which are adapted to the study of a large class of optimization problems. A theory is constructed with special respect to problems with nonsmooth target-functions and side conditions.
    Notes: Zusammenfassung Es werden Differenzierbarkeitsbegriffe eingeführt, die sich zum Studium einer großen Klasse von Optimierungsaufgaben eignen. Besondere Berücksichtigung finden dabei Aufgaben mit nichtglatten Zielfunktionen und Nebenbedingungen.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 15
    Electronic Resource
    Electronic Resource
    Springer
    Computing 12 (1974), S. 67-73 
    ISSN: 1436-5057
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Description / Table of Contents: Abstract Generalized norms are used to define hypernormballs in linear spaces. It turns out that the intervals, intervalvectors, intervalmatrices and intervalfunctions of Interval Analysis are special hypernormballs. Then the induced algebraic structure in the space of hypernormballs is investigated.
    Notes: Zusammenfassung In linearen Räumen werden mittels eines verallgemeinerten Normbegriffes gewisse Teilmengen ausgezeichnet, die Hypernormbälle. Es zeigt sich, daß die in der Intervallrechnung auftretenden Intervalle, Intervallvektoren, Intervallmatrizen und Intervallfunktionen spezielle Hypernormbälle sind. Sodann wird die induzierte algebraische Struktur im Raum der Hypernormbälle untersucht.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 16
    Electronic Resource
    Electronic Resource
    Springer
    Mathematical programming 6 (1974), S. 105-109 
    ISSN: 1436-4646
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 17
    Electronic Resource
    Electronic Resource
    Springer
    Mathematical programming 6 (1974), S. 118-118 
    ISSN: 1436-4646
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 18
    Electronic Resource
    Electronic Resource
    Springer
    Mathematical programming 6 (1974), S. 121-140 
    ISSN: 1436-4646
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Notes: Abstract This nested decomposition algorithm is intended for solving linear programs with the staircase structure that is characteristic of dynamic multi-sector models for economic development. Staircase problems represent a special case of the discrete-time optimal control problem. Our method is based upon the same principles as that of Glassey [5], but appears easier to describe and to relate to control theory. Computational experience is reported for a series of test problems. The algorithm has been coded in MPL, an experimental language for mathematical programming. This translator has made it possible to obtain a more readable program — and with fewer instructions — than one written in a conventional language. However, because the present version of MPL does not permit the use of slow access memory, this has prevented us from exploring the full potential of nested decomposition for solving larger problems than can be handled by conventional simplex techniques.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 19
    Electronic Resource
    Electronic Resource
    Springer
    Mathematical programming 6 (1974), S. 167-179 
    ISSN: 1436-4646
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Notes: Abstract In earlier results by Sposito and David, Kuhn—Tucker duality was established over nondegenerate cone domains (not necessarily polyhedral) without differentiability under a certain natural modification of the Slater condition, in addition to the convexity of a certain auxiliary set. This note extends Kuhn—Tucker duality to optimization problems with both nondegenerate and degenerate cone domains. Moreover, under a different condition than presented in earlier results by the author, this note develops Kuhn—Tucker duality for a certain class of nonlinear problems with linear constraints and an arbitrary objective function.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 20
    Electronic Resource
    Electronic Resource
    Springer
    Computing 13 (1974), S. 385-387 
    ISSN: 1436-5057
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 21
    ISSN: 1436-5057
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Description / Table of Contents: Abstract An elastic body in contact with an elastic or rigid subgrade is represented by Finite Elements. The total potential energy of the system under consideration of linearly elastic material and small deformations is now a quadratic function of the nodal deformations and the nodal values of the contact pressure which is approximated by a polynomial. Only a part of the surface of the body must be proposed which includes the real contact surface. After evaluation of the equilibrium equations and the contact condition in an inequality and a linear transformation of the nodal variables, all relations are now so formulated, that minimization of total potential energy can be expressed as a Quadratic Program in the unknown nodal deformations and nodal values of contact pressure. Standard Programs can now be used for solution.
    Notes: Zusammenfassung Der mit einer elastischen oder starren Unterlage in Kontakt tretende Körper wird durch finite Elemente repräsentiert. Die totale potentielle Energie des Systems ist bei elastischem Materialverhalten und kleinen Verformungen eine quadratische Funktion in den Knotenvariablen und den Knotenpunktsordinaten der durch ein Polynom approximierten Kontaktdruckverteilung. Dazu ist nur ein Bereich auf der Oberfläche des Körpers festzulegen, innerhalb dessen die aktuelle Kontaktfläche liegen muß. Nach Ermittlung der Gleichgewichtsbedingungen und der entsprechenden Kontaktbedingung als Ungleichung sowie einer linearen Transformation der Knotenvariablen werden num sämtliche Beziehungen so formuliert, daß sich die Minimierung der totalen potentiellen Energie als ein Quadratisches Programm in den Knotenvariablen und den entsprechenden Ordinaten der Kontaktdruckverteilung darstellen läßt. Die Lösung des quadratischen Programmes kann mit Standardprogrammen durchgeführt werden.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 22
    Electronic Resource
    Electronic Resource
    Springer
    Mathematical programming 7 (1974), S. 260-261 
    ISSN: 1436-4646
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 23
    Electronic Resource
    Electronic Resource
    Springer
    Mathematical programming 7 (1974), S. 263-282 
    ISSN: 1436-4646
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Notes: Abstract For a given inequality with 0–1 variables, there are many other “equivalent” inequalities with exactly the same 0–1 feasible solutions. The set of all equivalent inequalities is characterized, and methods to construct the equivalent inequality with smallest coefficients are described.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 24
    Electronic Resource
    Electronic Resource
    Springer
    Mathematical programming 7 (1974), S. 283-310 
    ISSN: 1436-4646
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Notes: Abstract An algorithm for the linear complementarity problem is developed which uses principal pivots only. The algorithm is shown to be equivalent to Lemke's algorithm. The advantage of the proposed algorithm is that infeasibility tests may be made after each principal pivot. One such test is equivalent to a check whether the matrix satisfies the “plus” condition of copositive plus matrices or the condition of classL 2 of Eaves.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 25
    Electronic Resource
    Electronic Resource
    Springer
    Mathematical programming 7 (1974), S. 368-375 
    ISSN: 1436-4646
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Notes: Abstract The theorem of this paper is of the same general class as Farkas' Lemma, Stiemke's Theorem, and the Kuhn—Fourier Theorem in the theory of linear inequalities. LetV be a vector subspace ofR n , and let intervalsI 1,⋯, I n of real numbers be prescribed. A necessary and sufficient condition is given for existence of a vector (x 1 ,⋯, x n ) inV such thatx i ∈I i (i = 1, ⋯,n); this condition involves the “elementary vectors” (nonzero vectors with minimal support) ofV ⊥. The proof of the theorem uses only elementary linear algebra.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 26
    Electronic Resource
    Electronic Resource
    Springer
    Mathematical programming 7 (1974), S. 389-389 
    ISSN: 1436-4646
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 27
    Electronic Resource
    Electronic Resource
    Springer
    Mathematical programming 7 (1974), S. 390-390 
    ISSN: 1436-4646
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 28
    Electronic Resource
    Electronic Resource
    Springer
    Mathematical programming 7 (1974), S. 17-31 
    ISSN: 1436-4646
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Notes: Abstract A nonlinear generalization of square matrices with non-positive off-diagonal elements is presented, and an algorithm to solve the corresponding complementarity problem is suggested. It is shown that the existence of a feasible solution implies the existence of a least solution which is also a complementary solution. A potential application of this nonlinear setup in extending the well-known linear Leontief input—output systems is discussed.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 29
    Electronic Resource
    Electronic Resource
    Springer
    Mathematical programming 7 (1974), S. 46-59 
    ISSN: 1436-4646
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Notes: Abstract This paper presents a new algorithm for the continuous modular design problem. The method is based on and can be combined with preceding work by Passy, and Shaftel and Thompson. The proposed algorithm guarantees a strict decrease of the objective function's value at every iteration and converges in a finite number of steps.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 30
    Electronic Resource
    Electronic Resource
    Springer
    Mathematical programming 6 (1974), S. 89-104 
    ISSN: 1436-4646
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Notes: Abstract The general Fermat problem is to find the minimum of the weighted sum of distances fromm destination points in Euclideann-space. Kuhn recently proved that a classical iterative algorithm converges to the unique minimizing point , for any choice of the initial point except for a denumerable set. In this note, it is shown that although convergence is global, the rapidity of convergence depends strongly upon whether or not  is a destination. If  is not a destination, then locally convergence is always linear with upper and lower asymptotic convergence boundsλ andλ′ (λ ≥ 1/2, whenn=2). If  is a destination, then convergence can be either linear, quadratic or sublinear. Three numerical examples which illustrate the different possibilities are given and comparisons are made with the use of Steffensen's scheme to accelerate convergence.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 31
    Electronic Resource
    Electronic Resource
    Springer
    Mathematical programming 6 (1974), S. 110-113 
    ISSN: 1436-4646
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Notes: Abstract For a collection of subsets of a setS, letn k be the maximal number of sets from such that no point ofS belongs to more thank of them. Then the limitδ of the sequencen k /k is related to the valuev of the game in which the minimizer selects a setα in , the maximizer a pointx inS, and the payoff isϰ α (x), byδ≤v −1≤inf v δ v . Herev is any finite subset ofS and δ v the corresponding limit. Analogous results hold for covering. The bounds obtained in this way forn k and in particularn 1 reflect the influence of the boundary ofS when, for instance,S is a convex body to be packed with congruent copies of another body. In some cases, the bounds are sharp.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 32
    Electronic Resource
    Electronic Resource
    Springer
    Mathematical programming 6 (1974), S. 157-166 
    ISSN: 1436-4646
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Notes: Abstract The purpose of this paper is to study a generalization of the concept of blocking and antiblocking polyhedra that has been introduced by D.R. Fulkerson. The polyhedra studied by Fulkerson are restricted to the nonnegative orthant in R m . The present generalization considers sets restricted to a cone. This leads to two polarity correspondences, which are related to the Minkowski polarity for convex sets.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 33
    Electronic Resource
    Electronic Resource
    Springer
    Mathematical programming 6 (1974), S. 224-228 
    ISSN: 1436-4646
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 34
    Electronic Resource
    Electronic Resource
    Springer
    Mathematical programming 6 (1974), S. 240-240 
    ISSN: 1436-4646
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 35
    Electronic Resource
    Electronic Resource
    Springer
    Mathematical programming 6 (1974), S. 242-242 
    ISSN: 1436-4646
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 36
    Electronic Resource
    Electronic Resource
    Springer
    Mathematical programming 6 (1974), S. 372-372 
    ISSN: 1436-4646
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 37
    Electronic Resource
    Electronic Resource
    Springer
    Mathematical programming 6 (1974), S. 365-370 
    ISSN: 1436-4646
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Notes: Abstract A modification of the column generation operation in Dantzig—Wolfe decomposition is suggested. Instead of the usual procedure of solving one or more subproblems at each major iteration, it is shown how the subproblems may be solved parametrically in such a way as to maximize the immediate improvement in the value of objective in the “master problem”, rather than to maximize the “reduced profit” of the entering column. The parametric problem is shown to involve the maximization of a piece-wise linear concave function of a single variable. It is hoped that in some cases the use of the suggested procedure may improve the slow rates of convergence common in decomposition algorithms.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 38
    Electronic Resource
    Electronic Resource
    Springer
    Mathematical programming 6 (1974), S. 28-41 
    ISSN: 1436-4646
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Notes: Abstract A large scale hydroelectric system optimization is considered and solved by using a non-linear programming method. The largest numerical case involves approximately 6 000 variables, 4 000 linear equations, 11 000 linear and nonlinear inequality constraints and a nonlinear objective function. The solution method is based on (i) partial elimination of independent variables by solving linear equations, (ii) essentially unconstrained optimization of a compound function that consists of the objective function, nonlinear inequality constraints and part of the linear inequality constraints. The compound function is obtained via penalty formulation. The algorithm takes full advantage of the problem's structure and provides useful solutions for real life problems that, in general, are defined over empty feasible regions.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 39
    Electronic Resource
    Electronic Resource
    Springer
    Mathematical programming 7 (1974), S. 87-96 
    ISSN: 1436-4646
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Notes: Abstract A highly efficient algorithm (HK) devised by Held and Karp for solving the symmetric traveling-salesman problem was presented at the 7th Mathematical Programming Symposium in 1970 and published in Mathematical Programming in 1971. Its outstanding performance is due to a clever exploitation of the relationship between the traveling-salesman problem and minimum spanning trees. However, various improvements of their method have led to a version (IHK) which tends to be some 25 times faster than the original one. Experiments with data selected at random, ranging in size up to 80 cities, show that the computing time for IHK is roughly doubled as the number of cities is increased by 10.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 40
    Electronic Resource
    Electronic Resource
    Springer
    Mathematical programming 7 (1974), S. 108-109 
    ISSN: 1436-4646
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 41
    Electronic Resource
    Electronic Resource
    Springer
    Mathematical programming 7 (1974), S. 113-114 
    ISSN: 1436-4646
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 42
    Electronic Resource
    Electronic Resource
    Springer
    Mathematical programming 7 (1974), S. 110-112 
    ISSN: 1436-4646
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 43
    Electronic Resource
    Electronic Resource
    Springer
    Mathematical programming 7 (1974), S. 117-143 
    ISSN: 1436-4646
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Notes: Abstract The paper surveys the basic results and nonresults for decision rules in stochastic programming. It exhibits some of the difficulties encountered when trying to restrict the class of acceptable rules to those possessing specific functional forms. A liberal dosage of examples is provided which illustrate various cases. The treatment is unified by making use of the equivalence of various formulations which have appeared in the literature. An appendix is devoted to the P-model for stochastic programs with chance constraints.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 44
    Electronic Resource
    Electronic Resource
    Springer
    Mathematical programming 7 (1974), S. 181-190 
    ISSN: 1436-4646
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Notes: Abstract An algorithm for solving ordinary geometric programs is presented. The algorithm is based on the reduced system associated with geometric programs and is highly flexible in that it allows the use of several nonlinear optimization techniques.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 45
    Electronic Resource
    Electronic Resource
    Springer
    Mathematical programming 7 (1974), S. 199-211 
    ISSN: 1436-4646
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Notes: Abstract Using Scarf's algorithm for “computing” a fixed point of a continuous mapping, the following is proved: LetM 1 ⋯ M n be closed sets inR n which cover the standard simplexS, so thatM i coversS i , the face ofS opposite vertexi. We say a point inS iscompletely labeled if it belongs to everyM i andk-almost-completely labeled if it belongs to all butM k . Then there exists a closed setT ofk-almost-completely labeled points which connects vertexk with some completely labeled point. This result is used to prove Browder's theorem (a parametric fixed-point theorem) inR n . It is also used to generate “algorithms” for the nonlinear complementarity problem which are analogous to the Lemke—Howson algorithm and the Cottle—Dantzig algorithm, respectively, for the linear complementarity problem.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 46
    Electronic Resource
    Electronic Resource
    Springer
    Mathematical programming 7 (1974), S. 245-248 
    ISSN: 1436-4646
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 47
    Electronic Resource
    Electronic Resource
    Springer
    Mathematical programming 7 (1974), S. 259-259 
    ISSN: 1436-4646
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 48
    Electronic Resource
    Electronic Resource
    Springer
    Mathematical programming 7 (1974), S. 311-350 
    ISSN: 1436-4646
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Notes: Abstract This paper describes two numerically stable methods for unconstrained optimization and their generalization when linear inequality constraints are added. The difference between the two methods is simply that one requires the Hessian matrix explicitly and the other does not. The methods are intimately based on the recurrence of matrix factorizations and are linked to earlier work on quasi-Newton methods and quadratic programming.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 49
    Electronic Resource
    Electronic Resource
    Springer
    Mathematical programming 7 (1974), S. 380-383 
    ISSN: 1436-4646
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Notes: Abstract An algorithm is described for finding the minimum of any convex, not necessarily differentiable, functionf of several variables. The algorithm yields a sequence of points tending to the solution of the problem, if any; it requires the calculation off and one subgradient off at designated points. Its rate of convergence is estimated for convex and also for twice differentiable convex functions. It is an extension of the method of conjugate gradients, and terminates whenf is quadratic.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 50
    Electronic Resource
    Electronic Resource
    Springer
    Mathematical programming 7 (1974), S. 391-391 
    ISSN: 1436-4646
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 51
    Electronic Resource
    Electronic Resource
    Springer
    Mathematical programming 7 (1974), S. 1-16 
    ISSN: 1436-4646
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Notes: Abstract This paper establishes quantitative bounds for the variation of an isolated local minimizer for a general nonlinear program under perturbations in the objective function and constraints. These bounds are then applied to establish rates of convergence for a class of recursive nonlinear-programming algorithms.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 52
    Electronic Resource
    Electronic Resource
    Springer
    Mathematical programming 7 (1974), S. 60-86 
    ISSN: 1436-4646
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Notes: Abstract The primary objectives of this paper are: (1) to present an improved formulation of the out-of-kilter algorithm; (2) to give the results of an extensive computational comparison of a code based on this formulation with three widely-used out-of-kilter production codes; (3) to study the possible sensitivity of these programs to the type of problem being solved; and (4) to investigate the effect of advanced dual start procedures on overall solution time. The study discloses that the new formulation does indeed provide the most efficient solution procedure of those tested. This streamlined version of out-of-kilter was found to be faster than the other out-of-kilter codes tested (SHARE, BSRL and Texas Water Development Board codes) by a factor of 2–5 on small and medium size problems and by a factor of 4–15 on large problems. The streamlined method's median solution time for 1500 node networks on a CDC 6600 computer is 33 seconds with a range of 33 to 35 seconds.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 53
    Electronic Resource
    Electronic Resource
    Springer
    Computing 13 (1974), S. 89-92 
    ISSN: 1436-5057
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 54
    Electronic Resource
    Electronic Resource
    Springer
    Computing 13 (1974), S. 93-105 
    ISSN: 1436-5057
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Description / Table of Contents: Zusammenfassung Eine neue Klasse von stochastischen Automaten ist eingeführt worden. Seine Elemente, abhängige Automaten genannt, werden charakterisiert durch eine Klasseneinteilung auf die Menge der Zustände, so daß der Übergang zwischen den Klassen auf deterministische Weise definiert worden ist. Die Definitionen des Isomorphismus und des Aquivalenz wurden angepaßt. Einige Zusammenhänge mit anderen Klassen von stochastischen Automaten und Subklassen der abhängigen Automaten werden studiert.
    Notes: Abstract A new class of stochastic automata is defined. Its elements, called dependent automata, are characterized by a partition on the set of states such that the transition between the blocks is defined deterministicly. The definitions of isomorphism and equivalence are adapted. Some relations with other classes of stochastic automata and subclasses of dependent automata are defined.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 55
    Electronic Resource
    Electronic Resource
    Springer
    Computing 13 (1974), S. 143-154 
    ISSN: 1436-5057
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Description / Table of Contents: Abstract Using new special functions the solution of linear second-order differential equations with constant coefficients is transformed in such a way so that it no longer contains numerical singularities. A numerical algorithm for the computation of an approach for this solution and an ALGOL 60-program are given.
    Notes: Zusammenfassung Die Lösung linearer Differentialgleichungen zweiter Ordnung mit konstanten Koeffizienten wird mit Hilfe neuer spezieller Funktionen derart umgeschrieben, daß sie keine numerischen Singularitäten mehr enthält. Es wird ein numerischer Algorithmus zur Berechnung eines Näherungswertes dieser Lösung und ein ALGOL 60-Programm angegeben.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 56
    Electronic Resource
    Electronic Resource
    Springer
    Computing 13 (1974), S. 183-193 
    ISSN: 1436-5057
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Description / Table of Contents: Zusammenfassung Es wird ein FORTRAN-Programm dargestellt zur automatischen Berechnung bestimmter Integrale mit stark oszillierendem Integrand. Die Integration wird durchgeführt mit Hilfe von speziellen Quadraturformeln vom Gaußschen Typ.
    Notes: Abstract An automatic integration routine for the computation of highly oscillating functions is presented. The algorithm is based on the use of Gaussian quadrature formulas with suitable weight function.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 57
    Electronic Resource
    Electronic Resource
    Springer
    Computing 13 (1974), S. 205-213 
    ISSN: 1436-5057
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Description / Table of Contents: Zusammenfassung Eine hinreichende Bedingung für beste Chebyshev Approximationen der Forma+bϕ(cx) wird angegeben und durch Alternanten ihrer Fehlerkurve charakterisiert. Gegeben werden mehrere Beispiele für ϕ in denen Alternanten vorkommen. Betrachtet wird das Problem, die beste Annäherung zu berechnen. Für einige Funktionen ϕ wird gezeigt, daß das Hinzufügen aller Polynome ersten Grades zu der Familie der Approximationen noch eine Alternantentheorie gibt.
    Notes: Abstract A sufficient condition is given for best Chebyshev approximations of the form a+bϕ(cx) to be characterized by alternation of their error curve. Several examples are given of ϕ for which alternation occurs. The problem of computing a best approximation is considered. It is shown for some ϕ that adding all first degree polynomials to the family of approximations still gives an alternating theory.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 58
    Electronic Resource
    Electronic Resource
    Springer
    Computing 13 (1974), S. 267-277 
    ISSN: 1436-5057
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Description / Table of Contents: Abstract For the approximate quadrature of improper integrals over the real axis for analytic functions quadrature formulae with an infinite number of equidistant nodes are considered. In a Hardy space the L1-norm of the error of the trapezoidal rule is evaluated and, furthermore, a quadrature formula with minimal error norm is given.
    Notes: Zusammenfassung Für die numerische Quadratur uneigentlicher Integrale über die reelle Achse bei analytischen Funktionen werden Quadratur-formeln mit unendlich vielen äquidistanten Stützstellen betrachtet. In einem Hardyschen Raum wird die L1-Norm des Fehlers bei der Rechteckregel bestimmt, und es wird ferner eine Quadraturformel mit minimaler Fehlernorm angegeben.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 59
    Electronic Resource
    Electronic Resource
    Springer
    Mathematical programming 6 (1974), S. 197-211 
    ISSN: 1436-4646
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Notes: Abstract Given an existing network, a list of arcs which could be added to the network, the arc costs and capacities, and an available budget, the problem considered in this paper is one of choosing which arcs to add to the network in order to maximize the maximum flow from a sources to a sinkt, subject to the budgetary constraint. This problem appears in a large number of practical situations which arise in connection with the expansion of electricity or gas supply, telephone, road or rail networks. The paper describes an efficient tree-search algorithm using bounds calculated by a dynamic programming procedure which are very effective in limiting the solution space explicitly searched. Computational results for a number of medium sized problems are described and computing times are seen to be very reasonable.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 60
    Electronic Resource
    Electronic Resource
    Springer
    Mathematical programming 6 (1974), S. 241-241 
    ISSN: 1436-4646
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 61
    Electronic Resource
    Electronic Resource
    Springer
    Mathematical programming 6 (1974), S. 243-263 
    ISSN: 1436-4646
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Notes: Abstract Complementary pivot algorithms known at the present time fall into several quite general categories, with obvious similarities. This paper deals with general pivoting systems which provide a natural setting for the study of complementary pivot algorithms. A generalized algorithm is presented for these systems. We give results on the number of iterations necessary for such an algorithm.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 62
    Electronic Resource
    Electronic Resource
    Springer
    Mathematical programming 6 (1974), S. 301-326 
    ISSN: 1436-4646
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Notes: Abstract A method for sensitivity analysis in nonlinear programming has recently been developed using the sequential unconstrained minimization technique. It is applied here to perform sensitivity analyses on four example problems to demonstrate the computational feasibility and characteristics of the approach. The sensitivity analysis is conducted along the minimizing trajectory for each problem. The convergence characteristics of the first partial derivatives of the variables and objective function with respect to the parameters in the sensitivity analysis are illustrated.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 63
    Electronic Resource
    Electronic Resource
    Springer
    Mathematical programming 6 (1974), S. 48-61 
    ISSN: 1436-4646
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Notes: Abstract We consider two convex polyhedra related to the vertex packing problem for a finite, undirected, loopless graphG with no multiple edges. A characterization is given for the extreme points of the polyhedron $$\mathcal{L}_G = \{ x \in R^n :Ax \leqslant 1_m ,x \geqslant 0\} $$ , whereA is them × n edge-vertex incidence matrix ofG and 1 m is anm-vector of ones. A general class of facets of = convex hull{x∈R n :Ax≤1 m ,x binary} is described which subsumes a class examined by Padberg [13]. Some of the results for are extended to a more general class of integer polyhedra obtained from independence systems.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 64
    Electronic Resource
    Electronic Resource
    Springer
    Computing 12 (1974), S. 145-148 
    ISSN: 1436-5057
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Description / Table of Contents: Abstract Letf be 2 π-periodic,T v its trigonometric interpolation polynomial, $$\bar f$$ and $$\bar T_T $$ the conjugates off andT T, respectively. In this note the maximum norms ‖f-T T‖, $$\parallel f - \bar T_T \parallel $$ ‖f′−T ′‖ and $$\parallel \bar f' - \bar T'_T \parallel $$ are estimated by the Fourier coefficients off. Iff is analytic on Φ results by Kress [2], [3] are obtained.
    Notes: Zusammenfassung Es seif 2 π-periodisch,T N sein trigonometrisches Interpolationspolynom, $$\bar f$$ bzw. $$\bar T_N $$ die Konjugierten zuf bzw.T N. In der Note werden die Maximum-Normen ‖f-T N‖, $$\parallel \bar f - \bar T_N \parallel $$ , ‖f′−f′ N ‖ und $$\parallel \bar f' - \bar T'_N \parallel $$ über die Fourier-Koeffizienten vonf und also ableitungsfrei abgeschätzt. Der Sonderfallf analytisch auf ℝ liefert Ergebnisse von Kress [2], [3].
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 65
    Electronic Resource
    Electronic Resource
    Springer
    Computing 12 (1974), S. 181-194 
    ISSN: 1436-5057
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Description / Table of Contents: Zusammenfassung Es werden einige Formen der „Successive Overrelaxation (SOR)” auf ein gekoppeltes Paar von der biharmonischen Gleichung äquivalenter Differenzengleichungen übertragen. Die Auswertung und Ergebnisse ermöglichen einen teilweisen Vergleich der Verfahren untereinander. Rechnungsergebnisse werden auch angegeben.
    Notes: Abstract Several forms of “Successive Overrelaxation (SOR)” are applied to a coupled pair of difference equations, equivalent to the biharmonic equation. The analysis and results yield a partial comparison amongst the methods. Computational results are also included.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 66
    Electronic Resource
    Electronic Resource
    Springer
    Computing 12 (1974), S. 215-222 
    ISSN: 1436-5057
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Description / Table of Contents: Abstract This note presents a matrix representation of iterative methods which is a generalization of those given by Miranker [6] and Rice [8]. It is based on an elementary theorem which show that the order of convergence of some nonlinear single-step and total-step methods is the spectral radius of a certain matrix. Thus a large class of iterative methods are easy to analyze especially such as: Hermiteinterpolatory methods, composite Hermite-interpolatory methods, several parallel methods and even special methods for systems of equations.
    Notes: Zusammenfassung In dieser Note wird eine Matrixdarstellung für Iterationsverfahren zur Lösung nichtlinearere Gleichungen angegeben. Diese Darstellung umfaßt jene von Miranker [6] und Rice [8] angegebenen. Es wird ein Theorem elementar bewiesen, welches besagt, daß die Ordnung einer Klasse nichtlinearer Gesamt-und Einzelschrittverfahren gleich dem Spektralradius der Darstellungsmatrix ist. Die angegebene Matrixdarstellung ermöglicht besonders einfach die Untersuchung paralleler und serieller Iterationsverfahren, welche durch Interpolation unter Verwendung von Ableitungen gebildet werden. Sie läßt sich aber auch bei speziellen nichtlinearen Gleichungssytemen anwenden.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 67
    ISSN: 1436-5057
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Description / Table of Contents: Abstract By means of the theory of distributions the possibilities to obtain qualitative statements concerning solutions of systems of linear differential equations with discontinuous right hand sides are investigated. A number of existence and uniqueness theorems is proved for a suitable defined initial value problem. Moreover the structure of solutions (continuity, periodicity etc.) is investigated more closely. It is shown that a number of theorems known from the classical theory of periodical solutions is applicable to differential equations in the space of distributions with only slight modifications.
    Notes: Zusammenfassung Es werden die Möglichkeiten untersucht, mit Hilfe der Theorie der Distributionen qualitative Aussagen über Lösungen von linearen Differentialgleichungssystemen mit nicht stetiger rechter Seite zu erhalten. Für ein geeignet definiertes Anfangswertproblem werden einige Existenz- und Eindeutigkeitssätze bewiesen. Außerdem wird die Struktur der Lösungen (Stetigkeit, Periodizität usw.) näher untersucht. Es wird gezeigt, daß sich eine Reihe der aus der klassischen Theorie bekannten Sätze über periodische Lösungen unter geringfügigen Modifikationen auf Differentialgleichungen im Raum der Distributionen übertragen lassen.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 68
    Electronic Resource
    Electronic Resource
    Springer
    Computing 12 (1974), S. 291-313 
    ISSN: 1436-5057
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Description / Table of Contents: Zusammenfassung Die Arbeit enthält die Beschreibung eines neuen heuristischen Algorithmus, der überprüft ob zwei Graphen isomorph sind. Der Algorithmus besteht aus zwei Teilen. Der erste Teil, ein 0 (n 5)-Algorithmus, liefert eine Knoten- und Kantenpartition. Der zweite Teil gewinnt aus diesen Partitionen auf Grund heuristischer Überlegungen alle möglichen Isomorphismen. Die Knoten- und Kantenpartitionen werden mit Hilfe eines Connectivity-Graphen beschrieben, an Hand dessen eine hinreichende Bedingung für die Existenz eines Isomorphismus überprüft werden kann.
    Notes: Abstract A new algorithm for testing isomorphism on directed and undirected graphs is described. It consists of an 0 (n 5) algorithm for partitioning node and edge sets, plus a heuristic procedure for deriving all the isomorphisms. The partitioning is described by a “connectivity graph” on which a sufficient condition for isomerphism can be tested.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 69
    Electronic Resource
    Electronic Resource
    Springer
    Computing 13 (1974), S. 67-79 
    ISSN: 1436-5057
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Description / Table of Contents: Zusammenfassung Die vorliegende Arbeit behandelt die numerische Lösung von Integralgleichungen erster Art, nämlich ( y)x∈I:=[a, b], mitg∈C(I), g(a)=0, wobei ein (linearer) Integraloperator vom Volterraschen (oder Abelschen) Typ bezeichnet. Die gegebene Funktiong wird aufI (oder auf einer endlichen TeilmengeZ⊂I) unter Benutzung gewisser schwacher (weak) Tschebyscheff-Systeme gleichmäßig angenähert. Wegen der Linearität von besitzt man daher sofort eine Näherungsfunktion für die gesuchte Lösungy. Die Existenz und Charakterisierung wie auch die numerische Bestimmung solcher Näherungsfunktionen wird untersucht.
    Notes: Abstract The present paper deals with the approximate solution of integral equations of the first kind, ( y)x∈I:=[a, b], where denotes a (linear) integral operator of Volterra (or Abel) type, and whereg∈C(I), withg(a)=0. The given functiong is approximated uniformly onI (or on a finite subsetZ⊂I by using certain weak Chebyshev systems onI which are obtained in a natural way. By the linearity of this yields an approximation to the exact solutiony onI. Questions of uniqueness and characterization of such approximating functions, as well as numerical aspects of the approximation problem are discussed.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 70
    Electronic Resource
    Electronic Resource
    Springer
    Computing 13 (1974), S. 107-113 
    ISSN: 1436-5057
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Description / Table of Contents: Abstract Graph algorithms for shortest paths form a class of very efficient algorithms which are of versatile applicability (i.e. see [1], [2], [3], [4]). This class corresponds with a rather general class of problems which are solvable by these algorithms (see [4], [5]). It is shown that the general covering problem does not belong to this problem class.
    Notes: Zusammenfassung Graphenalgorithmen zur Bestimmung kürzester Wege bilden eine Klasse sehr effizienter und vielseitig anwendbarer Algorithmen (vgl. z. B. [1], [2], [3], [4]). Man kann dieser Algorithmenklasse eine recht allgemeine Klasse von Problemen gegenüberstellen, die sich mit diesen Algorithmen lösen lassen (vgl. [4], [5]). Hier sollen im folgenden Überdeckungsprobleme darauf untersucht werden, inwieweit sie mit den genannten Graphenalgorithmen gelöst werden können. Es wird gezeigt, daß das allgemeine Überdeckungsproblem nicht zu der Problemklasse gehört, auf die diese Graphenalgorithmen anwendbar sind.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 71
    Electronic Resource
    Electronic Resource
    Springer
    Computing 13 (1974), S. 155-171 
    ISSN: 1436-5057
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Description / Table of Contents: Zusammenfassung Wir leiten zwei lineare untere Schranken für die Minimalzahl der 2-stelligen Booleschen Operationen her, die notwendig sind, um gewisse Boolesche Funktionen zu berechnen. Eine Schranke hängt von den Primimplikanten der Booleschen Funktion ab. Die andere hängt von der Menge der Unterfunktionen ab. Beide untere Schranken sind in gewissen Fällen exakt.
    Notes: Abstract We establish two linear lower bounds on the minimal number of 2-ary Boolean operations that are necessary to compute certain Boolean functions. The first bound depends on the structure of primimplicants of the Boolean function. The second bound depends on the structure of the set of subfunctions. Both lower bounds yield the exact cost of an optimal computation in certain cases.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 72
    Electronic Resource
    Electronic Resource
    Springer
    Computing 13 (1974), S. 121-141 
    ISSN: 1436-5057
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Description / Table of Contents: Abstract In this paper quadrature procedures with partially preassigned nodes are described. They are constructed by integration of a general, linear, hermitian, interpolating operator. Those nodes, which are not preassigned, and for the first free are fixed by the requirement, that all weights of first derivatives in these free nodes vanish in the resulting quadrature formulas. In order to get positive weights for the function-values additional conditions must be settled up. For one (ore two) preassigned node(s) the given sufficient positivity-conditions say, that the preassigned nodes are not situated in the interior of the interval of integration, e. g. for strongly monotone basic-functions which are needed in the construction of the interpolating operator. As special cases the quadratures of Radau and Lobatto are involved. Further quadratures having nodes outside the interval of integration and beeing very siutable for connected formulas for large intervals are contained, partially with unusual interpolating conditions. At last it is shown, how to obtain numerically the free nodes of quadratureswith preassigned nodes from thosewithout preassigned nodes (and vice versa) by making use of inbedding-methods.
    Notes: Zusammenfassung In der vorliegenden Arbeit werden Quadraturverfahren mit teilweise vorgeschriebenen Stützstellen beschrieben, die durch Integration eines allgemeinen, linearen, Hermiteschen Interpolationsoperators entstehen. Die nicht fest vorgeschriebenen, zunächst freien Stützstellen werden durch die Forderung festgelegt, daß im resultierenden Quadraturverfahren die zugehörigen Gewichte der Ableitungen sämtlich den Wert Null erhalten. Damit die Gewichte der Funktionenwerte positiv ausfallen, müssen zusätzliche Bedingungen gestellt werden. Wenn eine bzw. zwei Stützstelle(n) fest vorgeschrieben sind, besagen die hier angegebenen hinreichenden Positivitätsbedingungen, daß für streng monotone Basisfunktionen, die zur Konstruktion des Interpolationsoperators benötigt werden, die vorgeschriebenen Stützstellen nicht im Innern des Integrationsintervalles liegen dürfen. Als Spezialfälle sind die Quadraturverfahren von Radau und Lobatto enthalten. Auch andere Quadraturverfahren, die Stützstellen außerhalb des Integrationsintervalles haben, und die sich zum Aneinanderhängen bei großem Integrationsintervall besonders gut eignen, sind enthalten, z. T. unter ungewöhnlichen Interpolationsbedingungen. Schließlich wird dargelegt, wie man mit Hilfe von Einbettungsverfahren aus den Stützstellen von Quadraturenohne vorgeschriebenen Stützstellen die Stützstellen gleichartiger Quadraturenmit vorgeschriebenen Stützstellen berechnen kann.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 73
    Electronic Resource
    Electronic Resource
    Springer
    Computing 13 (1974), S. 195-203 
    ISSN: 1436-5057
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Description / Table of Contents: Zusammenfassung Zwei verschiedene Methoden, um Tricomis Confluente Hypergeometrische Funktion ψ (a, σ; λ) zu berechnen werden angegeben. Die beiden Methoden gründen sich auf den Gebrauch rekurrenter Relationen. Die erste methode konvergiert wie $$\exp ( - \alpha |\lambda |^{1/3} n^{2/3} )for some \alpha 〉 0$$ und die zweite wie $$\exp ( - \beta |\lambda |^{1/2} n^{1/2} )for some \beta 〉 0.$$ In dieser Arbeit werden Beispiele hierfür vorgestellt.
    Notes: Abstract Two methods for calculating Tricomi's confluent hypergeometric function are discussed. Both methods are based on recurrence relations. The first method converges like $$\exp ( - \alpha |\lambda |^{1/3} n^{2/3} )for some \alpha 〉 0$$ and the second like $$\exp ( - \beta |\lambda |^{1/2} n^{1/2} )for some \beta 〉 0.$$ Several examples are presented.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 74
    Electronic Resource
    Electronic Resource
    Springer
    Computing 13 (1974), S. 249-252 
    ISSN: 1436-5057
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Description / Table of Contents: Abstract An algorithm (M) for the determination of minimal paths and spanning trees in graphs with weighted edges is described. (M) produces a connection between some known constructions.
    Notes: Zusammenfassung Es wird ein Algorithmus (M) zur Bestimmung minimaler Wege und Gerüste in Graphen mit gewichteten Kanten angegeben. (M) stellt einen Zusammenhang zwischen einigen bekannten Konstruktionen her.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 75
    ISSN: 1436-5057
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Description / Table of Contents: Abstract This paper is an approach in using multistep-methods for integrating “stiff”-systems of ordinary differential equations. New classes of explicit, implicit and PECE-algorithms are developed. The PECE-algorithms are characterized by an absolute stability domain, which, concerning values of some parameters, can decay into two parts, one of which can be placed free along the negative real axis in the complex plane. Beside this, some timeconstant will be integrated exactly. Technical problems show the application of the algorithms.
    Notes: Zusammenfassung Es wird versucht, das Problem der Integration von „stiff”-Systemen von gewöhnlichen Differentialgleichungen durch Anwendung von Mehrschrittverfahren zu lösen. Die Klassen neuer Verfahren sind explizite, implizite und PECE-Algorithmen. Die PECE-Algorithmen besitzen ein absolutes Stabilitätsgebiet, welches, abhängig von Parameterwerten, in zwei Gebiete zerfällt, von denen eines beliebig längs der negativen reellen Achse verschiebbar ist. Zudem können bestimmte Systemzeitkonstante exakt integriert werden. Technische Probleme zeigen die Anwendung dieser Verfahren.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 76
    Electronic Resource
    Electronic Resource
    Springer
    Computing 13 (1974), S. 313-325 
    ISSN: 1436-5057
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Description / Table of Contents: Abstract Necessary and sufficient criteria are given when the product of two interval polynomials is again an interval polynomial.
    Notes: Zusammenfassung Notwendige und hinreichende Kriterien werden angegeben, wann das Produkt zweier Intervallpolynome wieder ein Intervallpolynom ist.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 77
    Electronic Resource
    Electronic Resource
    Springer
    Computing 13 (1974), S. 327-352 
    ISSN: 1436-5057
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Description / Table of Contents: Abstract A general theoretical basis for the design of exponentially fitted numerical integration methods will be derived for obtaining methods which, from accuracy and stability, allow large discretization intervals even for systems with large eigenvalues. The technique of transforming existing numerical methods to an exponentially fitted version will be exemplified and the influence of exponential fitting on discretization error and stability for one-step methods will be discussed.
    Notes: Zusammenfassung Es wird eine allgemeine theoretische Basis für die Konstruktion exponentiell angepaßter numerischer Integrationsverfahren für Systeme von Differentialgleichungen erster Ordnung hergeleitet, welche aufgrund ihrer Genauigkeit und Stabilität große Diskretisierungsintervalle auch dann erlauben, wenn das System Eigenwerte mit großen Beträgen hat. Die Technik der Überführung bekannter numerischer Methoden in eine exponentiell angepaßte Version wird erläutert und der Einfluß der Exponentialanpassung auf den Diskretisierungsfehler und die Stabilität bei Einschrittverfahren diskutiert.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 78
    Electronic Resource
    Electronic Resource
    Springer
    Mathematical programming 7 (1974), S. 240-244 
    ISSN: 1436-4646
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 79
    Electronic Resource
    Electronic Resource
    Springer
    Computers and the humanities 8 (1974), S. 56-63 
    ISSN: 1572-8412
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Media Resources and Communication Sciences, Journalism
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 80
    Electronic Resource
    Electronic Resource
    Springer
    Computers and the humanities 8 (1974), S. 130-130 
    ISSN: 1572-8412
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Media Resources and Communication Sciences, Journalism
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 81
    Electronic Resource
    Electronic Resource
    Springer
    Computers and the humanities 8 (1974), S. 161-172 
    ISSN: 1572-8412
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Media Resources and Communication Sciences, Journalism
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 82
    Electronic Resource
    Electronic Resource
    Springer
    Computers and the humanities 8 (1974), S. 173-177 
    ISSN: 1572-8412
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Media Resources and Communication Sciences, Journalism
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 83
    Electronic Resource
    Electronic Resource
    Springer
    Computers and the humanities 8 (1974), S. 194-194 
    ISSN: 1572-8412
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Media Resources and Communication Sciences, Journalism
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 84
    Electronic Resource
    Electronic Resource
    Springer
    Computers and the humanities 8 (1974), S. 195-206 
    ISSN: 1572-8412
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Media Resources and Communication Sciences, Journalism
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 85
    Electronic Resource
    Electronic Resource
    Springer
    Computers and the humanities 8 (1974), S. 312-312 
    ISSN: 1572-8412
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Media Resources and Communication Sciences, Journalism
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 86
    Electronic Resource
    Electronic Resource
    Springer
    Computers and the humanities 8 (1974), S. 297-300 
    ISSN: 1572-8412
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Media Resources and Communication Sciences, Journalism
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 87
    Electronic Resource
    Electronic Resource
    Springer
    Computers and the humanities 8 (1974), S. 2-2 
    ISSN: 1572-8412
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Media Resources and Communication Sciences, Journalism
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 88
    Electronic Resource
    Electronic Resource
    Springer
    Computers and the humanities 8 (1974), S. 2-2 
    ISSN: 1572-8412
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Media Resources and Communication Sciences, Journalism
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 89
    Electronic Resource
    Electronic Resource
    Springer
    Computers and the humanities 8 (1974), S. 5-20 
    ISSN: 1572-8412
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Media Resources and Communication Sciences, Journalism
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 90
    Electronic Resource
    Electronic Resource
    Springer
    Computers and the humanities 8 (1974), S. 27-39 
    ISSN: 1572-8412
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Media Resources and Communication Sciences, Journalism
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 91
    Electronic Resource
    Electronic Resource
    Springer
    Computers and the humanities 8 (1974), S. 130-130 
    ISSN: 1572-8412
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Media Resources and Communication Sciences, Journalism
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 92
    Electronic Resource
    Electronic Resource
    Springer
    Computers and the humanities 8 (1974), S. 153-159 
    ISSN: 1572-8412
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Media Resources and Communication Sciences, Journalism
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 93
    Electronic Resource
    Electronic Resource
    Springer
    Computers and the humanities 8 (1974), S. 172-172 
    ISSN: 1572-8412
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Media Resources and Communication Sciences, Journalism
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 94
    Electronic Resource
    Electronic Resource
    Springer
    Computers and the humanities 8 (1974), S. 191-192 
    ISSN: 1572-8412
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Media Resources and Communication Sciences, Journalism
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 95
    Electronic Resource
    Electronic Resource
    Springer
    Computers and the humanities 8 (1974), S. 183-190 
    ISSN: 1572-8412
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Media Resources and Communication Sciences, Journalism
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 96
    Electronic Resource
    Electronic Resource
    Springer
    Computers and the humanities 8 (1974), S. 194-194 
    ISSN: 1572-8412
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Media Resources and Communication Sciences, Journalism
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 97
    Electronic Resource
    Electronic Resource
    Springer
    Computers and the humanities 8 (1974), S. 239-245 
    ISSN: 1572-8412
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Media Resources and Communication Sciences, Journalism
    Notes: Conclusion Our principle intention has been to show how a general-purpose pattern-matching procedure can serve as the basis for a simple automated system for the grammatical analysis of sentences produced by students. From a pedagogical point of view, the design of instructional modules in terms of simple phrase-structure grammars appears to be feasible and general, at least for elementary topics in grammar and usage. A virtue of the system is that it requires the student to perform a task which is very much like that for which he is being trained, i.e., the creation of grammatical and at least minimally effective sentences. It also provides rapid feedback. An efficient large-scale system for processing student interaction with modules which are restricted to fairly simple grammars would be adequate for a considerable body of instructional material.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 98
    Electronic Resource
    Electronic Resource
    Springer
    Computers and the humanities 8 (1974), S. 270-270 
    ISSN: 1572-8412
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Media Resources and Communication Sciences, Journalism
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 99
    Electronic Resource
    Electronic Resource
    Springer
    Computers and the humanities 8 (1974), S. 258-267 
    ISSN: 1572-8412
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Media Resources and Communication Sciences, Journalism
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 100
    Electronic Resource
    Electronic Resource
    Springer
    Computers and the humanities 8 (1974), S. 278-278 
    ISSN: 1572-8412
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Media Resources and Communication Sciences, Journalism
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
Close ⊗
This website uses cookies and the analysis tool Matomo. More information can be found here...