Timeline for Optimal algorithm choice for mixed diagonal/dense problem
Current License: CC BY-SA 3.0
8 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jan 15, 2018 at 13:47 | answer | added | Federico Poloni | timeline score: 1 | |
| Jan 14, 2018 at 16:53 | history | edited | java4ever | CC BY-SA 3.0 |
added 109 characters in body
|
| Jan 14, 2018 at 15:34 | comment | added | Wolfgang Bangerth | I think you will want to update the question to state that $\hat f \in {\mathbb C}^{2n}$ instead of ${\mathbb C}^{n}$. | |
| Jan 14, 2018 at 8:49 | comment | added | Federico Poloni | If $\beta_j=0$, then $\alpha_j\neq 0$ or the matrix wouldn't be invertible; just permute column $j$ with column $n+j$ and you can reduce to the case in which $\beta$ has all nonzero entries. | |
| Jan 14, 2018 at 5:37 | comment | added | java4ever | The diagonal matrices may also contain $0+0i$ on their diagonal or may be $0+0i$ for all entries, but at least one entry per row in the lower half of the block matrix is not $0+0i$ | |
| Jan 13, 2018 at 20:37 | comment | added | Federico Poloni | en.wikipedia.org/wiki/Schur_complement (of one of the two diagonal matrices). | |
| Jan 13, 2018 at 16:24 | review | First posts | |||
| Jan 14, 2018 at 10:20 | |||||
| Jan 13, 2018 at 16:19 | history | asked | java4ever | CC BY-SA 3.0 |