Spoken Languages:
English, French, German
Pronouns:
She/her
Professional Interests:
Graph and Network Algorithms, Linear Algebra, Quantum Computing, Automatic Differentiation
English, French, German
Pronouns:
She/her
Professional Interests:
Graph and Network Algorithms, Linear Algebra, Quantum Computing, Automatic Differentiation
Accept 2 answers given by other contributors
Awarded to Christine Tobler on 22 May 2023
Solve a problem for the first time
Awarded to Christine Tobler on 13 Jul 2020
100 of your answers have been accepted
Awarded to Christine Tobler on 02 Jul 2020
Contribute at least one answer each month for 36 consecutive months
Awarded to Christine Tobler on 02 Jul 2020
Answer 3 questions that were unanswered for more than 30 days
Awarded to Christine Tobler on 10 Aug 2018
Provide your first answer ever to someone else's question
Awarded to Christine Tobler on 20 Jul 2017
Feeds
답변 있음
What is the residual defined in eigs?
The issue is likely that eigs doesn't use the residual as you describe it: The iterative algorithm used inside of eigs when comp...
What is the residual defined in eigs?
The issue is likely that eigs doesn't use the residual as you describe it: The iterative algorithm used inside of eigs when comp...
16일 전 | 0
답변 있음
LU decomposition with 5 output arguments
As Matt says, the simplest is likely to just use decomposition object. In terms of how to solve a linear system, the doc page g...
LU decomposition with 5 output arguments
As Matt says, the simplest is likely to just use decomposition object. In terms of how to solve a linear system, the doc page g...
27일 전 | 2
| 수락됨
답변 있음
Proper Installation of Tensor Toolbox
Find the path the folder that defines the class you want to use. My guess is for Tucker this will be the ttensor class (but it's...
Proper Installation of Tensor Toolbox
Find the path the folder that defines the class you want to use. My guess is for Tucker this will be the ttensor class (but it's...
대략 1개월 전 | 0
답변 있음
Computing eigenvalues and eigenvectors of two symbolic matrices
eig does not support the two-input syntax for symbolic. For the call eig(B, A), if A is invertible you can instead solve eig(A\B...
Computing eigenvalues and eigenvectors of two symbolic matrices
eig does not support the two-input syntax for symbolic. For the call eig(B, A), if A is invertible you can instead solve eig(A\B...
대략 1개월 전 | 0
답변 있음
Stability analysis of a time dependent Lyapunov equation
The tensorprod function doesn't do what you are looking for here, that would be kron (short for Kronecker product). It also see...
Stability analysis of a time dependent Lyapunov equation
The tensorprod function doesn't do what you are looking for here, that would be kron (short for Kronecker product). It also see...
대략 2개월 전 | 0
답변 있음
getting warning while using eigs on the matrices obtained from freefem++
If modifying the input sigma doesn't help, it's likely that for your call eigs(A, B, sigma, ...) the matrices are such that A - ...
getting warning while using eigs on the matrices obtained from freefem++
If modifying the input sigma doesn't help, it's likely that for your call eigs(A, B, sigma, ...) the matrices are such that A - ...
2개월 전 | 0
| 수락됨
답변 있음
Trying to construct a filtered graph using pmfg function that uses the (MATLAB-BGL) library in MacBook.
The problem seems to be with the MatlabBGL FileExchange package and specifically with the .mex files that are being provided the...
Trying to construct a filtered graph using pmfg function that uses the (MATLAB-BGL) library in MacBook.
The problem seems to be with the MatlabBGL FileExchange package and specifically with the .mex files that are being provided the...
2개월 전 | 0
| 수락됨
답변 있음
Can I get all of the shortest paths between all pairs of nodes in a Directed Graph in one function call
Using shortestpathtree in a loop over the starting node is the way to go. You can change the data format of the first output by ...
Can I get all of the shortest paths between all pairs of nodes in a Directed Graph in one function call
Using shortestpathtree in a loop over the starting node is the way to go. You can change the data format of the first output by ...
3개월 전 | 1
답변 있음
Inconsistency between Matlab eig() function and Matlab generated C code eig() function
For code generation, the eig function doesn't have as many special-case treatments as the eig function in regular MATLAB. This m...
Inconsistency between Matlab eig() function and Matlab generated C code eig() function
For code generation, the eig function doesn't have as many special-case treatments as the eig function in regular MATLAB. This m...
3개월 전 | 2
| 수락됨
답변 있음
How to control the curvature of each edge when drawing graph object?
The curvature of the edges in this plot aren't controllable. You could turn off the edges from the graph plot, and use the plot ...
How to control the curvature of each edge when drawing graph object?
The curvature of the edges in this plot aren't controllable. You could turn off the edges from the graph plot, and use the plot ...
3개월 전 | 1
답변 있음
eigs function works slowly
A possible issue is that "largestreal" option works less towards the strengths of the EIGS algorithm than the default "largestab...
eigs function works slowly
A possible issue is that "largestreal" option works less towards the strengths of the EIGS algorithm than the default "largestab...
3개월 전 | 0
답변 있음
Why is my parfor loop running slower than a regular for loop
The problem is likely that the cost of each iteration is still too small to warrant the start-up time of the parfor loop. You c...
Why is my parfor loop running slower than a regular for loop
The problem is likely that the cost of each iteration is still too small to warrant the start-up time of the parfor loop. You c...
4개월 전 | 0
답변 있음
Quick method in solving symmetric linear equation
You can definitely use iterative methods such as pcg. The success of this usually depends on how well-conditioned your matrix is...
Quick method in solving symmetric linear equation
You can definitely use iterative methods such as pcg. The success of this usually depends on how well-conditioned your matrix is...
6개월 전 | 1
답변 있음
doc QR decomposition error
Hi, As you can see here, R is an m by n matrix and Q is an m by m matrix in the default behavior of the qr function: A = randn...
doc QR decomposition error
Hi, As you can see here, R is an m by n matrix and Q is an m by m matrix in the default behavior of the qr function: A = randn...
6개월 전 | 0
답변 있음
Replacing old version graphshortestpath with new shortestpath function
You can replace [ dist,path{1} ] = graphshortestpath( adjMatrix, 1, numel(newImg(:))); with [ path{1}, dist ] = shortestpath(...
Replacing old version graphshortestpath with new shortestpath function
You can replace [ dist,path{1} ] = graphshortestpath( adjMatrix, 1, numel(newImg(:))); with [ path{1}, dist ] = shortestpath(...
6개월 전 | 0
답변 있음
Eigenvalues and Eigenvector computation on extremely bad conditioned matrices
If the matrix P has rank 120 and its size is 160, you should expect 40 eigenvalues to be Inf - this is how singularities in the ...
Eigenvalues and Eigenvector computation on extremely bad conditioned matrices
If the matrix P has rank 120 and its size is 160, you should expect 40 eigenvalues to be Inf - this is how singularities in the ...
6개월 전 | 0
답변 있음
QR factorization of a low rank matrix
Let's start with computing a rank-2 approximation of a large matrix. In general, this would be done using the SVD, but if you kn...
QR factorization of a low rank matrix
Let's start with computing a rank-2 approximation of a large matrix. In general, this would be done using the SVD, but if you kn...
7개월 전 | 0
답변 있음
Can additional information be added to the directed graph plotting node 'tooltip'?
Yes, you can do this using the dataTipTextRow function: nodeNames = {'Node A', 'Node B', 'Node C', 'Node D', 'Node E', 'Node F'...
Can additional information be added to the directed graph plotting node 'tooltip'?
Yes, you can do this using the dataTipTextRow function: nodeNames = {'Node A', 'Node B', 'Node C', 'Node D', 'Node E', 'Node F'...
8개월 전 | 0
| 수락됨
답변 있음
computational complexity of svds
There is a recent function (introduced R2020b) called svdsketch, which is using randomized linear algebra. We recommend this for...
computational complexity of svds
There is a recent function (introduced R2020b) called svdsketch, which is using randomized linear algebra. We recommend this for...
8개월 전 | 0
답변 있음
Write Hamiltonian using kron function
For a 6-dimensional Kronecker product, you would want to take Sz = [1 0; 0 -1]; I = [1 0; 0 1]; and apply the Kronecker produ...
Write Hamiltonian using kron function
For a 6-dimensional Kronecker product, you would want to take Sz = [1 0; 0 -1]; I = [1 0; 0 1]; and apply the Kronecker produ...
8개월 전 | 0
답변 있음
Algorithm for edge connectivity of a digraph?
There is no direct method in MATLAB for computing the edge connectivity. Based on the Wikipedia page, you should be able to comp...
Algorithm for edge connectivity of a digraph?
There is no direct method in MATLAB for computing the edge connectivity. Based on the Wikipedia page, you should be able to comp...
9개월 전 | 0
| 수락됨
답변 있음
Get coordinates of 3-D force-directed graph plot without plotting?
There isn't currently such a function available. For the example above, nearly all the time is being spent in computing the coo...
Get coordinates of 3-D force-directed graph plot without plotting?
There isn't currently such a function available. For the example above, nearly all the time is being spent in computing the coo...
9개월 전 | 0
| 수락됨
답변 있음
Obtain eigs from matrix and partially known eigenvector
Hi Jennifer, You are right that matrix P here is a block-diagonal matrix with three blocks: [A 0 0; 0 B 0 0 0 C] And for su...
Obtain eigs from matrix and partially known eigenvector
Hi Jennifer, You are right that matrix P here is a block-diagonal matrix with three blocks: [A 0 0; 0 B 0 0 0 C] And for su...
10개월 전 | 1
| 수락됨
답변 있음
finding degree and neighbor of each vertex in a subgraph H but indexing according to original graph
I think the easiest will be to build on what you started by giving the nodes in graph G names which are just the string version ...
finding degree and neighbor of each vertex in a subgraph H but indexing according to original graph
I think the easiest will be to build on what you started by giving the nodes in graph G names which are just the string version ...
10개월 전 | 0
답변 있음
Change of parameters of Gates in quantumCircuit does not take effect
This is a bug, thank you for reporting it. As a workaround while waiting for this to be addressed, pleaseconstruct a new gate in...
Change of parameters of Gates in quantumCircuit does not take effect
This is a bug, thank you for reporting it. As a workaround while waiting for this to be addressed, pleaseconstruct a new gate in...
10개월 전 | 2
| 수락됨
답변 있음
how to find neighbors/degree of hyperedges of a uniform hypergraph?
MATLAB doesn't support hypergraphs, but often a specific problem can be solved with just a graph or multigraph, by interpreting ...
how to find neighbors/degree of hyperedges of a uniform hypergraph?
MATLAB doesn't support hypergraphs, but often a specific problem can be solved with just a graph or multigraph, by interpreting ...
10개월 전 | 0
| 수락됨
답변 있음
LU decomposition algorithm change
As you point out, this kind of difference in result is to be expected and is well withing expected round-off behavior. Another ...
LU decomposition algorithm change
As you point out, this kind of difference in result is to be expected and is well withing expected round-off behavior. Another ...
11개월 전 | 1
답변 있음
How can I plot a multilayer graph (2 layer) starting from adjacency matrices?
Here's an example of how to do this (using just some random data, since I don't have the matrices you mention above). % Choose ...
How can I plot a multilayer graph (2 layer) starting from adjacency matrices?
Here's an example of how to do this (using just some random data, since I don't have the matrices you mention above). % Choose ...
대략 1년 전 | 1
| 수락됨
답변 있음
How to create a random graph that is connected?
If an undirected graph is connected, it must contain at least one path that visits each node at least once. You could construct...
How to create a random graph that is connected?
If an undirected graph is connected, it must contain at least one path that visits each node at least once. You could construct...
대략 1년 전 | 0
답변 있음
I have a question about the distributed computing of the eig function.
EIG for distributed arrays calls into the ScaLAPACK library - the references given by ScaLAPACK documentation would be the best ...
I have a question about the distributed computing of the eig function.
EIG for distributed arrays calls into the ScaLAPACK library - the references given by ScaLAPACK documentation would be the best ...
대략 1년 전 | 1
| 수락됨
또한 다음 목록에서 웹사이트를 선택하실 수도 있습니다.
미주
- América Latina (Español)
- Canada (English)
- United States (English)
유럽
- Belgium (English)
- Denmark (English)
- Deutschland (Deutsch)
- España (Español)
- Finland (English)
- France (Français)
- Ireland (English)
- Italia (Italiano)
- Luxembourg (English)
- Netherlands (English)
- Norway (English)
- Österreich (Deutsch)
- Portugal (English)
- Sweden (English)
- Switzerland
- United Kingdom (English)
아시아 태평양
- Australia (English)
- India (English)
- New Zealand (English)
- 中国
- 日本Japanese (日本語)
- 한국Korean (한국어)