christine tobler -凯发k8网页登录
mathworks
professional interests: numerical linear algebra, graph algorithms
统计数据
0 个提问
384
0 个问题
1
排名
102
of 277,885
声誉
1,222
贡献数
0 个提问
384
回答接受率
0.00%
收到投票数
242
排名
of 18,801
声誉
n/a
平均
0.00
贡献数
0
下载次数
0
all time 下载次数
0
排名
101,165
of 129,101
贡献数
0 个问题
1
评分
20
徽章数量
1
贡献数
0 帖子
贡献数
0
平均
贡献数
0
平均赞数
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
matlab answers
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
as you point out, this kind of difference in result is to be expected and is well withing expected round-off behavior. another ...
5 days 前 | 1
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 ...
2 months 前 | 1
| 已接受
if an undirected graph is connected, it must contain at least one path that visits each node at least once. you could construct...
2 months 前 | 0
eig for distributed arrays calls into the scalapack library - the references given by scalapack documentation would be the best ...
2 months 前 | 1
| 已接受
this isn't the standard definition of a nonlinear eigenvalue problem, where you would have only one scalar lambda. am i underst...
2 months 前 | 0
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...
4 months 前 | 0
| 已接受
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)...
4 months 前 | 0
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...
5 months 前 | 0
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 ...
5 months 前 | 0
| 已接受
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...
6 months 前 | 1
the determinant should only be used explicitly to solve an eigenvalue problem for symbolic calculation (for example, when you so...
7 months 前 | 2
| 已接受
ideally this shouldn't crash, but produce an out-of-memory error. however, for example on linux there is the "out-of-memory kill...
8 months 前 | 0
| 已接受
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 ...
9 months 前 | 0
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(...
9 months 前 | 1
| 已接受
replace the line i = cumtrapz(y,cumtrapz(x,mberry(keyset),2)); with i = cumtrapz(y,cumtrapz(x,mberry(keyset),2), 1); here'...
10 months 前 | 0
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...
10 months 前 | 1
unfortunately there isn't a way to get these coordinates without plotting. i have added your request for such a function to our ...
10 months 前 | 1
| 已接受
yes, matlab's graph and digraph plots only have one nodecolor property which applies to both the marker's facecolor and edgecolo...
10 months 前 | 0
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...
11 months 前 | 0
the case of a 0-by-0 matrix doesn't have any very useful definition, as you note correctly in the comments above. matlab does w...
12 months 前 | 1
| 已接受
yes, the matrix a becomes singular after applying the last two for-loops (which i think are the boundary conditions). you can v...
1 year 前 | 1
call findedge(g, node1, node2). if there is no edge connecting these nodes, the output is zero. otherwise, the output is the ind...
1 year 前 | 0
| 已接受
the lu decomposition really involves three new matrices: an upper-triangular matrix u, a lower-triangular matrix l, and a permut...
1 year 前 | 0
| 已接受
first, we should keep in mind that the task is really to find a representation of a with as small blocks on the diagonal as poss...
1 year 前 | 0
| 已接受
i'm getting both 4 eigenvalues and 4 eigenvectors when running your code: linkmatrix = [0,1/3,1/3,1/3; 0,0,1,0; ...
1 year 前 | 0
| 已接受
this is a bug in digraph, thank you for reporting it! i have passed it along and it will be fixed in a future release.
1 year 前 | 0
| 已接受
you could represent the first layer as a graph object, adding coordinate information for each node to the nodes table. for the s...
1 year 前 | 0
the problem is that the covariance matrix becomes very large here. luckily, it's not necessary to compute this matrix explicitly...
1 year 前 | 0
| 已接受
there's an unknown variable in the value you pass to sort, so this won't be sorted by magnitude as the magnitude isn't known. h...
1 year 前 | 0
| 已接受
if eig has been working well for the size of your problem you could consider using [u, d] = eig(k, m); %this solves k*u = m*u*d...
1 year 前 | 1
| 已接受