Skip to main content
arbitUser1401's user avatar
arbitUser1401's user avatar
arbitUser1401's user avatar
arbitUser1401
  • Member for 12 years, 8 months
  • Last seen more than 1 year ago
revised
Loading…
Loading…
answered
Loading…
comment
Ease of calculation of norm
that is the problem with 2 norm, that it entails computing $A^{1/2}z$ which yet remains the problem. That is why in computation of $A^{-1}b$ people use $A$ norm (e.g. conjugate gradient method) cause it overcomes the problem of computing $A^{-1}z$ where z remains an approximation of x
awarded
revised
Ease of calculation of norm
matrix norm changed by vector norm
Loading…
comment
Ease of calculation of norm
sorry about confusion. I indeed meant vector norm
asked
Loading…
accepted
awarded
comment
calculating Möbius function
I want to avoid factoring it. I'm also considering Sieve of Eratosthenes
asked
Loading…
accepted
awarded
comment
Matrix elimination
As Igor pointed , there can be a lot of $S$ possible , which also say that there can be a number of $y$ and $S$ exist for pair of $A$ and $z$. What I'm trying to do is, suppose by some contraption I generated a $y$, (without explicitly finding out $S$ ) , I want to verify that for such $y$, there indeed exist some $S$ satisfying $A=SS^{T}$ ( again I'm not interested in calculation of S,existence is sufficient )
awarded
asked
Loading…
accepted
comment
Low-rank factorization of SPD matrix
Right now I'm trying using truncated SVD; (In general it need not be low rank) Sorry about the confusion
asked
Loading…
1
2