Search Results for "find"

...Enter 'load "path/to/your/file"' or drag the file into the terminal. You need to fit a function to the data? Enter 'fit data() -with=YOURFUNCTION(x)' Need assistance? Enter 'help topic' into the terminal or simply press [F1]. Find us on Discord: https://discord.gg/s5tSjwU Follow us on Mastodon: https://fosstodon.org/@numeredevs Visit our page: https://www.numere.org Buy us a coffee: https://ko-fi.com/numere We've moved to GitHub: https://github.com/numere-org

...YAFU (with assistance from other free software) uses the most powerful modern algorithms (and implementations of them) to factor input integers in a completely automated way. The automation within YAFU is state-of-the-art, combining factorization algorithms in an intelligent and adaptive methodology that minimizes the time to find the factors of arbitrary input integers. Most algorithm implementations are multi-threaded, allowing YAFU to fully utilize multi- or many-core processors (including SNFS, GNFS, SIQS, and ECM). YAFU is primarily a command-line driven tool. You provide the number to factor and, via screen output and log files, YAFU will provide you the factors. ...

...It includes the most efficient tree-based sorting algorithm that is possible and shows that finding a new prime can be done by sorting the differences between the previous primes in the right way. Unfortunately it has turned out that going this way is even more slowly than trying to find primes by brute force. So it can only be used as a test with heavy load for the sorting algorithm, which can be used for sorting any kind of data. And as already mentioned, it's just the most efficient tree-based sorting algorithm that you can get. But furthermore this way of finding primes interestingly leaves a hard nut to crack for mathematicians: In very rare cases it finds numbers that are not primes. ...

Project consist of a WinForm to modify Mumps source files in order to compile and use them under the 64-bit or 32-bit windows environment and to create necessary VS 2010 projects/solution to compile the source code. On the code tab you can find the sample Mumps solver solution with 6 projects. Two projects are a mumps wrapper library - dynamic and static. And other four projects are testing projects - two are C++ (linking static or dynamic wrapper library) and two are C (again linking static or dynamic library). Please check the blog posts about the use and the additional explanation of the projects or send me a mail if any difficulties arise. ...

In general, Pearson correlation coefficients can be quite error-prone to outliers, thus Jackknifing may be helpful. I could not find any useful implementation for calculating more than leave-1-out Jackknife Pearson correlation coefficients. 'leave-kojack' offers an implementation for Jackknife Pearson correlation with dynamic values of k, i.e. leave-k-out Pearson correlation.

This is a project for Andre to share CellML related tools he works on that other people might find useful.

...Thank you for visiting the Physics Calculator, provided by PIezoSystems Inc., please visit their company website at https://piezosystems.org. For other downloads, please visit our github page, https://github.com/PiezoSystems. We hope that you find this program useful and easy to use, for troubleshooting, please email us, contact@piezosystems.org. If any bugs were found, please email us at bugs@piezosystems.org.

A distributed computation project to find true primes.

A set of Macaulay2 and C programs developed to find intersections between known classes of degree 3 centers.

This project is a collection of FreeFEM++ scripts used to find numerical solutions of the free-surface incompressible Navier-Stokes equations. The boundary interpolations from a moving mesh are suitable for applying surface tension boundary conditions

Tools for working with Metamath proof databases. This project is a fork of Norm Megill's Proof Assistant, which you can find at http://us.metamath.org/ .

WinS (Wins Is Not Serious) is not another MatLab. Now it can only find prime numbers, in an interval, beep when it find twin primes, print the maximum distance found between two consecutive prime numbers.

The purpose of this project was to prepare gfortran for integration into gcc. Since this integration was completed in the summer of 2003, this project is now finished. You can find information about gfortran on http://gcc.gnu.org/wiki/GFortran/

The goal is to use distributed computing in the least bandwidth-intensive way to find a large prime number. We will have four parts to the project.