Re: is this solvable?
- To: mathgroup at smc.vnet.net
- Subject: [mg56614] Re: is this solvable?
- From: Peter Pein <petsie at arcor.de>
- Date: Sat, 30 Apr 2005 01:27:24 -0400 (EDT)
- References: <d4sov7$ale$1@smc.vnet.net>
- Sender: owner-wri-mathgroup at wolfram.com
ames_kin at yahoo.com wrote:
> a'[t] + b'[t]== -p1 a[t] - p2 b[t]
>
> where {a[0]== a0, b[0]== b0}
>
> is this solvable in Mathematica? If so, how will I go about doing so?
>
> let's assume a[0]== a0, and b[0]==b0
>
> if symbolic solution isn't possible, then intial conditions of
> a[0]== 1, and b[0]==0.5 couild be used...(or any other numbers for that
> matter)
>
> thanks in advance.
>
Yes,
I guess you'll get infinitely many solutions. Your system is obviously
underestimated. I would say, the best you can expect, is to get b[t] in
dependence on a[t].
--
Peter Pein
Berlin