回答済み
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 ...

約1年前 | 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...

約1年前 | 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'...

約1年前 | 0

| 採用済み

回答済み
computational complexity of svds
There is a recent function (introduced R2020b) called svdsketch, which is using randomized linear algebra. We recommend this for...

約1年前 | 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...

1年以上前 | 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...

1年以上前 | 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...

1年以上前 | 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...

1年以上前 | 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 ...

1年以上前 | 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...

1年以上前 | 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 ...

1年以上前 | 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 ...

1年以上前 | 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 ...

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

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

1年以上前 | 1

| 採用済み

回答済み
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...

1年以上前 | 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...

2年弱前 | 0

| 採用済み

回答済み
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)...

2年弱前 | 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...

2年弱前 | 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 ...

2年弱前 | 0

| 採用済み

回答済み
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...

2年弱前 | 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...

約2年前 | 2

| 採用済み

回答済み
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...

約2年前 | 0

| 採用済み

回答済み
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 ...

約2年前 | 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(...

約2年前 | 1

| 採用済み

回答済み
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'...

約2年前 | 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...

2年以上前 | 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 ...

2年以上前 | 1

| 採用済み

回答済み
'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...

2年以上前 | 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...

2年以上前 | 0