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 spectral-method
Search options not deleted
user 39741
For questions about spectral methods, a technique for solving differential equations by expressing them in terms of some computationally convenient basis (typically that obtained via fast fourier transform). Questions could relate to the theory behind the method or details of implementing for a particular problem.
1
vote
1
answer
356
views
Solving Poisson-like PDE with FFT
Problem
I have an $n\times n$ grid, and each point on the grid is assigned two values: a score, and an (inverse) speed factor. There is a "turtle" moving along the grid, and it's goal is to maximize i …
- 131
1
vote
Accepted
Solving Poisson-like PDE with FFT
You can use an iterative method to find $p$. Do the following steps:
Solve the equation $\nabla^2 p^1 = -s$.
Solve the new equation $\nabla^2 p^{n+1} = -(s+\gamma p^n)$.
Repeat step 2 until convergen …
- 131