Showing papers in "Computer Physics Communications in 1985"

TL;DR: The method of embedding is considered, which is widely used with explicit Runge-Kutta methods for the solution of first order initial value problems, for use with the special formulae used to integrate the Schrodinger equation.

TL;DR: In this paper, three four-step methods for the numerical solution of the radial Schrodinger equation are compared theoretically and experimentally, and the results show that all of them are equivalent.

TL;DR: In this paper, the Hellmann-Feynman theorem is used to approximate the transition frequencies and corresponding intensities of the least squares procedure for the phase conventions of Condon and Shortley.

TL;DR: In this paper, two linearly independent solutions are found, in general, to the cataloguenumber: ACDP differential equation f (x)+ g (x)f(x) = 0, where g has x°, x~ and x~ 2terms, with coefficients1, x2~and X(X Programobtainablefrom: CPCProgramLibrary, Queen'sUni+ 1), respectively.

TL;DR: In this article, the resistive MHD equations are linearized around an equilibrium with cylindrical symmetry and solved numerically as a complex eigenvalue problem, which allows one to solve for very small resistivity γ≈10 -10.

TL;DR: In this article, a methode iterative for obtenir des bornes superieures and inferieures aux valeurs de l'energie for l'equation de Schrodinger radiale is presented.

TL;DR: A modified conjugate gradient method is derived which requires only one pass through the coefficients and the temporary vectors, applicable to problems which may be complex and non-symmetric.

TL;DR: An overview of the SIGMA-1, a large-scale dataflow computer being developed at the Electrotechnical Laboratory, Japan, which is predicted to give higher speed over a wide range of applications than conventional von Neumann computers.

TL;DR: The Ising ferromagnet is a well-known model of a system of interacting spins which is amenable to Monte Carlo calculation involving Boolean work and low precision counting and high quality 24-bit random number generation.

TL;DR: Generator (b) has been greatly speeded-up by re-implementation, and now produces more than 100 × 106 high quality 16-bit numbers/s, and Generator (c) is under development and will achieve even higher performance, mainly due to producing data in greater bulk.

TL;DR: These algorithms are organized in such a way as to be easily modified for general-purpose multiprocessors with shared global memories.

TL;DR: The concept of an incremental programming support environment is described in which all software documents internally are represented by graph-like high-level data structures which can be executed using different interpretation modes which enable different test and monitoring facilities.

TL;DR: The present DAPs are far from the modern state of the art in fabrication, and future engines of similar design could be made with present technology with a rating well over a Gflop, providing very cost-effective computing.

TL;DR: In this paper, the authors identify the three essential parts for a successful and robust adaptive grid distribution equation for systems of nonlinear partial differential equations: (1) the spatial function, composed of operators that control the shape and size of zones, and guarantees the stability and positivity of the corresponding metric, (2) the structure function, which provides an objective measure of the structure of the solution, and generates source terms that drive the grid distribution into any desired configuration, and (3) an asymmetric time filter, which ensures a smooth space-time evolution of the mesh globally, even

TL;DR: The results show that the coefficient matrices which arise have important differences from those which derive from many standard test problems, and the application of truccated power series expansions to the preconditioning phase is shown to produce substantial gains.

TL;DR: Ce programme determine, sur la base d'un critere d'energie, l'information spaciale d'une chaise polypeptidique a partir de the sequence de peptide.

TL;DR: A compiler for transforming serial programs into parallel form, and studies the importance of several transformations as well as their effect on the execution time.

TL;DR: Algorithms for Newton-like interval methods on vector computers converge under relatively weak conditions to the solution of systems arising from discretizations of nonlinear elliptic PDE.

TL;DR: Algorithms for interpreting the motion of edge features in an image sequence in terms of the position, orientation and motion of a planar visible surface facet have been developed and implemented on an SIMD processor array and are shown to be nearly compatible with real time video frame rates.

TL;DR: The very positive performance comparisons with today's supercomputers allow us to conclude that parallel computers and programming, of the type the authors have considered, represent a pragmatic answer to many computationally intensive problems.

TL;DR: In this article, the coefficients de transformation which relient les etats produits h.O. are calculated, and the arguments associes a des ensembles differents de coordonnees de Jacobi de systemes a 3 and 4 corps avec des masses arbitraires.