Journal•ISSN: 0010-485X
Computing
Springer Science+Business Media
About: Computing is an academic journal published by Springer Science+Business Media. The journal publishes majorly in the area(s): Finite element method & Boundary value problem. It has an ISSN identifier of 0010-485X. Over the lifetime, 3166 publications have been published receiving 66942 citations. The journal is also known as: computer technology.
Topics: Finite element method, Boundary value problem, Iterative method, Numerical analysis, Cloud computing
Papers published on a yearly basis
Papers
More filters
TL;DR: A shortest augmenting path algorithm for the linear assignment problem that contains new initialization routines and a special implementation of Dijkstra's shortest path method is developed.
Abstract: We develop a shortest augmenting path algorithm for the linear assignment problem. It contains new initialization routines and a special implementation of Dijkstra's shortest path method. For both dense and sparse problems computational experiments show this algorithm to be uniformly faster than the best algorithms from the literature. A Pascal implementation is presented.
1,196 citations
TL;DR: This paper is the first of a series and is devoted to the first introduction of the $\Cal H$-matrix concept, which allows the exact inversion of tridiagonal matrices.
Abstract: A class of matrices (
$\Cal H$
-matrices) is introduced which have the following properties (i) They are sparse in the sense that only few data are needed for their representation (ii) The matrix-vector multiplication is of almost linear complexity (iii) In general, sums and products of these matrices are no longer in the same set, but their truncations to the $\Cal H$
-matrix format are again of almost linear complexity (iv) The same statement holds for the inverse of an $\Cal H$
-matrix This paper is the first of a series and is devoted to the first introduction of the $\Cal H$
-matrix concept Two concret formats are described The first one is the simplest possible Nevertheless, it allows the exact inversion of tridiagonal matrices The second one is able to approximate discrete integral operators
1,106 citations
TL;DR: Two ways of implementing the algorithm are considered: multitape Turing machines and logical nets (with step=binary logical element.)
Abstract: Es wird ein Algorithmus zur Berechnung des Produktes von zweiN-stelligen Dualzahlen angegeben. Zwei Arten der Realisierung werden betrachtet: Turingmaschinen mit mehreren Bandern und logische Netze (aus zweistelligen logischen Elementen aufgebaut).
976 citations
TL;DR: It is shown that tabu search techniques provide almost optimal colorings of graphs having up to 1000 nodes and their efficiency is shown to be significantly superior to the famous simulated annealing.
Abstract: Tabu search techniques are used for moving step by step towards the minimum value of a function. A tabu list of forbidden movements is updated during the iterations to avoid cycling and being trapped in local minima. Such techniques are adapted to graph coloring problems. We show that they provide almost optimal colorings of graphs having up to 1000 nodes and their efficiency is shown to be significantly superior to the famous simulated annealing.
654 citations
TL;DR: An algebraic multigrid algorithm for symmetric, positive definite linear systems is developed based on the concept of prolongation by smoothed aggregation based on a set of requirements motivated heuristically by a convergence theory.
Abstract: An algebraic multigrid algorithm is developed based on prolongations by smoothed aggregation. Coarse levels are generated automatically. Guidelines for the selection of method components are presented based on energy considerations. Efficiency of the resulting algorithm is demonstrated by computational results.
648 citations