Four months after 0.44, a new release of Social Networks Visualiser is ready. Version 0.45 fixes a thousand (short of…) bugs, and adds new features, such as initial support for GraphML, four new node shapes and new widgets for network rotation and zooming. My plan is to have GraphML as the default format. At the [...]
This is a very simple Pascal program I wrote in mid 1990s, which solves a sparse NxN linear system using the Succesive Overrelaxation Method (SOR), which in turn is based on Gauss Seidel Method.
Both methods are iterative.
N is initially set at maximum …64.
You need the W factor for the SOR to complete successful. [...]
This Pascal program is usefull in solving large tridiagonal linear systems. An example is the systems emerging from numerically integrating parabolic PDE’s by Finite Differences method.
It was ported to Turbo Pascal from a Fortran 77 program.
Its usage is very simple. All you have to do is to enter dimension of the system and the [...]
The goal of this project was to create a class (named lifo) of Last-In-First-Out Lists (Stacks) of integers with variable length. The class actually defines a new Data Type, named lifo. Each variable of this type will be a LIFO List. Of course, the class must have defined some operations (member-functions) for handling the [...]
This Pascal program finds the value of a Nth order polynomial:
implementing Horner method without using any complex arithmetic in Fortran 77.
Obviously, it can find complex values, for complex x’s, but without complex arithmetic.
The program also uses ANSI codes to clear screen.
