Pages that link to "Item:Q3630382"
From MaRDI portal
The following pages link to Performance and Accuracy of LAPACK's Symmetric Tridiagonal Eigensolvers (Q3630382):
Displaying 18 items.
- A limited memory BFGS algorithm for non-convex minimization with applications in matrix largest eigenvalue problem (Q283997) (← links)
- Projection methods for quantum channel construction (Q496914) (← links)
- Coupling bounds for approximating birth-death processes by truncation (Q899628) (← links)
- On tridiagonal matrices unitarily equivalent to normal matrices (Q968982) (← links)
- Higher-order spectral clustering for geometric graphs (Q2658739) (← links)
- Performance-based numerical solver selection in the Lighthouse framework (Q2830643) (← links)
- Preconditioners for saddle point systems with trace constraints coupling 2D and 1D domains (Q2831079) (← links)
- An Accelerated Divide-and-Conquer Algorithm for the Bidiagonal SVD Problem (Q2936585) (← links)
- New fast divide-and-conquer algorithms for the symmetric tridiagonal eigenvalue problem (Q2955975) (← links)
- Communication lower bounds and optimal algorithms for numerical linear algebra (Q4683913) (← links)
- A note on generating finer‐grain parallelism in a representation tree (Q4924936) (← links)
- Restructuring the Tridiagonal and Bidiagonal QR Algorithms for Performance (Q5177205) (← links)
- Accuracy of the $s$-Step Lanczos Method for the Symmetric Eigenproblem in Finite Precision (Q5264995) (← links)
- Fast Computation of Spectral Projectors of Banded Matrices (Q5358302) (← links)
- Linear algebra software for large-scale accelerated multicore computing (Q5740076) (← links)
- Computing the Bidiagonal SVD Through an Associated Tridiagonal Eigenproblem (Q5862553) (← links)
- Performance and accuracy of the basic closure algorithm of quadrature-based moment methods (Q6087931) (← links)
- Ranking edges by their impact on the spectral complexity of information diffusion over networks (Q6583631) (← links)
