Timeline for Approximate Algorithms for Poisson's Equation (PDE)
Current License: CC BY-SA 2.5
6 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Feb 15, 2011 at 21:22 | answer | added | Andrew Homan | timeline score: 1 | |
| Jan 4, 2011 at 21:45 | comment | added | Dan Piponi | You ask for random or approximate algorithms. You then mention the multigrid method. This gives approximate solutions to PDEs. Haven't you answered your question already? In addition, you say "the best algorithms I know are ... but ... are O(n)". The use of "but" implies that O(n) (whatever n is) conflicts with "approximate or randomised". I can't see why and it suggests you've left something out. Maybe you particularly seek fast algorithms. What actually is your question? | |
| Dec 27, 2010 at 20:08 | comment | added | dranxo | There was an ICM talk about this. cs-www.cs.yale.edu/homes/spielman/icm2010.pdf | |
| Dec 22, 2010 at 13:24 | comment | added | Denis Serre | I think your question should contain more details. For instance, what is $n$ in $O(n)$ ? | |
| Dec 21, 2010 at 19:45 | answer | added | Steve Huntsman | timeline score: 0 | |
| Dec 21, 2010 at 18:26 | history | asked | CSK Varma | CC BY-SA 2.5 |