updated August 18, 2017

user: webuser log off

News
Mathematics
Computing
Technology
Education

[2015-06-03]


[2015-06-03]

CESLIB -- Computational Earth Sciences Library

This paper discusses a new object-oriented Fortran library for computational earth sciences (CESLib)....display full article text



[2006-07-13]


[2006-07-13]

High-Precision Arithmetic - Calculation of Pi to Arbitrary Number of Significant Digits

Following is an implementation in C++ of a high-precision arithmetic programme for the calculation of pi to an arbirary number of significant digits. The implementation is similar to that of the programme for calculating e, presented earlier in this section. The programme can be run in parallel on any number of networked compute nodes that can be logged on to with a single account sharing the same home drive (e.g., an NFS share) across all compute nodes. This programme does not require parallel computing libraries such as MPI, nor is it dependent on OpenMP-aware compilers.

Save the link in the left pane as a .tar.bz2 (UNIX tar bzip2 archive) file, decompress using `tar xfj` and make using GNU or intel C++ compilers. See more info commented in the source files....display full article text



[2006-07-12]


[2006-07-12]

Parallel Simulation of an Endocrine Organ

The following paper (in Russian) describes a probabilistic mathematical model and presents a multi-processing simulation programme for modelling granulated endocrine glands.

The programme source code can be downloaded by following the thumbnailed link in the left pane.

Save the link in the left pane as a .tar.bz2 (UNIX tar bzip2 archive) file, decompress using `tar xfj` and make using an Intel Fortran compiler. See more info commented in the source files....display full article text


Modelling Endocrine Organs - July 2006L


[2006-07-11]


[2006-07-11]

High-Precision Arithmetic - Calculation of Euler's Number e to Arbitrary Number of Significant Digits

Following is an implementation in C++ of a high-precision arithmetic programme for the calculation of Euler's number to an arbirary number of significant digits. The programme can be run in parallel on any number of networked compute nodes that can be logged on to with a single account sharing the same home drive (e.g., an NFS share) across all compute nodes. This programme does not require parallel computing libraries such as MPI, nor is it dependent on OpenMP-aware compilers.

Save the link in the left pane as a .tar.bz2 (UNIX tar bzip2 archive) file, decompress using `tar xfj` and make using GNU or Intel C++ compilers. See more info commented in the source files....display full article text



[2006-07-10]


[2006-07-10]

Generalised "Tower of Hanoi" Problem

The following programme implements three methods of solving the "generalised" Tower of Hanoi problem. This problem, like the classical one, consists in finding the optimal sequence of moves for transfering a number of disks between two posts, the only difference in the generalised setting is that the number of posts can be arbitrary.

Save the link in the left pane as a .tar.bz2 (UNIX tar bzip2 archive) file, decompress using `tar xfj` and make using GNU or Intel C++ compilers. See more info commented in the source files....display full article text



(C) 2006-2017 Musa Maharramov PRIVACY NOTICE AND CONTACT DETAILS