답변 있음

How do I stop incidence function rearranging the edges of a graph?

The reordering isn't happening when the incidence of the graph is computed, but instead at the moment that the graph is construc...

How do I stop incidence function rearranging the edges of a graph?

The reordering isn't happening when the incidence of the graph is computed, but instead at the moment that the graph is construc...

5달 전 | 0

| 수락됨

답변 있음

Generalized Eigenvalue Problem - Hessenberg Matrix

I agree with Steve Lord; if you're able to replicate the action of matrix A on a vector v, you can pass this to EIGS in a functi...

Generalized Eigenvalue Problem - Hessenberg Matrix

I agree with Steve Lord; if you're able to replicate the action of matrix A on a vector v, you can pass this to EIGS in a functi...

5달 전 | 0

| 수락됨

답변 있음

Generating all non-isomorphic graphs for a given number of nodes with specified degrees

I've attached a script that computes the graphs in your example, here's the plot of all graphs it found:

Generating all non-isomorphic graphs for a given number of nodes with specified degrees

I've attached a script that computes the graphs in your example, here's the plot of all graphs it found:

5달 전 | 1

답변 있음

how to find kshortest path or use Dijkstra algorithm for 12 plot points.

I'm not sure how the data you're adding here maps to the picture you attached. Here's how I would go about inserting the positio...

how to find kshortest path or use Dijkstra algorithm for 12 plot points.

I'm not sure how the data you're adding here maps to the picture you attached. Here's how I would go about inserting the positio...

6달 전 | 0

답변 있음

generate multi Diagonal matrices

The SVD is usually computed for a matrix, but you're only passing in a scalar on each call. Is it possible you meant to pass in...

generate multi Diagonal matrices

The SVD is usually computed for a matrix, but you're only passing in a scalar on each call. Is it possible you meant to pass in...

6달 전 | 0

답변 있음

S is diagonal matrix of singular values?

MATLAB (and Fortran) store matrices in a column-first ordering, while in your file, you want to save numbers in a row-first orde...

S is diagonal matrix of singular values?

MATLAB (and Fortran) store matrices in a column-first ordering, while in your file, you want to save numbers in a row-first orde...

6달 전 | 0

| 수락됨

답변 있음

Performance of matlab direct linear solver with respect to sparsity

