


default search action
Computing, Vol. 33, 1984
Volume 33, Number 1, 1984
- Selim G. Akl:

Optimal parallel algorithms for computing convex hulls and for sorting. 1-11 - Georg Lausen:

Integrated Concurrency Control in Shared B-Trees. 13-26 - Ljiljana D. Petkovic, Miodrag S. Petkovic:

On the k-th root in circular arithmetic. 27-35 - Wolfgang Burmeister, Jochen W. Schmidt:

Determination of the cone radius for positive concave operators. 37-49 - Tjalling J. Ypma:

Difference Newton-like methods under weak continuity conditions. 51-64 - Igor Moret:

A note on Newton type iterative methods. 65-73 - Siegfried Dietze:

An example for the regula-falsi method with an asymptotic cycle. 75-81 - Georg Brügner:

Rounding error analysis of interpolation procedures. 83-87 - Donald E. Knuth:

An algorithm for Brownian zeroes. 89-94
Volume 33, Number 2, 1984
- Ulrich Derigs:

Alternate strategies for solving bottleneck assignment problems - analysis and computational results. 95-106 - Reinhard Frank, F. Macsek, Christoph W. Ueberhuber:

Interated defect correction for differential equations part II: Numerical experiments. 107-129 - Karl Strehmel, Rüdiger Weiner:

Lokale Fehlerschätzung mittels modifizierter Richardson-Extrapolation in linear impliziten Einschrittverfahren. 131-140 - Karl-Udo Jahn:

Maximale Fixpunkte von Intervallfunktionen. 141-151 - Hartmut Schwandt:

A symmetric iterative interval method for systems of nonlinear equations. 153-164 - Götz Alefeld:

The centered form and the mean value form - a necessary condition that they yield the range. 165-169 - Wolfgang Böhm:

Efficient evaluation of splines. 171-177 - Tetsuro Yamamoto:

The Symm-Wilkinson method for improving an approximate eigenvalue and its associated eigenvector. 179-184 - Marinus van Veldhuizen:

Asymptotic expansions of the global error for the implicit midpoint rule (stiff case). 185-192
Volume 33, Numbers 3-4, 1984
- Zbigniew J. Czech:

A region analysis algorithm for the live variables problem. 193-210 - Gottfried Tinhofer, Helmut Schreck:

Linear time tree codes. 211-225 - Hans Tzschach:

M-Vollständigkeit von Warteschlangensystemen. 227-235 - Gerhard West:

Eine schnelle Mellin-Transformation. 237-245 - Luc Devroye:

A simple algorithm for generating random variates with a log-concave density. 247-257 - Robert S. Anderssen, Frank R. de Hoog:

Finite difference methods for the numerical differentiation of non-exact data. 259-267 - Ulrich Lamp, Klaus Thomas Schleicher, Ernst Peter Stephan

, Wolfgang L. Wendland:
Galerkin collocation for an improved boundary element method for a plane mixed boundary value problem. 269-296 - Jan G. Verwer, Jesús María Sanz-Serna

:
Convergence of method of lines approximations to partial differential equations. 297-313 - Dao-qi Chen, Reginald P. Tewarson:

A quasi-Newton method with sparse triple factorization for unconstrained minimization. 315-329 - H. Cornelius, Rudolf Lohner:

Computing the range of values of real functions with accuracy higher than second order. 331-347 - Manfred R. Trummer

:
A note on the ART of relaxation. 349-352 - José Mario Martínez

:
A Quasi-Newton method with modification of one column per iteration. 353-362 - Georgios Akrivis, Klaus-Jürgen Förster:

On the definiteness of quadrature formulae of Clenshaw-Curtis type. 363-366 - Rainer Ansorge:

Connections between the Cimmino-method and the Kaczmarz-method for the solution of singular and regular systems of equations. 367-375

manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.


Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID














