Pages that link to "Item:Q4389239"

The following pages link to Dynamic Thick Restarting of the Davidson, and the Implicitly Restarted Arnoldi Methods (Q4389239):

Displaying 50 items.

• Parallel solution of large-scale eigenvalue problem for master equation in protein folding dynamics (Q436775) (← links)
• Fast iterative interior eigensolver for millions of atoms (Q440633) (← links)
• A new algorithm for computing eigenpairs of matrices (Q646056) (← links)
• Chebyshev-filtered subspace iteration method free of sparse diagonalization for solving the Kohn-Sham equation (Q728633) (← links)
• A key to choose subspace size in implicitly restarted Arnoldi method (Q747742) (← links)
• An iterative method for single and vertically stacked semiconductor quantum dots simulation (Q815391) (← links)
• A modification on minimum restarting method in the Arnoldi algorithm for computing the eigenvalues of a nonsymmetric matrix (Q856144) (← links)
• A new restarting method in the Lanczos algorithm for generalized eigenvalue problem (Q879499) (← links)
• Block Krylov-Schur method for large symmetric eigenvalue problems (Q925250) (← links)
• An inexact Krylov-Schur algorithm for the unitary eigenvalue problem (Q935390) (← links)
• A hybrid of the restarted Arnoldi and electromagnetism meta-heuristic methods for calculating eigenvalues and eigenvectors of a non-symmetric matrix (Q990403) (← links)
• Weighted FOM-inverse vector iteration method for computing a few smallest (largest) eigenvalues of pair (A, B) (Q990516) (← links)
• A numerical solution using an adaptively preconditioned Lanczos method for a class of linear systems related with the fractional Poisson equation (Q1009406) (← links)
• A new method for accelerating Arnoldi algorithms for large scale eigenproblems (Q1037802) (← links)
• Computational experience with sequential and parallel, preconditioned Jacobi--Davidson for large, sparse symmetric matrices (Q1399640) (← links)
• New methods for calculations of the lowest eigenvalues of the real symmetric generalized eigenvalue problem (Q1578093) (← links)
• Preconditioning eigenvalues and some comparison of solvers (Q1591177) (← links)
• On restarting the tensor infinite Arnoldi method (Q1742587) (← links)
• Thick-restart Lanczos method for electronic structure calculations (Q1819081) (← links)
• A new restarting method in the Arnoldi algorithm for computing the eigenvalues of a nonsymmetric matrix (Q1886555) (← links)
• Large sparse symmetric eigenvalue problems with homogeneous linear constraints: The Lanczos process with inner-outer iterations (Q1976920) (← links)
• A vertex-centred finite volume method for the 3D multi-term time and space fractional Bloch-Torrey equation with fractional Laplacian (Q2160957) (← links)
• Parametric dominant pole algorithm for parametric model order reduction (Q2252833) (← links)
• A harmonic restarted Arnoldi algorithm for calculating eigenvalues and determining multiplicity (Q2368742) (← links)
• FOM-inverse vector iteration method for computing a few smallest (largest) eigenvalues of pair (A,B) (Q2371475) (← links)
• Weighted restarting method in the weighted Arnoldi algorithm for computing the eigenvalues of a nonsymmetric matrix (Q2493706) (← links)
• A dynamic thick restarted semi-refined ABLE algorithm for computing a few selected eigentriplets of large nonsymmetric matrices (Q2494666) (← links)
• Convergence of Arnoldi's method for generalized eigenvalue problems (Q2516941) (← links)
• A short note on a generalization of the Givens transformation (Q2629505) (← links)
• Two harmonic Jacobi-Davidson methods for computing a partial generalized singular value decomposition of a large matrix pair (Q2676809) (← links)
• A cross-product free Jacobi-Davidson type method for computing a partial generalized singular value decomposition of a large matrix pair (Q2680320) (← links)
• Alternative correction equations in the Jacobi-Davidson method (Q2760355) (← links)
• Generalized Preconditioned Locally Harmonic Residual Method for Non-Hermitian Eigenproblems (Q2790094) (← links)
• A thick-restart Lanczos algorithm with polynomial filtering for Hermitian eigenvalue problems (Q2818245) (← links)
• A Jacobi-Davidson method for two-real-parameter nonlinear eigenvalue problems arising from delay-differential equations (Q2931539) (← links)
• Thick restarting the weighted harmonic Arnoldi algorithm for large interior eigenproblems (Q2995496) (← links)
• A Preconditioned Hybrid SVD Method for Accurately Computing Singular Triplets of Large Matrices (Q3447456) (← links)
• TRPL+K: Thick-Restart Preconditioned Lanczos+K Method for Large Symmetric Eigenvalue Problems (Q4632005) (← links)
• Two-Grid and Multiple-Grid Arnoldi for Eigenvalues (Q4691182) (← links)
• Efficient parallel solution to large‐size sparse eigenproblems with block FSAI preconditioning (Q4924932) (← links)
• Hybrid Iterative Refined Method for Computing a Few Extreme Eigenpairs of a Symmetric Matrix (Q4997345) (← links)
• Hybrid Iterative Refined Method for Computing a Few Extreme Eigenpairs of a Symmetric Matrix (Q5161741) (← links)
• The Eigenvalues Slicing Library (EVSL): Algorithms, Implementation, and Software (Q5230632) (← links)
• A parallel implementation of Davidson methods for large-scale eigenvalue problems in SLEPc (Q5498689) (← links)
• Extending the eigCG algorithm to nonsymmetric Lanczos for linear systems with multiple right-hand sides (Q5502424) (← links)
• Polynomial Preconditioned Arnoldi with Stability Control (Q5856683) (← links)
• Solving large nonlinear generalized eigenvalue problems from density functional theory calculations in parallel (Q5932824) (← links)
• An integrated Davidson and multigrid solution approach for very large scale symmetric eigenvalue problems (Q5935674) (← links)
• Limited‐memory polynomial methods for large‐scale matrix functions (Q6068267) (← links)
• A sketch-and-select Arnoldi process (Q6598496) (← links)