default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDComputing, Volume 53
Volume 53, Number 1, March 1994
- Wieslaw Lucjan Nowinski
:
A conflict free memory access in parallel image reconstruction. 1-11 - Horst Eckardt:
Disk cache architectures for transaction-like applications in parallel computers. 13-31 - R. D. Lararov, I. D. Mishev, Panayot S. Vassilevski:
Finite volume methods with local refinement for convection-diffusion problems. 33-57 - Ivan Lirkov, Svetozar Margenov, Panayot S. Vassilevski:
Circulant block-factorization preconditioners for elliptic problems. 59-74 - John C. Butcher:
Some orbital test problems. 75-94 - Ya. Hlynsky, Yu. Panchyshyn:
Efficient implementation of a 2nd derivative method for stiff ODEs. 95-99
Volume 53, Number 2, June 1994
- Christian Kanzow:
An unconstrained optimization technique for large-scale linearly constrained convex minimization problems. 101-117 - Fangjun Zhou, Yi Xiao:
A class of nonmonotone stabilization trust region methods. 119-136 - Bernd Mulansky, Jochen W. Schmidt:
Powell-Sabin splines in range restricted interpolation of scattered data. 137-154 - Andreas Rieder, X. Zhou:
On the robustness of the dampedV-cycle of the wavelet frequency decomposition multigrid method. 155-171 - Christoph Schwab:
Variable order composite quadrature of singular and nearly singular integrals. 173-194 - Norbert Hungerbühler:
Numerical analysis of singular weighted integrals. 195-203
Volume 53, Numbers 3-4, September 1994
- Mohand Ourabah Benouamer, P. Jaillon, Dominique Michelucci, Jean-Michel Moreau:
Hashing lazy numbers. 205-217 - Xavier Merrheim:
The computation of elementary functions in radix 2p. 219-232 - Michael J. Schulte, J. Omar, Earl E. Swartzlander Jr.:
Optimal initial approximations for the Newton-Raphson division algorithm. 233-242 - Roman Reith, Christian P. Ullrich:
Coarse-grain parallelizations of interval algorithms decomposing dense matrices and solving triangular systems on multicomputers. 243-257 - Gerd Bohlender, T. Kersten, R. Trier:
Implicit matrix multiplication with maximum accuracy on various transputer networks. 259-276 - Olaf Knüppel:
PROFIL/BIAS - A fast interval library. 277-287 - H. M. E. Berlejung:
A test environment using symbolic program trace. 289-299 - Jean-François Carpraux, Jocelyne Erhel, Miloud Sadkane:
Spectral portrait for non-hermitian large sparse matrices. 301-310 - Götz Alefeld, A. Gienger, Günter Mayer:
Numerical validation for an inverse matrix eigenvalue problem. 311-322 - Hoon Hong, Volker Stahl:
Safe starting regions by fixed points and tightening. 323-335 - Dietmar Ratz:
Box-Splitting strategies for the interval Gauss-Seidel step in a global optimization method. 337-353 - P. Schramm:
Intersection problems of parametric surfaces in CAGD. 355-364 - Jiri Rohn:
Enclosing solutions of linear interval equations is NP-hard. 365-368 - R. Rihm:
On a class of enclosure methods for initial value problems. 369-377 - Markus Neher:
Enclosing solutions of an inverse Sturm-Liouville problem with finite data. 379-395
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 2025-12-17 20:51 CET 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:
