The following pages link to On parallelizable eigensolvers (Q1201930):
Displaying 10 items.
- Efficient eigenvalue and singular value computations on shared memory machines (Q811744) (← links)
- Fast spectral projection algorithms for density-matrix computations (Q1306101) (← links)
- Parallel computation of polynomials with minimal uniform norm and its application to large eigenproblems (Q1372035) (← links)
- International workshop on eigenvalue problems: algorithms; software and applications, in petascale computing (EPASA2018) (Q2318508) (← links)
- A fixed-point method for approximate projection onto the positive semidefinite cone (Q2400246) (← links)
- A quadratically convergent QR-like method without shifts for the Hermitian eigenvalue problem (Q2502892) (← links)
- (Q4226729) (← links)
- Evaluating products of matrix pencils and collapsing matrix products (Q4828884) (← links)
- An efficient Jacobi-like algorithm for parallel eigenvalue computation (Q5375330) (← links)
- Exponentially convergent parallel algorithm for nonlinear eigenvalue problems (Q5436492) (← links)
