Re: asking suggestions on the algorithm in compution.Thanks.

From: ZHANG Yan (buaanupt_at_sina.com)
Date: 10/29/04 

Date: 29 Oct 2004 08:33:17 -0700

Thank you very much for your comments. I am very sorry that I have not
stated the questions very clearly. Hope that the following is more
clear.

//////////////////////////////////////////////////////////////////////
Input: k,A,b
//k is integer; A is integer; b is integer
Output:X

X = 0.0
for k = 1..A
  for all possible set (m_1,m_2,...,m_k) satisfying m_1+m_2+...+m_k =
b
     X = X + f_1(m_1) * f_2(m_2) * ... * f_k(m_k)
  end
end

//in this algorithm, f_i(m_i) is a function with m_i as input.

The difficulty lies in the fact that there are too many possible
combination of set (m_1,m_2,...,m_k) satisfying m_1+m_2+...+m_k = b.
So, the number of cycle is ver high.

Can you plz give some suggestions in reduce the computation time and
complexity? Thank you very much. 

--
Y.ZHANG

Relevant Pages
Loading