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 |
For questions about solving numerical problems by evaluating over a discrete grid of points in the problem domain.
1
vote
1
answer
194
views
Overlapping 1D grids
I need to find the overlap of these grids, i.e., what cell of grid #1 overlaps with what cell of grid #2, and what is the overlapping area (length). … Below I am including a Python script that solves this problem in a simple way, checking every pair of grid cells. …
3
votes
1
answer
206
views
Calculations on discontinous grids
Suppose for a grid-based calculation a grid is used such that the grid Jacobian is discontinuous. … This grid can be illustrated by this plot, showing the x coordinate of the grid point vs. its index normalized to the total number of grid points. …
6
votes
2
answers
293
views
What makes a good computational grid?
Most computational methods for solving PDEs are grid-based. What makes a computational grid "good", other than being sufficiently fine to resolve features of numerical solutions? … Is there a high-level overview, a paper or a book, discussing what makes a grid "good", for a range of solution methods and numerical problems of interest? …