erm...could you elaborate? I'm writing a program that solves linear equations with gauss seidel iteration (and gauss/gauss jordan elimination), so there's a main program which calls the various methods as subroutines...
except within the gauss seidel subroutine I want to separate a bit which...
basic question really...can you have subroutines nested within subroutines? or are there any other types of subprograms within fortran95 other than functions and subroutines? (need one that can pass back an array)
if you can [use subs within subs], how do you link them? like in the main...
we've a basic numerical integration assignment, using simpsons/trapezium rule to calculate some non analytical function.
Logic suggests that you use as many "strips" as possible (ie. as small a value of dx as possible) to estimate the value of the integral, however I've seen some graph some...
well all the engineering courses are hard, but I feel aero gets a particularly hard time of it. as in, while aero's are working, the mech-eng's are usually partying. just my observations of course.
i think it implies [Al(H_{2}O)_{6-n}(OH)_{n}]^{3-n}
the way i understood it, the high charge density of the "Al3+" ion dragged in electron density off the water ligands, so the water ligands could be deprotonated to form the above complex (though the number of deprotonations depends on the...
I'm actually quite interested in this and the links don't work...
"File not found
The link you have clicked is not available.
Use only the link that was generated by YouSendIt and emailed to the recipient(s)."
:(
do you mean:
| b_r n^r + b_{r-1}n^{r-1} + \ldots b_0| \leq |n^r + n^r + n^r + \ldots \mbox{(to the extent of k)}|
which only is true if
b_{r-s} < n^s \mbox{ and } \ k=r where s=1,2,3...
but the coefficients of n^{r-s} are going to be much smaller than any possible value of n^{r-s} once n...
also, i think all that is needed is the ratio test for convergence (of the reciprocal) however if I use this when I replace n^k with (b+n)^k (to create the polynomial), i end up with series within series, and I'm not sure what to do with that.
(The ratio test is also what i used for a^n/n^k)
proving the reciprocal goes to zero is exactly how i did a^n/n^k...
but i didn't think you could just add terms in various powers of n and expect the same result as a^n/n^k (or its reciprocal) without proving it?
right...well all i can think of at the moment is changing (n^k) to (n+b)^k and prove that it works for that - however i don't think that's valid since (i don't think) every possible polynomial can be created by such an expansion.
i've not a clue where to start with the triangle inequality
i've to show (as part of a bigger assignment) that
a^n/p(n), where p is any polynomial and a>1, tends to infinity as n does. I've proved that:
a^n/n^k
does so, but I'm not sure how to extend this to a complete polynomial such as
(c1)n+(c2)n^2+(c3)n^3...
thanks for any help
NB: edited
i got it to agree in the end...i had to resolve parallel and perp. to the bars instead of the vertical and horizontal. never figured out why it didn't work the normal way, neither did my lab partner, a final year mech eng...silly really.
just have to build it now.
ahh see I don't have solid media, only archive files to be unpacked. i have done so, and tried to run /home/(username)/.../setup, but it does nay work.
anyone know how to do this? i have 0 experience installing stuff on linux, I'm pretty new to it. i know the one word "un-tarring" and that's about the limit of my capabilities
it'll be wildfire3 version of proe on debian distro
thanks for any and all help