For sparse matrices, the performance of backslash depends a lot on the specific structure of that sparse matrices (where the non...

Performance of matlab direct linear solver with respect to sparsity

For sparse matrices, the performance of backslash depends a lot on the specific structure of that sparse matrices (where the non...

6달 전 | 0

| 수락됨

답변 있음

How can I return real-valued eigenvectors from diagonalization?

I don't think it's possible: Looking at the eigenvalues and eigenvectors of B, >> diag(D) ans = 0.0000 + 2.0000i 0.000...

How can I return real-valued eigenvectors from diagonalization?

I don't think it's possible: Looking at the eigenvalues and eigenvectors of B, >> diag(D) ans = 0.0000 + 2.0000i 0.000...

7달 전 | 0

답변 있음

incorrect eigenvector using eig(A,B)

The residual MK*V-MM*V*w2 is expected to be numerically close to zero, however, you have to take into account the scaling of the...

incorrect eigenvector using eig(A,B)

The residual MK*V-MM*V*w2 is expected to be numerically close to zero, however, you have to take into account the scaling of the...

7달 전 | 0

답변 있음

highlight Nodecolor for a graph using a color map (JET)

Since colors is a n-by-3 array, use colors(i, :) to access the complete row that represents the color for node i. You can also u...

highlight Nodecolor for a graph using a color map (JET)

Since colors is a n-by-3 array, use colors(i, :) to access the complete row that represents the color for node i. You can also u...

7달 전 | 0

| 수락됨

답변 있음

Path between 2 nodes in a graph

Compute a path between the nodes, then check if the result is empty (this is returned by shortestpath if no path exists): path ...

Path between 2 nodes in a graph

Compute a path between the nodes, then check if the result is empty (this is returned by shortestpath if no path exists): path ...

7달 전 | 2

답변 있음

Diagonalising a Skew-Symmetric Matrix

When EIG is called with an exactly symmetric/hermitian matrix, MATLAB falls back to a specialized algorithm that guarantees that...

Diagonalising a Skew-Symmetric Matrix

When EIG is called with an exactly symmetric/hermitian matrix, MATLAB falls back to a specialized algorithm that guarantees that...

7달 전 | 2

| 수락됨

답변 있음

Properties of SVD of a hermitian matrix not holding at single precision

I'd suggest just calling EIG [V, S] = eig(A) instead of calling the SVD. If A is (exactly!) symmetric on input, this will retu...

Properties of SVD of a hermitian matrix not holding at single precision

I'd suggest just calling EIG [V, S] = eig(A) instead of calling the SVD. If A is (exactly!) symmetric on input, this will retu...

7달 전 | 0

| 수락됨

답변 있음

What is the difference between Gram-Smith QR decomposition procedure and qr.m function in Matlab?

MATLAB's QR decomposition is computed using Householder transformations, which is generally more numerically advantageous.

What is the difference between Gram-Smith QR decomposition procedure and qr.m function in Matlab?

MATLAB's QR decomposition is computed using Householder transformations, which is generally more numerically advantageous.

7달 전 | 0

| 수락됨

답변 있음

Plotting a graph in layered fashion

Unfortunately, there is currently no way to do this with the 'layered' layout. I'll make a note of your need for this. For now,...

Plotting a graph in layered fashion

Unfortunately, there is currently no way to do this with the 'layered' layout. I'll make a note of your need for this. For now,...

7달 전 | 0

답변 있음

Shortest path through nodes

As Bjorn mentioned, this is the traveling salesman problem. The optimization toolbox has an example of how to use their intlinpr...

Shortest path through nodes

As Bjorn mentioned, this is the traveling salesman problem. The optimization toolbox has an example of how to use their intlinpr...

8달 전 | 1

| 수락됨

답변 있음

lsqminnorm- Tolerance to Reduce Impact of Noisy Data

The tolerance in lsqminnorm should be used if you expect your matrix A to be of low rank up to a tolerance. That is, for rank k,...

lsqminnorm- Tolerance to Reduce Impact of Noisy Data

The tolerance in lsqminnorm should be used if you expect your matrix A to be of low rank up to a tolerance. That is, for rank k,...

8달 전 | 0

답변 있음

How do I get Matlab to display a graph type data structure with decreasing weights

The Edges table attached to a digraph is always standardized so that its sorted by the EndNodes column. However, you can get a c...

How do I get Matlab to display a graph type data structure with decreasing weights

The Edges table attached to a digraph is always standardized so that its sorted by the EndNodes column. However, you can get a c...

8달 전 | 0

| 수락됨

답변 있음

Ordering edge names in Digraph

The edges are reordered in the graph constructor, but it looks like the Power variable you're assigning is in the same order as ...

Ordering edge names in Digraph

The edges are reordered in the graph constructor, but it looks like the Power variable you're assigning is in the same order as ...

8달 전 | 0

| 수락됨

답변 있음

SVD of each row of a matrix

The SVD of a row vector has the singular value equal to its norm, and the singular vectors 1 and the normalized vector. If this...

SVD of each row of a matrix

The SVD of a row vector has the singular value equal to its norm, and the singular vectors 1 and the normalized vector. If this...

8달 전 | 0

| 수락됨

답변 있음

qr decomposition run-time performance

When a "~" is used for a return value, this is only for code clarity. MATLAB still needs to compute that value, so the second ca...

qr decomposition run-time performance

When a "~" is used for a return value, this is only for code clarity. MATLAB still needs to compute that value, so the second ca...

8달 전 | 2

답변 있음

Sign difference between coeff=pca(X) and [~,~,v] = svd(X)

I'm not sure why this happens. As mentioned by others, it doesn't matter what sign these outputs have. You could try stepping th...

Sign difference between coeff=pca(X) and [~,~,v] = svd(X)

I'm not sure why this happens. As mentioned by others, it doesn't matter what sign these outputs have. You could try stepping th...

8달 전 | 1

답변 있음

How to use non-unique node names in a digraph?

Instead of setting these inputs as node names, add them as a separate variable in the nodes table. Then, pass them to the plotti...

How to use non-unique node names in a digraph?

Instead of setting these inputs as node names, add them as a separate variable in the nodes table. Then, pass them to the plotti...

9달 전 | 0

| 수락됨

답변 있음

Is there any way to accelerate the solving of a series of large sparse positive definite linear equations "Ax=b" with same "A" and different "b"?

If you are able to solve for one vector using A \ b, you could pass in a matrix containing all your right-hand sides in instead:...

Is there any way to accelerate the solving of a series of large sparse positive definite linear equations "Ax=b" with same "A" and different "b"?

If you are able to solve for one vector using A \ b, you could pass in a matrix containing all your right-hand sides in instead:...

9달 전 | 2

답변 있음

Accelerate eigs with GPU

The eigs function is not supported on the GPU. There is support for sparse matrices on the GPU, since R2015a: Release notes para...

Accelerate eigs with GPU

The eigs function is not supported on the GPU. There is support for sparse matrices on the GPU, since R2015a: Release notes para...

9달 전 | 1

답변 있음

Properties of adjacency matrix

In terms of the adjacency matrix, a disconnected graph means that you can permute the rows and columns of this matrix in a way w...

Properties of adjacency matrix

In terms of the adjacency matrix, a disconnected graph means that you can permute the rows and columns of this matrix in a way w...

9달 전 | 0

답변 있음

Assigning values to an array of arbitrary dimensions in MATLAB.

Using the somewhat recent implicit expansion, this can also be done without indexing into every element of the array: function ...

Assigning values to an array of arbitrary dimensions in MATLAB.

Using the somewhat recent implicit expansion, this can also be done without indexing into every element of the array: function ...

10달 전 | 0

답변 있음

How to find all edges indexes if node indexes are given?

So you're looking for all edges where both end nodes are part of the set 4, 5, 6? This will compute them: >> [s, t] = findedge(...

How to find all edges indexes if node indexes are given?

So you're looking for all edges where both end nodes are part of the set 4, 5, 6? This will compute them: >> [s, t] = findedge(...

10달 전 | 0

| 수락됨

답변 있음

Create random graph with limited degree

You could start by just making an undirected graph, and then go through each node and compute its degree. If the degree is large...

Create random graph with limited degree

You could start by just making an undirected graph, and then go through each node and compute its degree. If the degree is large...

10달 전 | 0

해결됨

Maximum of ND-array

Find the maximum element of a N dimensional array. Example: A=[1 2 4 ; -20 4 10]; The maximum is 10.

10달 전