English, French, German
Pronouns:
She/her
Professional Interests:
Graph and Network Algorithms, Linear Algebra, Quantum Computing, Automatic Differentiation
Statistics
RANK
101
of 284,553
REPUTATION
1,264
CONTRIBUTIONS
0 Questions
398 Answers
ANSWER ACCEPTANCE
0.00%
VOTES RECEIVED
250
RANK
of 19,214
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
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
Content Feed
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...
1 month ago | 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...
1 month ago | 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(...
2 months ago | 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 ...
2 months ago | 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...
2 months ago | 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'...
3 months ago | 0
| accepted
computational complexity of svds
There is a recent function (introduced R2020b) called svdsketch, which is using randomized linear algebra. We recommend this for...
3 months ago | 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...
3 months ago | 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...
4 months ago | 0
| accepted
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...
4 months ago | 0
| accepted
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...
5 months ago | 1
| accepted
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 ...
5 months ago | 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...
5 months ago | 1
| accepted
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 ...
5 months ago | 0
| accepted
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 ...
6 months ago | 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 ...
8 months ago | 1
| accepted
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...
8 months ago | 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 ...
8 months ago | 1
| accepted
non linear eigen value problem
This isn't the standard definition of a nonlinear eigenvalue problem, where you would have only one scalar lambda. Am I underst...
8 months ago | 0
Issues with the normalisation of mode shapes?
eig(A, B) normalizes the eigenvectors in the B-mass norm, but only if it recognizes the input as a symmetric problem (A is symme...
10 months ago | 0
| accepted
Proof of relation between the generalized singular values of gsvd(A,B) and gsvd(B,A)
The background for this is the 5-output form of the GSVD: [U,V,X,C,S] = gsvd(A,B) returns unitary matrices U and V, a (usually)...
10 months ago | 0
Update a sparse matrix efficiently
The fastest way to construct a sparse matrix will be when the inputs are sorted, first by columns and then by rows. You can veri...
11 months ago | 1
Given a big square matrix and some eigenvalues, how to find the corresponding eigenvectors?
I wouldn't expect a 3072-by-3072 matrix to be a problem on the machine you describe. Could you try to run the following on your ...
11 months ago | 0
| accepted
new interface for QR decomposition in Matlab 2022a
Yes, we made this change for R2022a. I'm sorry this has caused problems for you, @Klaus Diepold, could you share how you had bee...
12 months ago | 1
how to find eigenvalues using the determinant ?
The determinant should only be used explicitly to solve an eigenvalue problem for symbolic calculation (for example, when you so...
1 year ago | 2
| accepted
GUI crashes when using eigs with a nonzero shift on a large generalised eigenvalue problem.
Ideally this shouldn't crash, but produce an out-of-memory error. However, for example on Linux there is the "out-of-memory kill...
1 year ago | 0
| accepted
GPU speed up for pcg() is disappointing
It looks like you can simply replace your current call to pcg with x = pcg(A, b, tol, 5000, @(y) L\y, @(y)L'\y); as the error ...
1 year ago | 0
What is matlab doing under the hood when I solve this generalized eigenvalue problem?
You can use the Display option to get some more information on what's going on inside of eigs. load matrices.mat [V,D] = eigs(...
1 year ago | 1
| accepted
Trapz error in calculating 2D integrals: ORDER contains an invalid permutation index
Replace the line I = cumtrapz(y,cumtrapz(x,MBerry(keySet),2)); with I = cumtrapz(y,cumtrapz(x,MBerry(keySet),2), 1); Here'...
1 year ago | 0
`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...
1 year ago | 1
You can also select a web site from the following list
Americas
- América Latina (Español)
- Canada (English)
- United States (English)
Europe
- 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)
Asia Pacific
- Australia (English)
- India (English)
- New Zealand (English)
- 中国
- 日本Japanese (日本語)
- 한국Korean (한국어)