The determinations of consistent orderings for the sor iterative method

The concept of consistent ordering is central to the theory of the successive over-relaxation (SOR) iterative method for the solution of the set of equations Ax = b. (1

Solution of partial differential equations on vector and parallel computers

The present status of numerical methods for partial differential equations on vector and parallel computers was reviewed. The relevant aspects of these computers are discussed and a brief review of their development is included, with particular attention paid to those characteristics that influence algorithm selection. Both direct and iterative methods are given for elliptic equations as well as explicit and implicit methods for initial boundary value problems. The intent is to point out attractive methods as well as areas where this class of computer architecture cannot be fully utilized because of either hardware restrictions or the lack of adequate algorithms. Application areas utilizing these computers are briefly discussed

A comparison of numerical splitting-based methods for Markovian dependability and performability models

Iterative numerical methods are an important ingredient for the solution of continuous time Markov dependability models of fault-tolerant systems. In this paper we make a numerical comparison of several splitting-based iterative methods. We consider the computation of steady-state reward rate on rewarded models. This measure requires the solution of a singular linear system. We consider two classes of models. The first class includes failure/repair models. The second class is more general and includes the modeling of periodic preventive test of spare components to reduce the probability of latent failures in inactive components. The periodic preventive test is approximated by an Erlang distribution with enough number of stages. We show that for each class of model there is a splitting-based method which is significantly more efficient than the other methods.Postprint (published version

Cyclic networks of quantum gates

In this article initial steps in an analysis of cyclic networks of quantum logic gates is given. Cyclic networks are those in which the qubit lines are loops. Here we have studied one and two qubit systems plus two qubit cyclic systems connected to another qubit on an acyclic line. The analysis includes the group classification of networks and studies of the dynamics of the qubits in the cyclic network and of the perturbation effects of an acyclic qubit acting on a cyclic network. This is followed by a discussion of quantum algorithms and quantum information processing with cyclic networks of quantum gates, and a novel implementation of a cyclic network quantum memory. Quantum sensors via cyclic networks are also discussed.Comment: 14 pages including 11 figures, References adde