In this study, coupled non-linear partial differential equations governing the natural convection from an isothermal wall of a trapezoidal porous enclosure have been solved numerically by finite element method (FEM) in conjunction with GMRES, a Krylov subspace based solver. In view of the...

The parallel computational complexity of the Bak–Sneppen evolution model is studied. It is shown that Bak–Sneppen histories can be generated by a massively parallel computer in a time that is polylogarithmic in the length of the history. In this parallel dynamics, histories are built up via...

Currently, in the context of quasi-Monte Carlo applications the most effective low-discrepancy sequences are digital (t, s)-sequences.

A new fourth-order compact difference scheme for the three-dimensional (3D) convection diffusion equation with variable coefficients is presented. The novelty of this new difference scheme is that it only requires 15 grid points and that it can be decoupled with two colors. The entire...

The traditional Monte Carlo simulation of order transitions in a ferromagnet (or in a binary crystalline alloy) is carried out by generating a sequence of local swaps (spin reversals or exchanges of atoms) on a finite lattice, each of which in turn is accepted or rejected according to...

In this paper a second degree iterative Monte Carlo method for solving systems of linear algebraic equations and matrix inversion is presented. Comparisons are made with iterative Monte Carlo methods with degree one. It is shown that the mean value of the number of chains N, and the chain length...

An efficient algorithm for the evaluation of the parametric sensitivities for mixed systems of differential and algebraic equations (DAEs) on computers involving multiple processors operating in parallel is presented. The algorithm derives its efficiency by decoupling the integration of the...

We exhibit some simple gadgets useful in designing shallow parallel circuits for quantum algorithms. We prove that any quantum circuit composed entirely of controlled-not gates or of diagonal gates can be parallelized to logarithmic depth, while circuits composed of both cannot. Finally, while...

We propose a definition of QNC, the quantum analog of the efficient parallel class NC. We exhibit several useful gadgets and prove that various classes of circuits can be parallelized to logarithmic depth, including circuits for encoding and decoding standard quantum error-correcting codes, or...

We exhibit a quantum circuit that performs the Quantum Fourier Transform on $n$ qubits in $ (n)$ depth. Thus, a parallel quantum computer can carry out the QFT in linear time. We conjecture that this can, in fact, be reduced to $ ({\rm log} n)$ depth, which would place the QFT in the class {\bf...