Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDComputing, Volume 28
Volume 28, Number 1, 1982
- Yehuda Wallach:
Alternating sequential-parallel calculation of eigenvalues for symmetric matrices. 1-16 - Jon G. Rokne, T. Wu:
The circular complex centered form. 17-30 - Edgar Kaucher, Siegfried M. Rump:
E-methods for fixed point equations f(x)=x. 31-42 - Wolf-Jürgen Beyn, Jens Lorenz:
Spurious solutions for discrete superlinear boundary value problems. 43-51 - Heribert Blum, Manfred Dobrowolski:
On finite element methods for elliptic equations on domains with corners. 53-63 - Karl Hans Müller:
A recurrence for Dirichlet problems. 65-68 - John B. Kioustelidis:
Monotonicity of the error of optimal segmented approximations. 69-74 - Charles B. Dunham:
Remez algorithm for Chebyshev approximation with interpolation. 75-78 - Wolfgang Mönch:
Iterative refinement of approximations to a generalized inverse of a matrix. 79-87
Volume 28, Number 2, 1982
- H. Leuprecht, Wilhelm Oberaigner:
Parallel algorithms for the rounding exact summation of floating point numbers. 89-104 - Helmut Ratschek, W. Sauer:
Linear interval equations. 105-115 - R. Krawczyk, Karl Nickel:
Die zentrische Form in der Intervallarithmetik, ihre quadratische Konvergenz und ihre Inklusionsisotonie. 117-137 - Roland Hornung:
Discrete minimax problem: Algorithms and numerical comparisons. 139-154 - Ladislav Luksan:
New combined method for unconstrained minimization. 155-169 - P. Waldvogel:
Bisection forAx=λBx with matrices of variable band width. 171-180 - J. D. P. Donnelly:
Discrete invariant imbedding and front-tracking. 181-188
Volume 28, Number 3, 1982
- Hanspeter Bieri, Walter Nef:
A recursive sweep-plane algorithm, determining all cells of a finite division of Rd. 189-198 - G. Keller:
Numerical solution of initial-value problems by collocation methods using generalized piecewise functions. 199-211 - John E. Lavery:
Solution of quasilinear hyperbolic initial-boundary-value problems by the method of pseudolinear equations. 213-223 - N. S. Asaithambi, Shen Zuhe, Ramon E. Moore:
On computing the range of values. 225-237 - Jon G. Rokne:
Optimal computation of the Bernstein algorithm for the bound of an interval polynomial. 239-246 - Walter J. Reuß:
Eine repräsentative Auswahl von Knotenmatrizen zu Klassen isomorpher Graphen. 247-255 - Leszek Slominski:
Probabilistic analysis of combinatorial algorithms: A bibliography with selected annotations. 257-267 - Didier Fayard, Gérard Plateau:
An algorithm for the solution of the 0-1 knapsack problem. 269-287
Volume 28, Number 4, 1982
- Alexander Leitsch:
Fiducial intervals for the waiting time in batch and time-sharing systems. 289-303 - Antonio Ramón Vaquero Sánchez, José M. Troya:
Optimization and approximation algorithm for placement of records on linear storage devices. 305-316 - John M. Bownds:
Theory and performance of a subroutine for solving Volterra Integral Equations. 317-332 - Felix Breitenecker:
On the solution of linear boundary value problems by extended invariant imbedding. 333-343 - Michael Gipser:
On global convergence of coordinate relaxation in the case of an unsymmetrical, diagonally dominant Jacobian. 345-361 - Helmut Prodinger:
A note on a result of R. Kemp on R-typly rooted planted plane trees. 363-366 - Luc Devroye:
A note on the average depth of tries. 367-371 - A. D. Raptis:
Two-step methods for the numerical solution of the Schrödinger equation. 373-378
a service of 
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.
last updated on 2024-04-25 04:49 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
