The following pages link to PRIMME (Q16212):
Displaying 50 items.
- Parallel software for lattice \(\mathcal{N} = 4\) supersymmetric Yang-Mills theory (Q311616) (← links)
- Accelerating large partial EVD/SVD calculations by filtered block Davidson methods (Q341332) (← links)
- On optimizing Jacobi-Davidson method for calculating eigenvalues in low dimensional structures using eight band \(\mathbf{k}\cdot\mathbf{p}\) model (Q465559) (← links)
- Parallel implementations of the trace minimization scheme trace{min} for the sparse symmetric eigenvalue problem (Q493418) (← links)
- JADAMILU: a software code for computing selected eigenvalues of large sparse symmetric matrices (Q710112) (← links)
- Multigrid deflation for lattice QCD (Q778340) (← links)
- State-of-the-art eigensolvers for electronic structure calculations of large scale nano-systems (Q934111) (← links)
- Truncated Hilbert space approach to the 2d \(\phi^{4}\) theory (Q1636300) (← links)
- Estimating the trace of the matrix inverse by interpolating from the diagonal of an approximate inverse (Q1674709) (← links)
- Using negative curvature in solving nonlinear programs (Q1694388) (← links)
- A spectral Newton-Schur algorithm for the solution of symmetric generalized eigenvalue problems (Q1988487) (← links)
- Approaching the self-dual point of the sinh-Gordon model (Q2024186) (← links)
- Eigenvalue spectrum and scaling dimension of lattice \(\mathcal{N} = 4\) supersymmetric Yang-Mills (Q2032636) (← links)
- Efficient semidefinite programming with approximate ADMM (Q2073055) (← links)
- Periodically driven perturbed CFTs: the sine-Gordon model (Q2121311) (← links)
- Computing the smallest singular triplets of a large matrix (Q2211056) (← links)
- A cross-product approach for low-rank approximations of large matrices (Q2293619) (← links)
- Data clustering with quantum mechanics (Q2358235) (← links)
- Trace-penalty minimization for large-scale eigenspace computation (Q2398478) (← links)
- Two harmonic Jacobi-Davidson methods for computing a partial generalized singular value decomposition of a large matrix pair (Q2676809) (← links)
- Hybrid iterative refined restarted Lanczos bidiagonalization methods (Q2679823) (← links)
- A Thick-Restart Lanczos Algorithm with Polynomial Filtering for Hermitian Eigenvalue Problems (Q2818245) (← links)
- Computing Partial Spectra with Least-Squares Rational Filters (Q2827038) (← links)
- Feast Eigensolver for Non-Hermitian Problems (Q2830645) (← links)
- Anasazi software for the numerical solution of large-scale eigenvalue problems (Q2989069) (← links)
- A Parallel Implementation of the Jacobi-Davidson Eigensolver for Unsymmetric Matrices (Q3081377) (← links)
- A Self-Learning Algebraic Multigrid Method for Extremal Singular Triplets and Eigenpairs (Q3165420) (← links)
- Beyond Automated Multilevel Substructuring: Domain Decomposition with Rational Filtering (Q3174778) (← links)
- A Preconditioned Hybrid SVD Method for Accurately Computing Singular Triplets of Large Matrices (Q3447456) (← links)
- Increasing the Performance of the Jacobi--Davidson Method by Blocking (Q3457832) (← links)
- Block Locally Optimal Preconditioned Eigenvalue Xolvers (BLOPEX) in Hypre and PETSc (Q3525963) (← links)
- A Block Preconditioned Harmonic Projection Method for Large-Scale Nonlinear Eigenvalue Problems (Q4569317) (← links)
- TRPL+K: Thick-Restart Preconditioned Lanczos+K Method for Large Symmetric Eigenvalue Problems (Q4632005) (← links)
- Sharp error bounds for Ritz vectors and approximate singular vectors (Q4960077) (← links)
- Hybrid Iterative Refined Method for Computing a Few Extreme Eigenpairs of a Symmetric Matrix (Q4997345) (← links)
- A Fast Iterative Algorithm for Near-Diagonal Eigenvalue Problems (Q5057768) (← links)
- PHIST (Q5066575) (← links)
- Nonlinear Eigenvector Methods for Convex Minimization over the Numerical Range (Q5146631) (← links)
- Hybrid Iterative Refined Method for Computing a Few Extreme Eigenpairs of a Symmetric Matrix (Q5161741) (← links)
- An Out-of-Core Eigen-Solver with OpenMP Parallel Scheme for Large Spare Damped System (Q5225936) (← links)
- Spectral condition‐number estimation of large sparse matrices (Q5227181) (← links)
- On Inner Iterations of Jacobi--Davidson Type Methods for Large SVD Computations (Q5230610) (← links)
- The Eigenvalues Slicing Library (EVSL): Algorithms, Implementation, and Software (Q5230632) (← links)
- A Golub--Kahan Davidson Method for Accurately Computing a Few Singular Triplets of Large Sparse Matrices (Q5230648) (← links)
- ChASE (Q5237434) (← links)
- PRIMME_SVDS: A High-Performance Preconditioned SVD Solver for Accurate Large-Scale Computations (Q5372627) (← links)
- Sketching for Principal Component Regression (Q5380270) (← 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)
- Deflation as a Method of Variance Reduction for Estimating the Trace of a Matrix Inverse (Q5738167) (← links)
