Community Profile

photo

Christine Tobler

Last seen: 1 dag ago Active since 2015

Statistics

All
  • Solver
  • Knowledgeable Level 5
  • 36 Month Streak
  • Thankful Level 1
  • Pro
  • Revival Level 2
  • First Answer

View badges

Content Feed

View by

Answered
How to check if there is an edge between two nodes in an undirected graph?
Call findedge(g, node1, node2). If there is no edge connecting these nodes, the output is zero. Otherwise, the output is the ind...

5 dagen ago | 0

| accepted

Answered
Why does lu function yield different lower triangle matrix if I return [L,U] rather than [L, U, P]?
The LU decomposition really involves three new matrices: An upper-triangular matrix U, a lower-triangular matrix L, and a permut...

7 dagen ago | 0

| accepted

Answered
How to find a permutation matrix to turn a general hermitian matrix into a block diagonal one?
First, we should keep in mind that the task is really to find a representation of A with as small blocks on the diagonal as poss...

7 dagen ago | 0

Answered
Interpreting eigenvalues and eigenvectors when using symbolic toolbox
I'm getting both 4 eigenvalues and 4 eigenvectors when running your code: linkMatrix = [0,1/3,1/3,1/3; 0,0,1,0; ...

9 dagen ago | 0

| accepted

Answered
Different behaviour in indexing between table and digraph node table
This is a bug in digraph, thank you for reporting it! I have passed it along and it will be fixed in a future release.

15 dagen ago | 0

| accepted

Answered
Linking nodes using links in a graph based on information from another layer
You could represent the first layer as a graph object, adding coordinate information for each node to the Nodes table. For the s...

15 dagen ago | 0

Answered
Error message when trying to compute EOF with covariance matrix.
The problem is that the covariance matrix becomes very large here. Luckily, it's not necessary to compute this matrix explicitly...

19 dagen ago | 0

| accepted

Answered
Sorting eigenvectors using symbolic toolbox for PageRank algorithm
There's an unknown variable in the value you pass to sort, so this won't be sorted by magnitude as the magnitude isn't known. H...

20 dagen ago | 0

| accepted

Answered
eigenvalue and eigenvector of free vibration while stiffness matrix is not invertable
If eig has been working well for the size of your problem you could consider using [U, D] = eig(K, M); %this solves K*U = M*U*D...

20 dagen ago | 1

| accepted

Answered
Finding a node in graph with most mutually adjacent nodes
Thanks for adding the tag, Steve! Here's another idea for how to do this. So you want to find all pairs of edges that go a->b a...

26 dagen ago | 1

| accepted

Answered
eigen value what i am getting from matlab software that is not exact when i am compairing with hand calculated value and the mode shape i am getting is reverse
The results look correct to me, can you say what you are expecting instead? Two points that are maybe relevant: MATLAB does num...

ongeveer een maand ago | 0

Answered
The node number in the digraph does not match the node number used in shortestpath().
Try putting the node numbers in quotes: [path,d, edgepath] = shortestpath(G,"228","231"); You have given each node a name, and...

ongeveer een maand ago | 1

| accepted

Answered
Unitary matrix with non-orthogonal eigenvectors?
The short answer is that it's possible to compute an orthonormal basis of eigenvectors for an orthogonal matrix, but that MATLAB...

ongeveer 2 maanden ago | 2

| accepted

Answered
Eigenvalue problem on non-Hermitian matrix
You can think of it like this: If there is an invertible V such that inv(V)*H*V=D, then you can expect that the matrix myW = inv...

ongeveer 2 maanden ago | 0

| accepted

Answered
Seasonal Breakdown from a Time Series data
Perhaps the trenddecomp function would be useful? It has an optional input period where a vector of several periods can also be ...

ongeveer 2 maanden ago | 0

Answered
How to find all the downstream nodes from a node in a graph?
Looking at this again due to the recent comment added, it might be simpler to use a directed graph instead of an undirected one:...

2 maanden ago | 1

Answered
Which solver should I use to solve a square and symmetric, linear system of equations?
The first thing to check is the size and density of your matrix. The SYMMLQ function you mentioned is one of a group of methods ...

2 maanden ago | 1

| accepted

Answered
Can we compute the graph Laplacian matrix for a directed graph?
It depends how you want to define it, there is no one consistent definition of what the graph laplacian of a directed graph is. ...

2 maanden ago | 1

| accepted

Answered
eigs using 'smallestabs' vs scalar
Hi Jack, I had initially misunderstood that you were getting different results when passing in 'smallestabs' vs. passing in the...

3 maanden ago | 0

| accepted

Answered
missing eigenvector when using eig on defective matrix
The short answer is that this is a case where a small change in the input matrix has a large effect on the eigenvectors being co...

3 maanden ago | 1

| accepted

Answered
THE GRAPH FUNCTION DOESN'T CONSIDER WEIGHTS
Hard to say what's going wrong without seeing your code. Here's an example where you can see the weights being used to decide on...

4 maanden ago | 1

| accepted

Answered
mldivide (backslash): advantage by using sparse matrix instead of a full matrix with respect to the quality of the results?
The condition estimate used in mldivide to decide if a warning should be given is much less accurate for the sparse case. This i...

4 maanden ago | 2

| accepted

Answered
LDL does not support complex symmetric matrices
Largely the reason LDL doesn't support this is that it's less commonly requested for complex symmetric matrices than for complex...

5 maanden ago | 0

| accepted

Answered
Inconsistency in behavior of SVD
Firstly, I agree completely with John's great explanations above: Any singular value below eps*first singular value should be tr...

5 maanden ago | 3

| accepted

Answered
Accuracy Problem when solving linear equation system using: lu(S) vs. decomposition(S,'lu')
The version in decomposition does some optional steps of iterative refinement: It uses the same solution you have above based on...

5 maanden ago | 0

| accepted

Answered
Need help fixing errors on code written in old MATLAB syntax
I'd also recommend replacing the calls svd(A) and svd(A, 0) with calling svd(A, 'econ'), since the code here is only using the f...

5 maanden ago | 0

Answered
Different results on different computers, Matlab 2021b - 64 bit, windows 64 bit, both Intel chips
First, about "which value to trust?" Both values are equally trustworthy, the differences in results come down to applying the ...

6 maanden ago | 1

| accepted

Answered
eigs with Extended Capabilities
The first of these would only be useful if you need to apply EIGS to many problems in parallel, in which case each of these coul...

6 maanden ago | 1

Answered
How to parallelize many small SVD's on a GPU
As of R2021b, there is a function pagesvd which is supported on both CPU and distributed arrays. It's not supported for gpuArray...

6 maanden ago | 2

| accepted

Answered
How does shortestpath function work?
Every edge has a number, which is the order in which they appear in the Edges table (try displaying g.Edges). The edgepath conta...

6 maanden ago | 1

| accepted

Load more