Pages that link to "Item:Q1362621"

The following pages link to Refined iterative algorithms based on Arnoldi's process for large unsymmetric eigenproblems (Q1362621):

Displaying 50 items.

• An orthogonally accumulated projection method for symmetric linear system of equations (Q310195) (← links)
• On refined Ritz vectors and polynomial characterization (Q316597) (← links)
• A new extrapolation method for PageRank computations (Q344287) (← links)
• Accelerating the Arnoldi-type algorithm for the PageRank problem and the ProteinRank problem (Q395333) (← links)
• A two-step matrix splitting iteration for computing PageRank (Q475634) (← links)
• Inner iterations in the shift-invert residual Arnoldi method and the Jacobi-Davidson method (Q477157) (← links)
• The Rayleigh-Ritz method, refinement and Arnoldi process for periodic matrix pairs (Q629534) (← links)
• A new variant of Arnoldi method for approximation of eigenpairs (Q724525) (← links)
• A refined harmonic Rayleigh-Ritz procedure and an explicitly restarted refined harmonic Arnoldi algorithm (Q814247) (← links)
• A refined unsymmetric Lanczos eigensolver for computing accurate eigentriplets of a real unsymmetric matrix (Q836714) (← links)
• An Arnoldi-type algorithm for computing Page Rank (Q855280) (← links)
• A modification on minimum restarting method in the Arnoldi algorithm for computing the eigenvalues of a nonsymmetric matrix (Q856144) (← links)
• A restarted induced dimension reduction method to approximate eigenpairs of large unsymmetric matrices (Q898927) (← links)
• FOM accelerated by an extrapolation method for solving PageRank problems (Q898964) (← links)
• An Arnoldi-extrapolation algorithm for computing pagerank (Q989127) (← links)
• Fast eigenvalue calculations in a massively parallel plasma turbulence code (Q991122) (← links)
• Restarted generalized Krylov subspace methods for solving large-scale polynomial eigenvalue problems (Q1014354) (← links)
• A Jacobi-Davidson type method for the generalized singular value problem (Q1025866) (← links)
• A new method for accelerating Arnoldi algorithms for large scale eigenproblems (Q1037802) (← links)
• An Arnoldi-based iterative scheme for nonsymmetric matrix pencils arising in finite element stability problems (Q1195466) (← links)
• A variation on the block Arnoldi method for large unsymmetric matrix eigenproblems (Q1299851) (← links)
• Polynomial characterizations of the approximate eigenvectors by the refined Arnoldi method and an implicitly restarted refined Arnoldi algorithm (Q1301301) (← links)
• A refined iterative algorithm based on the block Arnoldi process for large unsymmetric eigenproblems (Q1377506) (← links)
• A refined shift-and-invert Arnoldi algorithm for large unsymmetric generalized eigenproblems. (Q1416322) (← links)
• Composite orthogonal projection methods for large matrix eigenproblems (Q1585577) (← links)
• A GMRES-power algorithm for computing PageRank problems (Q1643825) (← links)
• A relaxed two-step splitting iteration method for computing PageRank (Q1655370) (← links)
• An Arnoldi-Inout method accelerated with a two-stage matrix splitting iteration for computing PageRank (Q1675429) (← links)
• The inexact residual iteration method for quadratic eigenvalue problem and the analysis of convergence (Q1677471) (← links)
• A new shift strategy for the implicitly restarted refined harmonic Lanczos method (Q1696462) (← links)
• Computing smallest singular triplets with implicitly restarted Lanczos bidiagonalization (Q1826601) (← links)
• An iterative block Arnoldi algorithm with modified approximate eigenvectors for large unsymmetric eigenvalue problems (Q1827036) (← links)
• The refined harmonic Arnoldi method and an implicitly restarted refined algorithm for computing interior eigenpairs of large matrices (Q1862016) (← links)
• A refined Arnoldi type method for large scale eigenvalue problems (Q1943090) (← links)
• A preconditioned conjugate gradient algorithm for GeneRank with application to microarray data mining (Q1944967) (← links)
• The general inner-outer iteration method based on regular splittings for the PageRank problem (Q2009568) (← links)
• The coupled iteration algorithms for computing PageRank (Q2118952) (← links)
• A Hessenberg-type algorithm for computing PageRank problems (Q2118965) (← links)
• Acceleration of the generalized FOM algorithm for computing PageRank (Q2127521) (← links)
• Acceleration of an adaptive generalized Arnoldi method for computing PageRank (Q2131499) (← links)
• An adaptive Power-GArnoldi algorithm for computing PageRank (Q2222161) (← links)
• On a new variant of Arnoldi method for approximation of eigenpairs (Q2229927) (← links)
• Harmonic and refined harmonic shift-invert residual Arnoldi and Jacobi-Davidson methods for interior eigenvalue problems (Q2255719) (← links)
• A general multi-splitting iteration method for computing PageRank (Q2322449) (← links)
• A-posteriori residual bounds for Arnoldi's methods for nonsymmetric eigenvalue problems (Q2430753) (← links)
• On the convergence of Ritz pairs and refined Ritz vectors for quadratic eigenvalue problems (Q2434933) (← links)
• Optimal expansion of subspaces for eigenvector approximations (Q2469518) (← links)
• A Jacobi-Davidson type method for the product eigenvalue problem (Q2475395) (← links)
• A refined Jacobi-Davidson method and its correction equation (Q2485413) (← links)
• An implicitly restarted Lanczos bidiagonalization method with refined harmonic shifts for computing smallest singular triplets (Q2511197) (← links)