Feeds
답변 있음
What's the most efficient way to solve a sparse linear system Ax = b?
There are very few cases where the `\` operator isn't the fastest and roughly the most accurate. I've done a lot of testing of t...
What's the most efficient way to solve a sparse linear system Ax = b?
There are very few cases where the `\` operator isn't the fastest and roughly the most accurate. I've done a lot of testing of t...
7년 초과 전 | 0
답변 있음
The way to solve a singular matrix
% Goal: solve A*x == b for x % Set up some matrix A (I used a sparse matrix) -- do yourself % Set up the vector ...
The way to solve a singular matrix
% Goal: solve A*x == b for x % Set up some matrix A (I used a sparse matrix) -- do yourself % Set up the vector ...
거의 10년 전 | 0
제출됨
nderiv_fornberg( k, xPts, u)
Computes a derivative of arbitrary order on a vector u on an uneven grid.
거의 11년 전 | 다운로드 수: 2 |
질문
Caching a large 3D interpolation using griddata()
I'm using griddata() to go from a spherical grid of sizes on the order (128x256x1500) to a Cartesian cube centered on the sphere...
11년 초과 전 | 답변 수: 1 | 0
