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 linear-algebra
Search options not deleted
user 9896
Questions about the properties of vector spaces and linear transformations, including linear systems in general.
5
votes
0
answers
572
views
When is polytope compatible with network flow?
A linear program is the problem of optimizing an linear objective function within some polytope $A$ over $\mathbf R^n$. My question is motivated by the question of when a linear programming problem ca …
- 3,475
5
votes
Accepted
Lower Bound on the Cost of Solving Linear System
Any $O(N^t)$ algorithm for matrix multiplication yields a corresponding $O(N^t)$ algorithm for matrix inversion. There are not any non-trivial lower bounds for matrix multiplication. It is believed th …
- 3,475
0
votes
0
answers
49
views
Forming orthogonal bases in different orders
Let $\alpha_1, \dots, \alpha_n$ be unit vectors in some vector space $V = R^d$. For any permutation $\pi: [n] \rightarrow [n]$, we can form the Gram-Schmidt orthogonal bases $\beta_{\pi,1}, \dots, \be …
- 3,475