default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDComputing, Volume 43
Volume 43, Number 1, March 1989
- Ian F. Akyildiz, Horst von Brand:
Dual and selfdual networks of queues with rejection blocking. 1-11 - Igor Moret:
A continuation procedure based on projected Newton steps. 13-25 - Vladimír Janovský
:
A note on Computing simple bifurcation points. 27-36 - Ulrike Linde, Manfred Reimer, Burkhard Sündermann:
Numerische Berechnung extremaler Fundamentalsysteme für Polynomräume über der Vollkugel. 37-45 - Ulrich Tautenhaln:
A fast interative method for solving regularized parameter identification problems in elliptic boundary value problems. 47-58 - Pavel B. Bochev, Svetoslav Markov:
A self-validating numerical method for the matrix exponential. 59-72 - Siegfried Thiel:
A generalisation of the interval Newton single-step method for nonlinear systems of equations. 73-84 - Shen Zuhe, Michael C. Eiermann:
Interval-majorant method and global optimization. 85-92 - Jiri Rohn:
A Farkas-type theorem for linear interval equations. 93-95
Volume 43, Number 2, June 1989
- Eckart W. Gekeler:
On the numerical solution of double-periodic elliptic eigenvalue problems. 97-114 - Winfried Auzinger:
On the error structure of the implicit Euler scheme applied to stiff systems of differential equations. 115-131 - John B. Kioustelidis:
L2-Error bounds for approximate solutions of elliptic partial differential equations with Dirichlet-boundary conditions. 133-140 - Ronald Cools, Hans Joachim Schmid:
Minimal cubature formulae of degree 2k-1 for two classical functionals. 141-157 - Avram Sidi:
Comparison of some numerical quadrature formulas for weakly singular periodic Fredholm integral equations. 159-170 - C. W. Clenshaw, Peter R. Turner:
Root squaring using level-index arithmetic. 171-185 - Wang Deren, Zhao Fengguang:
Complexity analysis of a process for simultaneously obtaining all zeros of polynomials. 187-197
Volume 43, Number 3, September 1990
- T. Geyer, Joachim Wick:
A deterministic particle-method solving the linearized Boltzmann equation. 199-207 - H. Claus:
Singly-implicit Runge-Kutta methods for retarded and ordinary differential equations. 209-222 - Winfried Auzinger, Reinhard Frank, Gabriela Kirlinger:
Asymptotic error expansions for stiff equations: Applications. 223-253 - Charalampos Tsitouras, George Papageorgiou:
Runge-Kutta interpolants based on values from two successive integration steps. 255-266 - Catterina Dagnino, Elisabetta Santi:
On the evaluation of one-dimensional Cauchy principal value integrals by rules based on cubic spline interpolation. 267-276 - Panayot S. Vassilevski:
On some ways of approximating inverses of banded matrices in connection with deriving preconditioners based on incomplete block factorizations. 277-296 - Horst A. Eiselt:
A computational study of minimax flow centers in trees. 297-307
Volume 43, Number 4, December 1990
- János D. Pintér:
Solving nonlinear equation systems via global partition and search: Some experimental results. 309-323 - Christian Lubich, Michel Roche:
Rosenbrock methods for differential-algebraic systems with solution-dependent singular matrix multiplying the derivative. 325-342 - Tadeusz Jankowski:
One-step methods for retarded differential equations with parameters. 343-359 - Bernd Hofmann, R. Hausding, Ralf Wolke:
Regularization of a Volterra integral equation by linear inequalities. 361-375 - Mansour Al-Zanaidi, Christian Grossmann:
1D-grid generation by monotone iteration discretization. 377-390 - Philippe Flajolet:
On adaptive sampling. 391-400 - Wojciech Szpankowski, Vernon Rego:
Yet another application of a binomial recurrence order statistics. 401-410
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 2026-07-28 23:38 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, funded, and maintained by:
Schloss Dagstuhl - Leibniz Center for Informatics is a member of the Leibniz Association and is funded by the federal government of Germany and the states of Germany, especially Saarland and Rhineland‑Palatinate.
