Risposto
Traverse a directed graph visiting all edges at least once?
There aren't any functions for MATLAB's graph object that solve this problem. Possibly you can formulate this as an optimization...

quasi 5 anni fa | 1

Risposto
How to search all elements in two cell arrays?
All right, let's assume you have a graph containing both G and H stored as graph object GH, and that this graph contains the bla...

circa 5 anni fa | 0

| accettato

Risposto
My Hessenberg Decomposition code is not working
Your code looks correct, try it with A = randn(10) for example - this matches the outputs of HESS quite closely. When the input ...

circa 5 anni fa | 1

Risposto
Direct Solver
The direct sparse solver (\) unfortunately doesn't have methods for complex symmetric or hermitian problems, only for real symme...

circa 5 anni fa | 2

Risposto
Solve large linear equations with backslash operator. Why is sparse matrix solved slower than the full matrix?
Sparse linear system solvers are usually fast for sparse matrices with specific structure of where the nonzeros are placed. For ...

circa 5 anni fa | 0

Risposto
EIGS: Why is 'smallestabs' faster than 'largestabs'?
Whether 'largestabs' or 'smallestabs' depends on the problem: 'smallestabs' needs to factorize the first input, which can make i...

circa 5 anni fa | 0

| accettato

Risposto
What is the algorithm used by svd function?
We don't give information on what SVD algorithm we use, look up the LAPACK library for detailed descriptions. For practical pur...

circa 5 anni fa | 1

Risposto
Inverse of higher order matrix
Another way of looking at the equations x*Q = 0 and x e = 1 is as an equation system x * [Q e] = [0 1], which you could solve us...

circa 5 anni fa | 0

Risposto
How to decompose a 4th order tensor
The value of K1111 is overwritten with the next value in every loop iteration - is this your intention, or did you maybe mean to...

circa 5 anni fa | 0

Risposto
How can I find the Members of the largest component of a graph?
Use oF = F_prime.Nodes.Name(bin==m); instead of the find command to return node names instead of node numbers.

circa 5 anni fa | 1

| accettato

Risposto
Projecting data points onto eigenvector space
The lambda here is a diagonal matrix, so SORT will sort each of its columns, not the eigenvalues on the diagonal among themselve...

circa 5 anni fa | 0

Risposto
Soring varying and compex eigenvalues
This can't be done one the level of individual EIG calls, since it's necessary to track eigenvalues from one call to the next. T...

circa 5 anni fa | 0

| accettato

Risposto
Change position of Graph edge label and node label
The position of the labels that are part of the graph plot can't be modified. It's possible to create independent text labels an...

circa 5 anni fa | 0

Risposto
Specifying node numbers using digraph
The easiest way to use graph/digraph when your node numbers are not sequential is to convert the node numbers to string, which w...

circa 5 anni fa | 0

| accettato

Risposto
Cannot create a matrix using pinv.
You've hit on a rare matrix that the SVD algorithm isn't able to work with (the SVD being the factorization called withing the P...

circa 5 anni fa | 0

Risposto
Solving for ALL the eigenvectors of a sparse matrix
There isn't really an algorithm like this, unless you have a very specific structure (tridiagonal or banded matrix mostly). The...

circa 5 anni fa | 1

Risposto
How to add an edge between two nodes of two different graphs?
You could also add the edges of both graphs to one larger graph, and then use addedge to connect them. You would probably not ge...

circa 5 anni fa | 1

| accettato

Risposto
How to make nodes' removal from a graph as a function of time?
You may want to look at the graph and digraph classes: Graph and Network Algorithms and their method rmnode specifically.

circa 5 anni fa | 0

| accettato

Risposto
How to determine if a graph is two-connected?
The biconncomp function will split the edges of a graph into its biconnected components. If the output of biconncomp is a vector...

circa 5 anni fa | 0

Risposto
Computing generalized Inverse of a square but sparse matrix?
If you want to apply pinv(A)*b, you can instead use lsqminnorm(A, b), which also works for sparse matrices and does something eq...

circa 5 anni fa | 0

Risposto
Warning: Matrix is close to singular or badly scaled. Results may be inaccurate. RCOND = 9.735910e-18.
I tried plotting the following two things: >> figure; semilogy(max(abs(A), [], 1)) >> figure; semilogy(max(abs(A), [], 2)) Fr...

circa 5 anni fa | 0

| accettato

Risposto
Modify Nodes and Edges of GraphPlot
I'm afraid that's not possible with GraphPlot. For performance, you could use scatter to plot all the nodes, and plot to plot a...

circa 5 anni fa | 0

| accettato

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

oltre 5 anni fa | 2

| accettato

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

oltre 5 anni fa | 0

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

oltre 5 anni fa | 1

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

oltre 5 anni fa | 0

| accettato

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

oltre 5 anni fa | 0

| accettato

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

oltre 5 anni fa | 1

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

oltre 5 anni fa | 0

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

oltre 5 anni fa | 0