Professional Interests: numerical linear algebra, graph algorithms

답변 있음

how would i change an undirected network into a directed network on matlab?

It depends on what you want to the directed graph to look like. To replace every undirected edge with two directed edges going i...

how would i change an undirected network into a directed network on matlab?

It depends on what you want to the directed graph to look like. To replace every undirected edge with two directed edges going i...

6일 전 | 1

답변 있음

Both eig() and eigs() function calculate different eigenvalues depending on optional input values

The problems seen here are due to M being symmetric positive semi-definite. Such a matrix is numerically singular, which can hav...

Both eig() and eigs() function calculate different eigenvalues depending on optional input values

The problems seen here are due to M being symmetric positive semi-definite. Such a matrix is numerically singular, which can hav...

19일 전 | 5

| 수락됨

답변 있음

Warning: Matrix is singular to working precision: What exactly generates this warning?

The warning is generated based on an estimate of the condition number (specifically, the reciprocal condition number in 1-norm, ...

Warning: Matrix is singular to working precision: What exactly generates this warning?

The warning is generated based on an estimate of the condition number (specifically, the reciprocal condition number in 1-norm, ...

19일 전 | 0

답변 있음

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

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

19일 전 | 1

답변 있음

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

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

약 1달 전 | 0

| 수락됨

답변 있음

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

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

약 1달 전 | 1

답변 있음

Direct Solver

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

Direct Solver

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

약 2달 전 | 1

답변 있음

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

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

약 2달 전 | 0

답변 있음

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

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

약 2달 전 | 0

| 수락됨

답변 있음

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

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

약 2달 전 | 1

답변 있음

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

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

2달 전 | 0

답변 있음

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

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

2달 전 | 0

답변 있음

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.

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.

2달 전 | 1

| 수락됨

답변 있음

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

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

2달 전 | 0

답변 있음

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

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

3달 전 | 0

| 수락됨

답변 있음

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

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

3달 전 | 0

답변 있음

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

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

3달 전 | 0

| 수락됨

답변 있음

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

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

3달 전 | 0

답변 있음

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

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

3달 전 | 1

답변 있음

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

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

3달 전 | 1

| 수락됨

답변 있음

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.

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.

3달 전 | 0

| 수락됨

답변 있음

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

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

3달 전 | 0

답변 있음

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

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

3달 전 | 0

답변 있음

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

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

3달 전 | 0

| 수락됨

답변 있음

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

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

3달 전 | 0

| 수락됨

답변 있음

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

4달 전 | 2

| 수락됨

답변 있음

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

4달 전 | 0

답변 있음

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

4달 전 | 1

답변 있음

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

4달 전 | 0

| 수락됨

답변 있음

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

5달 전 | 0

| 수락됨