# Christine Tobler

### MathWorks

Professional Interests: numerical linear algebra, graph algorithms

**Statistics**

RANK**98**

of 262.996

REPUTATION**1.156**

CONTRIBUTIONS

**0** Questions

**369** Answers

ANSWER ACCEPTANCE **
0.00%
**

VOTES RECEIVED**227**

RANK

of 18.000

REPUTATION**N/A**

AVERAGE RATING**0.00**

CONTRIBUTIONS**0** Files

DOWNLOADS **0**

ALL TIME DOWNLOADS**0**

CONTRIBUTIONS**0 Posts**

CONTRIBUTIONS**0** Public Channels

AVERAGE RATING

CONTRIBUTIONS**0** Highlights

AVERAGE NO. OF LIKES

**Content Feed**

`svd` sometimes blows up - how to fix it?

In short, the problem is that pinv_modified is based on a misunderstanding of the workaround here. The idea is to check if SVD f...

13 días ago | 1

Calculating node coordinates for a graph without plot command

Unfortunately there isn't a way to get these coordinates without plotting. I have added your request for such a function to our ...

16 días ago | 1

| accepted

'MarkerEdgeColor' for Graph/Digraph Nodes

Yes, MATLAB's graph and digraph plots only have one NodeColor property which applies to both the marker's FaceColor and EdgeColo...

16 días ago | 0

How to convert a graph / edges list into a shapefile (.shp) ?

There isn't a direct way to do this with a graph object. The mapping toolbox has a shapewrite function which produces a .shp fil...

alrededor de 1 mes ago | 0

Condition number of empty matrix

The case of a 0-by-0 matrix doesn't have any very useful definition, as you note correctly in the comments above. MATLAB does w...

alrededor de 2 meses ago | 1

| accepted

How to fix **Warning: Matrix is close to singular or badly scaled. Results may be inaccurate. RCOND = 1.053110e-20.** ?

Yes, the matrix A becomes singular after applying the last two for-loops (which I think are the boundary conditions). You can v...

3 meses ago | 1

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

3 meses ago | 0

| accepted

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

3 meses ago | 0

| accepted

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

3 meses ago | 0

| accepted

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

3 meses ago | 0

| accepted

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.

3 meses ago | 0

| accepted

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

3 meses ago | 0

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

3 meses ago | 0

| accepted

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

4 meses ago | 0

| accepted

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

4 meses ago | 1

| accepted

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

4 meses ago | 1

| accepted

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

4 meses ago | 0

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

4 meses ago | 1

| accepted

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

4 meses ago | 2

| accepted

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

5 meses ago | 0

| accepted

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

5 meses ago | 0

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

5 meses ago | 1

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

5 meses ago | 1

| accepted

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

5 meses ago | 1

| accepted

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

6 meses ago | 0

| accepted

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

6 meses ago | 1

| accepted

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

7 meses ago | 1

| accepted

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

7 meses ago | 2

| accepted

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

7 meses ago | 0

| accepted

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

8 meses ago | 3

| accepted