Skip to main content

All Questions

Tagged with
0 votes
1 answer
85 views

Problem with For Loop when evaluating a recursive function at multiple points

I am running into problems with my For loop when trying to evaluate my expression. Fix some parameter values : ...
Anna MSJ's user avatar
2 votes
0 answers
113 views

Finding recurrence relation from an inexact numerical sequence

Consider the recurrence relationship d[0] = 0; d[i_] := (1 + Sqrt[1 + 4 d[i - 1]^2])/2 /; i >= 1 which generates the following sequence (generated by using <...
TDH's user avatar
  • 489
1 vote
2 answers
156 views

Recursive sequence with RecurenceTable

I want to compute elements of a recursive sequence and use them as coefficients of a power series. However, the (i+1)-th element depends on all previous elements. Writing this as a sum in ...
VN23's user avatar
  • 123
4 votes
3 answers
481 views

Slow computation of recursive sequences

I want to investigate the asymptotic behavior of the following recursive system: ...
David Lingard's user avatar
0 votes
0 answers
113 views

How to convert a symbolic recursive formula to a non-recursive one

I am new to Mathematica. I want to convert a recursive formula to a non-recursive one using symbolic math. Specifically, I have a recursive formula similar to this: $a_n = f_a(c_{n-1}, x_{n-1})$ $...
KRL's user avatar
  • 101
1 vote
2 answers
204 views

Computing recursive sequence [duplicate]

I would like to compute a[1000] of the following recursive sequence a[1] = 1; a[n_] := a[n - 1] + 1/a[n - 1]^2 but it takes a long time for computing even small ...
p.kn's user avatar
  • 233
1 vote
3 answers
212 views

Finding a sequence with RecurrenceTable

I would appreciate if somebody could help me with the following problem: Q: How can the following recursion equations be solved using RecurrenceTable? $\...
Young's user avatar
  • 269
1 vote
2 answers
1k views

How to define a recursive sequence

I would appreciate if somebody could help me with the following problem: Q: How to define this in Mathematica. $$a_{n+1}=\begin{cases} a_{n} & ,a_{n} \ge n\\ 2n-a_{n}& ,a_n<n \end{cases}...
Young's user avatar
  • 269
3 votes
1 answer
167 views

Taking a long time to produce output

In the following, I want to know b[1000], but it is taking a very long time even for b[30]. Please help ...
Schrodinger's user avatar
3 votes
3 answers
144 views

A Fibonacci growth problem

I would like to measure the first column vector as defined here using Mathematica. The list formed of the sum of the adults and infants at each period is a Fibonacci sequence. $\qquad %Translator ...
E Bassal's user avatar
  • 746
5 votes
2 answers
2k views

How to find a recurrence relation for a numerical sequence?

This question was inspired by Vladimir Reshetnikov's question (How to find a recurrence relation for a sequence?): Given a finite sequence of numbers, how can we find in MMA a recurrence relation ...
Dr. Wolfgang Hintze's user avatar
7 votes
1 answer
690 views

How to find a recurrence relation for a sequence?

I have a sequence given by an explicit formula for n-th term: ...
Vladimir Reshetnikov's user avatar
1 vote
1 answer
378 views

Defining a recursive integral sequence

I have a recursive integral sequence as follows: $$y_0(x)=1+r,$$ $$y_1(x)=-\frac{1}{\Gamma(a)}\int_0^x (x-t)^{a-1} y_0(t) dt,$$ $$\vdots$$ $$y_n(x)=-\frac{1}{\Gamma(a)}\int_0^x (x-t)^{a-1} y_{n-1}(t) ...
Angel's user avatar
  • 155
4 votes
3 answers
331 views

Long waiting time for computing a summation

It takes a long time to compute the summation below, and I'd like to know if there are alternative ways to compute things faster. When replacing $15$ by $\infty$, then I should get $3^{1/3}$. I need ...
user 1357113's user avatar
  • 1,415