Timeline for Find a vector in the null space of a large dense matrix, where elements in the matrix are not directly accessible
Current License: CC BY-SA 4.0
5 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Mar 2, 2023 at 21:16 | comment | added | HANDSOMEJACKANDY | I mean CG is for sure the fastest iterative method to solve for any general equations Ax=b (A being PSD). However, for the particular case Ax=0, CG is obviously not utilising the information of b = 0. I wonder if I could incorporate this information to improve the convergence speed of CG, or, if there are other methods that are particularly efficient in solving Ax = 0. | |
| Mar 2, 2023 at 21:10 | comment | added | Dirk | Why would CG be slow on this? The progress of CG depends on the full spectrum of A and not so much on the condition number if I remember correctly. | |
| Mar 2, 2023 at 17:22 | history | edited | Francesco Polizzi |
edited tags
|
|
| S Mar 2, 2023 at 11:52 | review | First questions | |||
| Mar 2, 2023 at 13:57 | |||||
| S Mar 2, 2023 at 11:52 | history | asked | HANDSOMEJACKANDY | CC BY-SA 4.0 |