Services & Resources / Wolfram Forums
MathGroup Archive
*Archive Index
*Ask about this page
*Print this page
*Give us feedback
*Sign up for the Wolfram Insider

MathGroup Archive 2004

[Date Index] [Thread Index] [Author Index]

Search the Archive

Re: Bernoulli variable algebra

  • To: mathgroup at
  • Subject: [mg46559] Re: Bernoulli variable algebra
  • From: Jens-Peer Kuska <kuska at>
  • Date: Mon, 23 Feb 2004 22:33:41 -0500 (EST)
  • Organization: Universitaet Leipzig
  • References: <c16m89$5pd$>
  • Reply-to: kuska at
  • Sender: owner-wri-mathgroup at







JMyers6761 wrote:
> I have been working on a Mathematica package used to predict the reliability of
> complex redundent systems. The calculations, which are done symboliclly, become
> quite complex. Since all of the variables used are Bernoulli variables, i.e.
> take on only values of 0 or 1, the expressions must be simplified by use of the
> rule x_^n_->x. My problem is this, the expressions are complex and large and,
> as a result the Mathematica Kernal runs out of memory trying to expand the
> expressions. I know, from other techniques, that the resulting expressions
> after application of the  x_^n_->x rule are still large (> 1000 terms) they are
> not unmanageable. (The expressions prior to applying the rule might be on the
> order of 10^6 terms) If a technique could be devised for accomplishing the
> effect of the above transformation without first requiring the full expansion
> of the expressions it would be possible to greatly simplify the required
> analysis. Is anyone aware of a technique for the simplification of algebraic
> expressions of Bernoulli variables without requiring expansion of the
> expression first?
> Any hints would be greatly appreciated.
> Thankyou,
> Al Myers

  • Prev by Date: Re: How can I graph a characteristic equation dx/dt=v?????
  • Next by Date: Re: Bernoulli variables again
  • Previous by thread: Re: Bernoulli variable algebra
  • Next by thread: Errors evaluating InputForm[graphic]