PRIMME
From MaRDI portal
Software:16212
swMATH4023MaRDI QIDQ16212FDOQ16212
Author name not available (Why is that?)
Cited In (52)
- A spectral Newton-Schur algorithm for the solution of symmetric generalized eigenvalue problems
- Spectral condition‐number estimation of large sparse matrices
- Sketching for Principal Component Regression
- Multigrid deflation for lattice QCD
- On Inner Iterations of Jacobi--Davidson Type Methods for Large SVD Computations
- Hybrid Iterative Refined Method for Computing a Few Extreme Eigenpairs of a Symmetric Matrix
- Hybrid Iterative Refined Method for Computing a Few Extreme Eigenpairs of a Symmetric Matrix
- A parallel implementation of Davidson methods for large-scale eigenvalue problems in SLEPc
- A Block Preconditioned Harmonic Projection Method for Large-Scale Nonlinear Eigenvalue Problems
- Anasazi software for the numerical solution of large-scale eigenvalue problems
- PHIST
- A Fast Iterative Algorithm for Near-Diagonal Eigenvalue Problems
- Periodically driven perturbed CFTs: the sine-Gordon model
- TRPL+K: Thick-Restart Preconditioned Lanczos+K Method for Large Symmetric Eigenvalue Problems
- A Preconditioned Hybrid SVD Method for Accurately Computing Singular Triplets of Large Matrices
- An Out-of-Core Eigen-Solver with OpenMP Parallel Scheme for Large Spare Damped System
- Beyond Automated Multilevel Substructuring: Domain Decomposition with Rational Filtering
- Truncated Hilbert space approach to the 2d \(\phi^{4}\) theory
- Nonlinear Eigenvector Methods for Convex Minimization over the Numerical Range
- Computing the smallest singular triplets of a large matrix
- Sharp error bounds for Ritz vectors and approximate singular vectors
- Approaching the self-dual point of the sinh-Gordon model
- Block Locally Optimal Preconditioned Eigenvalue Xolvers (BLOPEX) in Hypre and PETSc
- Data clustering with quantum mechanics
- A thick-restart Lanczos algorithm with polynomial filtering for Hermitian eigenvalue problems
- Computing partial spectra with least-squares rational filters
- A Parallel Implementation of the Jacobi-Davidson Eigensolver for Unsymmetric Matrices
- Parallel software for lattice \(\mathcal{N} = 4\) supersymmetric Yang-Mills theory
- A Golub--Kahan Davidson Method for Accurately Computing a Few Singular Triplets of Large Sparse Matrices
- A cross-product approach for low-rank approximations of large matrices
- Deflation by restriction for the inverse-free preconditioned Krylov subspace method
- On optimizing Jacobi-Davidson method for calculating eigenvalues in low dimensional structures using eight band \(\mathbf{k}\cdot\mathbf{p}\) model
- PRIMME_SVDS: A High-Performance Preconditioned SVD Solver for Accurate Large-Scale Computations
- ChASE
- The Eigenvalues Slicing Library (EVSL): Algorithms, Implementation, and Software
- Extending the eigCG algorithm to nonsymmetric Lanczos for linear systems with multiple right-hand sides
- Parallel implementations of the trace minimization scheme trace{min} for the sparse symmetric eigenvalue problem
- Accelerating large partial EVD/SVD calculations by filtered block Davidson methods
- Deflation as a Method of Variance Reduction for Estimating the Trace of a Matrix Inverse
- JADAMILU: a software code for computing selected eigenvalues of large sparse symmetric matrices
- Two harmonic Jacobi-Davidson methods for computing a partial generalized singular value decomposition of a large matrix pair
- A Self-Learning Algebraic Multigrid Method for Extremal Singular Triplets and Eigenpairs
- Using negative curvature in solving nonlinear programs
- Feast eigensolver for non-Hermitian problems
- Hybrid iterative refined restarted Lanczos bidiagonalization methods
- A Domain Decomposition Rayleigh--Ritz Algorithm for Symmetric Generalized Eigenvalue Problems
- Eigenvalue spectrum and scaling dimension of lattice \(\mathcal{N} = 4\) supersymmetric Yang-Mills
- State-of-the-art eigensolvers for electronic structure calculations of large scale nano-systems
- Efficient semidefinite programming with approximate ADMM
- Estimating the trace of the matrix inverse by interpolating from the diagonal of an approximate inverse
- Trace-penalty minimization for large-scale eigenspace computation
- Increasing the Performance of the Jacobi--Davidson Method by Blocking
This page was built for software: PRIMME