Mercurial > octave

comparison NEWS @ 30238:72b6b886b9d0

Find changesets by keywords (author, files, the commit message), revision number or hash, or revset expression.
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 39a4ab124fd0
children a0bcfaf04cc1
comparison
equal deleted inserted replaced
30237:2b74543c85ea 30238:72b6b886b9d0
74 of the desired size such as `[0x1u32; 0x100; 0x10000]`, or 2) pad 74 of the desired size such as `[0x1u32; 0x100; 0x10000]`, or 2) pad
75 constants in array expressions with leading zeros so that they use the 75 constants in array expressions with leading zeros so that they use the
76 same number of digits for each value such as 76 same number of digits for each value such as
77 `[0x00_00_01; 0x00_01_00; 0x01_00_00]`. 77 `[0x00_00_01; 0x00_01_00; 0x01_00_00]`.
78 78
79 - The `factor` function has been overhauled for speed. Especially, for 79 - The `factor` function has been overhauled for speed. For large
80 large input quantities (> 1e14) with small prime factors, e.g. 80 composite numbers > 1e14, it can be up to 10,000 times faster.
81 `intmax ("uint64")`, the function can be up to 10,000 times faster.
82 However, for large input quantities with large prime factors, the function
83 can be up to 4x faster.
84 81
85 - The `mldivide` function (i.e., the `\` operator) now uses an LU 82 - The `mldivide` function (i.e., the `\` operator) now uses an LU
86 decomposition to solve nearly singular full square matrices. This is 83 decomposition to solve nearly singular full square matrices. This is
87 Matlab-compatible and yields results which more nearly minimize `norm 84 Matlab-compatible and yields results which more nearly minimize `norm
88 (A*x - b)`. Previously, Octave computed a minimum-norm solution. 85 (A*x - b)`. Previously, Octave computed a minimum-norm solution.