Search Results
| Search type | Search syntax |
|---|---|
| Tags | [tag] |
| Exact | "words here" |
| Author |
user:1234 user:me (yours) |
| Score |
score:3 (3+) score:0 (none) |
| Answers |
answers:3 (3+) answers:0 (none) isaccepted:yes hasaccepted:no inquestion:1234 |
| Views | views:250 |
| Code | code:"if (foo != bar)" |
| Sections |
title:apples body:"apples oranges" |
| URL | url:"*.example.com" |
| Saves | in:saves |
| Status |
closed:yes duplicate:no migrated:no wiki:no |
| Types |
is:question is:answer |
| Exclude |
-[tag] -apples |
| For more details on advanced search visit our help page | |
Results tagged with factorization
Search options not deleted
user 514326
For questions about factorization, the decomposition of mathematical objects (e.g. natural numbers, polynomials) into products of smaller objects (e.g. primes, lower degree polynomials).
2
votes
1
answer
170
views
How to do LU factorization efficiently based on the factorized result added with a low-rank ...
Is there any efficient way to compute the LU factorization of $A^{\text{new}}$? … Normally, a full re-factorization of $A^{\text{new}}$ is $O(n^3)$ complexity, and I am seeking a possible $O(n^2)$ algorithm with the reuse of $L^{\text{old}}$ and $U^{\text{old}}$ that have been previously …
- 21