Faster than find on all the colomns

2 次查看（过去 30 天）
Jose Santos
Jose Santos 2019-3-1
评论： Jose Santos 2019-3-1
I'm tryting to find a faster way than the one I already have. So I have a big matrix, with between 4 and 16 lines and around 5K colomns, which is sparcely populated with ones. What I need to do is: The first nonzero element of each colomn is too remain one, and if there are more non-zero elements they have to be multiplied by a constant coefficient.
The way I do it now is as follows: multiply all the elements by the coefficient, and then run throught the colomns (with for ), looking for the first element to turn it back to one, with find. Like on the example below. I'm just thinking if I could not do it without having to go through all the colomns looking for the first nonzero element, as the code have to be run several times on the simulation.
a= [1] [0]
[0] [1]
[1] [0]
[0] [0]
then
a= [K] [0]
[0] [K]
[K] [0]
[0] [0]
then (with for + find)
a= [1] [0]
[0] [1]
[K] [0]
[0] [0]

请先登录，再回答此问题。

采纳的回答

Andrei Bobrov
Andrei Bobrov 2019-3-1
a = rand(5,15)>.7;
K = 100;
lo = cumsum(a) > 1;
a(lo) = a(lo)*K;
  1 个评论
Jose Santos
Jose Santos 2019-3-1
Great thanks, the example does not work with "a", as it is a logical matrix, but with my example it does work. Thanks

请先登录，再进行评论。

更多回答（0 个）

类别

在 Help Center 和 File Exchange 中查找有关 Simulink 的更多信息

标签

产品


版本

R2017b

Community Treasure Hunt

Find the treasures in MATLAB Central and discover how the community can help you!

Start Hunting!

Translated by