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
  • Books
  • Articles  (17,501)
  • 1980-1984  (13,358)
  • 1975-1979  (4,143)
  • 1983  (6,413)
  • 1981  (6,945)
  • 1975  (4,143)
  • Computer Science  (17,501)
Collection
  • Books
  • Articles  (17,501)
Years
  • 1980-1984  (13,358)
  • 1975-1979  (4,143)
Year
Journal
  • 1
    Electronic Resource
    Electronic Resource
    Springer
    Mathematical programming 21 (1981), S. 190-203 
    ISSN: 1436-4646
    Keywords: Complementarity Problem ; Cones ; Topological Degree
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Notes: Abstract In this paper we consider the problem of establishing the number of solutions to the complementarity problem. For the case when the Jacobian of the mapping has all principal minors negative, and satisfies a condition at infinity, we prove that the problem has either 0, 1, 2 or 3 solutions. We also show that when the Jacobian has all principal minors positive, and satisfies a condition at infinity, the problem has a unique solution.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 2
    Electronic Resource
    Electronic Resource
    Springer
    Mathematical programming 21 (1981), S. 233-234 
    ISSN: 1436-4646
    Keywords: Polytope ; Subdivision ; Simplex ; Volume ; Centroid
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Notes: Abstract Subdivisions of polytopes are described which place any chosen vertex in a (near-) minimal number of simplices. Ancillary procedures to find volumes and centroids of polytopes are indicated.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 3
    Electronic Resource
    Electronic Resource
    Springer
    Mathematical programming 21 (1981), S. 301-318 
    ISSN: 1436-4646
    Keywords: Semi-infinite Programs ; Open Helly-type Theorems ; Finite Subprograms ; Convex Programs ; Multi-criteria Programs ; Quasi-convex Programs ; Quasi-differentiable Programs
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Notes: Abstract We show that a semi-infinite quasi-convex program with certain regularity conditions possesses finitely constrained subprograms with the same optimal value. This result is applied to various problems.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 4
    Electronic Resource
    Electronic Resource
    Springer
    Mathematical programming 21 (1981), S. 348-356 
    ISSN: 1436-4646
    Keywords: Multi-extremal Optimization ; Multinomial Distribution ; Bayes Estimate ; Monte Carlo
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Notes: Abstract The solution of ak-extremal problem is defined as the set of pairs (x i * , θi),i = 1, ⋯ ,k, where x t * isi th local minimum andθ i is the volume of the set of attraction of this minimum. A Bayesian estimate ofk and (θ 1 , ⋯ , θ k ) is constructed.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 5
    Electronic Resource
    Electronic Resource
    Springer
    Mathematical programming 21 (1981), S. 120-120 
    ISSN: 1436-4646
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 6
    Electronic Resource
    Electronic Resource
    Springer
    Mathematical programming 21 (1981), S. 319-330 
    ISSN: 1436-4646
    Keywords: Nonlinear Programming ; Geometric Programming ; Duality Theory
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Notes: Abstract The several published methods for mapping a dual solution estimate to a primal solution estimate in posynomial geometric programming provide no criteria for deciding how much deviation from primal feasibility, or discrepancy between the primal and dual objective function values, should be permitted before the primal solution estimate is accepted by the designer. This paper presents a new and simple dual-to-primal conversion method that uses the cost coefficients to provide a sound economic criterion for determining when to accept a primal solution estimate. The primal solution estimate generated is the exact solution to a modified primal obtained from the given primal by modifying the cost coefficients, with the exponent matrix left unchanged. The method is shown to have desirable properties when coupled with a convergent dual algorithm.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 7
    Electronic Resource
    Electronic Resource
    Springer
    Mathematical programming 21 (1981), S. 1-18 
    ISSN: 1436-4646
    Keywords: Game Theory ; Cost Allocation ; Spanning Tree
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Notes: Abstract We consider the problem of cost allocation among users of a minimum cost spanning tree network. It is formulated as a cooperative game in characteristic function form, referred to as a minimum cost spanning tree (m.c.s.t.) game. We show that the core of a m.c.s.t. game is never empty. In fact, a point in the core can be read directly from any minimum cost spanning tree graph associated with the problem. For m.c.s.t. games with efficient coalition structures we define and construct m.c.s.t. games on the components of the structure. We show that the core and the nucleolus of the original game are the cartesian products of the cores and the nucleoli, respectively, of the induced games on the components of the efficient coalition structure.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 8
    Electronic Resource
    Electronic Resource
    Springer
    Mathematical programming 21 (1981), S. 119-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 ...
  • 9
    Electronic Resource
    Electronic Resource
    Springer
    Mathematical programming 21 (1981), S. 121-136 
    ISSN: 1436-4646
    Keywords: Linear Programming ; Polynomial Algorithms ; Total Unimodularity
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Notes: Abstract This paper describes several algorithms for solution of linear programs. The algorithms are polynomial when the problem data satisfy certain conditions.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 10
    Electronic Resource
    Electronic Resource
    Springer
    Mathematical programming 21 (1981), S. 182-189 
    ISSN: 1436-4646
    Keywords: Equilibrium ; Linear Monetary Economy ; Linear Programming
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Notes: Abstract An algorithm is presented for computing equilibria in a linear monetary economy, that is, an exchange economy in which all individuals have linear utility functions and in which goods are bought and sold only in exchange for money. The algorithm computes the equilibrium prices by solving a finite sequence of linear programming problems.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 11
    Electronic Resource
    Electronic Resource
    Springer
    Mathematical programming 21 (1981), S. 229-232 
    ISSN: 1436-4646
    Keywords: Primal Feasible Basis ; Dual Feasible Basis ; Basic Variable ; Nonbasic Variable ; Optimal Basic Solution
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Notes: Abstract In a recent paper M.C. Cheng proposed new criteria for the simplex algorithm which guarantee that (i) a nonbasic variable of a basic feasible solution will remain nonbasic in an optimal basic solution, (ii) a basic variable of a basic solution will remain basic in an optimal basic solution. This comment gives (i) a slight generalization of the first result and (ii) a counterexample to the second proposition.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 12
    Electronic Resource
    Electronic Resource
    Springer
    Mathematical programming 21 (1981), S. 240-240 
    ISSN: 1436-4646
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 13
    Electronic Resource
    Electronic Resource
    Springer
    Mathematical programming 21 (1981), S. 241-261 
    ISSN: 1436-4646
    Keywords: Dual problem ; Duality Theory ; Optimality Conditions ; Price Functions ; Nonlinear Programming ; Integer Programming
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Notes: Abstract We survey some recent developments in duality theory with the idea of explaining and unifying certain basic duality results in both nonlinear and integer programming. The idea of replacing dual variables (prices) by price functions, suggested by Everett and developed by Gould, is coupled with an appropriate dual problem with the consequence that many of the results resemble those used in linear programming. The dual problem adopted has a (traditional) economic interpretation and dual feasibility then provides a simple alternative to concepts such as conjugate functions or subdifferentials used in the study of optimality. In addition we attempt to make precise the relationship between primal, dual and saddlepoint results in both the traditional Lagrangean and the more general duality theories and to see the implications of passing from prices to price functions. Finally, and perhaps surprisingly, it appears that all the standard algorithms terminate by constructing primal and dual feasible solutions of equal value, i.e., by satisfying generalised optimality conditions.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 14
    Electronic Resource
    Electronic Resource
    Springer
    Mathematical programming 21 (1981), S. 358-358 
    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 ...
  • 15
    Electronic Resource
    Electronic Resource
    Springer
    Mathematical programming 8 (1975), S. 91-103 
    ISSN: 1436-4646
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Notes: Abstract This paper describes what is termed the “generalized assignment problem”. It is a generalization of the ordinary assignment problem of linear programming in which multiple assignments of tasks to agents are limited by some resource available to the agents. A branch and bound algorithm is developed that solves the generalized assignment problem by solving a series of binary knapsack problems to determine the bounds. Computational results are cited for problems with up to 4 000 0–1 variables, and comparisons are made with other algorithms.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 16
    Electronic Resource
    Electronic Resource
    Springer
    Mathematical programming 8 (1975), S. 43-53 
    ISSN: 1436-4646
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Notes: Abstract A break in a {0, 1}-matrix is defined as a 0 with at least one 1 to its left and at least one 1 to its right in the same row. This paper is concerned with {0, 1}-matrices with given column sums and an upper limit for the row sums. In addition, there are limits on the distance from the first to the last 1 in a row. The problem that is considered is to find a {0, 1}-matrix satisfying the conditions such that the total number of breaks is minimum. An algorithm for solving this problem is presented. Computational results illustrate the effectiveness of the algorithm. The investigation originated in a problem of crew rostering.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 17
    Electronic Resource
    Electronic Resource
    Springer
    Mathematical programming 8 (1975), S. 104-116 
    ISSN: 1436-4646
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Notes: Abstract This paper presents a new algorithm for the solution of multi-state dynamic programming problems, referred to as the Progressive Optimality Algorithm. It is a method of successive approximation using a general two-stage solution. The algorithm is computationally efficient and has minimal storage requirements. A description of the algorithm is given including a proof of convergence. Performance characteristics for a trial problem are summarized.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 18
    Electronic Resource
    Electronic Resource
    Springer
    Mathematical programming 8 (1975), S. 250-250 
    ISSN: 1436-4646
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 19
    Electronic Resource
    Electronic Resource
    Springer
    Mathematical programming 8 (1975), S. 272-307 
    ISSN: 1436-4646
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Notes: Abstract A method of solving the 0–1 knapsack problem which derives from the “shrinking boundary method” is described and compared to other methods through extensive computational experimentation.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 20
    Electronic Resource
    Electronic Resource
    Springer
    Mathematical programming 8 (1975), S. 332-344 
    ISSN: 1436-4646
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Notes: Abstract Consequences of a general formulation of the theorem of the alternative are exploited.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 21
    Electronic Resource
    Electronic Resource
    Springer
    Mathematical programming 8 (1975), S. 369-374 
    ISSN: 1436-4646
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Notes: Abstract A perturbation method is introduced which transforms any fixed cost transportation problem F into a degeneracy-free equivalent F′. If a basic optimal solution to F′ is known, an optimal solution to F can be obtained by means of simple rounding.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 22
    Electronic Resource
    Electronic Resource
    Springer
    Mathematical programming 8 (1975), S. 345-368 
    ISSN: 1436-4646
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Notes: Abstract Consider the relaxation of an integer programming (IP) problem in which the feasible region is replaced by the intersection of the linear programming (LP) feasible region and the corner polyhedron for a particular LP basis. Recently a primal-dual ascent algorithm has been given for solving this relaxation. Given an optimal solution of this relaxation, we state criteria for selecting a new LP basis for which the associated relaxation is stronger. These criteria may be successively applied to obtain either an optimal IP solution or a lower bound on the cost of such a solution. Conditions are given for equality of the convex hull of feasible IP solutions and the intersection of all corner polyhedra.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 23
    Electronic Resource
    Electronic Resource
    Springer
    Mathematical programming 8 (1975), S. 378-381 
    ISSN: 1436-4646
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Notes: Abstract We consider the linear programming formulation of the asymmetric travelling salesman problem. Several new inequalities are stated which yield a sharper characterization in terms of linear inequalities of the travelling salesman polytope, i.e., the convex hull of tours. In fact, some of the new inequalities as well as some of the well-known subtour elimination constraints are indeed facets of the travelling salesman polytope, i.e., belong to the class of inequalities that uniquely characterize the convex hull of tours to an-city problem.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 24
    Electronic Resource
    Electronic Resource
    Springer
    Mathematical programming 9 (1975), S. 57-68 
    ISSN: 1436-4646
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Notes: Abstract A family of test-problems is described which is designed to investigate the relative efficiencies of general optimisation algorithms and specialised algorithms for the solution of nonlinear sums-of-squares problems. Five algorithms are tested on three members of the family, and it is shown that the best choice of algorithms is critically affected by the value of one parameter in the test functions.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 25
    Electronic Resource
    Electronic Resource
    Springer
    Mathematical programming 9 (1975), S. 87-99 
    ISSN: 1436-4646
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Notes: Abstract This paper identifies necessary and sufficient conditions for a penalty method to yield an optimal solution or a Lagrange multiplier of a convex programming problem by means of a single unconstrained minimization. The conditions are given in terms of properties of the objective and constraint functions of the problem as well as the penalty function adopted. It is shown among other things that all linear programs with finite optimal value satisfy such conditions when the penalty function is quadratic.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 26
    Electronic Resource
    Electronic Resource
    Springer
    Mathematical programming 9 (1975), S. 130-130 
    ISSN: 1436-4646
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 27
    Electronic Resource
    Electronic Resource
    Springer
    Mathematical programming 9 (1975), S. 137-137 
    ISSN: 1436-4646
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 28
    Electronic Resource
    Electronic Resource
    Springer
    Mathematical programming 9 (1975), S. 139-160 
    ISSN: 1436-4646
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Notes: Abstract Supposez ∈ E n is a solution to the optimization problem minimizeF(x) s.t.x ∈ E n and an algorithm is available which iteratively constructs a sequence of search directions {s j } and points {x j } with the property thatx j →z. A method is presented to accelerate the rate of convergence of {x j } toz provided that n consecutive search directions are linearly independent. The accelerating method uses n iterations of the underlying optimization algorithm. This is followed by a special step and then another n iterations of the underlying algorithm followed by a second special step. This pattern is then repeated. It is shown that a superlinear rate of convergence applies to the points determined by the special step. The special step which uses only first derivative information consists of the computation of a search direction and a step size. After a certain number of iterations a step size of one will always be used. The acceleration method is applied to the projection method of conjugate directions and the resulting algorithm is shown to have an (n + 1)-step cubic rate of convergence. The acceleration method is based on the work of Best and Ritter [2].
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 29
    Electronic Resource
    Electronic Resource
    Springer
    Mathematical programming 9 (1975), S. 255-255 
    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 ...
  • 30
    Electronic Resource
    Electronic Resource
    Springer
    Mathematical programming 9 (1975), S. 247-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 ...
  • 31
    Electronic Resource
    Electronic Resource
    Springer
    Mathematical programming 9 (1975), S. 257-277 
    ISSN: 1436-4646
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Notes: Abstract The nonlinear complementarity problem is the problem of finding a point x in the n-dimensional Euclidean space,R n , such that x ⩾ 0, f(x) ⩾ 0 and 〈x,f(x)∼ = 0, where f is a nonlinear continuous function fromR n into itself. Many existence theorems for the problem have been established in various ways. The aim of the present paper is to treat them in a unified manner. Eaves's basic theorem of complementarity is generalized, and the generalized theorem is used as a unified framework for several typical existence theorems.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 32
    Electronic Resource
    Electronic Resource
    Springer
    Mathematical programming 9 (1975), S. 313-335 
    ISSN: 1436-4646
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Notes: Abstract This paper presents a local convergence analysis of Broyden's class of rank-2 algorithms for solving unconstrained minimization problems, $$h(\bar x) = \min h(x)$$ ,h ∈ C1(R n ), assuming that the step-size ai in each iterationx i+1 =x i -α i H i ▽h(x i ) is determined by approximate line searches only. Many of these methods including the ones most often used in practice, converge locally at least with R-order, $$\tau \geqslant \sqrt[n]{2}$$ .
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 33
    Electronic Resource
    Electronic Resource
    Springer
    Mathematical programming 9 (1975), S. 350-357 
    ISSN: 1436-4646
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Notes: Abstract This paper presents an algorithm for ranking the vertices of a directed graph. Its space and time requirements are bounded byc 1 n 2 +c 2, wheren is the number of vertices of the graph andc 1,c 2 are positive constants which are independent of the size or other properties of the graph. The algorithm can be easily modified to solve the problem of determining longest distances from a vertex to all other vertices in a positive real valued graph with at mostc 1 n 2 +c 2 elementary operations; the same result holds for shortest distances in negative real valued graphs.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 34
    Electronic Resource
    Electronic Resource
    Springer
    Mathematical programming 9 (1975), S. 371-376 
    ISSN: 1436-4646
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Notes: Abstract This paper reports an empirical discovery in integer programming. A version of the branch-and-bound approach is used as a control and tested against the same algorithm augmented by the use of Hillier's linear search performed at every node of the search tree. It is shown that the imbedded linear search locates solutions within 1%, and solutions within 5% of the theoretical optimum, which in fact can be seen to have this proximity to the theoretical optimum at the time of termination of computation, over ten times faster than the control.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 35
    Electronic Resource
    Electronic Resource
    Springer
    Computing 14 (1975), S. 51-65 
    ISSN: 1436-5057
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Description / Table of Contents: Abstract In this paper the mathematical structures occuring in rounded computations with complex numbers and intervals are studied. By means of the special representation of the complex numbers and the properties of their operations one can show, that the same structures as in the real case occur again. Nevertheless we can prove formulae for the interval arithmetic wellknown for complex intervals ([1]) which are easy to calculate.
    Notes: Zusammenfassung In der vorliegenden Arbeit werden die beim numerischen Rechnen mit komplexen Zahlen und Intervallen auftretenden mathematischen Räume untersucht. Unter Verwendung der speziellen Darstellung komplexer Zahlen und der Eigenschaften ihrer Verknüpfungen läßt sich zeigen, daß wieder dieselben Strukturen wie im reellen Fall vorliegen. Trotzdem lassen sich für die Intervallarithmetik leicht auswertbare Formeln herleiten, wie sie für komplexe Intervalle bekannt sind ([1]).
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 36
    Electronic Resource
    Electronic Resource
    Springer
    Computing 14 (1975), S. 107-117 
    ISSN: 1436-5057
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Description / Table of Contents: Zusammenfassung Es handelt sich um eine nomographische approximative Lösungsmethode der folgenden Minimierungsaufgabe: $$g(t_0 ,t_1 ) + g(t_1 ,t_2 ) + ... + g(t_{n - 1} ,t_n ) = \min !$$ unter der Bedingung $$t_0 \underset{\raise0.3em\hbox{$\smash{\scriptscriptstyle-}$}}{ \leqslant } 0〈 t_1〈 t_2〈 ...〈 t_{n - 1}〈 T\underset{\raise0.3em\hbox{$\smash{\scriptscriptstyle-}$}}{ \leqslant } t_n ,$$ wobein die Anzahl der Variablen ist und auch unbekannt sein kann. Der Nomograph besteht aus den Höhenlinien vong(.,.) und anderen Hilfslinien. Die Erstellung der Nomographen durch Computer wird auch gezeigt.
    Notes: Zusammenfassung A graphical procedure is presented to obtain an approximate solution to the minimization problem of the follwing form: Minimize the function $$\varphi (t_0 ,t_1 ,...,t_{n - 1} ,t_n ) = g(t_0 ,t_1 ) + g(t_1 ,t_2 ) + ... + g(t_{n - 1} ,t_n )$$ subject to the constraints $$t_0 \underset{\raise0.3em\hbox{$\smash{\scriptscriptstyle-}$}}{ \leqslant } 0〈 t_1〈 t_2〈 ...〈 t_{n - 1}〈 T\underset{\raise0.3em\hbox{$\smash{\scriptscriptstyle-}$}}{ \leqslant } t_n $$ wheren the number of the variables is not predetermined. The nomograph for the procedure is constructed of contour lines of the functiong(.,.) as well as two other auxiliary curves. Procedures to prepare such nomographs by computer are also presented.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 37
    Electronic Resource
    Electronic Resource
    Springer
    Computing 14 (1975), S. 141-147 
    ISSN: 1436-5057
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Description / Table of Contents: Abstract A theorem is proved by means of Brouwer's theorem which allows to decide whether a given interval matrix [S] has the inclusion property relative to the unknown inverseA −1 of a known matrixA. It is demonstrated in which cases the theorem may be used and how to choose [S] in these cases.
    Notes: Zusammenfassung Mittels des Satzes von Brouwer wird ein Satz bewiesen, nach dem man entscheiden kann, ob eine gegebene Intervallmatrix [S] die Einschließungseigenschaft bezüglich der unbekannten InversenA −1 einer bekannten MatrixA hat. Es wird vorgeführt, in welchen Fällen der Satz anwendbar ist und wie [S] in diesen Fällen gewählt werden kann.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 38
    Electronic Resource
    Electronic Resource
    Springer
    Computing 14 (1975), S. 153-166 
    ISSN: 1436-5057
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Description / Table of Contents: Zusammenfassung Zur Konstruktion von Algorithmen zur numerischen Lösung einer allgemeinen Volterraschen Integralgleichung zweiter Art werden Splinefunktionen vom Gradem und der DefizienzJ−1, d. h. inC m−J , zusammen mit Gaußschen Quadraturformeln benutzt. Die Methode ist, für gegebenesm, von der Ordnung (m+1), und sie erfordert im allgemeinen 0(N) Auswertungen des Kerns. Die bisher bekannten Methoden erfordern 0(N 2) Auswertungen. Es wird gezeigt, daß die Methode für Splinefunktionen mit voller Stetigkeit (J=1) numerisch instabil ist für allem〉2. Dagegen wird die Stabilität bewiesen fürJ=m, m −1 undm beiliebig. Weiter wird fürm=3,J=1 gezeigt, daß bei geeigneter Modifikation der ursprünglichen Methode eine ganze Familie stabiler Methoden gewonnen werden kann.
    Notes: Abstract Spline function of degreem, deficiencyJ−1, i. e. inC m−J , are used in conjunction with (Gaussian) quadrature rules to construct algorthms for the numerical solution of a general Volterra integral equation of the second kind. For a givenm, the method is of order (m+1) and, in general, requires 0(N) evaluations of the kernel. This is in sharp contrast to the 0(N 2) evaluations required by hitherto known methods. It is shown that the method for spline functions with full continuity (J=1) is numerically unstable for allm〉2. However, stability is established forJ=m, m−1, for allm. Furthermore, form=3,J=1, it is demonstrated that by appropriately modifying the original method, a whole family of stable methods is obtained.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 39
    Electronic Resource
    Electronic Resource
    Springer
    Computing 14 (1975), S. 195-203 
    ISSN: 1436-5057
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Description / Table of Contents: Zusammenfassung Es wird ein Algorithmus beschrieben, der das chromatische Polynom eines Graphen in Koeffizientenform liefert. Ein FORTRAN-Programm wird angegeben und einige praktische Erfahrungen werden kurz zusammengefaßt.
    Notes: Abstract An algorithm for deriving the chromatic polynomial of a graph in coefficient form is described. A FORTRAN implementation is given, and some computational experience is summarized.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 40
    Electronic Resource
    Electronic Resource
    Springer
    Computing 14 (1975), S. 225-234 
    ISSN: 1436-5057
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Description / Table of Contents: Abstract In the present paper a new method is given for the numerical treatment of the initial problemsy (n)=f(x,y,y′, ...,y (n−1),y (i) (x o )=y o (i) , i=0, 1, ...,n−1. This method is an one-step process of order four. For a class of linear differential equations the exact solution is obtained. Moreover some numerical results are presented.
    Notes: Zusammenfassung In der vorliegenden Arbeit wird ein neues Verfahren zur numerischen Berechnung des Anfangswertproblemsy (n)=f(x,y,y′, ...,y (n−1),y (i)(x o )=y o (i) , i=0, 1, ..., n−1 gegeben. Es handelt sich hierbei um ein Einschrittverfahren der Konsistenzordnung 4. Das Verfahren liefert für eine Klasse linearer Differentialgleichungen die exakte Lösung. Abschließend geben wir einige numerische Beispiele.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 41
    Electronic Resource
    Electronic Resource
    Springer
    Computing 14 (1975), S. 261-270 
    ISSN: 1436-5057
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Description / Table of Contents: Abstract It is not possible to support by numerical tests the common opinion that the filter method is better than the additive algorithm. The reasons for the limited efficiency of the filter method are stated together with results of numerical tests.
    Notes: Zusammenfassung Die in der Literatur verbreitete Meinung, die Filtermethode sei eine Verbesserung des additiven Algorithmus, kann durch numerische Tests nicht gestützt werden. Zusammen mit den Ergebnissen der numerischen Tests werden Ursachen für die beobachtete geringe Leistungsfähigkeit der Filtermethode angegeben.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 42
    Electronic Resource
    Electronic Resource
    Springer
    Computing 14 (1975), S. 285-312 
    ISSN: 1436-5057
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Description / Table of Contents: Zusammenfassung Eine interpretierte zweisortige Logik wird so definiert, daß sie die Repräsentation einer Unterklasse von Flußdiagrammschemata erlaubt. Ein Entscheidungsverfahren wird entwickelt für die Äquivalenz einfacher Darstellungsformeln innerhalb der Logik und infolgedessen wird ein Entscheidungsverfahren für Flußdiagrammschemata innerhalb der Unterklasse demonstriert. Anwendungen der in der Arbeit entwickelten Techniken haben weitere Entscheidungsverfahren zur Folge. Ein Entscheidungsverfahren für die Äquivalenz von Programmen in einer einfachen Programmiersprache wird auch angegeben.
    Notes: Abstract An interpreted two-sorted logic is defined to allow the representation of a subclass of flowchart schemata. A decision procedure for the equivalence of simple representing formulae within the logic is developed and as a consequence a decision procedure for flowchart schemata within the subclass is demonstrated. Applications of the techniques developed within the paper result in further decision procedures for the equivalence of flowchart schemata in other subclasses. In addition, a decision procedure for the equivalence of programs in a simple programming language is given.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 43
    Electronic Resource
    Electronic Resource
    Springer
    Computing 14 (1975), S. 389-396 
    ISSN: 1436-5057
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Description / Table of Contents: Abstract This paper contains an ALGOL-Procedure for solving mixed integer programming problems with convex objective function and constraints according to a method of Burkard [2].
    Notes: Zusammenfassung Diese Arbeit enthält ein ALGOL-Programm zur Lösung gemischt-ganzzahliger Optimierungsaufgaben mit konvexer Zielfunktion und konvexen Restriktionen nach einer Methode von Burkard [2].
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 44
    Electronic Resource
    Electronic Resource
    Springer
    Computing 15 (1975), S. 33-39 
    ISSN: 1436-5057
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Description / Table of Contents: Zusammenfassung Folgende Algorithmen wurden untersucht: 1. Warshall's Algorithm [17], 2. Purdom's Algorithm [13], 3. der modifizierte Algorithmus von Yen [14], 4. der Algorithmus von Dzikiewicz [3, 4]. Die getesteten Digraphen wurden durch einen Zufallsgenerator erzeugt. Das Literaturverzeichnis enthält alle Veröffentlichungen über Algorithmen zur Bildung der transitiven Hülle, welche den Verfassern bekannt sind.
    Notes: Abstract The paper contains results of computational experiences with the following algorithms for finding the transitive closure of a digraph: (i) Warshall's algorithm [17], (ii) Purdom's algorithm [13], (iii) the modification of Yen's algorithm [14], and (iv) the new algorithms for finding the transitive closure [3, 4]. The tested digraphs were generated at random. The enclosed references contain all papers known to the authors concerning transitive closure algorithms.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 45
    ISSN: 1436-5057
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Description / Table of Contents: Abstract In this paper Aireys converging factors of the exponential integral are transformed into an asymptotic expansion with remainder. This expansion is obtained by an Euler transformation of the remaining divergent series in analogy to the formal procedure due to Airey. The remainder termR N (z) is developed by Abels asymptotic principle. Transforming the terms of this series we get Aireys converging factors. Finally we improve the estimation of the remainder term which has been given by J. B. Rosser.
    Notes: Zusammenfassung In der vorliegenden Abhandlung werden die Aireyschen Konvergenzfaktoren für das Exponentialintegral zu einer asymptotischen Entwicklung mit Restglied umgeformt. Diese Entwicklung wird in Anlehnung an das Aireysche formale Herleitungsverfahren durch Eulersche Transformation der divergenten Restreihe gewonnen. Das RestgliedR N (z) seinerseits wird nach dem Prinzip der Abelschen Asymptotik entwickelt. Durch Umformen dieser Reihe erhält man die Aireyschen Konvergenzfaktoren; deren Restabschätzung nach J. B. Rosser wird in der vorliegenden Arbeit verbessert.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 46
    Electronic Resource
    Electronic Resource
    Springer
    Computing 15 (1975), S. 71-74 
    ISSN: 1436-5057
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Description / Table of Contents: Zusammenfassung Es werden einige Sätze über die Erhaltung der Eindeutigkeit von n-tupel-Sprachen präsentiert. Weiters wird der Begriff der „n-stratified” Mengen als Verallgemeinerung der von Ginsburg definierten „stratified” Mengen eingeführt und damit eine notwendige und hinreichende Charakterisierung der beschränkten eindeutigen n-tupel-Sprachen — in Analogie zu den beschränkten eindeutigen umgebungsunabhängigen Sprachen — angegeben.
    Notes: Abstract Several results concerning the preservation of unambiguity in n-tuple languages are presented here. Furthermore, the notion of n-stratified sets — as appropriate generalization of the straified sets defined by Ginsburg — is introduced and a necessary and sufficient characterisation result for bounded unambiguous n-tuple languages analogous to bounded unambiguous context free languages is given.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 47
    Electronic Resource
    Electronic Resource
    Springer
    Computing 15 (1975), S. 137-146 
    ISSN: 1436-5057
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Description / Table of Contents: Abstract If an Integral Equation is solved by Hermite Collocation we get essentially the same error bound as by using a more complicate method, supposed the collocation-points are suitably chosen. How to do this is one essential part of this paper. The discussion of numerical problems is confined to the case of linear problems.
    Notes: Zusammenfassung Gegenstand der Arbeit ist die Lösung nichtlinearer Integralgleichungen durch hermitesche Kollokation. Bei geeigneter Wahl der Kollokationsstellen —hierzu benötigen wir die Theorie der Gaußschen Quadraturformeln — ergibt sich praktisch dieselbe Genauigkeit wie bei komplizierteren Verfahren. Da nichtlineare Probleme bei der praktischen Rechnung meist linearisiert werden, beschränkt sich die Diskussion der numerischen Probleme auf den linearen Fall.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 48
    Electronic Resource
    Electronic Resource
    Springer
    Computing 15 (1975), S. 147-156 
    ISSN: 1436-5057
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Description / Table of Contents: Abstract Effective procedures for the decision whether two finite graphs are isomorphic or not make use of some information about the automorphism groups of these graphs. The paper deals with a systematic representation of this information and proposes an algorithm scheme for the determination of the automorphisms of a graph.
    Notes: Zusammenfassung Bekannte Verfahren zum Nachweis der Isomorphie zwischen zwei endlichen GraphenG undG′ benutzen Informationen über die Automorphismengruppen beider Graphen. Die vorliegende Arbeit befaßt sich mit einer systematischen Darstellung dieser Information und enthält ein Algorithmenschema zur Bestimmung der Automorphismen eines Graphen.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 49
    Electronic Resource
    Electronic Resource
    Springer
    Computing 15 (1975), S. 173-179 
    ISSN: 1436-5057
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Description / Table of Contents: Zusammenfassung Dieser Aufsatz fängt mit einer Untersuchung zweier besonderer Gestalten der Gauß-Turán-Quadratur des Chebyshev-Typs der Präzision 6n−1 an. Dann werden die Restformeln dieser Quadraturen entwickelt und scharfe Irrtumgrenzen für die Funktionen inC q [−1, 1] gezeigt, woq eine positive ganze Zahl ist. Am wichtigsten beweist diese Studie, daß diese Ergebnisse verlängert werden können, um die Resformeln und scharfe Irrtumsabschätzungen für alle solchen Quadraturen höherer Präzision zu erhalten.
    Notes: Abstract This paper begins with an investigation of two special forms of the Gauss-Turán quadrature of Chebyshev-type of precision 6n−1. Then the remainder formulas of these quadratures are developed and sharp error bounds for the functions inC q [−1, 1] are shown, whereq is a positive integer. Most importantly this study proves that these reslts can be extended in order to yield sharp error estimates for all such quadratures of higher precision.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 50
    Electronic Resource
    Electronic Resource
    Springer
    Computing 15 (1975), S. 205-216 
    ISSN: 1436-5057
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Description / Table of Contents: Abstract By Mac Leod there was presented an improved algorithm for the computation of cubic natural Splines with equi-spaced knots. In this paper his algorithm is extended to the case of type I and II L-Splines corresponding to operators of second order with constant coefficients and applied to a problem concerning the static deflection of beams.
    Notes: Zusammenfassung Mac Leod hat ein numerisch stabiles Verfahren zur Berechnung von kubischen natürlichen Polynom-Splines mit äquidistanten Knoten hergeleitet, das lediglich einen Rechenaufwand in der Größenordnung der Knotenanzahl erfordert. Sein Ansatz wird in dieser Arbeit auf den Fall von L-Splines vom Typ I und II zu Operatoren zweiter Ordnung mit konstanten Koeffizienten erweitert und auf eine dem Spline-Problem adäquate Fragestellung bei der statischen Biegung von Balken angewendet.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 51
    Electronic Resource
    Electronic Resource
    Springer
    Computing 15 (1975), S. 217-234 
    ISSN: 1436-5057
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Description / Table of Contents: Zusammenfassung Um einen natürlichen, von Kodierungen unabhängigen Vergleich zwischen primitiv-rekursiven Funktionen und Automatentransduktionen zu ermöglichen, werden die Grzegorczyk-Hierarchie, die Rekursionszahl-Hierarchie und die Loop-Hierarchie von arithmetischen auf Wortfunktionen verallgemeinert. Dabei ergeben sich einige Unterschiede zum arithmetischen Fall. Unter Benutzung von Turingmaschinen und verallgemeinerten endlichen Automaten werden alle Inklusionsprobleme der Funktionenklassen dieser Hierarchien gelöst. Von Automaten definierte Funktions- und Sprachklassen werden innerhalb dieser Hierarchien klassifiziert. Außerdem werden primitiv-rekursive Transformationen zwischen verschiedenen Monoiden behandelt.
    Notes: Abstract In order to compare primitive recursive functions and transductions defined by automata in a natural way independent of encodings, we generalize the Grzegorczyk hierarchy, the recursion number hierarchy and the loop hierarchy from arithmetical to wordfunctions. We observe several differences between the arithmetical and the non-arithmetical theory. By means of turingmachines and generalized sequential machines all inclusion problems for the function classes of these hierarchies are solved. Transductions and languages defined by automata are classified within these hierarchies. Moreover, we introduce and study primitive recursive transformations between different monoids.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 52
    Electronic Resource
    Electronic Resource
    Springer
    Computing 15 (1975), S. 275-286 
    ISSN: 1436-5057
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Description / Table of Contents: Abstract A method for the determination of Eigenvalues and Eigenvectors of symmetric non-hermitian matrices has been developed. This method is characterized by a “complex unitarity” of the transformation matrix. Thereby it is possible to extend the Jacobi procedure to symmetric non-hermitian matrices and to guarantee convergency.
    Notes: Zusammenfassung Es wird ein Verfahren zur Bestimmung der Eigenwerte und Eigenrichtungen von symmetrisch nicht-hermiteschen Matrizen entwickelt, das dadurch charakterisiert ist, daß für die auf die Matrix angewandte Transformation eine „Komplexe Unitarität” gefordert wird. So gelingt es, das Jacobi-Verfahren auf symmetrische nicht-hermitesche Matrizen zu erweitern und die Konvergenz zu gewährleisten.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 53
    Electronic Resource
    Electronic Resource
    Springer
    Computing 15 (1975), S. 311-328 
    ISSN: 1436-5057
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Description / Table of Contents: Abstract We derive explicit bounds for the termination index and for the error bound of algorithms as they were studied in part I. Furthermore, we analyze a relation between the theory of part I and the theory of Dahlquist.
    Notes: Zusammenfassung Es werden explizite Schranken angegeben für den Abbrechindex und für die Fehlerschranke von Algorithmen, wie sie in Teil I untersucht wurden. Weiterhin wird ein Zusammenhang zwischen der Theorie von Teil I und der Theorie von Dahlquist untersucht.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 54
    ISSN: 1436-5057
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 55
    Electronic Resource
    Electronic Resource
    Springer
    Computing 14 (1975), S. 1-3 
    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 ...
  • 56
    Electronic Resource
    Electronic Resource
    Springer
    Computing 14 (1975), S. 5-14 
    ISSN: 1436-5057
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Description / Table of Contents: Abstract Wir geben eine neue Methode für die Reduktion des Grades eines Intervallpolynoms. Es wird gezeigt, daß diese Methode besser ist als eine frühere Methode ([4] und [5]), wenn der Grad der Reduktion klein ist. Einige numerische Vergleiche und eine Anwendung auf Grenzwertprobleme werden angegeben.
    Notes: Abstract A new Method for reducing the degree of an interval polynomial is presented. The method is shown to be better than a previously suggested method ([4] and [5]) when the degree of the reduction is small. Some numerical comparisons and an application to a boundary value problem is given.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 57
    Electronic Resource
    Electronic Resource
    Springer
    Computing 14 (1975), S. 183-193 
    ISSN: 1436-5057
    Keywords: Complexity classes ; honesty classes ; honesty procedures ; naming theorem
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Description / Table of Contents: Zusammenfassung Ein wichtiges Ergebnis der Komplexitätstheorie ist der Umbenennungssatz von E. M. McCreight, der besagt, daß es einen Algorithmus σ gibt, der alle Namen ϕi des Systems der Komplexitätsklassen in neue Namen ϕσ(i) überführt, derart, daß die neuen Namen die Schrittmaßbedingung „λi,n,m[ϕσ(i)(n)≦m] entscheidbar” erfüllen. Unsere Untersuchung der „gutartigen Funktionenklassen” zeigt, daß ein entsprechender Umbenennungsalgorithmus für diese Klassen nicht existiert.
    Notes: Abstract An important result in the theory of complexity classes is the naming theorem of E. M. McCreight, which states that the system of complexity classes can be renamed uniformly by a measured set of names. Our investigation of honesty classes shows that for these classes the analogous assertion is false. No measured transformation of programs renames correctly all honesty classes.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 58
    Electronic Resource
    Electronic Resource
    Springer
    Computing 14 (1975), S. 213-223 
    ISSN: 1436-5057
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Description / Table of Contents: Abstract In analogy to the well known rudimentary predicates some predicates are considered which are constructed by logical operations from basic finite-automatondecidable attributes. It is shown that all sets of words definable by these predicates are regular. A similar results holds, if one changes to Σ-valued trees and finite automata on Σ-valued trees.
    Notes: Zusammenfassung In Analogie etwa zu den bekannten rudimentären Prädikaten werden Prädikate betrachtet, die man mit logischen Mitteln aus Anfangsprädikaten gewinnen kann, die von endlichen Automaten entscheidbar sind. Es wird gezeigt, daß die mit solchen Prädikaten definierbaren Wortmengen stets wieder regulär sind. Ein entsprechendes Resultat gilt auch für den Bereich der Σ-bewerteten Bäume und endlichen Automaten über diesem Bereich.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 59
    Electronic Resource
    Electronic Resource
    Springer
    Computing 14 (1975), S. 251-259 
    ISSN: 1436-5057
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Description / Table of Contents: Abstract The general duality theory of Rockafellar will be applied to some convex optimization problems in order to get duality, existence and characterization theorems for optimal solutions. Among other things, in this way one recovers some well-known results in a very simple manner.
    Notes: Zusammenfassung Die allgemeine Rockafellarsche Dualitätstheorie wird auf eine Reihe konvexer Optimierungsprobleme angewandt, um Dualitäts-, Existenz-und Charakterisierungssätze für Optimallösungen zu erhalten. Unter anderem werden auf diesem Wege einige schon bekannte Ergebnisse in sehr einfacher Weise wiedergewonnen.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 60
    Electronic Resource
    Electronic Resource
    Springer
    Computing 14 (1975), S. 313-314 
    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 ...
  • 61
    Electronic Resource
    Electronic Resource
    Springer
    Computing 14 (1975), S. 349-365 
    ISSN: 1436-5057
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Description / Table of Contents: Zusammenfassung In dieser Arbeit wird ein allgemeines Ringsystem untersucht. Eine Anzahl mit Speichern versehener Einheiten tauschen miteinander Daten über einen gemeinsamen Ringkanal aus. Dieser Kanal überträgt Daten nur in einer Richtung. Der Verkehr wird durch stationäre stochastische Prozesse mit unabhängigen Zuwächsen beschrieben. Die an den verschiedenen Einheiten auf die Übertragung wartenden Daten werden betrachtet. Die angenommene Warteschlangendisziplin gibt Daten mit längerem Übertragungsweg unterbrechende Prioritäten gegenüber Daten mit kürzerem Übertragungsweg. Für derartige Systeme werden die Erwartungswerte der Warteschlangenlängen und der Wartezeiten im stationären Zustand für alle Einheiten und Prioritätsklassen berechnet. Als hauptsächliches Hilfsmittel wird eine Äquivalenz zwischen einem allgemeinen Ringsystem und einem System von sehr viel einfacherer Struktur benutzt.
    Notes: Abstract This paper is concerned with general loop systems in which each of several buffered units may exchange data with any other unit via a single oneway loop channel. The traffic is described in terms of stationary stochastic processes with independent increments. The queues of data waiting for transmission which develop at the different units are investigated. The queueing discipline assumed here accords data with longer transmission paths preemptive priority over those with shorter paths. For such systems expected queue lengths and waiting times in the steady state are calculated for all units and priority classes. An equivalence is established between general loop systems and systems of a much simpler structure and is used in the derivation.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 62
    Electronic Resource
    Electronic Resource
    Springer
    Computing 15 (1975), S. 87-103 
    ISSN: 1436-5057
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Description / Table of Contents: Abstract A method to construct test matrices with free parameters is given. As an example of application a new test matrix of even order which is also appropriate to the eigenproblem is derived. Moreover some known test matrices with constant elements are generalized in such a way that they can be supplied with condition numbers of arbitrary order.
    Notes: Zusammenfassung Es wird eine Methode zur Konstruktion von Testmatrizen mit freien Parametern angegeben. Als Anwendungsbeispiel wird eine neue Testmatrix geradzahliger Ordnung hergeleitet, die auch für das Eigenwertproblem geeignet ist. Außerdem werden mehrere bekannte Testmatrizen mit konstanten Elementen so verallgemeinert, daß sie beliebig große Konditionszahlen annehmen können.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 63
    ISSN: 1436-5057
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Description / Table of Contents: Zusammenfassung Algorithmen zur numerischen Lösung von Steuerungsproblemen mit beschränkten Zustandsvariablen werden entwickelt. Zwei Fälle werden betrachtet: entweder tritt die Steuervariable nichtlinear auf oder sie tritt linear auf. Im ersten Fall wird gezeigt, daß eine Extremale, welche entweder die begrenzung berührt oder ein Stück auf der Begrenzung verläuft, Lösung eines geeigneten Zwei-Punkt-Randwertproblems ist. Im zweiten Fall wird eine numerische Idee beschrieben, welche eine numerische Lösung des Problems im Zustandsraum gestattet und auf die Lagrange-Multiplikatoren verzichtet. Drei numerische Beispiele werden diskutiert, welche die Effektivität der verschiedenen Algorithmen zeigen. Die dabei auftretenden Zwei-Punkt-Randwertprobleme werden mit der Mehrzielmethode gelöst.
    Notes: Abstract Algorithms for the numerical solution of optimal control problems with bounded state variables are developed. Two main cases are considered: either the control variable appears nonlinearly or the control variable appears linearly. In the first case, an extremal are touching the boundary or containing a boundary arc, is shown to satisfy a suitable two-point boundary value problem. In the second case, a numerical idea for solving the problem in statespace is presented which dispenses with the Lagrange-multipliers. Three numerical examples are discussed illustrating the efficiency of the different algorithms. The encountered two-point boundary value problems are solved with the method of multiple shooting.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 64
    Electronic Resource
    Electronic Resource
    Springer
    Computing 15 (1975), S. 157-167 
    ISSN: 1436-5057
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Description / Table of Contents: Abstract If the cutting plane method is applied formally to the computation of flows with minimal costs then repeatedly negative cycles have to be determined. Up to now this can be done only with algorithms which are relatively clumsy. A modification of the algorithm enables us to avoid the search of such cycles and to generate an effective algorithm. At the same time we obtain stimulations for other numerical procedures, e. g., it becomes apparent how to proceed, when the approximation of the (nonlinear) cost function is successively improved.
    Notes: Zusammenfassung Wendet man den Schnittebenenalgorithmus formal zur Bestimmung kostenminimaler Flüsse an, hat man wiederholt Zyklen mit negativer Bewertung zu bestimmen. Dies ist zur Zeit nur mit relativ schwerfälligen Algorithmen möglich. Es gelingt nun, den Algorithmus so zu modifizieren, daß die Suche solcher Zyklen vermieden wird und ein effektiver Algorithmus entsteht. Zugleich gewinnen wir Anregungen für andere Verfahren, so wird z. B. deutlich, wie man vorzugehen hat, wenn man die Approximation der Kostenfunktionen sukzessive verbessert.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 65
    Electronic Resource
    Electronic Resource
    Springer
    Computing 15 (1975), S. 181-193 
    ISSN: 1436-5057
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Description / Table of Contents: Zusammenfassung Ein beschränktes, konvexes PolyederP inR n wird meistens als Durchschnitt endlich vieler Halbräume beschrieben. Häufig bilden solche PolyederP den Restriktionenraum von Optimierungsaufgaben, die nur gelöst werden können, falls sämtliche Eckpunkte vonP bekannt sind. In diesem Artikel wird ein Algorithmus beschrieben, der unter Zuhilfenahme von Graphen und einer Idee von Mañas und Nedoma [2] diese Eckpunkte bestimmt. Anschiließen wird die erwartete Anzahl von Eckpunkten für die von Liebling [1] verwendeten Beispiele geschätzt.
    Notes: Abstract A bounded, convex polyhedronP inR n can be defined as the intersection of a finite number of halfspaces. Frequently, such polyhedronsP form the feasible regions of optimization problems; sometimes an optimum can only be determined when all vertices ofP are known. This paper describes an algorithm to enumerate these vertices with the help of graphs and a concept by Mañas and Nedoma [2]. Using this algorithm, it will be attempted to estimate the expected number of vertices of the examples employed by Liebling [1].
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 66
    Electronic Resource
    Electronic Resource
    Springer
    Computing 15 (1975), S. 235-246 
    ISSN: 1436-5057
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Description / Table of Contents: Abstract The convergence rate of the Chebyshev series of an analytic function depends on the singularities. In analgy to the Euler transformation we propose a method based on conformal mapping. By this means one obtains an improvement of the convergence rate and an enlargement of the domain where the series converges. In the special case of a linear transformation we find out a connection to the Euler-Knopp method. Finally we give applications to approximation problems and treat some examples.
    Notes: Zusammenfassung Das Konvergenzverhalten der Čebyšev-Entwicklung einer analytischen Funktion hängt von der Lage der Singularitäten ab. In Analogie zu den Euler-Verfahren schlagen wir ein konvergenzbeschleunigendes Verfahren vor, welches auf konformer Abbildung beruht. Dadurch erreicht man eine Vergrößerung des Konvergenzbereichs und eine Verbesserung der Konvergenzgüte. Besonders einfach läßt sich der Fall einer gebrochen linearen Abbildung behandeln, wo sich eine Verbindung zu den Euler-Knopp-Verfahren ergibt. Schließlich geben wir Anwendungen auf Approximationsprobleme und behandeln einige Beispiele.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 67
    Electronic Resource
    Electronic Resource
    Springer
    Computing 15 (1975), S. 287-290 
    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 ...
  • 68
    Electronic Resource
    Electronic Resource
    Springer
    Computing 15 (1975), S. 291-309 
    ISSN: 1436-5057
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Description / Table of Contents: Abstract We introduce the concept of a (numerical) algorithm and the following properties: consistency, local and global stability, numerical convergence. We exhibit classes of such algorithms with the following property: consistency and local stability together with a suitable termination criterion imply numerical convergence. It is shown that all known results in the literature may be deduced from two theorems on monotone algorithms.
    Notes: Zusammenfassung Es wird der Begriff des (numerischen) Algorithmus eingeführt und es werden dazu die folgenden Eigenschaften definiert: Konsistenz, lokale und globale Stabilität, numerische Konvergenz. Es werden Klassen solcher Algorithmen angegeben mit der folgenden Eigenschaft: Aus Konsistenz und lokaler Stabilität, zusammen mit einem passenden Abbrechkriterium, folgt numerische Konvergenz. Es wird gezeigt, daß alle bis heute bekannten Ergebnisse aus zwei Sätzen über monotone Algorithmen ableitbar sind.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 69
    Electronic Resource
    Electronic Resource
    Springer
    Computing 15 (1975), S. 347-355 
    ISSN: 1436-5057
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Description / Table of Contents: Zusammenfassung Die Quadraturformeln vom Clenshaw-Curtis Typ, die auf den “praktischen” Abszissenx k=cos(kπ/n),k=0(1)n, basieren, werden für die numerische Berechnung des Cauchyschen Hauptwerts $$\int\limits_{ - 1}^1 {(x - a)^{ - 1} } f(x) dx, - 1〈 a〈 1$$ , abgeleitet.
    Notes: Abstract Quadrature formulas of the Clenshaw-Curtis type, based on the “practical” abscissasx k=cos(kπ/n),k=0(1)n, are obtained for the numerical evaluation of Cauchy principal value integrals $$\int\limits_{ - 1}^1 {(x - a)^{ - 1} } f(x) dx, - 1〈 a〈 1$$ .
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 70
    Electronic Resource
    Electronic Resource
    Springer
    Mathematical programming 8 (1975), S. 390-390 
    ISSN: 1436-4646
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 71
    Electronic Resource
    Electronic Resource
    Springer
    Mathematical programming 8 (1975), S. 391-391 
    ISSN: 1436-4646
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 72
    ISSN: 1436-5057
    Keywords: 65 J ; 65 H
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Description / Table of Contents: Summary A generalization of the concept of a divided difference operator introduced by J. W. Schmidt is derived. The inclusion of solutions by certain Regula-falsi-methods realized by a well known approximation of the Jacobian matrix, which is no divided difference operator in the sense of Schmidt but a realization of this generalization, is proved.
    Notes: Zusammenfassung Durch Verallgemeinerung des von J. W. Schmidt eingeführten Steigungsbegriffes gelingt es, bei Durchführung gewisser Verfahren vom Regula-falsi-Typ mit einer naheliegenden und häufig verwendeten Approximation der Funktionalmatrix, die keine Steigung im herkömmlichen Sinne darstellt, jedoch eine Realisierung der oben genannten Verallgemeinerung liefert, Einschließungsaussagen für Lösungen von Operatorgleichungen nachzuweisen.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 73
    Electronic Resource
    Electronic Resource
    Springer
    Computing 26 (1981), S. 57-66 
    ISSN: 1436-5057
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Description / Table of Contents: Abstract An algorithm is proposed for computation of the exponential of a matrixX which uses the well known continued fraction expansion of tanhX. ForX essentially-nonnegative the following is proved: In interval arithmetic the algorithm is feasible, numerically convergent and bound conserving; after possibly a few initial steps it gives alternatively lower and upper bounds to the exact result.
    Notes: Zusammenfassung Es wird ein Algorithmus zur Berechnung der Exponentialfunktion von MatrizenX vorgeschlagen, der die Kettenbruch-Entwicklung von tanhX benutzt. IstX wesentlich-nichtnegativ, dann gilt: Der Algorithmus ist in Intervall-Arithmetik durchführbar, numerisch konvergent und schrankentreu; von einem Index an liefert er alternierend untere und obere Schranken für das exakte Ergebnis.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 74
    Electronic Resource
    Electronic Resource
    Springer
    Computing 26 (1981), S. 45-56 
    ISSN: 1436-5057
    Keywords: Order-convex operator ; Banach space ; Existence ; Convergence ; Operator equation ; partially ordered topological linear space ; 65J15 ; 47H17 ; 47H07
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Description / Table of Contents: Zusammenfassung SeiF:X→Y ein ordnungskonvexer Operator, woX, Y halbgeordnete Banachräume sind. Es werden zwei verwandte Verfahren zur Lösung der GleichungF(x)=0 diskutiert, von denen eines schon von Pasquali beschrieben worden ist (s. [2]), das andere von Wolfe [12]. Existenz- und Konvergenzsätze für diese Verfahren sind dargestellt und mit Hilfe von Beispielen illustriert. Ferner liegen einige Bemerkungen über ein Verfahren von Traub vor, das auch schon von Wolfe diskutiert worden ist [12].
    Notes: Abstract LetF:X→Y be an order-convex operator, whereX, Y are partially ordered Banach spaces. Two related methods for the solution ofF(x)=0 are discussed, one of which has been studied by Pasquali (see [2]) and the other by Wolfe [12]. Existence-convergence theorems for the methods are given, and these are illustrated with the aid of example. Some remarks are also made on a method due to Traub [7] which has also been discussed by Wolfe [12].
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 75
    Electronic Resource
    Electronic Resource
    Springer
    Computing 26 (1981), S. 19-31 
    ISSN: 1436-5057
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Description / Table of Contents: Zusammenfassung Gegeben sei ein Pseudo-Zufallszahlen-Generator, der gleichverteilte StichprobenU aus dem Intervall (0, 1) liefert, und eine statistische Verteilung, beschrieben durch ihre VerteilungsfunktionF(x). Dann erzeugt die InversionsmethodeX←F −1(U) Stichproben vonF(x). Ein Verfahren wird entwickelt, das “Guide”-Tafeln erstellt, mit dem Ziel, diese Inversion zu ermöglichen, so daß das Verfahren für beliebigeF(x) effizient wird. Für diskrete Verteilungen sind diese Tafeln klein und leicht zu erstellen, und der entstehende Stichproben-Algorithmus kann mit bekannten allgemeinen Verfahren gut konkurrieren. Stetige Verteilungen erfordern längere Vorbereitungszeiten und mehr Speicherplatz für die Tafeln. Diese werden mit Hilfe gegebener Wahrscheinlichkeitsdichtenf(x) vorbereitet. Die Methode ist anwendbar auf “vernünftige”f(x), einschließlich der normalerweise in der Statistik vorkommenden Fälle. Aufgrund der angeführten Rechenerfahrung mit Poisson-, Normal-, Gamma- und Cauchy-Verteilungen zeigt sich, daß unser allgemeines Verfahren fast so schnell ist, wie die besten bekannten Methoden, die speziell auf diese Verteilungen zugeschnitten wurden.
    Notes: Abstract Given a basic pseudo-random number generator which returns uniformly distributed samplesU from the interval (0, 1) and a statistical distribution as defined by its distribution functionF(x). Then the inversion methodX←F −1 (U) produces samples fromF(x). A procedure is developed which prepares “guide tables” in order to facilitate this inversion so that sampling becomes efficient for arbitraryF(x). For discrete distributions these tables are small and easy to set up, and the resulting sampling algorithm compares well with known general methods. Continuous distributions require longer set-up times and more space for tables. These are prepared using given probability densitiesf(x). The method can cope with “reasonable”f(x) including most cases which are commonly encountered in statistics. The reported computational experience, on Poisson, Normal, Gamma and Cauchy distributions, indicates that our general routine is almost as fast as the best known sampling algorithms which were specially designed for these distributions.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 76
    Electronic Resource
    Electronic Resource
    Springer
    Computing 26 (1981), S. 67-71 
    ISSN: 1436-5057
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Description / Table of Contents: Zusammenfassung Die Berechnung von beliebigen Funktionen dreieckiger Matrizen ist rekursiveweise ermöglicht mittels einfacher Eigenschaften, dagelegt in diesem Bericht.
    Notes: Abstract Any function of a triangular matrix can be recursively calculated on the basis of simple properties stated in this paper.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 77
    Electronic Resource
    Electronic Resource
    Springer
    Computing 26 (1981), S. 73-77 
    ISSN: 1436-5057
    Keywords: Cauchy type singular integral equations ; natural interpolation formulae ; Gauss-Chebyshev quadrature rule ; Nyström (quadrature) method for integral equations ; direct numerical solution of Cauchy type singular integral equations ; Primary: 65R20 ; Secondary: 45E05, 45L10, 65D05
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Description / Table of Contents: Zusammenfassung Eine singuläre Integralgleichung erster Art vom Cauchy-Typ kann entweder direkt, mittels einer Gaußschen numerischen Integrationsformel, oder durch Reduktion auf eine äquivalente Fredholmsche Integralgleichung zweiter Art, wo die Nyström-Methode anwendbar ist, gelöst werden. In dieser Arbeit wird bewiesen, daß unter geeigneten und sinnvollen Bedingungen die Ausdrücke der unbekannten Funktion der Integralgleichung, die einerseits bei den natürlichen Integrationsformeln der direkten Methode und anderseits bei der Nyström-Methode entstehen, im ganzen Integrationsintervall gleich sind.
    Notes: Abstract A Cauchy type singular integral equation of the first kind can be numerically solved either directly, through the use of a Gaussian numerical integration rule, or by reduction to an equivalent Fredholm integral equation of the second kind, where the Nyström method is applicable. In this note it is proved that under appropriate but reasonable conditions the expressions of the unknown function of the integral equation, resulting from the natural interpolation formulae of the direct method, as well as of the Nyström method, are identical along the whole integration interval.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 78
    Electronic Resource
    Electronic Resource
    Springer
    Computing 26 (1981), S. 79-82 
    ISSN: 1436-5057
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Description / Table of Contents: Zusammenfassung Es werden notwendige und hinreichende Bedingungen für das Problem der linearen Optimierung mit Intervallkoeffizienten angegeben, bei denen jedes Problem der linearen Optimierung, dessen Koeffizienten in gegebenen Intervallen fixiert werden, eine optimale Lösung besitzt.
    Notes: Abstract Necessary and sufficient conditions for a linear programming problem whose parameters (both in constraints and in the objective function) are prescribed by intervals are given under which any linear programming problem with parameters being fixed in these intervals has a finite optimum.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 79
    Electronic Resource
    Electronic Resource
    Springer
    Computing 26 (1981), S. 87-89 
    ISSN: 1436-5057
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Description / Table of Contents: Zusammenfassung Tseitin [3] und Galil [1] haben gezeigt, daß es in der Aussagenlogik für unendlich vielen KlausenmengenS(n) der Längen gibt, so daß jeder reguläre Resolutionsbeweis fürS(n) mindestens 2 cn (für einec〉0) verschiedene Klausen enthält. Wir geben hier einen einfacheren Beweis für die viel schwächere aber dennoch nichtpolynomiale Schranke 2 clog 2 n an.
    Notes: Abstract Tseitin [3] and Galil [1] have proven that for infinitely manyn there is a set of clausesS(n) of the propositional calculus of lengthn such that any regular resolution proof ofS(n) produces at least 2 cn distinct new clauses for somec〉0. We show that it is possible to obtain a much weaker but still non-polynomial bound of 2 clog 2 n by a simpler argument.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 80
    Electronic Resource
    Electronic Resource
    Springer
    Computing 26 (1981), S. 83-86 
    ISSN: 1436-5057
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Description / Table of Contents: Zusammenfassung Wir wenden den Satz, daß für eine Segmentfunktionf, deren SegmentableitungD(f) auf dem Segment [0, 1] von oben beschränkt ist, der Hausdorff-Abstand zwischenD(f) und der Ableitung eines linearen Operators durch den Modul derH-Stetigkeit vonD(f) und Konstante nach oben beschränkt ist, an auf Bernstein-Polynome und Mirakyan-Szász-Operatoren.
    Notes: Abstract Given a segment functionf, whose segment-derivative is bounded from above on the segment [0, 1] we applicate the theorem, that the Hausdorff distance betweenD(f) and the derivative of a linear operator is bounded from above by the modulus of H-continuity ofD(f) and some constants, to Bernstein polynomials and Mirakyan-Szász-operators.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 81
    Electronic Resource
    Electronic Resource
    Springer
    Computing 26 (1981), S. 91-105 
    ISSN: 1436-5057
    Keywords: 65N20 ; Adaptive mesh refinement ; multigrid methods ; finite element methods
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Description / Table of Contents: Zusammenfassung Das Unterprogramm PLTMG ist ein FORTRAN-Programm zur Lösung selbstadjungierter elliptischer Randwertprobleme für beliebige Bereiche desR 2. Es basiert auf einer stückweise-linearen Finite-Element-Methode, einer adaptiven Gitterverfeinerungsmethode und einer mehrstufigen iterativen Methode zur Lösung des resultierenden Systems linearer Gleichungen. In dieser Arbeit wird die Methode beschrieben, und einige numerische Ergebnisse und Vergleiche werden dargelegt.
    Notes: Abstract Subroutine PLTMG is a Fortran program for solving self-adjoint elliptic boundary value problems in general regions ofR 2. It is based on a piecewise linear triangle finite element method, an adaptive grid refinement procedure, and a multi-level iterative method to solve the resulting sets of linear equations. In this work we describe the method and present some numerical results and comparisons.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 82
    ISSN: 1436-5057
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Description / Table of Contents: Zusammenfassung Die Benutzung algebraischer Eigenwerte zur näherungsweisen Berechnung der Eigenwerte von Sturm-Liouville-Operatoren ist bekanntlich nur für die Grundschwingung und einige weitere Harmonische zufriedenstellend. In dieser Arbeit zeigen wir, wie man den asymptotischen Fehler, der bei verwandten aber einfachen Sturm-Liouville-Operatoren auftritt, dazu benutzen kann, um gewisse Klassen algebraischer Eigenwerte so zu korrigieren, daß die gleichmäßig gute Approximationen liefern.
    Notes: Abstract The use of algebraic eigenvalues to approximate the eigenvalues of Sturm-Liouville operators is known to be satisfactory only when approximations to the fundamental and the first few harmonics are required. In this paper, we show how the asymptotic error associated with related but simpler Sturm-Liouville operators can be used to correct certain classes of algebraic eigenvalues to yield uniformly valid approximations.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 83
    Electronic Resource
    Electronic Resource
    Springer
    Computing 26 (1981), S. 107-121 
    ISSN: 1436-5057
    Keywords: Primary: 65 H ; Secondary: 47 H ; Turning points ; Newton-like methods ; continuation methods ; local convergence
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Description / Table of Contents: Zusammenfassung Die RaumkurveL werde implizit durch das nichtlineare (n, n+1)-SystemH(u)=0 definiert. Es wird ein neues direktes Newton-ähnliches Verfahren zur Bestimmung der Rückkehrpunkte vonL beschrieben, das pro Schritt lediglich die Berechnung einer Jacobimatrix und 5 Funktionswerten vonH erfordert. Außerdem ist pro Schritt ein lineares Gleichungssystem der Dimensionn+1 mit 4 verschiedenen rechten Seiten zu lösen. Unter passenden voraussetzungen wird die lokale undQ-quadratische Konvergenz des Verfahrens bewiesen, sofern eine gewisse Diskretisierungsschrittweise geeignet gewählt wird. Zwei numerische Beispiele bestätigen die theoretischen Resultate.
    Notes: Abstract Let the space curveL be defined implicitly by the (n, n+1) nonlinear systemH(u)=0. A new direct Newton-like method for computing turning points ofL is described that requires per step only the evaluation of one Jacobian and 5 function values ofH. Moreover, a linear system of dimensionn+1 with 4 different right hand sides has to be solved per step. Under suitable conditions the method is shown to converge locally withQ-order two if a certain discretization stepsize is appropriately chosen. Two numerical examples confirm the theoretical results.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 84
    Electronic Resource
    Electronic Resource
    Springer
    Computing 26 (1981), S. 155-166 
    ISSN: 1436-5057
    Keywords: decomposable searching problem ; dynamization ; merging ; quad-trees ; k-d trees ; halfspaces ; maximal elements
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Description / Table of Contents: Zusammenfassung Wir definieren zwei Klassen zerlegbarer Suchprobleme und untersuchen, wie man diese Probleme effizient dynamisch lösen könnte. Für die erste Klasse (DD) zeigen wir, daß man sowohl das Einfügen als auch das Streichen von einzelnen Elementen im Zeitmittel effizient durchführen kann. Für die zweite Klasse (MD) zeigen wir zudem, daß man mit der Benützung einer schnellen Mischungsprozedur die Effizienz noch um ein wenig verbessern kann. Alss Anwendungen zeigen wir z. B. die effiziente Dynamisierung von Quadbäumen und vom gemeinsamen Durchschnitt endlich vieler Halbebenen in der Ebene.
    Notes: Abstract We define two classes of decomposable searching problems and consider ways of efficiently dynamizing them. For the first class, DD, we show that both insertions and deletions can be processed efficiently. For the second class, MD, we exploit a merge technique to obtain better insertion times. We also give a number of examples of problems to which the methods apply, including the dynamic maintenance of quadtrees and of the common intersection of finitely many halfspaces in the plane.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 85
    ISSN: 1436-5057
    Keywords: 90C30 ; 65K05 ; Nonlinear programming algorithms ; penalty algorithms
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Description / Table of Contents: Zusammenfassung Diese Arbeit beschreibt einen Algorithmus zur Minimierung einer nichtlinearen Funktion mit nichtlinearen Ungleichungen und Gleichungen als Nebenbedingungen. Die vorgeschlagene Methode hat die Eigenschaft, daß sie unter schwachen Voraussetzungen gegen einen Kuhn-Tucker-Punkt des betrachteten Optimierungsproblems konvergiert und unter stärkeren Voraussetzungen eine quadratische Konvergenzgeschwindigkeit aufweist. Ähnlich wie eine vor kurzem von Rosen vorgeschlagene Methode benutzt der Algorithmus eine Straffunktion, um einen Punkt in der Nähe der optimalen Lösung zu berechnen und schaltet dann auf Robinsons Methode um. Die neue Methode hat gegenüber dem Verfahren von Rosen zwei neue Eigenschaften. Erstens wird der richtige Wert des Parameters in der Straffunktion automatisch gefunden. Zweitens enthalten die mit der Methode von Robinson gelösten Teilprobleme nur lineare Gleichungen als Nebenbedingungen. Die Teilprobleme können daher besonders leicht gelöst werden. Vorläufige numerische Ergebnisse werden berichtet.
    Notes: Abstract This paper presents an algorithm for the minimization of a nonlinear objective function subject to nonlinear inequality and equality constraints. The proposed method has the two distinguishing properties that, under weak assumptions, it converges to a Kuhn-Tucker point for the problem and under somewhat stronger assumptions, the rate of convergence is quadratic. The method is similar to a recent method proposed by Rosen in that it begins by using a penalty function approach to generate a point in a neighborhood of the optimum and then switches to Robinson's method. The new method has two new features not shared by Rosen's method. First, a correct choice of penalty function parameters is constructed automatically, thus guaranteeing global convergence to a stationary point. Second, the linearly constrained subproblems solved by the Robinson method normally contain linear inequality constraints while for the method presented here, only linear equality constraints are required. That is, in a certain sense, the new method “knows” which of the linear inequality constraints will be active in the subproblems. The subproblems may thus be solved in an especially efficient manner. Preliminary computational results are presented.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 86
    Electronic Resource
    Electronic Resource
    Springer
    Computing 26 (1981), S. 209-225 
    ISSN: 1436-5057
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Description / Table of Contents: Zusammenfassung Es wird gezeigt, wie das probabilistische Konzept der Stoppzeit eines Zufallsprozesses für eine iterative Methode zur Lösung eines Systems linearer Gleichungen herangezogen werden kann. Alle bekannten iterativen Näherungsmethoden zur Lösung linearer Gleichungssysteme, wie z. B. die Blockmethoden nach Jakobi und Gauss-Seidel und Überrelaxationsmethoden, entsprechen verschieden gewählten Stoppzeiten. Das probabilistische Verfahren bietet die Möglichkeit, Lösungstechniken für die spezielle Struktur des Problems zu adaptieren. Darüber hinaus führen die vorgeschlagenen Methoden zu einer schnelleren Konvergenz.
    Notes: Abstract In this paper it is demonstrated how the probabilistic concept of a stopping time in a random process may be used to generate an iterative method for solving a system of linear equations. Actually all known iterative approximation methods for solving linear equations are generated by various choices of a stopping time e. g. the point and block Jacobi methods, the point and block Gauss-Seidel Methods and overrelaxation methods are covered. The probabilistic approach offers—in a natural way—the possibility of adapting the solution technique to the special structure of the problem. Moreover, posterior bounds for the solution are constructed, which lead to faster convergence of the approximations than with usual prior bounds.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 87
    Electronic Resource
    Electronic Resource
    Springer
    Computing 26 (1981), S. 227-237 
    ISSN: 1436-5057
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Description / Table of Contents: Zusammenfassung In dieser Arbeit werden mehrere systematische Möglichkeiten angegeben, die es erlauben, bei der Verwendung der intervallmäßigen Auswertung der Ableitung in Iterationsverfahren gewisse Intervalle durch reelle Zahlen zu ersetzen. Dadurch wird im allgemeinen die Konvergenz beschleunigt. Die gleiche Problemstellung wurde bereits von einem anderen Ausgangspunkt ausgehend in [5] betrachtet.
    Notes: Abstract We discuss several systematic possibilities for removing certain intervals when using an interval expression of the derivative in iterative methods. In general, the speed of convergence is accelerated in this way. Starting from a different point of view the same problem has been treated recently in [5].
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 88
    Electronic Resource
    Electronic Resource
    Springer
    Computing 26 (1981), S. 239-246 
    ISSN: 1436-5057
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Description / Table of Contents: Zusammenfassung Es werden charakteristische Eigenschaften solcher Approximationen gegeben. Ein Algorithmus, der gute, aber nicht unbedingt beste Approximationen liefert, wird diskutiert.
    Notes: Abstract Characteristic properties of such approximations are given. An algorithm providing good, but not necessarily best, approximations is also discussed.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 89
    Electronic Resource
    Electronic Resource
    Springer
    Computing 26 (1981), S. 247-256 
    ISSN: 1436-5057
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Description / Table of Contents: Zusammenfassung In dieser Arbeit werden sämtliche Nyström-Methoden fünfter Ordnung füry″=f(x, y) angegeben, welche vier Funktionsauswertungen pro Schritt benötigen. Es wird gezeigt, daß sich darunter nur eine einzige mit einem nichtleeren Periodizitätsintervall befindet.
    Notes: Abstract In this paper all fifth order Nyström methods fory″=f(x, y) based on four evaluations off are presented. Furthermore, we prove that out of these methods there is only one with a non-vanishing interval of periodicity.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 90
    Electronic Resource
    Electronic Resource
    Springer
    Computing 26 (1981), S. 271-274 
    ISSN: 1436-5057
    Keywords: 65 G 10 ; Differentiation ; interval valued functions
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Description / Table of Contents: Abstract This paper is concerned with relations between several versions of differentiation of interval valued functions.
    Notes: Zusammenfassung Es werden Beziehungen zwischen verschiedenen Ableitungsbegriffen für intervallwertige Funktionen angegeben.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 91
    Electronic Resource
    Electronic Resource
    Springer
    Computing 26 (1981), S. 315-326 
    ISSN: 1436-5057
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Description / Table of Contents: Zusammenfassung Es wird eine einfache, aber wirkungsvolle Methode zur exakten Lösung eines nichtlinearen Gleichungssystems, dessen Funktionalmatrix in der Lösung singulär ist, vorgestellt. Dies wird durch eine Vergrößerung des Gleichungssystems zu einem höherdimensionalen Gleichungssystem, dessen entsprechende Lösung isoliert ist, erreicht. Diese Lösung kann daher z. B. mit dem Newton-Verfahren, das lokal mindestens quadratisch konvergent und selbstkorrigierend ist, mit großer Genauigkeit bestimmt werden.
    Notes: Abstract A simple but efficient method to obtain accurate solutions of a system of nonlinear equations with a singular Jacobian at the solution is presented. This is achieved by enlarging the system to a higher dimensional one whose solution in question is isolated. Thus it can be computed e. g. by Newton's method, which is locally at least quadratically convergent and selfcorrecting, so that high accuracy is attainable.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 92
    ISSN: 1436-5057
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Description / Table of Contents: Zusammenfassung In numerischen Rechnungen treten neben den ganzen Zahlen häufig auch reelle und komplexe Zahlen, reelle und komplexe Intervalle sowie Vektoren und Matrizen über diesen Mengen auf. In der vorliegenden Arbeit erweitern wir die ProgrammierspracheFORTRAN so, daß Ausdrücke mit Operanden und Operatoren für all diese Typen (Datenmengen) akzeptiert werden. Wir beginnen mit einer kurzen Zusammenstellung dieser Räume und der arithmetischen Verknüpfungen in den Teilmengen, welche auf einem Rechner darstellbar sind. Es folgt dann eine allgemeine Beschreibung der Spracherweiterung sowie der neuen Standardfunktionen und Standardformelfunktionen für die zusätzlichen Datentypen. Im zweiten Teil der Arbeit geben wir dann die vollständige Syntax für die erweiterte Sprache in Form von leicht lesbaren Syntaxdiagrammen an. Wir erläutern auch die Semantik der Spracherweiterung.
    Notes: Abstract In addition to the integers, the real and complex numbers, the real segments (intervals) and complex segments as well as vectors and matrices over all of these comprise the fundamental data types in computation. We extendFORTRAN so that it accepts operands and operators for all of these types as primitives in expressions. We briefly review the spaces corresponding to these data types and the definitions of the arithmetic operations in their computer representable subsets. Then we give a general description of the language extension including the additional basic external functions and intrinsic functions for the new data types. Following this we give the syntax for the extended language in the form of easily traceable syntax diagrams. Comments on the semantics are also included.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 93
    Electronic Resource
    Electronic Resource
    Springer
    Computing 26 (1981), S. 327-332 
    ISSN: 1436-5057
    Keywords: 65 N 20 (Numerical solution of nonlinear boundary value problems)
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Description / Table of Contents: Abstract For nonlinear SOR-methods (Newton-SOR-methods) we discuss the problem how to get asymptotic optimal relaxation parameters ω(v). Here the matrix of the linear system at each step of iteration has not to be consistently ordered, we only assume symmetry and definitness. Our parameters are easy to compute and fixed for all steps. As an example nonlinear elliptic differential equations and their numerical solution by the finite element method or classical difference approximation are considered.
    Notes: Zusammenfassung Für nichtlineare SOR-Verfahren (Newton-SOR-Verfahren) wird ein einfaches Verfahren zur Berechnung asymptotisch optimaler Relaxationsparameter ω(v) erörtert. Hierbei muß die Matrix des in jedem Iterationsschritt auftretenden linearen Gleichungssystems nicht notwendig konsistent geordnet sein, wir setzen nur Symmetrie und Definitheit voraus. Es zeigt sich, daß die Parameter unabhängig von der jeweiligen Iterationsstufe ν gewählt werden können. Ihre Berechnung wird im Zusammenhang mit der numerischen Lösung nichtlinearer elliptischer Differentialgleichungen vermittels der Methode der finiten Elemente oder der klassischen Differentenapproximation diskutiert.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 94
    Electronic Resource
    Electronic Resource
    Springer
    Computing 26 (1981), S. 333-342 
    ISSN: 1436-5057
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Description / Table of Contents: Zusammenfassung Für Folgen aus einem iterativen Näherungsverfahren, die einem mit Hilfe von Potenzfunktionen beschreibbaren System von Ungleichungen genügen, wird gezeigt, daß ihre R-Ordnung mindestens gleich dem Spektralradius der Matrix aus den Exponenten ist, sofern ein zum Spektralradius gehörender Eigenvektor mit ausschließlich positiven Komponenten existiert.
    Notes: Abstract The R-order of sequences, coupled by a system (1) of difference inequalities, is shown to be at least equal to the spectral radius of the matrix of the exponents if a positive eigenvector belonging to the spectral radius exists.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 95
    Electronic Resource
    Electronic Resource
    Springer
    Computing 26 (1981), S. 355-360 
    ISSN: 1436-5057
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Description / Table of Contents: Zusammenfassung Es wird gezeigt, daß die Sicherheit eines Programmes für gewöhnliche Differentialgleichungen durch einen einfachen Trick wesentlich erhöht werden kann. Mit Hilfe dieser Idee und einer A-stabilen Rosenbrock-Formel haben wir ein kleines Programm geschrieben, welches gute numerische Resultate liefert.
    Notes: Abstract This note points out that the reliability of step-by-step integrators for ordinary differential equations can be increased considerably by a simple trick. We incorporated this idea into a program based on an A-stable Rosenbrock formula. This program comprises about 100 statements only and gives good numerical results.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 96
    Electronic Resource
    Electronic Resource
    Springer
    Computing 26 (1981), S. 361-366 
    ISSN: 1436-5057
    Keywords: Convex hull ; average complexity ; geometrical complexity ; algorithms
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Description / Table of Contents: Zusammenfassung Wir betrachtenn als unabhängig identisch verteilte Zufallsvektoren imR d mit der gemeinsamen Verteilungsdichtef. Die mittlere Konvexität eines Algorithmus zur Bestimmung der konvexen Hülle dieser Punkte seiE (C). Die meisten bekannten Algorithmen genügen für gewisse Klassen von Dichten der BedingungE (C)=0(n). In dieser Mitteilung zeigen wirE (C)=0(n) für Algorithmen, die im Vorlauf einen „Wegwerf-Schritt” benützen, wennf auf jedem nicht ausgearteten Rechteck desR 2 beschränkt ist und positiven Abstand von 0 besitzt.
    Notes: Abstract Considern independent identically distributed random vectors fromR d with common densityf, and letE (C) be the average complexity of an algorithm that finds the convex hull of these points. Most well-known algorithms satisfyE (C)=0(n) for certain classes of densities. In this note, we show thatE (C)=0(n) for algorithms that use a “throw-away” pre-processing step whenf is bounded away from 0 and ∞ on any nondegenerate rectangle ofR 2.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 97
    Electronic Resource
    Electronic Resource
    Springer
    Computing 26 (1981), S. 367-378 
    ISSN: 1436-5057
    Keywords: Searchtrees ; 1–2 brother trees ; insertion ; deletion ; implementation ; PASCAL
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Description / Table of Contents: Zusammenfassung Es wird eine PASCAL-Implementierung der Einfüge- und Entferne-Algorithmen für 1–2-Bruder-Bäume entwickelt. Die Implementierung ist nicht nur an sich interessant, sondern führte darüberhinaus zu einer Verbesserung des Entferne-Algorithmus.
    Notes: Abstract We derive an implementation in PASCAL of the insertion and deletion algorithms for 1–2 brother trees. The implementation is of interest not only in its own right but also in that it has given rise to an improved deletion algorithm.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 98
    ISSN: 1436-5057
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Description / Table of Contents: Zusammenfassung Direkte Methoden zur Lösung von singulären Integralgleichungen vom Cauchy-Typus (S. I. G.) beruhen auf der Gaussschen Regel für numerische Integration, wobei die S. I. G. durch Anwendung der resultierenden Funktionalgleichung an geeignet gewählten Kollokationspunkten auf ein lineares Gleichungssystem reduziert wird. In diesem Artikel wurde die Äquivalenz dieser Methode mit derjenigen, welche auf der Lagrangeschen Interpolations-Approximation der unbekannten Funktion, beruht, gezeigt. Indirekte Methoden zur Lösung von S. I. G. können durch Anwendung derselben numerischen Regel an der Fredholmschen Integralgleichung, auf welche die S. I. G. reduziert wird, erhalten werden. In diesem Artikel wurde gezeigt, daß beide Methoden, im Sinne, daß sie dieselben numerischen Resultate liefern, äquivalent sind. Schließlich wurde mit Hilfe dieser Resultate der, Fehler und die Konvergenz der Methoden festgestellt.
    Notes: Abstract Direct methods for solving Cauchy-type singular integral equations (S.I.E.) are based on Gauss numerical integration rule [1] where the S.I.E. is reduced to a linear system of equations by applying the resulting functional equation at properly selected collocation points. The equivalence of this formulation with the one based on the Lagrange interpolatory approximation of the unknown function was shown in the paper. Indirect methods for the solution of S. I. E. may be obtained after a reduction of it to an equivalent Fredholm integral equation and an application of the same numerical technique to the latter. It was shown in this paper that both methods are equivalent in the sense that they give the same numerical results. Using these results the error estimate and the convergence of the methods was established.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 99
    Electronic Resource
    Electronic Resource
    Springer
    Computing 27 (1981), S. 113-121 
    ISSN: 1436-5057
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Description / Table of Contents: Zusammenfassung Es wird eine Verallgemeinerung, der Methode von Walker für den Fall kontinuierlicher Verteilungen präsentiert. Die vorgeschlagene Methode arbeitet nach dem Rückweisungsverfahren, verwendet aber alle erzeugten Zufallswerte. Die Anwendung des Verfahrens auf den Generator für normalverteilte Zufallszahlen nach Kinderman und Ramage ergibt einen Algorithmus, der zum Algorithmus FL5 von Ahrens und Dieter äquivalent ist.
    Notes: Abstract A generalization of the Walker's method is presented for the case of continuous distributions. The proposed method is similar to the rejection technique but makes use of all the generated values. Application of the method for a normal random number generator of Kinderman and Ramage resulted in an algorithm that is equivalent to the FL5 procedure of Ahrens and Dieter.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 100
    Electronic Resource
    Electronic Resource
    Springer
    Computing 27 (1981), S. 137-144 
    ISSN: 1436-5057
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Description / Table of Contents: Zusammenfassung Es wird eine Modifikation des Krawczyk-OperatorsK(X) zur Einschließung von Lösungen nichtlinearer Gleichungssysteme behandelt. Wenn für mindestens eine Komponentei die EinschließungK i (X)⊂int (X i ) gilt, kann der OperatorK(X) verbessert werden. Außerdem wird das verbesserte Verfahren mit anderen Modifikationen verglichen.
    Notes: Abstract A variation of the Krawczyk operator for including the solutions of a nonlinear system is introduced here. It improves the Krawczyk operatorK (X) wheneverK i (X)⊂int (X i ) for somei. A comparison with other variations is also given.
    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...