The following pages link to SparseMatrix (Q16799):
Displaying 50 items.
- On the algorithm by Al-Mohy and Higham for computing the action of the matrix exponential: a posteriori roundoff error estimation (Q2402446) (← links)
- LSQR algorithm with structured preconditioner for the least squares problem in quaternionic quantum theory (Q2403829) (← links)
- A randomized algorithm for approximating the log determinant of a symmetric positive definite matrix (Q2404966) (← links)
- A two-sided short-recurrence extended Krylov subspace method for nonsymmetric matrices and its relation to rational moment matching (Q2408146) (← links)
- Hierarchical clustering with deep q-learning (Q2414694) (← links)
- Accelerating block coordinate descent methods with identification strategies (Q2419524) (← links)
- A new shifted block GMRES method with inexact breakdowns for solving multi-shifted and multiple right-hand sides linear systems (Q2420682) (← links)
- Low complexity matrix projections preserving actions on vectors (Q2424214) (← links)
- Privacy-preserving and verifiable protocols for scientific computation outsourcing to the cloud (Q2441503) (← links)
- Componentwise enclosure for solutions of least squares problems and underdetermined systems (Q2442244) (← links)
- Left-looking version of AINV preconditioner with complete pivoting strategy (Q2442284) (← links)
- Graph models and their efficient implementation for sparse Jacobian matrix determination (Q2446302) (← links)
- Memory efficient hybrid algebraic solvers for linear systems arising from compressible flows (Q2446628) (← links)
- Estimations of the trace of powers of positive self-adjoint operators by extrapolation of the moments (Q2447374) (← links)
- Exact identification of critical nodes in sparse networks via new compact formulations (Q2448196) (← links)
- On the choice of preconditioner for minimum residual methods for non-Hermitian matrices (Q2448311) (← links)
- Preconditioners based on strong subgraphs (Q2450047) (← links)
- Parallelism and robustness in GMRES with a Newton basis and deflated restarting (Q2450058) (← links)
- A Cholesky out-of-core factorization (Q2450457) (← links)
- Fast structured LU factorization for nonsymmetric matrices (Q2450863) (← links)
- Minimization principles and computation for the generalized linear response eigenvalue problem (Q2450894) (← links)
- Krylov subspace recycling for sequences of shifted linear systems (Q2451760) (← links)
- A fast algebraic multigrid preconditioned conjugate gradient solver (Q2506351) (← links)
- Implicitly restarting the LSQR algorithm (Q2510849) (← links)
- Barzilai-Borwein-like methods for the extreme eigenvalue problem (Q2514702) (← links)
- A class of incomplete orthogonal factorization methods. II: Implemetation and results (Q2568630) (← links)
- Continuous quadratic programming formulations of optimization problems on graphs (Q2629636) (← links)
- 2LEV-D2P4: a package of high-performance preconditioners for scientific and engineering applications (Q2642893) (← links)
- Towards an accurate performance modeling of parallel sparse factorization (Q2642894) (← links)
- Analysis of a sparse hypermatrix Cholesky with fixed-sized blocking (Q2642898) (← links)
- On greedy randomized block Kaczmarz method for consistent linear systems (Q2656635) (← links)
- tpSpMV: a two-phase large-scale sparse matrix-vector multiplication kernel for manycore architectures (Q2663542) (← links)
- Block GPBi-CG method for solving nonsymmetric linear systems with multiple right-hand sides and its convergence analysis (Q2665948) (← links)
- Randomized block Kaczmarz methods with \(k\)-means clustering for solving large linear systems (Q2667110) (← links)
- On extended Kaczmarz methods with random sampling and maximum-distance for solving large inconsistent linear systems (Q2668191) (← links)
- Compatibility, embedding and regularization of non-local random walks on graphs (Q2669350) (← links)
- Lower bounds for the bandwidth problem (Q2669517) (← links)
- On randomized trace estimates for indefinite matrices with an application to determinants (Q2671299) (← links)
- Domain decomposition based preconditioner combined local low-rank approximation with global corrections (Q2671772) (← links)
- Monte Carlo estimators for the Schatten \(p\)-norm of symmetric positive semidefinite matrices (Q2672173) (← links)
- Anymatrix: an extensible MATLAB matrix collection (Q2672725) (← links)
- A family of optimal weighted conjugate-gradient-type methods for strictly convex quadratic minimization (Q2672727) (← links)
- Implicit steepest descent algorithm for optimization with orthogonality constraints (Q2673531) (← links)
- Two harmonic Jacobi-Davidson methods for computing a partial generalized singular value decomposition of a large matrix pair (Q2676809) (← links)
- The global Golub-Kahan method and Gauss quadrature for tensor function approximation (Q2679650) (← links)
- Optimal size of the block in block GMRES on GPUs: computational model and experiments (Q2679654) (← links)
- Hybrid iterative refined restarted Lanczos bidiagonalization methods (Q2679823) (← links)
- A cross-product free Jacobi-Davidson type method for computing a partial generalized singular value decomposition of a large matrix pair (Q2680320) (← links)
- Balanced incomplete factorization preconditioner with pivoting (Q2681950) (← links)
- On fast greedy block Kaczmarz methods for solving large consistent linear systems (Q2695685) (← links)
