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  (8,954)
  • Springer  (8,954)
  • American Chemical Society
  • American Physical Society
  • Annual Reviews
  • 2010-2014  (2,234)
  • 2005-2009  (4,997)
  • 1985-1989
  • 1980-1984  (1,155)
  • 1970-1974  (568)
  • 1930-1934
  • 2011  (2,234)
  • 2009  (1,785)
  • 2008  (1,669)
  • 2006  (1,543)
  • 1984  (524)
  • 1980  (631)
  • 1973  (568)
  • 1934
  • Computer Science  (8,954)
Collection
  • Articles  (8,954)
Years
  • 2010-2014  (2,234)
  • 2005-2009  (4,997)
  • 1985-1989
  • 1980-1984  (1,155)
  • 1970-1974  (568)
  • +
Year
Journal
  • 1
    Electronic Resource
    Electronic Resource
    Springer
    Mathematical programming 19 (1980), S. 300-312 
    ISSN: 1436-4646
    Keywords: Equilibrium Prices ; Nonconvex Mathematical Programming ; Shadow Prices
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Notes: Abstract In this paper a definition is proposed for the concept of shadow prices in nonconvex programming. For a nonlinear program with equality and inequality constraints, existence of these prices and bounds for their possible values are obtained under the Mangasarian—Fromowitz regularity condition. Their exact values and some continuity properties are obtained under the more restrictive linear independence regularity condition. A definition of equilibrium prices is also proposed. Under convexity assumptions, all definitions and results coincide with those already known on this subject in convex programming.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 2
    Electronic Resource
    Electronic Resource
    Springer
    Mathematical programming 19 (1980), S. 313-327 
    ISSN: 1436-4646
    Keywords: Retrogressing Paths ; Homotopy Method ; Fixed-point Algorithm
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Notes: Abstract For certain functionsf fromR n toR n , the Eaves—Saigal algorithm computes a path inR n × (0, 1] which converges to a zero off. In this case, it is shown that even whenf is of classC ∞ and has a unique zero, the converging path may retrogress infinitely many times.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 3
    Electronic Resource
    Electronic Resource
    Springer
    Mathematical programming 18 (1980), S. 186-196 
    ISSN: 1436-4646
    Keywords: Weber's Problem ; Weiszfeld's Method ; Optimal Location
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Notes: Abstract For solving the Euclidean distance Weber problem Weiszfeld proposed an iterative method. This method can also be applied to generalized Weber problems in Banach spaces. Examples for generalized Weber problems are: minimal surfaces with obstacles, Fermat's principle in geometrical optics and brachistochrones with obstacles.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 4
    Electronic Resource
    Electronic Resource
    Springer
    Mathematical programming 18 (1980), S. 84-88 
    ISSN: 1436-4646
    Keywords: Complementary Pivot Algorithms ; Triangulations ; Vector Labels ; Borsuk's Theorem on Antipodal Points
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Notes: Abstract In this short note a simple and constructive proof is given for Borsuk's theorem on antipodal points. This is done through a special application of the complementary pivoting algorithm.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 5
    Electronic Resource
    Electronic Resource
    Springer
    Mathematical programming 18 (1980), S. 110-110 
    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 ...
  • 6
    Electronic Resource
    Electronic Resource
    Springer
    Mathematical programming 18 (1980), S. 155-168 
    ISSN: 1436-4646
    Keywords: Constrained Optimization ; Differential Equation ; Global Solution ; Nonlinear Programming
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Notes: Abstract A new method is presented for finding a local optimum of the equality constrained nonlinear programming problem. A nonlinear autonomous system is introduced as the base of the theory instead of usual approaches. The relation between critical points and local optima of the original optimization problem is proved. Asymptotic stability of the critical points is also proved. A numerical algorithm which is capable of finding local optima systematically at the quadratic rate of convergence is developed from a detailed analysis of the nature of trajectories and critical points. Some numerical results are given to show the efficiency of the method.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 7
    Electronic Resource
    Electronic Resource
    Springer
    Mathematical programming 18 (1980), S. 215-227 
    ISSN: 1436-4646
    Keywords: Frank—Wolfe Theorem ; Quadratic Programming ; Norm Coercive Functions ; Polyhedral Sets
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Notes: Abstract The Frank—Wolfe theorem states that a quadratic function, bounded below on a nonempty polyhedral convex set, attains its infimum there. This paper gives sufficient conditions under which a function either attains its infimum on a nonempty polyhedral convex set or is unbounded below on some halfline of that set. Quadratic functions are shown to satisfy these sufficient conditions.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 8
    Electronic Resource
    Electronic Resource
    Springer
    Mathematical programming 18 (1980), S. 248-273 
    ISSN: 1436-4646
    Keywords: Legendre Transform ; Stationary Points ; Convex Functions ; Duality
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Notes: Abstract In this work non-convex programs are analyzed via Legendre transform. The first part includes definitions and the classification of programs that can be handled by the transformation. It is shown that differentiable functions that are represented as a sum of strictly concave and convex functions belong to this class. Conditions under which a function may have such representation are given. Pseudo duality is defined and the pseudo duality theorem for non linear programs with equality constraints is proved. The techniques described are constructive ones, and they enable tocalculate explicitly a pseudo dual once the primal program is given. Several examples are included. In the convex case these techniques enable the explicit calculation of the dual even in cases where direct calculation was not possible.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 9
    Electronic Resource
    Electronic Resource
    Springer
    Mathematical programming 18 (1980), S. 286-290 
    ISSN: 1436-4646
    Keywords: Facility Location ; Steiner's Problem ; Location on the Sphere
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Notes: Abstract This note describes the nature of optimal solutions for the spherical Steiner-Weber location problem for the case of unit weights and either 3 or 4 demand points (requireing 4 demand points to lie in an open hemisphere). Geometrically appealing results which are necessary conditions for optimum solutions and spherical analogs of known planar results are obtained.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 10
    Electronic Resource
    Electronic Resource
    Springer
    Mathematical programming 18 (1980), S. 62-67 
    ISSN: 1436-4646
    Keywords: Economic Interpretation ; Mathematical Programming ; Duality ; Stochastic Programming
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Notes: Abstract The purpose of this note is to interpret a class of stochastic programming problems in economic terms. The primal stochastic program is shown to represent a certain production program of an entrepreneur. The dual program, which is also a stochastic program, represents the problem of a contractor who desires to purchase the entrepreneur's resources and sell product back to him.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 11
    Electronic Resource
    Electronic Resource
    Springer
    Mathematical programming 4 (1973), S. 118-119 
    ISSN: 1436-4646
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 12
    Electronic Resource
    Electronic Resource
    Springer
    Mathematical programming 4 (1973), S. 144-154 
    ISSN: 1436-4646
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Notes: Abstract This article deals mainly with a comparison of certain computational techniques used for the solution of non-linear constrained mathematical programming problems.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 13
    Electronic Resource
    Electronic Resource
    Springer
    Mathematical programming 4 (1973), S. 1-20 
    ISSN: 1436-4646
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Notes: Abstract This paper shows that the linear programming formulation of the two-commodity network flow problem leads to a direct derivation of the known results concerning this problem. An algorithm for solving the problem is given which essentially consists of two applications of the Ford—Fulkerson max flow computation. Moreover, the algorithm provides constructive proofs for the results. Some new facts concerning feasible integer flows are also given.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 14
    Electronic Resource
    Electronic Resource
    Springer
    Mathematical programming 18 (1980), S. 138-145 
    ISSN: 1436-4646
    Keywords: Set-covering Problem ; Branch and Bound ; Lower Bounds ; Steiner Triple Systems
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Notes: Abstract Fulkerson et al. have given two examples of set covering problems that are empirically difficult to solve. They arise from Steiner triple systems and the larger problem, which has a constraint matrix of size 330 × 45 has only recently been solved. In this note, we show that the Steiner triple systems do indeed give rise to a series of problems that are probably hard to solve by implicit enumeration. The main result is that for ann variable problem, branch and bound algorithms using a linear programming relaxation, and/or elimination by dominance require the examination of a super-polynomial number of partial solutions
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 15
    Electronic Resource
    Electronic Resource
    Springer
    Mathematical programming 18 (1980), S. 228-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 ...
  • 16
    Electronic Resource
    Electronic Resource
    Springer
    Mathematical programming 18 (1980), S. 232-232 
    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 18 (1980), S. 308-329 
    ISSN: 1436-4646
    Keywords: Polytopes ; Linear Programming
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Notes: Abstract This paper provides answers to several questions raised by V. Klee regarding the efficacy of Mattheiss' algorithm for finding all vertices of convex polytopes. Several results relating to the expected properties of polytopes are given which indicate thatn-polytopes defined by “large” numbers of constraints are difficult to obtain by random processes, the expected value of the number of vertices of polytope is considerably less than Klee's least upper bound the expected performance of Mattheiss' algorithm is far better than Klee's upper bound would suggest.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 18
    Electronic Resource
    Electronic Resource
    Springer
    Mathematical programming 5 (1973), S. 88-124 
    ISSN: 1436-4646
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Notes: Abstract The solution of the Chinese postman problem using matching theory is given. The convex hull of integer solutions is described as a linear programming polyhedron. This polyhedron is used to show that a good algorithm gives an optimum solution. The algorithm is a specialization of the more generalb-matching blossom algorithm. Algorithms for finding Euler tours and related problems are also discussed.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 19
    Electronic Resource
    Electronic Resource
    Springer
    Mathematical programming 5 (1973), S. 127-127 
    ISSN: 1436-4646
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 20
    Electronic Resource
    Electronic Resource
    Springer
    Mathematical programming 5 (1973), S. 381-384 
    ISSN: 1436-4646
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 21
    Electronic Resource
    Electronic Resource
    Springer
    Mathematical programming 5 (1973), S. 386-386 
    ISSN: 1436-4646
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 22
    Electronic Resource
    Electronic Resource
    Springer
    Mathematical programming 5 (1973), S. 387-387 
    ISSN: 1436-4646
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 23
    Electronic Resource
    Electronic Resource
    Springer
    Mathematical programming 5 (1973), S. 388-388 
    ISSN: 1436-4646
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 24
    Electronic Resource
    Electronic Resource
    Springer
    Mathematical programming 5 (1973), S. 385-385 
    ISSN: 1436-4646
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 25
    Electronic Resource
    Electronic Resource
    Springer
    Mathematical programming 5 (1973), S. 1-28 
    ISSN: 1436-4646
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Notes: Abstract Pivot column and row selection methods used by the Devex code since 1965 are published here for the first time. After a fresh look at the iteration process, the author introduces dynamic column weighting factors as a means of estimating gradients for the purpose of selecting a maximum gradient column. The consequent effect of this column selection on rounding error is observed. By allowing that a constraint may not be positioned so exactly as its precise representation in the computer would imply, a wider choice of pivot row is made available, so making room for a further selection criterion based on pivot size. Three examples are given of problems having between 2500 and 5000 rows, illustrating the overall time and iteration advantages over the standard simplex methods used today. The final illustration highlights why these standard methods take so many iterations. These algorithms were originally coded for the Atlas computer and were re-coded in 1969 for the Univac 1108.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 26
    Electronic Resource
    Electronic Resource
    Springer
    Mathematical programming 5 (1973), S. 41-53 
    ISSN: 1436-4646
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Notes: Abstract This paper studies how the solution of the problem of minimizingQ(x) = 1/2x T Kx − k T x subject toGx ≦ g andDx = d behaves whenK, k, G, g, D andd are perturbed, say by terms of size∈, assuming thatK is positive definite. It is shown that in general the solution moves by roughly∈ ifG, g, D andd are not perturbed; whenG, g, D andd are in fact perturbed, much stronger hypotheses allow one to show that the solution moves by roughly∈. Many of these results can be extended to more general, nonquadratic, functionals.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 27
    Electronic Resource
    Electronic Resource
    Springer
    Mathematical programming 5 (1973), S. 29-40 
    ISSN: 1436-4646
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Notes: Abstract Jack Edmonds developed a new way of looking at extremal combinatorial problems and applied his technique with a great success to the problems of the maximal-weight degreeconstrained subgraphs. Professor C. St. J.A. Nash-Williams suggested to use Edmonds' approach in the context of hamiltonian graphs. In the present paper, we determine a new set of inequalities (the “comb inequalities”) which are satisfied by the characteristic functions of hamiltonian circuits but are not explicit in the straightforward integer programming formulation. A direct application of the linear programming duality theorem then leads to a new necessary condition for the existence of hamiltonian circuits; this condition appears to be stronger than the ones previously known. Relating linear programming to hamiltonian circuits, the present paper can also be seen as a continuation of the work of Dantzig, Fulkerson and Johnson on the traveling salesman problem.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 28
    Electronic Resource
    Electronic Resource
    Springer
    Mathematical programming 5 (1973), S. 73-87 
    ISSN: 1436-4646
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Notes: Abstract The problem considered here is that of fitting a linear function to a set of points. The criterion normally used for this is least squares. We consider two alternatives, viz., least sum of absolute deviations (called the L1 criterion) and the least maximum absolute deviation (called the Chebyshev criterion). Each of these criteria give rise to a linear program. We develop some theoretical properties of the solutions and in the light of these, examine the suitability of these criteria for linear estimation. Some of the estimates obtained by using them are shown to be counter-intuitive.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 29
    Electronic Resource
    Electronic Resource
    Springer
    Mathematical programming 5 (1973), S. 54-72 
    ISSN: 1436-4646
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Notes: Abstract For linear multiple-objective problems, a necessary and sufficient condition for a point to be efficient is employed in the development of a revised simplex algorithm for the enumeration of the set of efficient extreme points. Five options within this algorithm were tested on a variety of problems. Results of these tests provide indications for effective use of the algorithm.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 30
    Electronic Resource
    Electronic Resource
    Springer
    Computing 11 (1973), S. 175-177 
    ISSN: 1436-5057
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Description / Table of Contents: Zusammenfassung Eine Menge vonn geordneten reellen Zahlen wird mittels vollständiger Enumeration ink Teilmengen (Cluster) derart zerlegt, daß die Summe der Summe der Abweichungsquadrate vom Mittelwert innerhalb jeder Teilmenge minimiert wird.
    Notes: Abstract A set ofn ordered real numbers is partitioned by complete enumeration intok clusters such that the sum of the sum of squared deviations from the mean-value within each cluster is minimized.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 31
    Electronic Resource
    Electronic Resource
    Springer
    Computing 11 (1973), S. 179-180 
    ISSN: 1436-5057
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 32
    Electronic Resource
    Electronic Resource
    Springer
    Computing 11 (1973), S. 213-220 
    ISSN: 1436-5057
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Description / Table of Contents: Abstract The situation of the hardwaretechnic enables also computers of average-performance to install the multiprogramming operational-mode. The structure and the strategy of a supplementary program for the semi-automatical multiprogramming operation will be stated. By these means the computers may be used more economically with only small additional display of software.
    Notes: Zusammenfassung Der Stand der Hardwaretechnik erlaubt durchaus auch für DV-Anlagen mittlerer Leistung die Einführung des Multiprogramming-Betriebsmodus. Es wird die Struktur und die Strategie eines Zusatzprogrammes zum halbautomatischen Multiprogrammingbetrieb angegeben. Dadurch können DV-Anlagen bei geringem zusätzlichem Softwareaufwand rationeller als bisher genutzt werden.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 33
    Electronic Resource
    Electronic Resource
    Springer
    Computing 11 (1973), S. 249-254 
    ISSN: 1436-5057
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Description / Table of Contents: Abstract The paper describes a surprisingly occuring rounding error in Gomory's all-integer algorithm for the solution of linear integer programming problems. A modification for the numerical stabilization of the algorithm is quoted.
    Notes: Zusammenfassung Die Arbeit beschreibt einen überraschenderweise bei Gomorys ganzzahligem Algorithmus zur Lösung rein-ganzzahliger linearer Optimierungsprobleme auftretenden Rundungsfehler. Eine Modifikation zur numerischen Stabilisierung des Verfahrens wird angegeben.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 34
    Electronic Resource
    Electronic Resource
    Springer
    Computing 11 (1973), S. 305-306 
    ISSN: 1436-5057
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 35
    Electronic Resource
    Electronic Resource
    Springer
    Computing 11 (1973), S. 315-325 
    ISSN: 1436-5057
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Description / Table of Contents: Zusammenfassung Zuerst wird ein explizites Differenzenverfahren beschrieben, das die eindimensionale Wärmeleitungs-gleichung approximiert und bei willkürlicher Wahl des Differenzengitters stabil ist. Dann folgt die Beschreibung eines Glättungsverfahrens, das die praktische Anwendung dieser Methode ermöglicht.
    Notes: Abstract An explicit difference approximation of the one-dimensional diffusion equation equation, which is stable for any choice of the difference gird and has a comparatively small truncation error, is described. A smoothing formula, which makes the practical use of this method possible, is given.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 36
    Electronic Resource
    Electronic Resource
    Springer
    Computing 11 (1973), S. 353-363 
    ISSN: 1436-5057
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Description / Table of Contents: Abstract Choosing an internal floating-point representation for a binary computer with given word-length is influenced by two factors: the size of the range of admissible numbers and the precision of the respective floating-point arithmetic. In this paper “precision” is defined by a statistical model of rounding errors. According to this definition base 4 floating-point arithmetic on an average produces smaller rounding errors than all other floating-point arithmetics with a base 2k, provided that the ranges of numbers have equal size.
    Notes: Zusammenfassung Bei der Auswahl einer internen Gleitkomma-Darstellung für einen binären Computer mit gegebener Wortlänge sind zwei Gesichtspunkte maßgebend: erstens die Größe des zulässigen Zahlbereichs und zweitens die Genauigkeit der zugehörigen Gleitkomma-Arithmetik. In dieser Arbeit wird der Begriff Genauigkeit über ein statistisches Rundungsfehlermodell definiert. Dann wird gezeigt, daß bei binären Computern Gleitkomma-Arithmetik zur Basis 4 durchschnittlich kleinere Rundungsfehler liefert als alle anderen Gleitkomma-Arithmetiken zu einer Basis 2k bei gleicher Größe des zulässigen Zahlbereichs.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 37
    ISSN: 1436-5057
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Description / Table of Contents: Abstract In this paper we consider finite difference operators which approximate the dirichlet problem of general nonlinear elliptic equations. For such nonlinear operators we give several criteria which insure the validity of an discrete monotonicity and maximum principle. In the case of linear difference operators one of these criteria is known as a necessary and sufficient condition.
    Notes: Zusammenfassung In der vorliegenden Arbeit werden Differenzenoperatoren als Approximationen des Dirichletproblems allgemeiner nichtlinearer elliptischer Differentialgleichungen betrachtet. Für diese nichtlinearen Operatoren werden verschiedene Kriterien angegeben, welche die Gültigkeit eines diskreten Monotonie- und Randmaximumprinzips sichern. Eines dieser Kriterien ist bei linearen Differenzenoperatoren bekannt als notwendige und hinreichende Bedingung.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 38
    Electronic Resource
    Electronic Resource
    Springer
    Computing 24 (1980), S. 341-347 
    ISSN: 1436-5057
    Keywords: Numerical analysis ; Volterra integral equations of the second kind ; stability
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Description / Table of Contents: Zusammenfassung Ziel dieser Arbeit ist es, die Stabilitätseigenschaften einer Klasse Volterrascher Integralgleichungen zweiter Art zu untersuchen. Unsere Behandlung ist der üblichen Stabilitätsanalyse ähnlich, in der die Kernfunktionen zu einer im voraus beschränkten Klasse von Testfunktionen gehören. Wir haben die Klasse der “endlich zerlegbaren” Kerne betrachtet. Stabilitätsbedingungen werden abgeleitet und verglichen mit den Bedingungen für die einfache Testgleichung. Es zeigt sich, daß die neuen Kriteria einschränkender sind als die konventionellen Bedingungen. Der praktische Wert wird getestet durch numerische Experimente mit der Trapezregel.
    Notes: Abstract The purpose of this paper is to analyse the stability properties of a class of multistep methods for second kind Volterra integral equations. Our approach follows the usual analysis in which the kernel function is a priori restricted to a special class of test functions. We consider the class of finitely decomposable kernels. Stability conditions will be derived and compared with those obtained with the simple test equation. It turns out that the new criteria are more severe than the conventional conditions. The practical value is tested by numerical experiments with the trapezoidal rule.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 39
    Electronic Resource
    Electronic Resource
    Springer
    Mathematical programming 18 (1980), S. 274-285 
    ISSN: 1436-4646
    Keywords: Triangulation ; Average Directional Density ; Fixed Point ; Equilateral Triangles
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Notes: Abstract We consider measures for triangulations ofR n. A new measure is introduced based on the ratio of the length of the sides and the content of the subsimplices of the triangulation. In a subclass of triangulations, which is appropriate for computing fixed points using simplicial subdivisions, the optimal one according to this measure is calculated and some of its properties are given. It is proved that for the average directional density this triangulation is optimal (within the subclass) asn goes to infinity. Furthermore, we compare the measures of the optimal triangulation with those of other triangulations. We also propose a new triangulation of the affine hull of the unit simplex. Finally, we report some computational experience that confirms the theoretical results.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 40
    Electronic Resource
    Electronic Resource
    Springer
    Mathematical programming 18 (1980), S. 330-337 
    ISSN: 1436-4646
    Keywords: Limiting Lagrangean ; Duality Gaps ; Perfect Duality ; Convex Conjugates ; Convex Duality ; Semi-infinite Programs ; Closure
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Notes: Abstract In this note we derive and extend the substance of recent results on Perfect Duality and Limiting Lagrangeans by using standard convex analysis and convex duality theory.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 41
    Electronic Resource
    Electronic Resource
    Springer
    Mathematical programming 18 (1980), S. 344-348 
    ISSN: 1436-4646
    Keywords: Unimodularity ; Determinants ; Integral matrices ; Generalized Inverses
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Notes: Abstract The paper applies Jacobi's fundamental result on minors of the adjoint matrix to obtain properties on determinants of unimodular matrices.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 42
    Electronic Resource
    Electronic Resource
    Springer
    Mathematical programming 18 (1980), S. 356-356 
    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 18 (1980), S. 357-357 
    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 ...
  • 44
    Electronic Resource
    Electronic Resource
    Springer
    Mathematical programming 18 (1980), S. 1-6 
    ISSN: 1436-4646
    Keywords: Discrete Dynamic Programming ; Optimal Markov Chains ; Linear Programming
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Notes: Abstract It is shown how a discrete Markov programming problem can be transformed, using a linear program, into an equivalent problem from which the optimal decision rule can be trivially deduced. This transformation is applied to problems which have either transient probabilities or discounted costs.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 45
    Electronic Resource
    Electronic Resource
    Springer
    Mathematical programming 18 (1980), S. 41-48 
    ISSN: 1436-4646
    Keywords: Aggregation ; Linear Complementarity Problems ; Constrained Consistency ; Disaggregation
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Notes: Abstract Aggregating linear complementarity problems under a general definition of constrained consistency leads to the possibility of consistent aggregation of linear and quadratic programming models and bimatrix games. Under this formulation, consistent aggregation of dual variables is also achieved. Furthermore, the existence of multiple sets of aggregation operators is discussed and illustrated with a numerical example. Constrained consistency can also be interpreted as a disaggregation rule. This aspect of the problem may be important for implementing macro (economic) policies by means of micro (economic) agents.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 46
    Electronic Resource
    Electronic Resource
    Springer
    Mathematical programming 19 (1980), S. 200-212 
    ISSN: 1436-4646
    Keywords: Quadratic Programming ; Linear Complementarity Problem ; Uniqueness ; Nonlinear Complementarity Problem
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Notes: Abstract It is shown that McCormick's second order sufficient optimality conditions are also necessary for a solution to a quadratic program to be locally unique and hence these conditions completely characterize a locally unique solution of any quadratic program. This result is then used to give characterizations of a locally unique solution to the linear complementarity problem. Sufficient conditions are also given for local uniqueness of solutions of the nonlinear complementarity problem.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 47
    Electronic Resource
    Electronic Resource
    Springer
    Mathematical programming 18 (1980), S. 359-359 
    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 18 (1980), S. 362-362 
    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 ...
  • 49
    Electronic Resource
    Electronic Resource
    Springer
    Mathematical programming 18 (1980), S. 16-30 
    ISSN: 1436-4646
    Keywords: Quadratic Programming ; Decomposition Method ; Lemke's Method
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Notes: Abstract A decomposition algorithm using Lemke's method is proposed for the solution of quadratic programming problems having possibly unbounded feasible regions. The feasible region for each master program is a generalized simplex of minimal size. This property is maintained by a dropping procedure which does not affect the finiteness of the convergence. The details of the matrix transformations associated with an efficient implementation of the algorithm are given. Encouraging preliminary computational experience is presented.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 50
    Electronic Resource
    Electronic Resource
    Springer
    Mathematical programming 18 (1980), S. 31-40 
    ISSN: 1436-4646
    Keywords: Step-size Procedures ; Line Search ; Gradient Methods ; Unconstrained Minimization ; Negative Curvature
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Notes: Abstract The Armijo and Goldstein step-size rules are modified to allow steps along a curvilinear path of the formx(α) + x + αs + α2 d, wherex is the current estimate of the minimum,s is a descent direction andd is a nonascent direction of negative curvature. By using directions of negative curvature when they exist, we are able to prove, under fairly mild assumptions, that the sequences of iterates produced by these algorithms converge to stationary points at which the Hessian matrix of the objective function is positive semidefinite.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 51
    Electronic Resource
    Electronic Resource
    Springer
    Mathematical programming 19 (1980), S. 61-77 
    ISSN: 1436-4646
    Keywords: Optimization ; Nonlinear Programming ; Unconstrained Optimization ; Nondifferentiable Optimization ; Min—Max Problems
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Notes: Abstract In this paper, we suggest approximations for smoothing out the kinks caused by the presence of “max” or “min” operators in many non-smooth optimization problems. We concentrate on the continuous-discrete min—max optimization problem. The new approximations replace the original problem in some neighborhoods of the kink points. These neighborhoods can be made arbitrarily small, thus leaving the original objective function unchanged at almost every point ofR n . Furthermore, the maximal possible difference between the optimal values of the approximate problem and the original one, is determined a priori by fixing the value of a single parameter. The approximations introduced preserve properties such as convexity and continuous differentiability provided that each function composing the original problem has the same properties. This enables the use of efficient gradient techniques in the solution process. Some numerical examples are presented.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 52
    Electronic Resource
    Electronic Resource
    Springer
    Mathematical programming 19 (1980), S. 92-101 
    ISSN: 1436-4646
    Keywords: Chow—Yorke Algorithm ; Homotopy Algorithm ; Globally Convergent ; Fixed Point Computation ; Nonlinear Complementarity Problem ; Computational Results ; Convex Minimization Problems ; Nonlinear Equations
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Notes: Abstract The Chow—Yorke algorithm is a nonsimplicial homotopy type method for computing Brouwer fixed points that is globally convergent. It is efficient and accurate for fixed point problems. L.T. Watson, T.Y. Li, and C.Y. Wang have adapted the method for zero finding problems, the nonlinear complementarity problem, and nonlinear two-point boundary value problems. Here theoretical justification is given for applying the method to some mathematical programming problems, and computational results are presented.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 53
    Electronic Resource
    Electronic Resource
    Springer
    Mathematical programming 4 (1973), S. 243-243 
    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 ...
  • 54
    Electronic Resource
    Electronic Resource
    Springer
    Mathematical programming 4 (1973), S. 245-268 
    ISSN: 1436-4646
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Notes: Abstract Several algorithms are presented for solving the non-linear programming problem, based on “variable-metric” projections of the gradient of the objective function into a local approximation to the constraints. The algorithms differ in the nature of this approximation. Inequality constraints are dealt with by selecting at each step a subset of “active” constraints to treat as equalities, this subset being the smallest necessary to ensure that the new point remains feasible. Some numerical results are given for the Colville problems.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 55
    Electronic Resource
    Electronic Resource
    Springer
    Mathematical programming 4 (1973), S. 324-335 
    ISSN: 1436-4646
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Notes: Abstract Givenf: R + n → R n , the complementarity problem is to find a solution tox ≥ 0,f(x) ≥ 0, and 〈x, f(x)〉 = 0. Under the condition thatf is continuously differentiable, we prove that for a generic set of such anf, the problem has a discrete solution set. Also, under a set of generic nondegeneracy conditions and a condition that implies existence, we prove that the problem has an odd number of solutions.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 56
    Electronic Resource
    Electronic Resource
    Springer
    Mathematical programming 18 (1980), S. 68-83 
    ISSN: 1436-4646
    Keywords: Nonconvex Programming ; Surrogate Duality ; Economies of Scale ; Quasiconcave Costs
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Notes: Abstract We consider a class of problems of resource allocation under economies of scale, namely that of minimizing a lower semicontinuous, isotone, and explicitly quasiconcave cost function subject to linear constraints. An important class of algorithms for the linearly constrained minimization of nonconvex cost functions utilize the branch and bound approach, using convex underestimating cost functions to compute the lower bounds. We suggest instead the use of the surrogate dual problem to bound subproblems. We show that the success of the surrogate dual in fathoming subproblems in a branch and bound algorithm may be determined without directly solving the surrogate dual itself, but that a simple test of the feasibility of a certain linear system of inequalities will suffice. This test is interpreted geometrically and used to characterize the extreme points and extreme rays of the optimal value function's level sets.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 57
    Electronic Resource
    Electronic Resource
    Springer
    Mathematical programming 19 (1980), S. 356-356 
    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 ...
  • 58
    Electronic Resource
    Electronic Resource
    Springer
    Mathematical programming 5 (1973), S. 125-125 
    ISSN: 1436-4646
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 59
    Electronic Resource
    Electronic Resource
    Springer
    Mathematical programming 5 (1973), S. 151-168 
    ISSN: 1436-4646
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Notes: Abstract Eaves and Zangwill [2] have developed a very general theory of the convergence of cutting plane algorithms. This theory is applied to prove the convergence of Geoffrion's Generalized Benders Decomposition procedure (GBD) [5]. Using the insight provided by the general theory, GBD is then modified to permit the deletion of old constraints without upsetting the infinite convergence property. Finally, certain approximations of GBD are presented and the robustness of the convergence results is indicated.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 60
    Electronic Resource
    Electronic Resource
    Springer
    Mathematical programming 5 (1973), S. 253-254 
    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 5 (1973), S. 255-266 
    ISSN: 1436-4646
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Notes: Abstract For any integern, a modified transportation problem with 2n + 2 nodes is constructed which requires 2 n + 2 n−2−2 iterations using all but one of the most commonly used minimum cost flow algorithms. As a result, the Edmonds—Karp Scaling Method [3] becomes the only known “good” (in the sense of Edmonds) algorithm for computing minimum cost flows.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 62
    Electronic Resource
    Electronic Resource
    Springer
    Mathematical programming 5 (1973), S. 267-285 
    ISSN: 1436-4646
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Notes: Abstract In this study we introduce the notion of supporting functions and exploit some of their important properties. We make use of these functions to develop generalized optimality conditions of a mixed stationary-saddle type, where the supporting functions play either the role of the gradients/directional derivatives and/or the role of the original functions. These conditions may be applied to certain problems involving nondifferentiable and/or nonconvex functions. Classical, as well as new stationary and saddle optimality conditions follow from our approach in a natural fashion.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 63
    Electronic Resource
    Electronic Resource
    Springer
    Mathematical programming 5 (1973), S. 286-298 
    ISSN: 1436-4646
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Notes: Abstract An algorithm using column generation and penalty function techniques is presented. A linear program with a uniformly bounded number of columns, similar to the restricted master in generalized programming, is used to reduce the number of constraints included in forming a penalty function. The penalty function is used as a Lagrangian in an unconstrained subproblem.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 64
    Electronic Resource
    Electronic Resource
    Springer
    Mathematical programming 5 (1973), S. 311-337 
    ISSN: 1436-4646
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Notes: Abstract A principal pivoting algorithm is given for finding local minimizing points for general quadratic minimization problems. The method is a generalization of algorithms of Dantzig, and Van de Panne and Whinston for convex quadratic minimization problems.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 65
    Electronic Resource
    Electronic Resource
    Springer
    Mathematical programming 5 (1973), S. 338-353 
    ISSN: 1436-4646
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Notes: Abstract If is a collection of subsets ofS andw is a nonnegative weight function onS, the problem of selecting a subset belonging to which has maximum weight is solved by a ‘greedy-type’ algorithm forall w if and only if is the set of independent sets of a matroid. This result is then generalised to show that ‘greedy-type’ algorithms select an optimum forall linear functionsc·x; x in some compact set $$U \subseteq R^n $$ andc 〉 0 if and only if the convex closure ofU is essentially a polymatroid. A byproduct of this is a new characterization of polymatroids.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 66
    Electronic Resource
    Electronic Resource
    Springer
    Mathematical programming 5 (1973), S. 299-310 
    ISSN: 1436-4646
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Notes: Abstract The linear complementarity problem is the problem of finding solutionsw, z tow = q + Mz, w≥0,z≥0, andw T z=0, whereq is ann-dimensional constant column, andM is a given square matrix of dimensionn. In this paper, the author introduces a class of matrices such that for anyM in this class a solution to the above problem exists for all feasibleq, and such that Lemke's algorithm will yield a solution or demonstrate infeasibility. This class is a refinement of that introduced and characterized by Eaves. It is also shown that for someM in this class, there is an even number of solutions for all nondegenerateq, and that matrices for general quadratic programs and matrices for polymatrix games nicely relate to these matrices.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 67
    Electronic Resource
    Electronic Resource
    Springer
    Mathematical programming 5 (1973), S. 354-373 
    ISSN: 1436-4646
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Notes: Abstract Several recent algorithms for solving nonlinear programming problems with equality constraints have made use of an augmented “penalty” Lagrangian function, where terms involving squares of the constraint functions are added to the ordinary Lagrangian. In this paper, the corresponding penalty Lagrangian for problems with inequality constraints is described, and its relationship with the theory of duality is examined. In the convex case, the modified dual problem consists of maximizing a differentiable concave function (indirectly defined) subject to no constraints at all. It is shown that any maximizing sequence for the dual can be made to yield, in a general way, an asymptotically minimizing sequence for the primal which typically converges at least as rapidly.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 68
    Electronic Resource
    Electronic Resource
    Springer
    Computing 11 (1973), S. 27-30 
    ISSN: 1436-5057
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Description / Table of Contents: Zusammenfassung Es wird der Fall diskutiert, daß mehr als eine erste Numerierung im Problem der Minimisierung der Bandbreite einer gegebenen schwach besetzten symmetrischen Matrix mittels eines gerichteten Verfahrens möglich ist. Gezeigt wird, daß ohne große Vermehrung der Kosten die Bandbreite bedeutend verkleinert werden kann.
    Notes: Abstract The case where more than one initial numberings is possible when minimizing the bandwidth of a given sparse symmetric matrix by a directed method, is discussed. It is shown that for a little extra cost there is a significant reduction in the bandwidth.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 69
    Electronic Resource
    Electronic Resource
    Springer
    Computing 11 (1973), S. 327-335 
    ISSN: 1436-5057
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Description / Table of Contents: Zusammenfassung Es werden Methoden angegeben, die es gestatten, beim Vorliegen einer guten, lokal bestenL 2-Approximation einer Funktion durch eine Funktionenfamilie, auf die Eindeutigkeit der besten Approximation zu schließen. Es wird angegeben—in Abhängigkeit vom Verhalten der approximierenden Familie—wie gut die Approximation sein muß, um den Schluß auf globale Eindeutigkeit zuzulassen.
    Notes: Abstract Presented are methods, which permit one to conclude the uniqueness of anL 2-Approximation of a function by a family of functions if the approximation is good andlocally best. Dependent on the smoothness of the approximating fmaily estimates of how good the approximation has to be to conclude global uniqueness are given.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 70
    Electronic Resource
    Electronic Resource
    Springer
    Computing 11 (1973), S. 365-377 
    ISSN: 1436-5057
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Description / Table of Contents: Abstract It is presented an errorestimation with regard to a partial order for a solutionx * of a nonlinear system of equationsf(x)=0. Its development also allows a statement about the unambiguity of the solution. The results are applied to a system of difference equations and to an algebraic Eigenvalueproblem.
    Notes: Zusammenfassung Für eine Lösungx * eines nichtlinearen Gleichungssystemsf(x)=0 wird eine Fehlerabschätzung bezüglich einer Halbordnung angegeben. Gleichzeitig kann auch eine Aussage über die Eindeutigkeit der Lösung gemacht werden. Die Ergebnisse werden auf Differenzengleichungen und auf ein algebraisches Eigenwertproblem angewandt.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 71
    Electronic Resource
    Electronic Resource
    Springer
    Computing 25 (1980), S. 29-45 
    ISSN: 1436-5057
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Description / Table of Contents: Zusammenfassung Es werden neue Algorithmen entwickelt, welcher das 0–1-Knapsack-Problem mit dynamischer Optimierung lösen. Für die Berechnung der Knapsack-Funktion werden rekursive Prozeduren vorgelegt, dann wird die Verwendung von Schranken untersucht, mit denen sich Zustände ausscheiden lassen, die nicht zu optimalen Lösungen führen. Die vorgeschlagenen Algorithmen bestimmen automatisch das am besten geeignete Lösungsverfahren. Ausführliche numerische Ergebnisse erlauben es, die neuen Algorithmen mit den gebräuchlichsten bekannten Verfahren zu vergleichen. Die Vergleiche weisen darauf hin, daß die vorgeschlagenen Algorithmen den besten bisher bekannten Ansätzen mit Branch and Bound und dynamischer Optimierung überlegen sind.
    Notes: Abstract New dynamic programming algorithms for the solution of the Zero-One Knapsack Problem are developed. Original recursive procedures for the computation of the Knapsack Function are presented and the utilization of bounds to eliminate states not leading to optimal solutions is analyzed. The proposed algorithms, according to the nature of the problem to be solved, automatically determine the most suitable procedure to be employed. Extensive computational results showing the efficiency of the new and the most commonly utilized algorithms are given. The results indicate that, for difficult problems, the algorithms proposed are superior to the best branch and bound and dynamic programming methods.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 72
    Electronic Resource
    Electronic Resource
    Springer
    Computing 25 (1980), S. 59-76 
    ISSN: 1436-5057
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Description / Table of Contents: Zusammenfassung Zwei Verfahren zur Lösung eines Optimierungsproblems mit stückweise linearer, konvexer und stetiger Zielfunktion und linearen Nebenbedingungen werden beschrieben. Das erste stellt eine Verallgemeinerung des gewöhnlichen Simplex-Algorithmus von Dantzig dar, das zweite eine Anpassung der Methode der Reduzierten Gradienten von P. Wolfe an das behandelte Problem. Beide Verfahren haben gegenüber den üblicherweise verwendeten Algorithmen den Vorteil, ohne Erhöhung der Zahl der Variablen oder Restriktionen zu arbeiten. Eine algorithmische Darstellung und Überlegungen zur Eignung verschiedener Versionen der Verfahren werden gegeben.
    Notes: Abstract Two methods for solving an optimization problem with piecewise linear, convex, and continuous objective function and linear restrictions are described. The first one represents a generalization of the ordinary Simplex-Algorithm by Dantzig, the second one an adaptation of the Reduced Gradient Method by P. Wolfe to the discussed problem. Contrary to the usually employed algorithms, both methods have the advantage of working without an increase of the number of variables or restrictions. An algorithmic presentation and deliberations on the appropriateness of different versions of the methods are provided.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 73
    Electronic Resource
    Electronic Resource
    Springer
    Computing 25 (1980), S. 131-146 
    ISSN: 1436-5057
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Description / Table of Contents: Zusammenfassung Gegenstand dieser Arbeit ist die Behandlung von Integralformeln und Verfahren zur optimalen numerischen Approximation von Integralen über die Einheitssphäre und von Koeffizienten in Reihenentwicklungen nach Kugelfunktionen. Durch Benutzung der Theorie Greenscher (Flächen-) Funktionen wird eine explizite Abschätzung des (absoluten) Fehlers von exaktem und approximierendem Integralwert angegeben.
    Notes: Abstract The aim of this paper is the study of integral formulas and methods for optimal numerical approximation of integrals over the (unit) sphere and coefficients being required in connection with series expansions into spherical harmonics. An explicit estimate of the (absolute) error of exact and approximating integral value is given by use of the theory of Green's (surface) functions on the sphere.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 74
    Electronic Resource
    Electronic Resource
    Springer
    Computing 25 (1980), S. 89-130 
    ISSN: 1436-5057
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Description / Table of Contents: Zusammenfassung Wir entwickeln hier ein modifiziertes Kollokationsverfahren als vollständige numerische Diskretisierung des Galerkin-Verfahrens zur Lösung von Fredholmschen Integralgleichungen erster Art mit logarithmischem Kern als Hauptteil. Diese Methode verknüpft hohe Genauigkeit der Galerkin-Verfahren mit der Schnelligkeit von Kolookationsmethoden. Die asymptotische Fehleranalysis liefert optimale Konvergenzordnung im Sinne finiter Element-Approximation. Das Verfahren gehört zu den verbesserten Randelement-Methoden, die zur Lösung einer großen Klasse ebener Randwertprobleme unter Verwendung finiter Elemente auf der Randkurve verwendet werden können. Die numerischen Experimente bestätigen hohe Genauigkeit bei kurzen Rechenzeiten.
    Notes: Abstract Here we present a certain modified collocation method which is a fully discretized numerical method for the solution of Fredholm integral equations of the first kind with logarithmic kernel as principal part. The scheme combines high accuracy from Galerkin's method with the high speed of collocation methods. The corresponding asymptotic error analysis shows optimal order of convergence in the sense of finite element approximation. The whole method is an improved boundary integral method for a wide class of plane boundary value problems involving finite element approximations on the boundary curve. The numerical experiments reveal both, high speed and high accuracy.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 75
    Electronic Resource
    Electronic Resource
    Springer
    Computing 25 (1980), S. 77-88 
    ISSN: 1436-5057
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Description / Table of Contents: Zusammenfassung Ein iteratives Verfahren zur Lösung quasilinearer hyperbolischer Gleichungen des Typs $$ - [p_1 (u_x ,x,t)]_x + [p_2 (u_t ,x,t)]_t = f(x,t)$$ im Gebiet (0, 1)×(0,T) wird entworfen. Für jedes gegebene Anfangs-Randwert-Problem dieses Typs, dessen Randbedingungen der ersten (zweiten) Art sind, wird ein konjugiertes Problem desselben Typs definiert, dessen Randbedingungen der zweiten (ersten) Art sind. Aus den Beziehungen, durch die die Lösungen eines Paares konjugiererter Probleme verbunden sind, wird eine Folge von Wellengleichungen gebildet. Das entworfene Verfahren besteht in der Berechnung der Lösungen der Wellengleichungen dieser Folge. Der theoretische Beweis der Konvergenz der Lösungen der Wellengleichungen gegen die Lösungen der konjugierten quasilinearen Probleme wird als offene Frage gelassen. Doch werden numerische Resultate angegeben, die zeigen, daß die Lösungen der Wellengleichungen unter günstigen Umständen tatsächlich gegen die Lösungen der konjugierten quasilinearen Probleme konvergieren.
    Notes: Abstract An iterative method of solving quasilinear hyperbolic equations of the type $$ - [p_1 (u_x ,x,t)]_x + [p_2 (u_t ,x,t)]_t = f(x,t)$$ in the domain (0, 1)×(0,T) is proposed. For each given initial-boundary-value problem of this type with boundary conditions of the first kind (second kind), a conjugate problem of the same type that has boundary conditions of the second kind (first kind) is defined. From the relations connecting the solutions of a pair of conjugate problems, a series of wave equations is created. The method proposed consists in calculating the solutions of the wave equations of this series. Theoretical proof of the convergence of the solutions of the wave equations to the solutions of the conjugate quasilinear problems is left as an open question. However, numerical results are presented to demonstrate that, under favorable circumstances, the solutions of the wave equations do converge to the solutions of the conjugate quasilinear problems.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 76
    Electronic Resource
    Electronic Resource
    Springer
    Computing 25 (1980), S. 163-174 
    ISSN: 1436-5057
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Description / Table of Contents: Zusammenfassung Wir beschreiben eine Testmethode, bei der ein Programm für algebraische Gleichungen durch eine Spezifikation von Eingangsparameter und Ausgangsinformation untersucht werden kann. Der Test wird unter selbstgewählten Bedingungen systematisch ausgeführt und liefert praktische Kriterien zur Beurteilung der Zuverlässigkeit des Programms.
    Notes: Abstract We describe a test method by which a program for polynomial equations can be examined with its specification about the input parameters and the output information. The test is systematically performed under desired conditions, and gives a practical criterion of a judgement on the reliability of the program.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 77
    Electronic Resource
    Electronic Resource
    Springer
    Computing 25 (1980), S. 155-162 
    ISSN: 1436-5057
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Description / Table of Contents: Zusammenfassung Es wird eine Quasi-Newton-Methode zur Minimierung einer Funktion ohne Nebenbedingungen beschrieben, die eine Cholesky-Faktorisierung einer Approximation der Hesseschen Matrix benutzt. In jedem Schritt wird eine neue Zeile und Spalte dieser Approximationsmatrix bestimmt und die Cholesky-Faktorisierung entsprechend angepaßt. Dies führt zu einer Verringerung des benötigten Speicherplatzes und vereinfacht die Berechnung der Schrittrichtung. Es müssen Maßnahmen eingeführt werden, um die Approximationsmatrix positiv definit zu halten. Es wird gezeigt, daß das Verfahren unter üblichen Bedingungen superlinear oder sogarn-step quadratisch konvergiert.
    Notes: Abstract A quasi-Newton method for unconstrained minimization is presented, which uses a Cholesky factorization of an approximation to the Hessian matrix. In each step a new row and column of this approximation matrix is determined and its Cholesky factorization is updated. This reduces storage requirements and simplifies the calculation of the search direction. Precautions are taken to hold the approximation matrix positive definite. It is shown that under usual conditions the method converges superlinearly or evenn-step quadratic.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 78
    Electronic Resource
    Electronic Resource
    Springer
    Computing 25 (1980), S. 147-154 
    ISSN: 1436-5057
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Description / Table of Contents: Zusammenfassung Sowohl in der zentrierten Form wie auch in der Mittelwertform liefert die Intervall-Fortsetzung einer Funktion eine Näherung zweiter Ordnung für den Wertebereich der Funktion über einem Intervall. Die beiden Formen unterscheiden sich jedoch bezüglich der Einschließungsmonotonie: Die Mittelwertform ist einschließungsmonoton, die zentrierte Form dagegen i.a. nicht, wie in der Arbeit gezeigt wird. Ferner ist die Mittelwertform allgemeiner anwendbar; eine Mittelwertform für einen Integraloperator wird diskutiert, und es wird gezeigt, daß sie ebenfalls eine einschließungsmonotone Näherung zweiter Ordnung ist.
    Notes: Abstract An interval extension of a function written in the centered form or the mean value form offers a second order approximation to the range of values of the function over an interval. However, the two forms differ with respect to inclusion monotonicity; the mean value form is inclusion monotone while the centered form is not. This is demonstrated in the following paper. Further, the mean value form is more generally applicable, and a mean value form for an integral operator is considered. It is shown that this form is also a second order inclusion monotone approximation.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 79
    Electronic Resource
    Electronic Resource
    Springer
    Computing 25 (1980), S. 175-179 
    ISSN: 1436-5057
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Description / Table of Contents: Zusammenfassung Die Fixpunktmethode von Kuhn-MacKinnon wird zur Lösung nichtlinearer Gleichungen mit bekannter Lokalisierung der Lösung angewendet. Die Rechenzeit für ein typisches Anwendungsbeispiel wird angegeben.
    Notes: Abstract Nonlinear Equations with known localisation of the solution are solved by the fixed point method of Kuhn-MacKinnon. A small sample of typical computational experience is given.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 80
    Electronic Resource
    Electronic Resource
    Springer
    Computing 25 (1980), S. 181-191 
    ISSN: 1436-5057
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Description / Table of Contents: Zusammenfassung In dieser Note wird die Konstruktion der Newton-Interpolation auf mehrere Variable übertragen für den Fall, daß die Interpolationspunkte auf einem Gitter liegen, eine Situation, die man häufig bei Finiten Elementen antrifft. Man kann die Technik auf das Zusammenfallen von Interpolationspunkten, d. h. Hermite-Interpolation, ausdehnen.
    Notes: Abstract In this paper the construction of the Newton interpolation is carried over to several variables in case the interpolation points are contained in a grid. This is frequently the case for finite elements. Coalescence of points, i.e. multiple knots may be included.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 81
    Electronic Resource
    Electronic Resource
    Springer
    Computing 25 (1980), S. 243-251 
    ISSN: 1436-5057
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Description / Table of Contents: Zusammenfassung Zur Lösung von Standortoptimierungsproblemen wird häufig eine auf E. Weiszfeld zurückgehende Methode verwendet, von der I. N. Katz lokal lineare Konvergenz nachweisen konnte. Dieses Resultat wird in der vorliegenden Arbeit verallgemeinert.
    Notes: Abstract Weiszfeld's method is widely used for solving problems of optimal location. It is shown that a very general variant of this method converges linearly thus generalizing a result of I. N. Katz.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 82
    Electronic Resource
    Electronic Resource
    Springer
    Computing 25 (1980), S. 209-232 
    ISSN: 1436-5057
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Description / Table of Contents: Zusammenfassung Wir verallgemeinern in dieser Arbeit ein Ergebnis von de Bruijn, Knuth und Rice über die Höhe planarer Wurzelbäume mitn Knoten. Wir berechnen zunächst die Anzahl allerr-fach gewurzelter planarer Bäume (r-Bäume) mitn Knoten und einer Höhe kleiner gleichk. Unter der Annahme, daß alle planare Bäume mitn Knoten gleichwahrscheinlich sind, zeigen wir, daß für großen ein planarer Wurzelbaum ein 3-Baum ist; für diese Verteilung berechnen wir die Verteilungsfunktion und die Varianz. Schließlich leiten wir einen exakten Ausdruck und sein asymptotisches Äquivalent für die mittlere Höhe $$\bar h_r $$ n einesr-Baumes mitn Knoten ab. Wir erhalten für alle ε〉0 $$\bar h_r (n) = \sqrt {\pi n} - \frac{1}{2}(r - 2) + O(1n(n)/n^{1/2 - \varepsilon } ).$$
    Notes: Abstract In this paper we generalize a result of de Bruijn, Knuth und Rice concerning the average height of planted plane trees withn nodes. First we compute the number of allr-typly rooted planted plane trees (r-trees) withn nodes and height less than or equal tok. Assuming that all planted plane trees withn nodes are equally likely, we show, that in the average a planted plane tree is a 3-tree for largen; for this distribution we compute also the cumulative distribution function and the variance. Finally, we shall derive an exact expression and its asymptotic equivalent for the average height $$\bar h_r $$ (n) of anr-tree withn nodes. We obtain for all ε〉0 $$\bar h_r (n) = \sqrt {\pi n} - \frac{1}{2}(r - 2) + O(1n(n)/n^{1/2 - \varepsilon } ).$$
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 83
    Electronic Resource
    Electronic Resource
    Springer
    Computing 25 (1980), S. 233-241 
    ISSN: 1436-5057
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Description / Table of Contents: Zusammenfassung Das normierte Penaltyfunktionsverfahren unterscheidet sich von dem gewöhnlichen äußeren Penaltyfunktionsverfahren mit variablem Abschneiden dadurch, daß die Problemfunktionen nach Abschluß jeder unrestringierten Optimierung durch Multiplizieren mit den Kehrwerten der erreichten Funktionswerte normalisiert werden. Rechnerische Ergebnisse anhand von 12 Testaufgaben werden berichtet und mit den Ergebnissen zweier anderer Penaltyfunktionsverfahren verglichen.
    Notes: Abstract The normed moving truncations penalty-function method differs from the common exterior moving truncations penaltyfunction method in that the problem functions are normalized after every completed unconstrained optimization, by multiplying with the reciprocal values attained by the functions. Computational results on 12 problems of varying complexity are reported, and compared with the results achieved by two other penalty-function methods.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 84
    Electronic Resource
    Electronic Resource
    Springer
    Computing 25 (1980), S. 253-267 
    ISSN: 1436-5057
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Description / Table of Contents: Zusammenfassung Clenshaw und Negus [1] haben den kubischen X-Spline definiert und auf ein Interpolationsproblem angewandt. In der vorliegenden Arbeit wird ein Interpolationssplinew eingeführt, der durch Kombination zweier speziellerX-Splines entsteht.w ist so konstruiert, daß der Rechenaufwand zu seiner Bestimmung im Falle stückweise äquidistanter Stützstellen geringer ist als derjenige für den konventionellen kubischen Splines c . Es wird eine vollständige Fehleranalyse fürw durchgeführt. Als eines der Hauptresultate ergibt sich, daßw unds c im Falle stückweise äquidistanter Stützstellen im wesentlichen das gleiche Fehlerverhalten haben.
    Notes: Abstract Clenshaw and Negus [1] defined the cubic X-spline, and they applied it to an interpolation problem. In the present paper, for the same interpolation problem, an interpolating splinew is considered by combining two specialX-splines. The construction ofw is such that the computational labour for its determination, in the case of piecewise equally spaced knots, is less than that of the conventional cubic splines c . A complete error analysis ofw is done. One of the main results is that, in the case of piecewise equally spaced knots,w ands c have essentially the same error estimates.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 85
    Electronic Resource
    Electronic Resource
    Springer
    Computing 25 (1980), S. 269-282 
    ISSN: 1436-5057
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Description / Table of Contents: Zusammenfassung In dieser Arbeit wird ein allgemeines Modell zur Analyse der Grenzgenauigkeit von Iterationsverfahren zur Lösung linearer und nichtlinearer Gleichungssysteme unter dem Einfluß von Rundungs- und Approximationsfehlern hergeleitet. Eine Reihe von Verfahren, für die diese Frage bisher nur unter Anwendung spezieller und teilweise komplizierter Techniken beantwortet wurde, können nun mit großer Leichtigkeit und Allgemeinheit behandelt werden.
    Notes: Abstract In this paper a general model for the analysis of the limiting accuracy of linear and nonlinear iterative methods under the influence of approximation and roundoff errors is presented. A number of numerical methods for which this question up to now has been answered by the use of specialized and rather complicated techniques only can be treated with great ease and generality.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 86
    Electronic Resource
    Electronic Resource
    Springer
    Computing 25 (1980), S. 297-298 
    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 ...
  • 87
    Electronic Resource
    Electronic Resource
    Springer
    Computing 25 (1980), S. 299-316 
    ISSN: 1436-5057
    Keywords: 65 N 05 ; 65 N 10 ; 65 M 05 ; 65 M 10
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Description / Table of Contents: Zusammenfassung Für 0≤x≤1, 0≤t≤T betrachten wir die Diffusionsgleichung $$\gamma (x)u_t (x, t) - (B u)_x (x, t) = f(x, t)$$ mitB u:=(a(x)u) x +b(x)u oder (alternativ)a(x)u x +β(x)u. Vorgegeben sind Anfangswerteu(x,0), Zuflußraten −(B u) (0,t) und (B u) (1,t) und eine Zuflußrate (B u) (ζ−0,t)−(B u) (ζ+0,t) and einer Zwischenstelle ζ∈(0, 1), an der die sonst glatten Funktionen γ,a, b, β Sprungstellen haben dürfen.a und γ sind als positiv vorausgesetzt. Faßt manu(x, t) als Temperatur und γ(x) u (x, t) als Energiedichte auf, so kann man die Gesamtenergie $$E(t) = \int\limits_0^1 {\gamma (x) u (x, t)} $$ als Integral über die Daten schreiben. Wir analysieren explizite und implizite Einschritt-Differenzenschemata, die an den Zeitgitterpunkten über ein Quadratur-Analogon exaktE (t) reproduzieren. Diese Schemata imitieren auch die isotone Abhängigkeit der Lösung von den Daten, und somit kann ihre Stabilität mit Hilfe von Gerschgorins Methode bewiesen werden, unter entsprechenden Glattheitsannahmen ergibt sich die Konvergenz als 0 ((Δx)2+Δt).
    Notes: Abstract For 0≤x≤1, 0≤t≤T we consider the diffusion equation $$\gamma (x)u_t (x, t) - (B u)_x (x, t) = f(x, t)$$ with (alternatively)B u:=(a(x)u) x +b(x)u ora(x)u x +β(x)u. There are given initial valuesu(x,0), influx rates−(B u) (0,t) and (B u) (1,t) across the lateral boundaries and an influx rate (B u) (ζ−0,t)−(B u) (ζ+0,t) at an interface ζ∈(0, 1) where the elsewhere smooth functions γ,a, b, β are allowed to have jump discontinuities.a and γ are assumed to be positive. Interpretingu(x, t) as temperature and γ(x) u (x, t) as energy density we can easily express the total energy $$E(t) = \int\limits_0^1 {\gamma (x) u (x, t)} $$ in terms of integrals of the given data. We describe and analyse explicit and implicit one-step difference schemes which possess a discrete quadrature analogue exactly matchingE(t) at the time grid points. These schemes also imitate the isotonic dependence of the solution on the data. Hence stability can be proved by Gerschgorin's method and, under appropriate smoothness assumptions, convergence is 0 ((Δx)2+Δt).
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 88
    Electronic Resource
    Electronic Resource
    Springer
    Computing 25 (1980), S. 283-295 
    ISSN: 1436-5057
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Description / Table of Contents: Zusammenfassung In dieser Arbeit werden zwei Halbordnungen für symmetrische Matrizen zueinander in Beziehung gesetzt, nämlich die durch den KegelK der elementweise nichtnegativen Matrizen definierte natürliche Halbordnung ≤ und die durch den KegelK D der nichtnegativ definiten Matrizen erzeugte definite Halbordnung $$ \leqslant \cdot$$ . Als Hauptresultat der Arbeit wird gezeigt, wie ein Matrixintervall im Sinne der definiten Halbordnung in optimale Schranken bezüglich der natürlichen Halbordnung eingeschlossen werden kann. Mit diesem Ergebnis ist es möglich, aus einer Lösungseinschließung mit der definite Halbordnung eine numerisch verwendbare Einschließung auf der Basis der natürlichen Halbordnung zu berechnen. Insbesondere kann auf diesem Wege ein stets und überdies quadratisch konvergentes Verfahren zur elementweisen monotonen Einschließung der Quadratwurzel einer symmetrischen, positiv definiten Matrix angegeben werden.
    Notes: Abstract In this paper, two kinds of partial ordering for symmetric matrices are related to each other, namely, the natural partial ordering ≤ generated by the coneK of elementwise nonnegative matrices, and the definite partial ordering $$ \leqslant \cdot$$ generated by the coneK D of nonnegative definite matrices. The main result of this paper shows how a matrix interval in the sense of the definite partial ordering can be enclosed between optimal bounds with respect to the natural partial ordering. By means of this result, it is possible to compute a numerically practicable inclusion based on the natural partial ordering from a given inclusion of some matrix with the definite partial ordering. In this way, an always and moreover quadratically convergent method of elementwise enclosing the square root of a positive definite, symmetric matrix can be constructed.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 89
    Electronic Resource
    Electronic Resource
    Springer
    Computing 33 (1984), S. 193-210 
    ISSN: 1436-5057
    Keywords: 68C25 ; 68B10 ; 68E10 ; Global program optimization ; flow graph ; reducibility ; interval analysis ; data flow analysis ; live variables ; time complexity
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Description / Table of Contents: Zusammenfassung Ein Algorithmus zur Lösung des Problems der lebenden Variablen für reduzible Flußgraphen wird vorgestellt. Er beruht auf dem Begriff eines Gebietes eines Flußgraphen. Der Algorithmus wird hinsichtlich seiner Zeitkomplexität mit der bekannten “round-robin”-Version des iterativen Algorithmus für “selbstreplizierende” Familien reduzibler Flußgraphen verglichen. Die Ergebnisse dieses Vergleiches sind nicht schlüssig, da der Gebietsanalysealgorithmus bei manchen Graphen mehr, bei anderen weniger Bitvektoroperationen erfordert.
    Notes: Abstract An algorithm to solve the “live variables” problem on reducible flow graphs is presented. It is based on the concept of a region of a flow graph. The algorithm is compared for time complexity with the well-known round-robin version of the iterative algorithm on “self-replicating” families of reducible flow graphs. The results of comparison are inconclusive in that the region analysis algorithm requires fewer bit-vector operations on some graphs and more on others.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 90
    Electronic Resource
    Electronic Resource
    Springer
    Computing 33 (1984), S. 247-257 
    ISSN: 1436-5057
    Keywords: Random variate generation ; simulation ; log concavity ; inequalities
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Description / Table of Contents: Zusammenfassung Wir legen einen kurzen Algorithmus zur Erzeugung von Zufallsveränderlichen mit log-konkaver Dichtef aufR mit bekanntem Median-Wert vor. Die mittlere Anzahl der erforderlichen Operationen ist unabhängig vonf. Die log-konkaven Dichtefunktionen beschreiben u. a. die Normal-, Gamma-, Weibull-, Beta-, Potenzexponential- (alle mit Formparameter mindestens 1), Perks- und Extremwert-Verteilung.
    Notes: Abstract We present a short algorithm for generating random variates with log-concave densityf onR and known mode in average number of operations independent off. Included in this class are the normal, gamma, Weibull, beta and exponential power (all with shape parameters at least 1), logistic, hyperbolic secant and extreme value distributions. The algorithm merely requires the presence of a uniform [0, 1] random number generator and a subprogram for computingf. It can be implemented in about 10 lines of FORTRAN code.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 91
    Electronic Resource
    Electronic Resource
    Springer
    Mathematical programming 18 (1980), S. 94-99 
    ISSN: 1436-4646
    Keywords: Integer Programming ; Integral Polyhedra ; Linear Inequalities ; Facets
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Notes: Abstract A new class of facets for knapsack polytopes is obtained. This class of inequalities is shown to define a polytope with zero–one vertices only. A combinatorial inequality is obtained from Fulkerson's max—max inequality.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 92
    Electronic Resource
    Electronic Resource
    Springer
    Mathematical programming 18 (1980), S. 109-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 ...
  • 93
    Electronic Resource
    Electronic Resource
    Springer
    Mathematical programming 18 (1980), S. 146-154 
    ISSN: 1436-4646
    Keywords: Convex Programming ; Maximum Entropy Problem ; Forecasting Models
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Notes: Abstract This paper describes a method to solve large sparse maximum entropy problems with linear equality constraints using Newtons and the conjugate gradient method. A numerical example is given to introduce the reader to possible applications of entropy models and this method. Some experience from large scale problems is also reported.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 94
    Electronic Resource
    Electronic Resource
    Springer
    Mathematical programming 18 (1980), S. 197-214 
    ISSN: 1436-4646
    Keywords: Nonlinear Programming ; Constrained Optimization ; Augmented Lagrangian Methods ; Multiplier Methods
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Notes: Abstract It is known that augmented Lagrangian or multiplier methods for solving constrained optimization problems can be interpreted as techniques for maximizing an augmented dual functionD c(λ). For a constantc sufficiently large, by considering maximizing the augmented dual functionD c(λ) with respect toλ, it is shown that the Newton iteration forλ based on maximizingD c(λ) can be decomposed into taking a Powell/Hestenes iteration followed by a Newton-like correction. Superimposed on the original Powell/Hestenes method, a simple acceleration technique is devised to make use of information from the previous iteration. For problems with only one constraint, the acceleration technique is equivalent to replacing the second (Newton-like) part of the decomposition by a finite difference approximation. Numerical results are presented.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 95
    Electronic Resource
    Electronic Resource
    Springer
    Mathematical programming 19 (1980), S. 111-114 
    ISSN: 1436-4646
    Keywords: Traveling Salesman Problem ; Heuristics ; Approximation
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Notes: Abstract We introduce subclasses of the traveling salesman problem (TSP) and analyze the behaviour of heuristics on them. We derive bounds for the performance of the algorithms.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 96
    Electronic Resource
    Electronic Resource
    Springer
    Mathematical programming 19 (1980), S. 155-177 
    ISSN: 1436-4646
    Keywords: Aggregation ; Networks ; Error-bounds
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Notes: Abstract It is often necessary or desirable in practice to replace a large, detailed optimization model with a smaller, approximate model. It would be useful to have bounds on the error resulting from this process of aggregation. This paper develops such bounds for a class of linear minimum-cost network-flow problems, where groups of nodes in a large problem are replaced by aggregate nodes. Two types of bounds are derived: A priori bounds are available before solving the aggregated problem; a posteriori bounds, which are generally tighter, may be computed afterwards.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 97
    Electronic Resource
    Electronic Resource
    Springer
    Mathematical programming 19 (1980), S. 230-236 
    ISSN: 1436-4646
    Keywords: Basic Feasible Solution ; Basic Variable ; Non-degenerate Basic Feasible Solution ; Non-basic Variable ; Optimal Basic Solution
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Notes: Abstract The standard linear programming problem with a finite optimum value is considered. We derive new criteria which guarantee that (i) a non-basic variable of a basic feasible solution will remain a non-basic variable of an optimal basic solution; (ii) a basic variable of a basic feasible solution will remain a basic variable of an optimal basic solution.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 98
    Electronic Resource
    Electronic Resource
    Springer
    Mathematical programming 19 (1980), S. 279-288 
    ISSN: 1436-4646
    Keywords: Mixed-Integer Programming ; Stochastic Programming
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Notes: Abstract Stochastic programs with continuous variables are often solved using a cutting plane method similar to Benders' partitioning algorithm. However, mixed 0–1 integer programs are also solved using a similar procedure along with enumeration. This similarity is exploited in this paper to solve two stage linear programs under uncertainty where the first stage variables are 0–1. Such problems often arise in capital investment. A network investment application is given which includes as a special case a coal transportation problem.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 99
    Electronic Resource
    Electronic Resource
    Springer
    Mathematical programming 19 (1980), S. 352-355 
    ISSN: 1436-4646
    Keywords: Minimax Theorem ; “Inf—sup” Theorem ; Convex Programming
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Notes: Abstract We give a new minisup theorem for noncompact strategy sets. Our result is of the type of the Matthies-Strang-Christiansen minimax theorem where the hyperplane should be replaced by any closed convex set. As an application, we derive a slight generalization of the Matthies-Strang-Christiansen minimax theorem.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 100
    Electronic Resource
    Electronic Resource
    Springer
    Mathematical programming 18 (1980), S. 89-93 
    ISSN: 1436-4646
    Keywords: Cyclic Coordinate Method ; Independent Search Directions ; Cycling ; Unconstrained Minimization
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Notes: Abstract Powell has shown that the cyclic coordinate method with exact searches may not converge to a stationary point. In this note we consider a more general class of algorithms for unconstrained minimization, and establish their convergence under the assumption that the objective function has a unique minimum along any line.
    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...