Reputation
12,017
Top tag
Next privilege 15,000 Rep.
Protect questions
Badges
3 16 41
Newest
 Generalist
Impact
~201k people reached

Jun
22
comment Determining whether x=1 is a regular singular point in the differential equation
I have covered the method in generality. $x_0$ is the placeholder I'm using for whichever point you're trying to check.
Jun
20
answered Determining whether x=1 is a regular singular point in the differential equation
Jun
20
revised Determining whether x=1 is a regular singular point in the differential equation
latex
Jun
20
reviewed Approve Fredholm equation
Jun
19
comment Complex Eigenvalues and systems of 1st-order ODEs
Well, the solutions would have the form $\mathbf{v}(t) = e^{\lambda t} \mathbf{v}_0$, and we have Euler's formula to convert complex exponentials into trig functions...does that sound familiar?
Jun
18
comment How can I use a precise definition to find values of delta that correspond with given epsilon values
@Grace, not equals, but "near". And no, you're not finding a new value of $a$, you're finding the distance $\delta$. So you want to find how close $x$ needs to be to $a = 2$ so that $|x^3 - 3x + 4 - 6| \le 0.1$.
Jun
18
awarded  Generalist
Jun
18
answered How can I use a precise definition to find values of delta that correspond with given epsilon values
Jun
18
comment Numerically finding eigenvalues of a Volterra operator of first kind
I should amend: Potentially unstable
Jun
18
comment Numerically finding eigenvalues of a Volterra operator of first kind
You could try discretizing with respect to a basis for which each integral can be computed exactly. You should also check if the operator is normal; if not then the eigenproblem is numerically unstable.
Jun
18
comment Numerically finding eigenvalues of a Volterra operator of first kind
To be more explicit: There will be a band of 1s, but it should lie above the diagonal, not on it.
Jun
18
comment Numerically finding eigenvalues of a Volterra operator of first kind
If you are using a cutoff value, then you cannot choose discretization points near that cutoff value, because then the approximation will not be good. So your matrix should not be triangular in the traditional sense.
Jun
17
comment Numerically finding eigenvalues of a Volterra operator of first kind
What quadrature rule are you using?
Jun
12
revised How can I solve what kind of function this is?
correction
Jun
12
comment How can I solve what kind of function this is?
You're right, I was implicitly assuming here that $f \in L^{\infty}$.
Jun
12
answered How can I solve what kind of function this is?
Jun
11
answered Can an identity element be variable?
Jun
9
comment What's interesting in latus rectum?
I had to google "Latus rectum" to learn what it was. I do not think it likely has a prominent role in any applications, because, as you say, you can derive it from all the other key parameters of a conic section. I would guess that the terminology came up in classical European mathematics...probably for the astronomy orbit stuff that you already mentioned.
Jun
8
awarded  Electorate
Jun
8
comment QR Algorithm fails under certain conditions
You write AB = R*Q - (p*eye(2)); which means you just subtracted pI from the matrix. Therefore the subsequent matrix is not going to be similar to the original matrix unless you add back p*I. The usual pseudocode looks something like... p = AB(n,n); [Q,R] = qr(AB - p*I);AB = R*Q + p*I