Spoken Languages:
English, French, German
Pronouns:
She/her
Professional Interests:
Linear Algebra, Graph and Network Algorithms, Quantum Computing
English, French, German
Pronouns:
She/her
Professional Interests:
Linear Algebra, Graph and Network Algorithms, Quantum Computing
Feeds
已回答
Why does backslash behave differently when transposition is used in-line?
This is an optimization that's present in both matrix multiplication and backslash: When transposition is applied as part of the...
Why does backslash behave differently when transposition is used in-line?
This is an optimization that's present in both matrix multiplication and backslash: When transposition is applied as part of the...
13 days 前 | 3
| 已接受
已回答
Finding all eigen value between two given eigen value.
Since you know both omega1 and omega2, and know that K is symmetric and M is symmetric positive definite (meaning the eigenvalue...
Finding all eigen value between two given eigen value.
Since you know both omega1 and omega2, and know that K is symmetric and M is symmetric positive definite (meaning the eigenvalue...
18 days 前 | 1
已回答
How can I quickly find the eigenvalues and eigenvectors of a matrix with a special structure using high-precision calculations?
Does Advanpix support eig / eigs for their class, using an overload? If not, I think eigs may have some issues, because the tole...
How can I quickly find the eigenvalues and eigenvectors of a matrix with a special structure using high-precision calculations?
Does Advanpix support eig / eigs for their class, using an overload? If not, I think eigs may have some issues, because the tole...
2 months 前 | 2
已回答
Finite elements model using STABIL
Since this is finite-element-based, my first thought is that you may have some all-zero rows or columns in matrix K. That can ha...
Finite elements model using STABIL
Since this is finite-element-based, my first thought is that you may have some all-zero rows or columns in matrix K. That can ha...
5 months 前 | 0
已回答
Why is the timing for decomposition and backsolve for M and M' so different?
Thank you for including the smaller matrices to reproduce the issue! It seems you're running into an edge case where we detect ...
Why is the timing for decomposition and backsolve for M and M' so different?
Thank you for including the smaller matrices to reproduce the issue! It seems you're running into an edge case where we detect ...
6 months 前 | 3
| 已接受
已回答
How does the svd function determine or fix the phase of singular vectors?
Hi Lv-lin, 1. MATLAB computes SVD internally through a completely separate algorithm than EIG, with both algorithms provided b...
How does the svd function determine or fix the phase of singular vectors?
Hi Lv-lin, 1. MATLAB computes SVD internally through a completely separate algorithm than EIG, with both algorithms provided b...
7 months 前 | 1
已回答
Iterating the eigenvalue function (eig) produces patterns --- is this a well known result?
Hi David, This is very interesting! To answer your questions: oo one question is, is this well known behavior? I'm not awa...
Iterating the eigenvalue function (eig) produces patterns --- is this a well known result?
Hi David, This is very interesting! To answer your questions: oo one question is, is this well known behavior? I'm not awa...
7 months 前 | 0
已回答
double free or corruption (out) error when using MATLAB Runtime 2023b
This seems to point to a memory corruption, the source of which is always hard to pinpoint (since the corruption could have happ...
double free or corruption (out) error when using MATLAB Runtime 2023b
This seems to point to a memory corruption, the source of which is always hard to pinpoint (since the corruption could have happ...
9 months 前 | 0
已回答
Calculate eigenfunctions to known eigenvalues
Unfortunately, there isn't a painless way to do this. That is, it's likely that writing new code to get eigenvectors given the e...
Calculate eigenfunctions to known eigenvalues
Unfortunately, there isn't a painless way to do this. That is, it's likely that writing new code to get eigenvectors given the e...
9 months 前 | 0
| 已接受
已回答
Backslash (mldivide) slower than inverse and multiplication
Hi AB, This is an interesting question. The conventional wisdom is based on the computational complexity, meaning it prioritize...
Backslash (mldivide) slower than inverse and multiplication
Hi AB, This is an interesting question. The conventional wisdom is based on the computational complexity, meaning it prioritize...
9 months 前 | 10
| 已接受
已回答
Symbolic Eigenvalue Assignment with Matlab Symbolic Math Toolbox
It seems that the svd function in Symbolic Toolbox supports the one-output syntax in general, but only supports the 3-input synt...
Symbolic Eigenvalue Assignment with Matlab Symbolic Math Toolbox
It seems that the svd function in Symbolic Toolbox supports the one-output syntax in general, but only supports the 3-input synt...
10 months 前 | 0
| 已接受
已回答
real power of matrices
I'm not seeing the described behavior: x = [1 0 0; 0 1 0; 2 3 1]; y = mpower(x, 0.5) y*y Can you try to rerun the code?
real power of matrices
I'm not seeing the described behavior: x = [1 0 0; 0 1 0; 2 3 1]; y = mpower(x, 0.5) y*y Can you try to rerun the code?
11 months 前 | 0
已回答
How does Matlabs svd() function calculate the value of V?
Hi Caleb, Happy to discuss the svd with you! That being said, as others here have mentioned, svd is a building block and not e...
How does Matlabs svd() function calculate the value of V?
Hi Caleb, Happy to discuss the svd with you! That being said, as others here have mentioned, svd is a building block and not e...
11 months 前 | 1
已回答
NaN output only when using three ouput for QR
The 3-output syntax and the 2-output syntax of QR use different implementations, so that's likely the reason you're seeing diffe...
NaN output only when using three ouput for QR
The 3-output syntax and the 2-output syntax of QR use different implementations, so that's likely the reason you're seeing diffe...
1 year 前 | 1
已回答
In a (possibly directed) graph, is there a simple way to find all nodes reachable for a given node?
The quickest way to find all nodes reachable from a given node is using the nearest function with Inf as the distance: g = digr...
In a (possibly directed) graph, is there a simple way to find all nodes reachable for a given node?
The quickest way to find all nodes reachable from a given node is using the nearest function with Inf as the distance: g = digr...
1 year 前 | 1
已回答
eig() working where eigs() doesn't
The 'largestreal' option can be useful, but this depends on the problem. The iteration inside eigs will naturally find the eigen...
eig() working where eigs() doesn't
The 'largestreal' option can be useful, but this depends on the problem. The iteration inside eigs will naturally find the eigen...
1 year 前 | 0
已回答
Should mldivide Return a Solution for Square, Rank-Deficient, but Consistent Set of Linear Equations?
Hi Paul! You can use x = linsolve(A, b, struct('RECT', true)); to use the QR method of mldivide even if A is square. To get ...
Should mldivide Return a Solution for Square, Rank-Deficient, but Consistent Set of Linear Equations?
Hi Paul! You can use x = linsolve(A, b, struct('RECT', true)); to use the QR method of mldivide even if A is square. To get ...
1 year 前 | 3
| 已接受
已回答
how can improve limitation of input simulation function of quantum circuit.limitation is number of qubits
The limit of 20-30 qubits is what would be expected for a state vector simulation, which requires a vector of length 2^NumQubits...
how can improve limitation of input simulation function of quantum circuit.limitation is number of qubits
The limit of 20-30 qubits is what would be expected for a state vector simulation, which requires a vector of length 2^NumQubits...
1 year 前 | 0
已回答
Problem in assigning proper eigevalues in a for-loop
Sorting the returned eigenvalues by their real part (since you are plotting only the real part of the eigenvalues) should help. ...
Problem in assigning proper eigevalues in a for-loop
Sorting the returned eigenvalues by their real part (since you are plotting only the real part of the eigenvalues) should help. ...
1 year 前 | 0
| 已接受
已回答
polyeig calculating few polynomial eigenvalue
While there is no equivalent to eigs for polyeig, if you just need some eigenvalues, you could step through polyeig.m and get wh...
polyeig calculating few polynomial eigenvalue
While there is no equivalent to eigs for polyeig, if you just need some eigenvalues, you could step through polyeig.m and get wh...
1 year 前 | 0
已回答
Numerical search for the singular points of a complex matrix
From your description, it appears you have a nonlinear eigenvalue problem (a matrix A(lambda) where you are looking for a comple...
Numerical search for the singular points of a complex matrix
From your description, it appears you have a nonlinear eigenvalue problem (a matrix A(lambda) where you are looking for a comple...
1 year 前 | 0
已回答
Non Linear Eigenvalue problem
Sorry for answering so long after the initial post. One option you could consider for solving a nonlinear eigenvalue problem is ...
Non Linear Eigenvalue problem
Sorry for answering so long after the initial post. One option you could consider for solving a nonlinear eigenvalue problem is ...
1 year 前 | 0
已回答
Incorrect evaluation by Composite Quantum Gate
The issue is a typo in your code. Instead of constructing 3 identity gates, your third gate is an X gate: innerUGates = [idGate...
Incorrect evaluation by Composite Quantum Gate
The issue is a typo in your code. Instead of constructing 3 identity gates, your third gate is an X gate: innerUGates = [idGate...
1 year 前 | 0
| 已接受
已回答
Remove node and reconnect edges in a very large graph
It is usually best to first compute all the edges / nodes to act on, and then modify the graph in one step with all of them: G1...
Remove node and reconnect edges in a very large graph
It is usually best to first compute all the edges / nodes to act on, and then modify the graph in one step with all of them: G1...
1 year 前 | 0
已回答
How to find the best solution to make eigs function converge?
It seems that the eigenvalues of H are pure imaginary (I'm seeing real parts of magnitude about 1e-14, and the maximum imaginary...
How to find the best solution to make eigs function converge?
It seems that the eigenvalues of H are pure imaginary (I'm seeing real parts of magnitude about 1e-14, and the maximum imaginary...
1 year 前 | 0
已回答
Call to inv() function seems to have (undesired) impact on Thread pool or maxNumCompThreads()
I asked around internally, and there was an issue that looks very similar in R2023b that has been fixed in R2024a. If you have R...
Call to inv() function seems to have (undesired) impact on Thread pool or maxNumCompThreads()
I asked around internally, and there was an issue that looks very similar in R2023b that has been fixed in R2024a. If you have R...
1 year 前 | 0
| 已接受
已回答
solving linear system with decomposition(A,'qr') and qr(A) produce different results
There are two reasons that the results don't match: 1) When the matrix is not full-rank, the QR-based solver in decomposition o...
solving linear system with decomposition(A,'qr') and qr(A) produce different results
There are two reasons that the results don't match: 1) When the matrix is not full-rank, the QR-based solver in decomposition o...
2 years 前 | 1
| 已接受
已回答
What is the most computationally efficient factorization of a matrix A?
Your solution is correct. Of the factorizations you know (PA=LU, the Choleski, SVD and the QR factorization), only LU and Chole...
What is the most computationally efficient factorization of a matrix A?
Your solution is correct. Of the factorizations you know (PA=LU, the Choleski, SVD and the QR factorization), only LU and Chole...
2 years 前 | 1
已回答
Improving Precision of Eigenvectors with Large Eigenvalues
The linked post is about a symmetric matrix, is this also your case? In that case (if issymmetric returns true for your matrix),...
Improving Precision of Eigenvectors with Large Eigenvalues
The linked post is about a symmetric matrix, is this also your case? In that case (if issymmetric returns true for your matrix),...
2 years 前 | 2
| 已接受
已回答
Join Subgraphs into a new Graph
Here's a quick example based on a guess at how you would like to merge the graphs: G1 = graph(["A" "B" "C"], ["B" "C" "D"]); G...
Join Subgraphs into a new Graph
Here's a quick example based on a guess at how you would like to merge the graphs: G1 = graph(["A" "B" "C"], ["B" "C" "D"]); G...
2 years 前 | 1
| 已接受
