Réponse apportée
How does the eig function calculate its values?
Could you tell us what your results are? Eigenvectors are not uniquely defined, so it's possible for them to look quite differen...

plus de 8 ans il y a | 1

Réponse apportée
Why my matlab does not take "graph" in command window? is there something missing in my matlab?
The graph feature has been shipping since release R2015b. Maybe you have an earlier release? Try entering >> g = graph(1,...

plus de 8 ans il y a | 1

| A accepté

Réponse apportée
COND for homogeneous equations?
That's an interesting question, I'm not sure what the right way to do this is. In a first step, the matrix condition number desc...

plus de 8 ans il y a | 2

Réponse apportée
Index exceeds matrix dimensions error
With index out of bounds errors, in can be useful to do the following: >> dbstop on error >> ... run your code ... When...

plus de 8 ans il y a | 0

Réponse apportée
eigenvector centrality vs pagerank
It's possible to define eigenvector centrality for directed graphs, but it's rarely done, because in most cases the output is no...

plus de 8 ans il y a | 2

| A accepté

Réponse apportée
Is it possible to speed-up solving Ax=b for multiple b's by pre-computing the Cholesky factorization of A?
The main reason the first call is slower is that |R = chol(A)| for a sparse matrix tends to have a large amount of fill-in (that...

plus de 8 ans il y a | 5

| A accepté

Réponse apportée
Approximation of 3D points with a 3D curve (path smoothing)
You could try the <https://www.mathworks.com/help/matlab/ref/smoothdata.html smoothdata> function, which would just smooth the x...

plus de 8 ans il y a | 0

Réponse apportée
eigs() runs faster for more eigenvalues of the same matrix
The reason is that the "search space" used in each iteration is determined based on the number of eigenvalues requested. By incr...

plus de 8 ans il y a | 3

| A accepté

Réponse apportée
incosistent matrix multiplication and probelm with covarince matrix
A way to avoid computing negative eigenvalues is to work only on a part of the matrix: S2 = J*sqrt(C); %implicitly, S = S2...

plus de 8 ans il y a | 1

Réponse apportée
Edge Clutter Reduction in a Graph
I'm afraid there is currently no option for MATLAB's graph plot to do edge bundling.

plus de 8 ans il y a | 0

Réponse apportée
Why are my eigenvalues complex? (eig)
The eigenvalues of a real matrix are only real if the matrix is symmetric. The matrix C is not symmetric, therefore the eigenval...

presque 9 ans il y a | 0

Réponse apportée
What's the truncation error in SVD?
Use |dsp = norm(ds(n+1:end)) / norm(ds)| instead of the sum. This is because in |norm(U*S*V', 'fro')|, you can move U and V o...

presque 9 ans il y a | 0

Réponse apportée
Are there any codes to generate planar graphs in matlab or are there any large collections of planar graphs in matlab?
Can you give some more context on what kinds of planar graphs you are looking for? Are you trying to test an algorithm, maybe? ...

presque 9 ans il y a | 0

Réponse apportée
Are there any codes to generate planar graphs in matlab or are there any large collections of planar graphs in matlab?
This is definitely the simplest way of generating random planar graphs in MATLAB, and should be reasonably quick (Delaunay trian...

presque 9 ans il y a | 0

Réponse apportée
Are there matlab codes to compute cycle spaces of graphs?
There is no direct method to compute this in MATLAB's graph classes. From reading the wiki page, it seems that the following wil...

presque 9 ans il y a | 2

Réponse apportée
Error with eigenvalues of unitary matrix
As mentioned in the comments above, if you are intending to compute all eigenvalues, it's best to call EIG, not EIGS. In fact, e...

presque 9 ans il y a | 2

| A accepté

Réponse apportée
How to convert graph to digraph?
I'm afraid it's not possible to have both directed and undirected edges in the same graph. To convert a graph to a digraph, you ...

presque 9 ans il y a | 0

| A accepté

Réponse apportée
Help with graphs - breadth search
This should be possible using the digraph object. Since you are modifying the graph, it may be best to write a for-loop that wil...

presque 9 ans il y a | 0

Réponse apportée
computing SVD of very large matrix
The simplest way may be to use a computer with more memory - a matrix of size 1100000 x 1100 takes about 9GB of memory, which is...

presque 9 ans il y a | 1

Réponse apportée
finding paths in a graph
I'm afraid I don't completely understand your question. In the strictest sense, what you describe is already done by dfsearch. H...

presque 9 ans il y a | 0

Réponse apportée
Null is misbehaving if used within loops.
Try using null(Z) instead of null(Z, 'r') With the 'r' option, no tolerance for round-off errors in the matrix Z ...

presque 9 ans il y a | 1

Réponse apportée
Sparse Matrix build efficiency
i) You should expect constructing a sparse matrix in a loop by adding elements using indexing A(i, j) = s to be slower than cons...

presque 9 ans il y a | 0

Réponse apportée
bdschur algorithm in Matlab
According to the file bdschur.m, this uses LAPACK's DTRSYL and SLICOT's MB03RD functions. See >> edit bdschur

environ 9 ans il y a | 0

| A accepté

Réponse apportée
Overloading arithmetic on graphs or digraphs
I'm afraid methods for MATLAB's digraph class can't be overloaded. There is still a way to get what you want, but it may be mor...

environ 9 ans il y a | 0

| A accepté

Réponse apportée
Return conditional from mrdivide
You could use the linsolve function, with a second output argument: [x, rcond] = linsolve(A, b); This solves the linear s...

environ 9 ans il y a | 1

| A accepté

Réponse apportée
How to easily solve an equation of the form AX =B where A is a large sparse matrix???
P1: With the Finite Difference Method, the matrix will often be singular if there aren't sufficient boundary conditions added to...

environ 9 ans il y a | 0

Réponse apportée
How to replace the diagonal elements of a matrix with 0 fro avoiding self loops?
If you are using the graph/digraph classes, you can also tell the constructor not to insert any self-loops for the diagonal elem...

environ 9 ans il y a | 1

Réponse apportée
Calculate number of following nodes in a directed graph
For one particular node, you can use nearest(G, u, Inf) to get a list of all nodes that are reachable from node G, at any...

environ 9 ans il y a | 0

| A accepté

Réponse apportée
To get dominant eigen vector
I realize this is an old post, but this might be helpful to others: One reason for EIG to return complex values with very sma...

environ 9 ans il y a | 0

Réponse apportée
How to change double matrix to float to avoid out of memory issue?
I'm afraid MATLAB doesn't support single sparse matrices. Do you get the out of memory error when calling the laplacian funct...

environ 9 ans il y a | 0