Mercurial > octave
changeset 30238:72b6b886b9d0
doc: rephrase NEWS about factor-function speedup (bug #61129).
* NEWS: rephrase file about factor-function speedup.
author | Kai T. Ohlhus <k.ohlhus@gmail.com> |
---|---|
date | Wed, 13 Oct 2021 11:26:43 +0900 |
parents | 2b74543c85ea |
children | 120e878f343f |
files | NEWS |
diffstat | 1 files changed, 2 insertions(+), 5 deletions(-) [+] |
line wrap: on
line diff
--- a/NEWS Tue Oct 12 08:46:56 2021 +0200 +++ b/NEWS Wed Oct 13 11:26:43 2021 +0900 @@ -76,11 +76,8 @@ same number of digits for each value such as `[0x00_00_01; 0x00_01_00; 0x01_00_00]`. -- The `factor` function has been overhauled for speed. Especially, for -large input quantities (> 1e14) with small prime factors, e.g. -`intmax ("uint64")`, the function can be up to 10,000 times faster. -However, for large input quantities with large prime factors, the function -can be up to 4x faster. +- The `factor` function has been overhauled for speed. For large +composite numbers > 1e14, it can be up to 10,000 times faster. - The `mldivide` function (i.e., the `\` operator) now uses an LU decomposition to solve nearly singular full square matrices. This is