Pages that link to "Item:Q1344405"
From MaRDI portal
The following pages link to An implicit restarted Lanczos method for large symmetric eigenvalue problems (Q1344405):
Displaying 50 items.
- Accelerating large partial EVD/SVD calculations by filtered block Davidson methods (Q341332) (← links)
- A mathematical biography of Danny C. Sorensen (Q413518) (← links)
- A Krylov-Schur approach to the truncated SVD (Q413526) (← links)
- Global convergence of the restarted Lanczos and Jacobi-Davidson methods for symmetric eigenvalue problems (Q500356) (← links)
- A Hamiltonian Krylov-Schur-type method based on the symplectic Lanczos process (Q541922) (← links)
- Approximate eigensolution of Laplacian matrices for locally modified graph products (Q654781) (← links)
- Clique-based method for social network clustering (Q779032) (← links)
- The spectral condition number plot for regularization parameter evaluation (Q782639) (← links)
- Sequences of well-distributed vertices on graphs and spectral bounds on optimal transport (Q829888) (← links)
- On preconditioned eigensolvers and invert-Lanczos processes (Q999788) (← links)
- Computation of a few small eigenvalues of a large matrix with application to liquid crystal modeling (Q1275165) (← links)
- A parallel Davidson-type algorithm for several eigenvalues (Q1287171) (← links)
- The symplectic eigenvalue problem, the butterfly form, the SR algorithm, and the Lanczos method (Q1307194) (← links)
- An implicit shift bidiagonalization algorithm for ill-posed systems (Q1347073) (← links)
- An implicitly restarted symplectic Lanczos method for the Hamiltonian eigenvalue problem (Q1368762) (← links)
- New methods for calculations of the lowest eigenvalues of the real symmetric generalized eigenvalue problem (Q1578093) (← links)
- Iterative methods for large continuation problems (Q1591183) (← links)
- Inexact and incremental bilinear Lanczos components algorithms for high dimensionality reduction and image reconstruction (Q1677031) (← links)
- Cucheb: a GPU implementation of the filtered Lanczos procedure (Q1737460) (← links)
- The numerical rank of Krylov matrices (Q1789397) (← links)
- Thick-restart Lanczos method for electronic structure calculations (Q1819081) (← links)
- Computing smallest singular triplets with implicitly restarted Lanczos bidiagonalization (Q1826601) (← links)
- Model reduction of state space systems via an implicitly restarted Lanczos method (Q1921318) (← links)
- Iterative methods for the computation of a few eigenvalues of a large symmetric matrix (Q1923866) (← links)
- Large sparse symmetric eigenvalue problems with homogeneous linear constraints: The Lanczos process with inner-outer iterations (Q1976920) (← links)
- Fast sampling of parameterised Gaussian random fields (Q1987947) (← links)
- A thick-restart Lanczos type method for Hermitian \(J\)-symmetric eigenvalue problems (Q2024610) (← links)
- The implicitly restarted multi-symplectic block-Lanczos method for large-scale Hermitian quaternion matrix eigenvalue problem and applications (Q2088824) (← links)
- Computing interior eigenvalues of large sparse symmetric matrices (Q2114504) (← links)
- Computing the smallest singular triplets of a large matrix (Q2211056) (← links)
- On Chebyshev-Davidson method for symmetric generalized eigenvalue problems (Q2219639) (← links)
- Link prediction via controlling the leading eigenvector (Q2245990) (← links)
- A cross-product approach for low-rank approximations of large matrices (Q2293619) (← links)
- Hessian-based adaptive sparse quadrature for infinite-dimensional Bayesian inverse problems (Q2310097) (← links)
- On the computation of a truncated SVD of a large linear discrete ill-posed problem (Q2360674) (← links)
- An implicitly restarted block Lanczos bidiagonalization method using Leja shifts (Q2376857) (← links)
- An iterative Lavrentiev regularization method (Q2433872) (← links)
- Approximating Spectral Clustering via Sampling: A Review (Q3297374) (← links)
- An extended QR-solver for large profiled matrices (Q3649858) (← links)
- Numerical solution of linear eigenvalue problems (Q4608452) (← links)
- A Fast Hierarchically Preconditioned Eigensolver Based on Multiresolution Matrix Decomposition (Q4627452) (← links)
- TRPL+K: Thick-Restart Preconditioned Lanczos+K Method for Large Symmetric Eigenvalue Problems (Q4632005) (← links)
- Simultaneous iterative solutions for the trust-region and minimum eigenvalue subproblem (Q5038438) (← links)
- Randomized Spectral Clustering in Large-Scale Stochastic Block Models (Q5057098) (← links)
- The Lanczos Algorithm Under Few Iterations: Concentration and Location of the Output (Q5146700) (← links)
- Subspace Iteration Randomization and Singular Value Problems (Q5254699) (← links)
- Distributional Robustness in Minimax Linear Quadratic Control with Wasserstein Distance (Q5883161) (← links)
- An iterative method with error estimators (Q5929294) (← links)
- Solving large nonlinear generalized eigenvalue problems from density functional theory calculations in parallel (Q5932824) (← links)
- A compact heart iteration for low-rank approximations of large matrices (Q6049289) (← links)
