default search action
Computing, Volume 40
Volume 40, Number 1, March 1988
- Andreas Drexl:
A simulated annealing approach to the multiconstraint zero-one knapsack problem. 1-8 - Henk Meijer, Selim G. Akl:
Bit serial addition trees and their applications. 9-17 - Annegret Hoy:
A relation between Newton and Gauss-Newton steps for singular nonlinear equations. 19-27 - Zi-Cai Li, Tien Dai Bui:
A new kind of combinations between the Ritz-Galerkin and finite element methods for singularity problems. 29-50 - Kazup Ishihara:
Successive overrelaxation method with projection for finite element solutions applied to the Dirichlet problem of the nonlinear elliptic equation Δu-bu2. 51-65 - Claudia Chiodo, Giuliana Criscuolo:
On the convergence of a rule by Monegato for the numerical evaluation of Cauchy principal value integrals. 67-74 - Peter William Meyer:
A fixed point multiple shooting method. 75-83 - Zuhe Shen, Arnold Neumaier:
A note on Moore's interval test for zeros of nonlinear systems. 85-89
Volume 40, Number 2, June 1988
- J. Thomas King, A. Neubauer:
A variant of finite-dimensional Tikhonov regularization with a-posteriori parameter choice. 91-109 - Song Jiang:
On a finite element method for the equations of one-dimensional nonlinear thermoviscoelasticity. 111-124 - Hermann Brunner:
The approximate solution of initial-value problems for general Volterra integro-differential equations. 125-137 - Ronald Cools, Ann Haegemans:
Another step forward in searching for cubature formulae with a minimal number of knots for the square. 139-146 - Jyrki Katajainen:
The region approach for computing relative neighbourhood graphs in the Lp metric. 147-161 - Wolfgang Volk:
An efficient raster evaluation method for univariate polynomials. 163-173 - Peter Weidner:
The Durand-Kerner method for trigonometric and exponential polynomials. 175-179 - Emilio Spedicato, W. Burmeister:
A strict bound to the condition number of bordered positive definite matrices. 181-183
Volume 40, Number 3, September 1988
- Per Christian Hansen:
Computation of the singular value expansion. 185-199 - Günter W. Mühlbach:
On multivariate interpolation by generalized polynomials on subsets of grids. 201-215 - Richard J. Charron:
Adapting rational approximants for Fourier series to data representation problems. 217-228 - Karin Gatermann:
The construction of symmetric cubature formulas for the square and the triangle. 229-240 - Karl Strehmel, Rüdiger Weiner, I. Dannehl:
A study ofB-convergence of linearly implicit Runge-Kutta methods. 241-253 - Rüdiger Weiner, Karl Strehmel:
A type insensitive code for delay differential equations basing on adaptive and explicit Runge-Kutta interpolation methods. 255-265 - Devinder Kaur, Yehuda Wallach:
Parallel methods for tridiagonal equations. 267-272 - Andreas Frommer, Werner Straub:
Error-bounds for zeroes of polynomials using complex circular arithmetic. 273-280
Volume 40, Number 4, December 1988
- Th. Mohr, C. Pasche:
A parallel shortest path algorithm. 281-292 - Helmuth Späth, Jörg Meier:
Flexible smoothing with periodic cubic splines and fitting with closed curves. 293-300 - Nikolaos Apostolatos, Vasilios Vlassopoulos:
Abschätzung von Produkten gitterpositiver Matrizen und optimale Vorhersage stochastischer Quellen. 301-313 - Maria Rosaria Crisci, Elvira Russo, Antonia Vecchio:
On the stability of the one-step exact collocation method for the second kind volterra integral equation with degenerate kernel. 315-328 - A. Peyerimhoff, E. Stickel, Eduard Wirsing:
On the rate of convergence for two-term recursions. 329-335 - Pierre Verlinden, Ronald Cools, Dirk Roose, Ann Haegemans:
The construction of cubature formulae for a family of integrals: A bifurcation problem. 337-346 - Rupert Lasser, J. Tritschler:
How to compute the n-fold convolution power of elementary functions without numerical integration. 347-351 - Peter Brucker:
An efficient algorithm for the job-shop problem with two jobs. 353-359 - Joachim Gwinner:
Acceptable solutions of linear complementarity problems. 361-366 - Jürgen Herzberger:
On the monotonicity of higher-order interval iterations for bounding the inverse matrix. 367-372
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.