Answered

how to find out the common neighbors of two nodes in a graph?

You can use the graph class for something like this. First, make a graph from the connection inputs you had: >> A=[1 2; 1 3; 1 ...

how to find out the common neighbors of two nodes in a graph?

You can use the graph class for something like this. First, make a graph from the connection inputs you had: >> A=[1 2; 1 3; 1 ...

5 maanden ago | 2

| accepted

Answered

Error using tabular/permute and Error in median (line 186)

Applying median to a table directly is not supported. Either apply median to a specific variable of the table >> t = table([3;...

Error using tabular/permute and Error in median (line 186)

Applying median to a table directly is not supported. Either apply median to a specific variable of the table >> t = table([3;...

5 maanden ago | 0

Answered

Finding bridge of not isolated vertices

There is no functionality for MATLAB's graph class that would compute the bridges / cut edges. If performance is not a main con...

Finding bridge of not isolated vertices

There is no functionality for MATLAB's graph class that would compute the bridges / cut edges. If performance is not a main con...

6 maanden ago | 1

Answered

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...

6 maanden ago | 0

| accepted

Answered

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...

6 maanden ago | 0

| accepted

Answered

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:

6 maanden ago | 1

Answered

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 maanden ago | 0

Answered

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 maanden ago | 0

Answered

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 maanden ago | 0

| accepted

Answered

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 maanden ago | 0

| accepted

Answered

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 maanden ago | 0

Answered

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 maanden ago | 0

Answered

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...

8 maanden ago | 0

| accepted

Answered

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 ...

8 maanden ago | 2

Answered

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...

8 maanden ago | 2

| accepted

Answered

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...

8 maanden ago | 0

| accepted

Answered

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.

8 maanden ago | 0

| accepted

Answered

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,...

8 maanden ago | 0

Answered

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 maanden ago | 1

| accepted

Answered

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 maanden ago | 0

Answered

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 maanden ago | 0

| accepted

Answered

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 maanden ago | 0

| accepted

Answered

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...

9 maanden ago | 0

| accepted

Answered

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...

9 maanden ago | 2

Answered

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...

9 maanden ago | 1

Answered

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...

10 maanden ago | 0

| accepted

Answered

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:...

10 maanden ago | 2

Answered

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...

10 maanden ago | 1

Answered

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...

10 maanden ago | 0

Answered

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 maanden ago | 0