The following pages link to SparseMatrix (Q16799):
Displaying 50 items.
- A multilevel approach to stochastic trace estimation (Q2074958) (← links)
- Localized Fourier analysis for graph signal processing (Q2074996) (← links)
- Multi-step greedy Kaczmarz algorithms with simple random sampling for solving large linear systems (Q2085033) (← links)
- A novel ILU preconditioning method with a block structure suitable for SIMD vectorization (Q2088835) (← links)
- Non-convex exact community recovery in stochastic block model (Q2089764) (← links)
- Scalability pipelined algorithm of the conjugate gradient method on heterogeneous platforms (Q2091474) (← links)
- Solving large linear least squares problems with linear equality constraints (Q2098770) (← links)
- A dimension expanded preconditioning technique for saddle point problems (Q2098782) (← links)
- A weighted randomized sparse Kaczmarz method for solving linear systems (Q2099537) (← links)
- GMRES using pseudoinverse for range symmetric singular systems (Q2104052) (← links)
- A least squares approach for saddle point problems (Q2111547) (← links)
- On the acceleration of the Barzilai-Borwein method (Q2114827) (← links)
- On a fast deterministic block Kaczmarz method for solving large-scale linear systems (Q2116037) (← links)
- An improved two-sweep iteration method for absolute value equations (Q2125919) (← links)
- A two-step randomized Gauss-Seidel method for solving large-scale linear least squares problems (Q2127524) (← links)
- Greedy randomized and maximal weighted residual Kaczmarz methods with oblique projection (Q2127557) (← links)
- Rational Krylov methods for fractional diffusion problems on graphs (Q2132423) (← links)
- An accelerated minimal gradient method with momentum for strictly convex quadratic optimization (Q2132432) (← links)
- A stabilized GMRES method for singular and severely ill-conditioned systems of linear equations (Q2135556) (← links)
- Metaheuristic algorithms for the bandwidth reduction of large-scale matrices (Q2136166) (← links)
- An extended-rational Arnoldi method for large matrix exponential evaluations (Q2144973) (← links)
- On greedy randomized average block Kaczmarz method for solving large linear systems (Q2146339) (← links)
- Hierarchical orthogonal factorization: sparse least squares problems (Q2147465) (← links)
- An extended delayed weighted gradient algorithm for solving strongly convex optimization problems (Q2161068) (← links)
- A class of residual-based extended Kaczmarz methods for solving inconsistent linear systems (Q2161070) (← links)
- Enclosing Moore-Penrose inverses (Q2174195) (← links)
- The inexact Euler-extrapolated block preconditioners for a class of complex linear systems (Q2176474) (← links)
- A greedy block Kaczmarz algorithm for solving large-scale linear systems (Q2176512) (← links)
- An opposition-based memetic algorithm for the maximum quasi-clique problem (Q2184091) (← links)
- Changing over stopping criterion for stable solving nonsymmetric linear equations by preconditioned conjugate gradient squared method (Q2184899) (← links)
- A parallel multithreaded sparse triangular linear system solver (Q2192563) (← links)
- On relaxed greedy randomized coordinate descent methods for solving large linear least-squares problems (Q2192631) (← links)
- Fast gradient methods with alignment for symmetric linear systems without using Cauchy step (Q2195925) (← links)
- An alternative extended block Arnoldi method for solving low-rank Sylvester equations (Q2203532) (← links)
- Matrix LSQR algorithm for structured solutions to quaternionic least squares problem (Q2203782) (← links)
- Block-accelerated aggregation multigrid for Markov chains with application to PageRank problems (Q2205866) (← links)
- Performance and stability of direct methods for computing generalized inverses of the graph Laplacian (Q2208933) (← links)
- Structure of the preconditioned system in various preconditioned conjugate gradient squared algorithms (Q2211057) (← links)
- Algorithms for approximate subtropical matrix factorization (Q2218339) (← links)
- Convergence analysis on matrix splitting iteration algorithm for semidefinite linear complementarity problems (Q2219444) (← links)
- Two new variants of the simpler block GMRES method with vector deflation and eigenvalue deflation for multiple linear systems (Q2221146) (← links)
- Discrete trace theorems and energy minimizing spring embeddings of planar graphs (Q2226448) (← links)
- On convergence rate of the randomized Gauss-Seidel method (Q2228499) (← links)
- Block sampling Kaczmarz-Motzkin methods for consistent linear systems (Q2230558) (← links)
- \texttt{MADAM}: a parallel exact solver for max-cut based on semidefinite programming and ADMM (Q2231040) (← links)
- COSMO: a conic operator splitting method for convex conic problems (Q2231337) (← links)
- On integer programming models for the maximum 2-club problem and its robust generalizations in sparse graphs (Q2242194) (← links)
- A count sketch maximal weighted residual Kaczmarz method for solving highly overdetermined linear systems (Q2245100) (← links)
- Analysis of centrality measures under differential privacy models (Q2246027) (← links)
- Convergent homotopy analysis method for solving linear systems (Q2248685) (← links)
