Computing the smallest eigenpairs of the graph Laplacian (Q1742851): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Import241208061232 (talk | contribs)
Normalize DOI.
 
(3 intermediate revisions by 3 users not shown)
Property / DOI
 
Property / DOI: 10.1007/s40324-017-0108-2 / rank
Normal rank
 
Property / OpenAlex ID
 
Property / OpenAlex ID: W1558311178 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1311.1695 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A comparison of eigensolvers for large-scale 3D modal analysis using AMG-preconditioned iterative methods / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generalized inverses. Theory and applications. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Preconditioning techniques for large linear systems: A survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Asymptotic Convergence of Conjugate Gradient Methods for the Partial Symmetric Eigenproblem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parallel Rayleigh quotient optimization with FSAI-based preconditioning / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximate inverse preconditioning in the parallel solution of sparse eigenproblems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Numerical comparison of iterative eigensolvers for large sparse symmetric positive definite matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximations of the Generalized Inverse of the Graph Laplacian Matrix / rank
 
Normal rank
Property / cites work
 
Property / cites work: Spectra of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Pursuing scalability for <i>hypre</i> 's conceptual interfaces / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5682350 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Jacobi--Davidson Style QR and QZ Algorithms for the Reduction of Matrix Pencils / rank
 
Normal rank
Property / cites work
 
Property / cites work: Shift-Invert Arnoldi's Method with Preconditioned Iterative Solves / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimizing Effective Resistance of a Graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Toward the Optimal Preconditioned Eigensolver: Locally Optimal Block Preconditioned Conjugate Gradient Method / rank
 
Normal rank
Property / cites work
 
Property / cites work: ARPACK Users' Guide / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tuned preconditioners for the eigensolution of large SPD matrices arising in engineering problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3066830 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combination of Jacobi–Davidson and conjugate gradients for the partial symmetric eigenproblem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Jacobi–Davidson Iteration Method for Linear Eigenvalue Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Case for a Biorthogonal Jacobi--Davidson Method: Restarting and Correction Equation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convergence Analysis of Iterative Solvers in Inexact Rayleigh Quotient Iteration / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1007/S40324-017-0108-2 / rank
 
Normal rank

Latest revision as of 07:31, 11 December 2024

scientific article
Language Label Description Also known as
English
Computing the smallest eigenpairs of the graph Laplacian
scientific article

    Statements

    Computing the smallest eigenpairs of the graph Laplacian (English)
    0 references
    0 references
    0 references
    12 April 2018
    0 references
    graph Laplacian
    0 references
    eigenpair computation
    0 references
    algorithms
    0 references
    networks
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references