Mercurial > octave
comparison NEWS @ 30261:a49c635b179d
isprime.m: Speed up for large integers using Miller-Rabin test (bug #61312).
* libinterp/corefcn/__isprimelarge__.cc: Implement Miller-Rabin test.
* libinterp/corefcn/module.mk: Add new file to build system.
* scripts/specfun/isprime.m: Use new function for large integers.
* scripts/specfun/factor.m: Use "isprime" that is now more efficient.
* NEWS: Add note about performance improvement.
author | Arun Giridhar <arungiridhar@gmail.com> |
---|---|
date | Fri, 29 Oct 2021 20:48:47 -0400 |
parents | cd8d4a95815a |
children | 14f443a73558 |
comparison
equal
deleted
inserted
replaced
30260:bfbe6e528af5 | 30261:a49c635b179d |
---|---|
80 decomposition to solve nearly singular full square matrices. This is | 80 decomposition to solve nearly singular full square matrices. This is |
81 Matlab-compatible and yields results which more nearly minimize `norm | 81 Matlab-compatible and yields results which more nearly minimize `norm |
82 (A*x - b)`. Previously, Octave computed a minimum-norm solution. | 82 (A*x - b)`. Previously, Octave computed a minimum-norm solution. |
83 | 83 |
84 - The `factor` function has been overhauled for speed. For large | 84 - The `factor` function has been overhauled for speed. For large |
85 composite numbers > 1e14, it can be up to 10,000 times faster. | 85 inputs > 1e14, it can be up to 10,000 times faster. |
86 | |
87 - The `isprime` function uses a new primality testing algorithm | |
88 that is up to 50,000 times faster for inputs > 1e14. | |
86 | 89 |
87 - The `betainc` function now calculates an exact output for the | 90 - The `betainc` function now calculates an exact output for the |
88 important special cases where a or b are 1. | 91 important special cases where a or b are 1. |
89 | 92 |
90 - The `whos` function now displays an additional attribute 's' when | 93 - The `whos` function now displays an additional attribute 's' when |