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 ag.algebraic-geometry
Search options not deleted
user 88812
Algebraic varieties, stacks, sheaves, schemes, moduli spaces, complex geometry, quantum cohomology.
2
votes
0
answers
69
views
Doubt on the best low rank approximation of a symmetric tensor
I have a matrix $M\in\mathbb{R}^{n\times k}$, with $k<n$ whose columns $m_i$ are linearly independent.
So we have $M := [m_1|..|m_k]$.
From the columns of $M$ I can define the following matrix
$$
C …
15
votes
0
answers
717
views
Solving polynomial systems with homotopy. Where is the bottleneck?
I have a polynomial system with $n+k$ unknowns ($n+k$ can be greater than 8), that is known to have a limited number of isolated solutions.
I want to solve this system numerically, but if I plug it …
7
votes
0
answers
2k
views
Why is solving polynomial systems NP hard?
Solving polynomial systems is known to be a NP hard problem; however it is not completely clear to me where this complexity comes from.
My interest is in the case of systems of multivariate polynomi …