LOBPCG
Locally Optimal Block Preconditioned Conjugate Gradient (LOBPCG) is a matrix-free method for finding the largest (or smallest) eigenvalues and the corresponding eigenvectors of a symmetric generalized eigenvalue problem for a given pair of complex Hermitian or real symmetric matrices, wherethe matrix is also assumed positive-definite.
Wikipage redirect
ARPACKAndrei Knyazev (mathematician)BLOPEXDomain decomposition methodsEdge-preserving smoothingEigenvalue algorithmGraph partitionHypreList of numerical analysis topicsList of numerical librariesMatrix-free methodsMultigrid methodPower iterationPrincipal component analysisSLEPcSegmentation-based object categorizationSpectral clustering
Link from a Wikipage to another Wikipage
primaryTopic
LOBPCG
Locally Optimal Block Preconditioned Conjugate Gradient (LOBPCG) is a matrix-free method for finding the largest (or smallest) eigenvalues and the corresponding eigenvectors of a symmetric generalized eigenvalue problem for a given pair of complex Hermitian or real symmetric matrices, wherethe matrix is also assumed positive-definite.
has abstract
Locally Optimal Block Precondi ...... lso assumed positive-definite.
@en
Link from a Wikipage to an external page
Wikipage page ID
26,951,185
page length (characters) of wiki page
Wikipage revision ID
1,023,564,998
Link from a Wikipage to another Wikipage
wikiPageUsesTemplate
comment
Locally Optimal Block Precondi ...... lso assumed positive-definite.
@en
label
LOBPCG
@en