math solver
Sponsored Links
Sponsored Links
Secleted [ 0 ] software to compare
Results 1 - 15 of about 272
Anagram Solver 0.1
Anagram Solver is a simple anagram solver program. more>>
Anagram Solver is a simple anagram solver program.
You can use it against any spelling dictionary that is formatted:
- one word per line
- in alphabetical order
If its not in alphabetical order, you could send it through pipe.
The basic algorithm tries all possible combinations of a word, in such a way that the combinations are generated in alphabetical order.
It also knows the next real word in the list, so it can tell whether or not it is futile to pursue a certain node. These optimizations make it possible for it to solve a 8+ letter word in a few seconds
To use it, simply point it to your aspell dictionary file, usually located in /usr/share/dict/linux.words
<<lessYou can use it against any spelling dictionary that is formatted:
- one word per line
- in alphabetical order
If its not in alphabetical order, you could send it through pipe.
The basic algorithm tries all possible combinations of a word, in such a way that the combinations are generated in alphabetical order.
It also knows the next real word in the list, so it can tell whether or not it is futile to pursue a certain node. These optimizations make it possible for it to solve a 8+ letter word in a few seconds
To use it, simply point it to your aspell dictionary file, usually located in /usr/share/dict/linux.words
Download (0.47MB)
Added: 2006-04-06 License: GPL (GNU General Public License) Price:
1306 downloads
Open Tax Solver 4.07
OpenTaxSolver (OTS) project is a free program for calculating Tax Form entries. more>>
OpenTaxSolver (OTS) project is a free program for calculating Tax Form entries and tax-owed or refund-due, such as Federal or State personal income taxes.
An optional graphical front-end, OTS_GUI, has been added. Currently, TaxSolver has been updated for the 2005 tax-year for the following forms: US 1040 and Schedules A, B, C, & D.
As well as for California, Massachusetts, New Jersey, and Pennsylvania State Taxes for 2005 tax-year, thanks to contributors. Updates for the following additional states are expected to be posted soon: North Carolina, New York, Ohio, and Virginia. Preliminary versions for Canada and the United Kingdom were posted in previous years and may be updated with help from volunteers.
Motivations:
- To make tax preparation software available for all platforms.
- To provide insight into how our taxes are calculated in clear unambiguous equations/code.
- To avoid invasive, bloated commercial software packages.
- To avoid rewriting our own individual programs each year by combining efforts.
- To provide a simple reliable tax-package requiring only rudimentary knowledge to maintain.
Enhancements:
- Automatic phone credit was added to US1040.
- It will automatically calculate standard one-time phone credit, if not otherwise specified on US1040 line 71.
- The NJ State form F line 5 was fixed.
<<lessAn optional graphical front-end, OTS_GUI, has been added. Currently, TaxSolver has been updated for the 2005 tax-year for the following forms: US 1040 and Schedules A, B, C, & D.
As well as for California, Massachusetts, New Jersey, and Pennsylvania State Taxes for 2005 tax-year, thanks to contributors. Updates for the following additional states are expected to be posted soon: North Carolina, New York, Ohio, and Virginia. Preliminary versions for Canada and the United Kingdom were posted in previous years and may be updated with help from volunteers.
Motivations:
- To make tax preparation software available for all platforms.
- To provide insight into how our taxes are calculated in clear unambiguous equations/code.
- To avoid invasive, bloated commercial software packages.
- To avoid rewriting our own individual programs each year by combining efforts.
- To provide a simple reliable tax-package requiring only rudimentary knowledge to maintain.
Enhancements:
- Automatic phone credit was added to US1040.
- It will automatically calculate standard one-time phone credit, if not otherwise specified on US1040 line 71.
- The NJ State form F line 5 was fixed.
Download (0.36MB)
Added: 2007-03-15 License: GPL (GNU General Public License) Price:
953 downloads
Other version of Open Tax Solver
License:GPL (GNU General Public License)
Scrabble Blast Solver 0.1
Scrabble Blast Solver application more>>
Scrabble Blast Solver 0.1 offers you a professional and easy-to-use software which is an effective way to find and display words and their score for the popular online Scrabble Blast game. This product will be your good choice.
Enhancements: Only calculates the correct score of words for the first round.
Added: 2009-01-29 License: GPL Price: FREE
20 downloads
Sudoku solver 0.1
Sudoku solver application was created for solving a Sudoku with a backtracking algorithm. more>>
Sudoku solver application was created for solving a Sudoku with a backtracking algorithm. Instead of using a 9 x 9 matrix, it extends the matrix to 10 x 36 (10 rows, 36 columns), storing information in the extra cells.
The last row is used for keeping track of how many cells, for the current column, are still available.
The columns 9-17 (0-based) are used for storing the numbers which are still available in rows 0-8.
The columns 18-26 are used for storing the numbers which are still available in columns 0-8.
The columns 27-35 are used for storing the numbers which are still available in each square (counting from left to right and from top to bottom).
<<lessThe last row is used for keeping track of how many cells, for the current column, are still available.
The columns 9-17 (0-based) are used for storing the numbers which are still available in rows 0-8.
The columns 18-26 are used for storing the numbers which are still available in columns 0-8.
The columns 27-35 are used for storing the numbers which are still available in each square (counting from left to right and from top to bottom).
Download (MB)
Added: 2007-08-20 License: GPL (GNU General Public License) Price:
1712 downloads
Math::Complex 1.37
Math::Complex is a Perl module with complex numbers and associated mathematical functions. more>>
Math::Complex is a Perl module with complex numbers and associated mathematical functions.
SYNOPSIS
use Math::Complex;
$z = Math::Complex->make(5, 6);
$t = 4 - 3*i + $z;
$j = cplxe(1, 2*pi/3);
<<lessSYNOPSIS
use Math::Complex;
$z = Math::Complex->make(5, 6);
$t = 4 - 3*i + $z;
$j = cplxe(1, 2*pi/3);
Download (0.032MB)
Added: 2007-07-04 License: Perl Artistic License Price:
843 downloads
Math Objects 0.1.3
Math Objects is a math template library for C++ using generic programming techniques. more>>
Math Objects is a math template library written in C++ using generic programming techniques. In order to use the "Math Objects" library, the user only has to include the header files he needs (e.g. Matrix.h, Polynomial.h etc.).
In order to compile the library the user needs an ISO/IEC 14882:1998 standard compliant C++ compiler (e.g. one that supports partial template specializations).
The math library has math objects like matrices, polynomials, rational functions, extended precision numbers, complex numbers etc. that can be handled in a similar way like basic numerical types (e.g. integers or floating point numbers).
One can access properties of a mathematical type through a (partial) specialization of a traits class for that type (AlgebraicTraits). Having the traits classes to expose properties of mathematical objects, one can define for example matrices of polynomials having extended precision complex coefficients and apply to them basic linear algebra algorithms using normal C++ syntax.
This library also implements two functions using two deterministic algorithms that compute the Smith form for polynomial matrices, and the Smith-McMillan form of a transfer functions matrix also keeping track of the transformation matrices.
These algorithms can be used to describe a MIMO (multi input-multi output) system by means of its zeros and poles and also give the MFD (matrix fraction description) of the system.
Enhancements:
- Recoded the LongInt class aiming for better runtime efficiency.
<<lessIn order to compile the library the user needs an ISO/IEC 14882:1998 standard compliant C++ compiler (e.g. one that supports partial template specializations).
The math library has math objects like matrices, polynomials, rational functions, extended precision numbers, complex numbers etc. that can be handled in a similar way like basic numerical types (e.g. integers or floating point numbers).
One can access properties of a mathematical type through a (partial) specialization of a traits class for that type (AlgebraicTraits). Having the traits classes to expose properties of mathematical objects, one can define for example matrices of polynomials having extended precision complex coefficients and apply to them basic linear algebra algorithms using normal C++ syntax.
This library also implements two functions using two deterministic algorithms that compute the Smith form for polynomial matrices, and the Smith-McMillan form of a transfer functions matrix also keeping track of the transformation matrices.
These algorithms can be used to describe a MIMO (multi input-multi output) system by means of its zeros and poles and also give the MFD (matrix fraction description) of the system.
Enhancements:
- Recoded the LongInt class aiming for better runtime efficiency.
Download (0.28MB)
Added: 2006-02-21 License: GPL (GNU General Public License) Price:
1343 downloads
Math::Vec 1.01
Math::Vec is a Object-Oriented Vector Math Methods in Perl. more>>
Math::Vec is a Object-Oriented Vector Math Methods in Perl.
SYNOPSIS
use Math::Vec;
$v = Math::Vec->new(0,1,2);
or
use Math::Vec qw(NewVec);
$v = NewVec(0,1,2);
@res = $v->Cross([1,2.5,0]);
$p = NewVec(@res);
$q = $p->Dot([0,1,0]);
or
use Math::Vec qw(:terse);
$v = V(0,1,2);
$q = ($v x [1,2.5,0]) * [0,1,0];
NOTICE
This module is still somewhat incomplete. If a function does nothing, there is likely a really good reason. Please have a look at the code if you are trying to use this in a production environment.
<<lessSYNOPSIS
use Math::Vec;
$v = Math::Vec->new(0,1,2);
or
use Math::Vec qw(NewVec);
$v = NewVec(0,1,2);
@res = $v->Cross([1,2.5,0]);
$p = NewVec(@res);
$q = $p->Dot([0,1,0]);
or
use Math::Vec qw(:terse);
$v = V(0,1,2);
$q = ($v x [1,2.5,0]) * [0,1,0];
NOTICE
This module is still somewhat incomplete. If a function does nothing, there is likely a really good reason. Please have a look at the code if you are trying to use this in a production environment.
Download (0.010MB)
Added: 2007-07-03 License: Perl Artistic License Price:
847 downloads
Math::ODE 0.03
Math::ODE Perl module allows you to solve N-th Order Ordinary Differential Equations with as little pain as possible. more>>
Math::ODE Perl module allows you to solve N-th Order Ordinary Differential Equations with as little pain as possible.
Currently, only IVPs (initial value problems) are supported, but native support for BVPs (boundary value problems) may be added in the future. To solve N-th order equations, you must first turn it into a system of N first order equations, as in MATLAB.
<<lessCurrently, only IVPs (initial value problems) are supported, but native support for BVPs (boundary value problems) may be added in the future. To solve N-th order equations, you must first turn it into a system of N first order equations, as in MATLAB.
Download (0.005MB)
Added: 2007-06-13 License: GPL (GNU General Public License) Price:
867 downloads
Math::Expr 0.2
Math::Expr is a Perl module that parses mathematical expressions. more>>
Math::Expr is a Perl module that parses mathematical expressions.
SYNOPSIS
require Math::Expr;
$p=new Math::Expr;
$e=$p->Parse("a+4*b-d/log(s)+f(d,e)");
Parses mathematical expressions into a tree structure. The expressions may contain integers, real numbers, alphanumeric variable names, alphanumeric function names and most other characters might be used as operators. The operators can even be longer than one character! The only limitation is that a variable or function name may not start on a digit, and not all chars are accepted as operations. To be exact, here is the grammatic (in perl regexp notation):
< Expr > = -?< Elem >(< OpChr >< Elem >)*
< Elem > = < Number >|< Var >|< Function >|(< Expr >)
< Number > = < Integer >|< Float >
< Integer > = d+
< Float > = d*.d+
< Var > = [a-zA-Z][a-zA-Z0-9]*(:[a-zA-Z][a-zA-Z0-9]*)?
< Function > = [a-zA-Z][a-zA-Z0-9]*(< Expr >(,< Expr >)*)
< OpChr > = [^a-zA-Z0-9(),.:]+
If the - sign is present at the beginning of an < Expr > it is parsed in the exact same structure as 0< Expr >. That is to allow constructions like "-a*b" or "b+3*(-7)".
A variable consists of two parts separated by a :-char. The first part is the variable name, and the second optional part is its type. Default type is Real.
METHODS
$p = new Math::Expr
This is the constructor, it creates an object which later can be used to parse the strings.
$e=$p->Parse($str)
This will parse the string $str and return an expression tree, in the form of a Math::Expr::Opp object (or in simple cases only a Math::Expr::Var or Math::Expr::Num object).
$p->Priority({^=>50, /=>40, *=>30, -=>20, +=>10})
This will set the priority of ALL the operands (there is currently no way to change only one of them). The priority decides what should be constructed if several operands is listed without delimiters. Eg if a+b*c should be treated as (a+b)*c or a+(b*c). (Default is listed in header).
$p->SetOppDB($db)
Sets the OpperationDB to be used to $db. See Math::Expr::OpperationDB for more info. This will be passed down to all objects returned by the parser aswell.
<<lessSYNOPSIS
require Math::Expr;
$p=new Math::Expr;
$e=$p->Parse("a+4*b-d/log(s)+f(d,e)");
Parses mathematical expressions into a tree structure. The expressions may contain integers, real numbers, alphanumeric variable names, alphanumeric function names and most other characters might be used as operators. The operators can even be longer than one character! The only limitation is that a variable or function name may not start on a digit, and not all chars are accepted as operations. To be exact, here is the grammatic (in perl regexp notation):
< Expr > = -?< Elem >(< OpChr >< Elem >)*
< Elem > = < Number >|< Var >|< Function >|(< Expr >)
< Number > = < Integer >|< Float >
< Integer > = d+
< Float > = d*.d+
< Var > = [a-zA-Z][a-zA-Z0-9]*(:[a-zA-Z][a-zA-Z0-9]*)?
< Function > = [a-zA-Z][a-zA-Z0-9]*(< Expr >(,< Expr >)*)
< OpChr > = [^a-zA-Z0-9(),.:]+
If the - sign is present at the beginning of an < Expr > it is parsed in the exact same structure as 0< Expr >. That is to allow constructions like "-a*b" or "b+3*(-7)".
A variable consists of two parts separated by a :-char. The first part is the variable name, and the second optional part is its type. Default type is Real.
METHODS
$p = new Math::Expr
This is the constructor, it creates an object which later can be used to parse the strings.
$e=$p->Parse($str)
This will parse the string $str and return an expression tree, in the form of a Math::Expr::Opp object (or in simple cases only a Math::Expr::Var or Math::Expr::Num object).
$p->Priority({^=>50, /=>40, *=>30, -=>20, +=>10})
This will set the priority of ALL the operands (there is currently no way to change only one of them). The priority decides what should be constructed if several operands is listed without delimiters. Eg if a+b*c should be treated as (a+b)*c or a+(b*c). (Default is listed in header).
$p->SetOppDB($db)
Sets the OpperationDB to be used to $db. See Math::Expr::OpperationDB for more info. This will be passed down to all objects returned by the parser aswell.
Download (0.013MB)
Added: 2007-07-25 License: Perl Artistic License Price:
821 downloads
Math::XOR 0.02
Math::XOR is a package to handle XOR encryption of string buffers. more>>
Math::XOR is a package to handle XOR encryption of string buffers.
SYNOPSIS
use XOR;
print xor_buf("hello", "world"), "n";
The XOR module allows you to quickly XOR two strings together. This is the only method of encryption that (assuming the randomness of the pattern used as an encryption key) truly cannot be broken. It also has interesting, very direct mathematical properties which can be fun to play with:
XOR string 1 and string 2, you get string 3 XOR string 1 and string 3, you get string 2 XOR string 2 and string 3, you get string 1
FUNCTIONS
xor_buf($string1, $string2)
This function will return a scalar, which is the result of XORing the two strings passed to it together. The strings may contain binary data.
If $string2 is not at least as many characters long as $string1, xor_buf() will print an error and return undef. Only as many characters as there are in $string1 will be returned; excess characters in $string2 will be ignored. For this reason, when encrypting data it is good to think of $string1 as your "data" and $string2 as your "key".
<<lessSYNOPSIS
use XOR;
print xor_buf("hello", "world"), "n";
The XOR module allows you to quickly XOR two strings together. This is the only method of encryption that (assuming the randomness of the pattern used as an encryption key) truly cannot be broken. It also has interesting, very direct mathematical properties which can be fun to play with:
XOR string 1 and string 2, you get string 3 XOR string 1 and string 3, you get string 2 XOR string 2 and string 3, you get string 1
FUNCTIONS
xor_buf($string1, $string2)
This function will return a scalar, which is the result of XORing the two strings passed to it together. The strings may contain binary data.
If $string2 is not at least as many characters long as $string1, xor_buf() will print an error and return undef. Only as many characters as there are in $string1 will be returned; excess characters in $string2 will be ignored. For this reason, when encrypting data it is good to think of $string1 as your "data" and $string2 as your "key".
Download (0.002MB)
Added: 2006-08-04 License: Perl Artistic License Price:
1176 downloads
LM-Solve 0.8.1
LM-Solve is a solver for Logic Mazes. more>>
LM-Solve project is a solver for Logic Mazes.
LM-Solve is a solver for several types of the puzzles present on the Logic Mazes site.
It currently supports Alice Mazes, Number Mazes, Plank Puzzles, Theseus and the Minotaur Mazes, and Tilt Mazes.
They are written in Perl and should be very portable.
Use the CPAN.pm module install Games::LMSolve command to install LM-Solve. For instance, invoke the following command on the command line:
# perl -MCPAN -e install Games::LMSolve
<<lessLM-Solve is a solver for several types of the puzzles present on the Logic Mazes site.
It currently supports Alice Mazes, Number Mazes, Plank Puzzles, Theseus and the Minotaur Mazes, and Tilt Mazes.
They are written in Perl and should be very portable.
Use the CPAN.pm module install Games::LMSolve command to install LM-Solve. For instance, invoke the following command on the command line:
# perl -MCPAN -e install Games::LMSolve
Download (0.020MB)
Added: 2006-12-21 License: Public Domain Price:
1038 downloads
Math::TotalBuilder 1.10
Math::TotalBuilder is a Perl module to build a whole total out of valued pieces. more>>
Math::TotalBuilder is a Perl module to build a whole total out of valued pieces.
SYNOPSIS
use Math::TotalBuilder;
my %lsd = ( pound => 240, shilling => 20, penny => 1 );
# units for 952 pence
my %tender = build(%lsd, 952);
# total value of 3, 21, 98
my $wealth = total(%lsd, { pound => 3, shilling => 21, penny => 98 });
# best better representation of 18, 6, 40
my %moolah = build(%lsd,
total (%lsd, { pound => 18, shilling => 6, penny => 40 }));
This module provides two subroutines, build and total, which can be used to handle quantities of valued items. These can be used to build the proper tender to represent a quantity of money, to compose a mass from standard weights, to convert a difference of seconds to a set of time units, or other similar calculations.
<<lessSYNOPSIS
use Math::TotalBuilder;
my %lsd = ( pound => 240, shilling => 20, penny => 1 );
# units for 952 pence
my %tender = build(%lsd, 952);
# total value of 3, 21, 98
my $wealth = total(%lsd, { pound => 3, shilling => 21, penny => 98 });
# best better representation of 18, 6, 40
my %moolah = build(%lsd,
total (%lsd, { pound => 18, shilling => 6, penny => 40 }));
This module provides two subroutines, build and total, which can be used to handle quantities of valued items. These can be used to build the proper tender to represent a quantity of money, to compose a mass from standard weights, to convert a difference of seconds to a set of time units, or other similar calculations.
Download (0.005MB)
Added: 2006-09-26 License: Perl Artistic License Price:
1123 downloads
Math::GSL 0.001
Math::GSL is a Perl module for the GNU Scientific Library. more>>
The GNU Scientific Library (GSL) is a C library that has hundreds of functions that are useful to scientists and mathematicians, such as special functions, linear algebra, statistics, etc... Wouldnt it be nice if you could access them all with Perl? Now you can with Math::GSL!
Warning: You are on the bleeding edge, this is alpha code, so if you want to test it out on your platform and report bugs or send patches, then please do! Yes, there is just about no documentation right now. Anyone care to write some?
<<lessWarning: You are on the bleeding edge, this is alpha code, so if you want to test it out on your platform and report bugs or send patches, then please do! Yes, there is just about no documentation right now. Anyone care to write some?
Download (0.008MB)
Added: 2007-06-13 License: GPL (GNU General Public License) Price:
863 downloads
Math::Polynomial::Solve 2.11
Math::Polynomial::Solve is a Perl module to find the roots of polynomial equations. more>>
Math::Polynomial::Solve is a Perl module to find the roots of polynomial equations.
SYNOPSIS
use Math::Complex; # The roots may be complex numbers.
use Math::Polynomial::Solve qw(poly_roots);
my @x = poly_roots(@coefficients);
or
use Math::Complex; # The roots may be complex numbers.
use Math::Polynomial::Solve qw(poly_roots get_hessenberg set_hessenberg);
#
# Force the use of the matrix method.
#
set_hessenberg(1);
my @x = poly_roots(@coefficients);
or
use Math::Complex; # The roots may be complex numbers.
use Math::Polynomial::Solve
qw(linear_roots quadratic_roots cubic_roots quartic_roots);
# Find the roots of ax + b
my @x1 = linear_roots($a, $b);
# Find the roots of ax**2 + bx +c
my @x2 = quadratic_roots($a, $b, $c);
# Find the roots of ax**3 + bx**2 +cx + d
my @x3 = cubic_roots($a, $b, $c, $d);
# Find the roots of ax**4 + bx**3 +cx**2 + dx + e
my @x4 = quartic_roots($a, $b, $c, $d, $e);
<<lessSYNOPSIS
use Math::Complex; # The roots may be complex numbers.
use Math::Polynomial::Solve qw(poly_roots);
my @x = poly_roots(@coefficients);
or
use Math::Complex; # The roots may be complex numbers.
use Math::Polynomial::Solve qw(poly_roots get_hessenberg set_hessenberg);
#
# Force the use of the matrix method.
#
set_hessenberg(1);
my @x = poly_roots(@coefficients);
or
use Math::Complex; # The roots may be complex numbers.
use Math::Polynomial::Solve
qw(linear_roots quadratic_roots cubic_roots quartic_roots);
# Find the roots of ax + b
my @x1 = linear_roots($a, $b);
# Find the roots of ax**2 + bx +c
my @x2 = quadratic_roots($a, $b, $c);
# Find the roots of ax**3 + bx**2 +cx + d
my @x3 = cubic_roots($a, $b, $c, $d);
# Find the roots of ax**4 + bx**3 +cx**2 + dx + e
my @x4 = quartic_roots($a, $b, $c, $d, $e);
Download (0.015MB)
Added: 2007-07-19 License: Perl Artistic License Price:
832 downloads
The Gerris Flow Solver 0.9.2
Gerris is an Open Source Free Software library for the solution of the partial differential equations describing fluid flow. more>>
Gerris project is an Open Source Free Software library for the solution of the partial differential equations describing fluid flow.
Gerris is supported by NIWA (National Institute of Water and Atmospheric research) and by the Marsden Fund of the Royal Society of New Zealand.
The code is written entirely in C and uses both the GLib Library and the GTS Library for geometrical functions and object-oriented programming.
Main features:
- The same code base is compiled with 2D and 3D support.
- Quadtree-based (Octree in 3D) spatial discretisation with automatic and dynamic local refinement.
- Multigrid Poisson solver.
- Second-order Godunov type advection scheme.
- Solves the time-dependent incompressible variable-density Euler, Stokes or Navier-Stokes equations or the 2D shallow-water and 3D hydrostatic oceanic equations.
- Support for complex solid boundaries (automatic locally-refined mesh generation).
- Semi-implicit multigrid diffusion solver with support for complex boundaries and associated boundary conditions in 2D and 3D.
- Semi-implicit multigrid barotropic solver for the oceanic equations.
- Adaptive mesh refinement: the resolution is adapted dynamically to the features of the flow.
- Flexible and powerful specifications of parameters.
- Flexible object-oriented custom specification of initial and boundary conditions, source terms, outputs etc...
- Portable parallel support using the MPI library.
- Volume of Fluid advection scheme for interfacial flows.
Enhancements:
- Bugfixes and significant speedups in the multilevel Poisson solver.
- Support for variable mesh resolution along solid boundaries.
- Improvements have been made to the robustness of very complex solid boundaries.
- Adaptive refinement of VOF-advected tracers has been added, as well as a preliminary implementation of CSF surface tension using Renardy El Ab.
- "proper discretisation".
- Solid boundaries can be refined according to the local curvature.
- Implicit Coriolis terms work with the Navier-Stokes solver.
- There is support for "thin" 3D domains.
<<lessGerris is supported by NIWA (National Institute of Water and Atmospheric research) and by the Marsden Fund of the Royal Society of New Zealand.
The code is written entirely in C and uses both the GLib Library and the GTS Library for geometrical functions and object-oriented programming.
Main features:
- The same code base is compiled with 2D and 3D support.
- Quadtree-based (Octree in 3D) spatial discretisation with automatic and dynamic local refinement.
- Multigrid Poisson solver.
- Second-order Godunov type advection scheme.
- Solves the time-dependent incompressible variable-density Euler, Stokes or Navier-Stokes equations or the 2D shallow-water and 3D hydrostatic oceanic equations.
- Support for complex solid boundaries (automatic locally-refined mesh generation).
- Semi-implicit multigrid diffusion solver with support for complex boundaries and associated boundary conditions in 2D and 3D.
- Semi-implicit multigrid barotropic solver for the oceanic equations.
- Adaptive mesh refinement: the resolution is adapted dynamically to the features of the flow.
- Flexible and powerful specifications of parameters.
- Flexible object-oriented custom specification of initial and boundary conditions, source terms, outputs etc...
- Portable parallel support using the MPI library.
- Volume of Fluid advection scheme for interfacial flows.
Enhancements:
- Bugfixes and significant speedups in the multilevel Poisson solver.
- Support for variable mesh resolution along solid boundaries.
- Improvements have been made to the robustness of very complex solid boundaries.
- Adaptive refinement of VOF-advected tracers has been added, as well as a preliminary implementation of CSF surface tension using Renardy El Ab.
- "proper discretisation".
- Solid boundaries can be refined according to the local curvature.
- Implicit Coriolis terms work with the Navier-Stokes solver.
- There is support for "thin" 3D domains.
Download (3.9MB)
Added: 2006-10-26 License: GPL (GNU General Public License) Price:
1106 downloads
Secleted [ 0 ] software to compare
Copyright Notice:
Software piracy is theft, Using crack, password, serial numbers, registration codes, key generators is illegal and prevent future software development. The above math solver search only lists software in full, demo and trial versions for free download. Download links are directly from our mirror sites or publisher sites, torrent files or links from rapidshare.com, yousendit.com or megaupload.com are not allowed