The following pages link to SparseMatrix (Q16799):
Displaying 50 items.
- The critical node detection problem in networks: a survey (Q1750314) (← links)
- A supernodal block factorized sparse approximate inverse for non-symmetric linear systems (Q1751071) (← links)
- A transformation approach that makes SPAI, PSAI and RSAI procedures efficient for large double irregular nonsymmetric sparse linear systems (Q1757367) (← links)
- Processor-efficient sparse matrix-vector multiplication (Q1767967) (← links)
- Factorized-sparse-approximate-inverse preconditionings of linear systems with unsymmetric matrices (Q1781380) (← links)
- Flexible and deflated variants of the block shifted GMRES method (Q1789698) (← links)
- Efficient CSR-based sparse matrix-vector multiplication on GPU (Q1793182) (← links)
- A novel CSR-based sparse matrix-vector multiplication on GPUs (Q1793667) (← links)
- A grid-based multilevel incomplete LU factorization preconditioning technique for general sparse matrices (Q1855075) (← links)
- Polynomial preconditioners based on factorized sparse approximate inverses (Q1855875) (← links)
- Preconditioning techniques for large linear systems: A survey (Q1868569) (← links)
- Ranking hubs and authorities using matrix functions (Q1938702) (← links)
- Convergence analysis of Lanczos-type methods for the linear response eigenvalue problem (Q1946190) (← links)
- A parallel implementation of the CMRH method for dense linear systems (Q1952302) (← links)
- Data-driven graph drawing techniques with applications for conveyor systems (Q1980856) (← links)
- A spectral Newton-Schur algorithm for the solution of symmetric generalized eigenvalue problems (Q1988487) (← links)
- The e-MoM approach for approximating matrix functionals (Q1989169) (← links)
- Algorithms for the computation of the matrix logarithm based on the double exponential formula (Q1989194) (← links)
- Parallel multiprojection preconditioned methods based on subspace compression (Q1992526) (← links)
- An evaluation of reordering algorithms to reduce the computational cost of the incomplete Cholesky-conjugate gradient method (Q1993591) (← links)
- A geometric probability randomized Kaczmarz method for large scale linear systems (Q1995943) (← links)
- On exact solution approaches for the longest induced path problem (Q1999389) (← links)
- A modularity based spectral method for simultaneous community and anti-community detection (Q2002803) (← links)
- Optimal detection of critical nodes: improvements to model structure and performance (Q2005802) (← links)
- Towards Monte Carlo preconditioning approach and hybrid Monte Carlo algorithms for matrix computations (Q2006553) (← links)
- A hybridized iterative algorithm of the BiCORSTAB and GPBiCOR methods for solving non-Hermitian linear systems (Q2006582) (← links)
- A generalization of the optimal diagonal approximate inverse preconditioner (Q2013784) (← links)
- Block conjugate gradient type methods for the approximation of bilinear form \(C^HA^{-1}B\) (Q2013786) (← links)
- A new randomized Gauss-Seidel method for solving linear least-squares problems (Q2021500) (← links)
- EIA-CNDP: an exact iterative algorithm for critical node detection problem (Q2027003) (← links)
- On choices of formulations of computing the generalized singular value decomposition of a large matrix pair (Q2028035) (← links)
- Two adaptive scaled gradient projection methods for Stiefel manifold constrained optimization (Q2035513) (← links)
- On restarted and deflated block FOM and GMRES methods for sequences of shifted linear systems (Q2035523) (← links)
- Shifted extended global Lanczos processes for trace estimation with application to network analysis (Q2035644) (← links)
- A two-level iterative scheme for general sparse linear systems based on approximate skew-symmetrizers (Q2035860) (← links)
- A survey of Shanks' extrapolation methods and their applications (Q2038482) (← links)
- On maximum residual block and two-step Gauss-Seidel algorithms for linear least-squares problems (Q2041935) (← links)
- Randomized double and triple Kaczmarz for solving extended normal equations (Q2041936) (← links)
- Learning chordal extensions (Q2046324) (← links)
- Spectral residual method for nonlinear equations on Riemannian manifolds (Q2052260) (← links)
- Global extended Krylov subspace methods for large-scale differential Sylvester matrix equations (Q2053275) (← links)
- A memetic algorithm based on reformulation local search for minimum sum-of-squares clustering in networks (Q2053830) (← links)
- Computing the matrix fractional power with the double exponential formula (Q2055512) (← links)
- Some iterative approaches for Sylvester tensor equations. II: A tensor format of simpler variant of GCRO-based methods (Q2058413) (← links)
- A \(2/3\)-approximation algorithm for vertex-weighted matching (Q2064284) (← links)
- Scaling matrices and counting the perfect matchings in graphs (Q2064289) (← links)
- On two-subspace randomized extended Kaczmarz method for solving large linear least-squares problems (Q2066187) (← links)
- A simple extrapolation method for clustered eigenvalues (Q2066191) (← links)
- Improvement of preconditioned bi-Lanczos-type algorithms with residual norm minimization for the stable solution of systems of linear equations (Q2070140) (← links)
- Bregman primal-dual first-order method and application to sparse semidefinite programming (Q2070334) (← links)
