Community Profile

photo

Andrew Knyazev


40 2010 이후 총 참여 횟수

http://en.wikipedia.org/wiki/Andrei_Knyazev_(mathematician)

Professional Interests: matrix computations, numerical PDEs, signal, image & video processing, data analytics and mining, data coding and transmission, material sciences, and model predictive control.

담당자

Andrew Knyazev's 배지

  • Personal Best Downloads Level 2
  • First Review
  • 5-Star Galaxy Level 4
  • GitHub Submissions Level 1
  • First Submission
  • Revival Level 3
  • Knowledgeable Level 2
  • 3 Month Streak
  • First Answer

세부 정보 보기...

참여 게시물
보기 기준

제출됨


Locally Optimal Block Preconditioned Conjugate Gradient
LOBPCG solves Hermitian partial generalized eigenvalue problems using preconditioning, as well as PCA

9달 전 | 다운로드 수: 17 |

Thumbnail

답변 있음
Eigs in multinode cluster
EIGS has limited support for distributed memory, so you can run it only on a single node, but see the answer from Christine Tob...

9달 전 | 0

| 수락됨

답변 있음
How do read .npy files in matlab?
https://github.com/kwikteam/npy-matlab

9달 전 | 1

| 수락됨

답변 있음
Error returned in Eigs Function " Undefined operator '.*' "
Looks like a bug in chebfun - just make this comment at <https://www.mathworks.com/matlabcentral/fileexchange/47023-chebfun-curr...

1년 이상 전 | 0

답변 있음
eigs does not return the eigenvalues closest to shift sigma
You may also want to try https://www.mathworks.com/matlabcentral/fileexchange/48-lobpcg-m passing your function handle to it. Co...

1년 이상 전 | 0

답변 있음
find eigenvalues of a very large sparse matrix
If the matrix is real symmetric or Hermitian, you may also want to try https://www.mathworks.com/matlabcentral/fileexchange/48-l...

1년 이상 전 | 0

답변 있음
LOBPCG Initial k eigenvectors approximation
See https://en.wikipedia.org/wiki/LOBPCG#Convergence_theory_and_practice

1년 이상 전 | 0

답변 있음
eigs() runs faster for more eigenvalues of the same matrix
Please check <https://www.mathworks.com/matlabcentral/fileexchange/48-lobpcg-m> that has probably faster and more predictable co...

1년 이상 전 | 1

답변 있음
How do i obtain only the first principal component?
https://www.mathworks.com/matlabcentral/fileexchange/48-lobpcg-m can be used as the method for calculating the eigenvector corre...

1년 이상 전 | 0

답변 있음
Smallest non-zero eigenvalue for a generalized eigenvalue problem
Since both matrices A and B are singular, it is not an easy problem numerically. Even eig(full(A), full(B)) may give you wrong a...

1년 이상 전 | 0

| 수락됨

답변 있음
Find max/min eigenvalue of a symmetric matrix
try http://www.mathworks.com/matlabcentral/fileexchange/48-lobpcg-m

5년 이하 전 | 1

답변 있음
Number of eigenvalues when using eigs
This is normal for eigs.

5년 이하 전 | 0

답변 있음
positive-definiteness of a huge sparse matrix
try http://www.mathworks.com/matlabcentral/fileexchange/48-lobpcg-m

5년 이하 전 | 0

답변 있음
how can i find k-eigenvalues faster than eig for hermitian dense matrix
try http://www.mathworks.com/matlabcentral/fileexchange/48-lobpcg-m

5년 이하 전 | 0

답변 있음
Take advantage of Hermitian matrices with eigs
You need to be more specific. Also, try http://www.mathworks.com/matlabcentral/fileexchange/48-lobpcg-m

5년 이하 전 | 0

답변 있음
Parallel computing of eigs
check SLEPc and BLOPEX

5년 이하 전 | 0

답변 있음
Sparse solver for large symmetric matrices
both eigs and http://www.mathworks.com/matlabcentral/fileexchange/48-lobpcg-m can be used in a matrix-free fashion, only needing...

5년 이하 전 | 0

답변 있음
Difference between eigs and eig
Is this behavior expected? - Yes. Eigs uses a tricky method that may give the results you describe, especially for funny mat...

5년 이하 전 | 0

답변 있음
eigs function: incorrect eigenvectors
This is normal for eigs. If you are happy with eig, just stay with it.

5년 이하 전 | 0

답변 있음
Why can't I compute the interior eigenvalues of a sparse matrix with "eigs" without inversion in MATLAB?
check http://www.mathworks.com/matlabcentral/fileexchange/48-lobpcg-m

5년 이하 전 | 0

답변 있음
How can I get the (approximate) eigenvectors of a huge matrix?
try http://www.mathworks.com/matlabcentral/fileexchange/48-lobpcg-m

5년 이하 전 | 0

답변 있음
How can I speed up the eigen value and eigen vector computations for a non-sparse matrix?
check http://www.mathworks.com/matlabcentral/fileexchange/48-lobpcg-m

5년 이하 전 | 0

답변 있음
How can the Cholesky decomposition step in eigs() be avoided without passing a matrix to eigs that is a Cholesky decomposition?
check http://www.mathworks.com/matlabcentral/fileexchange/48-lobpcg-m

5년 이하 전 | 0

제출됨


ortha.m
Orthonormalization Relative to matrix A

5년 이하 전 | 다운로드 수: 0 |

제출됨


subspace.m
Angle between subspaces.

5년 이하 전 | 다운로드 수: 2 |

제출됨


majorization check
checks if X is (weakly) majorized by Y, where X and Y must be numeric arrays.

5년 이하 전 | 다운로드 수: 1 |

제출됨


subspacea.m
Angles between subspaces. Canonical correlations.

5년 이하 전 | 다운로드 수: 4 |

제출됨


pcg.m with 'null' and 'flex' options
Preconditioned Conjugate Gradients handles homogeneous equations and nonsymmetric preconditioning

5년 이하 전 | 다운로드 수: 3 |

Thumbnail

제출됨


Best polynomial approximation in uniform norm
For a given function on an interval, the code calculates the min-max approximation by a polynomial.

5년 이하 전 | 다운로드 수: 5 |

Thumbnail

Load more