Feeds
질문
I have a very simple markov chain and I was wondering if there is a simplified equation for times spend in each state
I have the following transition matrix of a Markov Chain. M=[p, 1-p, 0, 0, ...; p, 0, 1-p, 0, ....; p, 0, 0, 1-p .......
3년 초과 전 | 답변 수: 2 | 0
2
답변질문
fill a vector (efficiently) with values specified by matrix and multiple vectors
Hi, I need to run this problem efficiently (because it will run a billion times or more) There is a fixed 2x2x2 matrix M Ea...
3년 초과 전 | 답변 수: 1 | 0
1
답변질문
finding stable point for complicated contrained function - tried ga
Hello, I have function with two variables and a few parameters: function [delta] = fun(x,par) ... %does a lot of things ...
거의 4년 전 | 답변 수: 0 | 0
0
답변질문
transforming a 2-dim array integers to 3-dim array of logical which are true for the corresponding number - without using a loop
Hello, I would like to take an 2-dim array like IND=[4 3 2; 1 2 3]; and create a 3-dim of logicals like ...
대략 7년 전 | 답변 수: 1 | 0
