Search Results for "multi click mouse"

...Simple algebra should be faster and more intuitive to perform on a computer than on paper and should look like maths. Write small fragments in plain text; perform simple click-and-drag algebra with the mouse; and explore more involved algebra through keyboard shortcuts. When done, save as plain text files or export to LaTeX and HTML.

Simple and intuitive graphic interface for graph theory with algorithms to compute line and root graphs of a given graph. - Double click to add a new node. - Left click a node and drag to change the position of the node. - Select a node with left click and add an edge with the next node you select. - Right click a node to delete it. Made in C++ using the wxWidgets library.

wxMathPlot is an add-on library for wxWidgets which provides a framework for easy plotting of mathematical functions, sampled data and generic 2D plots.

...Simply click "resume" on any error.) For newest binary builds, look in the "/bin" directory of the Subversion distribution (code section). Make sure to also download the 2008 version of math.dotnet.iridium. The corresponding dll file is in the files section.

A spring-based 3D graph layout tool written in Java. Rendering is performed in OpenGL via the JOGL library.

MandALot is a powerful software. It allows you to explore the Mandelbrot set, and overall to create pictures from the set. The interface is fully customizable and is divided into several parts: you can manage separately how the algorithm works, and how the colors of the interior and exterior of the set are generated. It also features multi-layer gestion. MandALot is optimized for both large and small screens.

Runge is an Interactive Solver for Systems of Ordinary Differential Equations. It solves initial value problem (aka Cauchy problem). Few advantages Runge provides: It's fast. It utilizes BLAS and LAPACK libraries optimized for modern multi-core processors. It's interactive. It allows you to start a solution by mouse click on a plane. It's precise. It uses Runge Rule to adjust step length to satisfy required precision on each step. It's effective. When it needs to compute derivatives (Jacobian matrix, for example) it does that analytically, i.e. without using numerical methods. ...