default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDComputing, Volume 63
Volume 63, Number 1, 1999
- Dietrich Braess, Maksimillian Dryja, Wolfgang Hackbusch:
A Multigrid Method for Nonconforming FE-Discretisations with Application to Non-Matching Grids. 1-25 - Hans-Görg Roos:
Sufficient Conditions for Uniform Convergence on Layer-Adapted Grids. 27-45 - D. Rostami Varnos Fadrani, Khosrow Maleknejad
:
Preconditioners for Solving Stochastic Boundary Integral Equations with Weakly Singular Kernels. 47-67 - Peter Kravanja, Marc Van Barel:
A Derivative-Free Algorithm for Computing Zeros of Analytic Functions. 69-91 - Peter Schatte:
Computing the Angle between Vectors. 93-96
Volume 63, Number 2, 1999
- Petter E. Bjørstad, Bjørn Peter Tjøstheim:
High Precision Solutions of Two Fourth Order Eigenvalue Problems. 97-107 - K. Nagatou:
A Numerical Method to Verify the Elliptic Eigenvalue Problems Including a Uniqueness Property. 109-130 - Ioannis K. Argyros:
Relations Between Forcing Sequences and Inexact Newton Iterates in Banach Space. 131-144 - K. A. Ariyawansa, N. Begashaw:
Global Convergence of a Class of Collinear Scaling Algorithms with Inexact Line Searches on Convex Functions. 145-169 - Lorenzo Verdoscia, Roberto Vaccaro:
An Adaptive Routing Algorithm for WK-Recursive Topologies. 171-184 - N. P. Seif, Maha Amin Hassanein, A. S. Deif:
Inverse Problem of the Interval Linear System of Equations. 185-200
Volume 63, Number 3, 1999
- Vjekoslav Sinkovic, Ignac Lovrek, Gábor Németh:
Load Balancing in Distributed Parallel Systems for Telecommunications. 201-218 - Suely Oliveira:
On the Convergence Rate of a Preconditioned Subspace Eigensolver. 219-231 - Marian Brezina, Petr Vanek:
A Black-Box Iterative Solver Based on a Two-Level Schwarz Method. 233-263 - Benedetta Morini, Maria Macconi:
Inexact Methods in the Numerical Solution of Stiff Initial Value Problems. 265-281 - Stefan Turek, Christian Becker, A. Runge:
Performance Rating via the Feast Indices. 283-297
Volume 63, Number 4, 1999
- Peter Brucker, Sigrid Knust:
Complexity Results for Single-Machine Problems with Positive Finish-Start Time-Lags. 299-316 - Rainer E. Burkard, M. M. Miatselski:
Volume Maximization and Orthoconvex Approximation of Orthogons. 317-330 - Michel X. Goemans, Franz Rendl:
Semidefinite Programs and Association Schemes. 331-340 - Clemens Heuberger:
Minimal Expansions in Redundant Number Systems and Shortest Paths in Graphs. 341-349 - Stefan E. Karisch, Eranda Çela, Jens Clausen, T. Espersen:
A Dual Framework for Lower Bounds of the Quadratic Assignment Problem Based on Linearization. 351-403 - Peter Kleinschmidt, Christian Rank:
New Heuristics for the Multidimensional Vote Assignment Problem. 405-417 - Ulrich Pferschy:
Dynamic Programming Revisited: Improving Knapsack Algorithms. 419-430
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-09 23:27 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:
