POLLY
Followers: 0 Following: 0
Feeds
提问
two-step Adams Moulton method
Hello, I want to use two-step Adams Moulton method to solve ODE. The code is given below. Running this I have problems with d...
6 years 前 | 2 个回答 | 1
2
个回答提问
Convert Nested for-Loops to parfor
I want to speed up my script and try to replace nested for loop with parfor. I know that I can parallelize either of the nested ...
6 years 前 | 2 个回答 | 0
2
个回答提问
Convert Adjacency list of graph into Adjacency matrix
I am working with Adjacency lists of a graph with 198 vertices and 2472 edges. How can I construct adjacency matrix of graph in ...
6 years 前 | 3 个回答 | 0
3
个回答提问
multidimensional array as an input of function
Thanks for taking the time to read this. I am working with 5D matrices (in my code resultG, resultX, resultY). These matrices ...
6 years 前 | 1 个回答 | 0
1
个回答提问
How to replace use of cell storage with use of arrays?
Thanks for taking the time to read this. This is a part of the script I'm working on: resultX0=cell(length(n),length(...
6 years 前 | 1 个回答 | 0
1
个回答提问
How to make a loop run multiple times for different values of a variable.
Thanks for taking the time to read this. This is the script I'm working on: resultX0 = cell(10, 1); resultY0 = cell(10, ...
7 years 前 | 0 个回答 | 0
0
个回答提问
Hi! I need to write m-file for ellipsoid method of linear programming. Could anyone help me? Thanks
In mathematical optimization, the ellipsoid method is an iterative method for minimizing convex functions. When specialized to s...
8 years 前 | 0 个回答 | 0
0
个回答提问
Hi everyone! I need to get a script for transportation problem (balanced).
I need to write a program function [x,cost]=transport(s,d,c); % [x,cost]=transport(s,d,c) % Input: % s = supplies...
8 years 前 | 0 个回答 | 0