Top new questions this week:
|
|
Even though this method is more widely used than the simple Verlet method mentioned above, it unfortunately has an error term of O(Δt^2) , which is two orders of magnitude worse. That said, if you …
|
|
I am trying to solve $\frac{u”}{1+u’^2} – \frac{1}{2(1-u)} = 0$ subject to $u(0)=1, u(1)=0$. If I understand how to do this properly, I first do the variable substitutions: $u = y$, $y_1 = y; y_2 = y’…
|
|
Does the Lanczos algorithm remain memory efficient even if the original Hermitian matrix is dense?
|
Greatest hits from previous weeks:
|
|
What is a simple algorithm for computing the SVD of $2 \times 2$ matrices? Ideally, I’d like a numerically robust algorithm, but I’ll like to see both simple and not-so-simple implementations. C code …
|
|
I’m new to computational science and I already have learned basic methods for integration, interpolation, methods like RK4, Numerov etc on c++ but recently my professor asked me to learn how to use …
|
|
Given two computational programs, one using a Gaussian basis, and the other using Slater basis, what are the practical differences, advantages and disadvantages for each choice ?
|
|
Given a positive definite symmetric matrix, what is the fastest algorithm for computing the inverse matrix and its determinant? For problems I am interested in, the matrix dimension is 30 or less. …
|
|
I have a simple question that is really hard to Google (besides the canonical What Every Computer Scientist Should Know About Floating-Point Arithmetic paper). When should functions such as …
|
|
As I understand it, since a solution to a linear program always occurs at a vertex of its polyhedral feasible set (if a solution exists and the optimal objective function value is bounded from below, …
|
|
I have learnt about Finite Element Method (also a little on other numerical methods) but I don’t know what are exactly definition of these two errors and differences between them?
|
