![](https://dblp.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
default search action
Computing, Volume 83
Volume 83, Number 1, May 2008
- Andreas Karageorghis
, Yiorgos Sokratis Smyrlis:
Conformal mapping for the efficient MFS solution of Dirichlet boundary value problems. 1-24 - Leslaw K. Bieniasz
:
An adaptive Huber method with local error control, for the numerical solution of the first kind Abel integral equations. 25-39 - K. Subramani
:
Computing inversion pair cardinality through partition-based sorting. 41-54
Volume 83, Numbers 2-3, November 2008
- Jan Mandel
, Bedrich Sousedík
, Clark R. Dohrmann:
Multispace and multilevel BDDC. 55-85 - Alexander Linke, Gunar Matthies, Lutz Tobiska:
Non-nested multi-grid solvers for mixed divergence-free Scott-Vogelius discretizations. 87-107 - Tsung-Lin Lee, Tien-Yien Li, Chih-Hsiung Tsai:
HOM4PS-2.0: a software package for solving polynomial systems by the polyhedral homotopy continuation method. 109-133
Volume 83, Number 4, December 2008
- Samuel Ferraz-Leite, Dirk Praetorius
:
Simple a posteriori error estimators for the h-version of the boundary element method. 135-162 - Leslaw K. Bieniasz
:
Initialisation of the adaptive Huber method for solving the first kind Abel integral equation. 163-174 - Götz Alefeld, Zhengyu Wang:
Error bounds for complementarity problems with tridiagonal nonlinear functions. 175-192 - Amr Elmasry, Claus Jensen
, Jyrki Katajainen:
Two new methods for constructing double-ended priority queues from priority queues. 193-204
![](https://dblp.uni-trier.de/img/cog.dark.24x24.png)
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.