The following pages link to SparseMatrix (Q16799):
Displaying 50 items.
- On sampling Kaczmarz-Motzkin methods for solving large-scale nonlinear systems (Q2695695) (← links)
- The intrinsic Toeplitz structure and its applications in algebraic Riccati equations (Q2700018) (← links)
- Global GPBiCGstab\((L)\) method for solving linear matrix equations (Q2700021) (← links)
- The randomized Kaczmarz algorithm with the probability distribution depending on the angle (Q2700026) (← links)
- Randomized block subsampling Kaczmarz-Motzkin method (Q2701041) (← links)
- A harmonic framework for stepsize selection in gradient methods (Q2701417) (← links)
- On algorithms for permuting large entries to the diagonal of a sparse matrix (Q2706301) (← links)
- Robust approximate inverse preconditioning for the conjugate gradient method (Q2706438) (← links)
- Preconditioning highly indefinite and nonsymmetric matrices (Q2706440) (← links)
- A factored approximate inverse preconditioner with pivoting (Q2784375) (← links)
- An algebraic multilevel preconditioner with low-rank corrections for sparse symmetric matrices (Q2797101) (← links)
- Edge modification criteria for enhancing the communicability of digraphs (Q2806181) (← links)
- PageRank beyond the web (Q2808253) (← links)
- Approximating spectral densities of large matrices (Q2808266) (← links)
- The Leja method revisited: backward error analysis for the matrix exponential (Q2811992) (← links)
- Preconditioning of the Reduced System Associated with the Restricted Additive Schwarz Method (Q2813278) (← links)
- Factorized approximate inverses with adaptive dropping (Q2815689) (← links)
- Computing partial spectra with least-squares rational filters (Q2827038) (← links)
- Interpolation-restart strategies for resilient eigensolvers (Q2827052) (← links)
- Modulus-type inner outer iteration methods for nonnegative constrained least squares problems (Q2827061) (← links)
- Optimizing sparse matrix-matrix multiplication for the GPU (Q2828151) (← links)
- A sparse symmetric indefinite direct solver for GPU architectures (Q2828161) (← links)
- Efficient matching for column intersection graphs (Q2828179) (← links)
- Parallel Jacobi-Davidson with block FSAI preconditioning and controlled inner iterations. (Q2829102) (← links)
- Estimating the largest elements of a matrix (Q2830567) (← links)
- ViennaCL-linear algebra library for multi- and many-core architectures (Q2830624) (← links)
- Efficient approximation algorithms for weighted \(b\)-matching (Q2830632) (← links)
- Complex network partitioning using label propagation (Q2830633) (← links)
- Performance-based numerical solver selection in the Lighthouse framework (Q2830643) (← links)
- Preconditioning of linear least squares by robust incomplete factorization for implicitly held normal equations (Q2831075) (← links)
- \(L_p\)-norm regularization algorithms for optimization over permutation matrices (Q2832890) (← links)
- Exploiting multiple levels of parallelism in sparse matrix-matrix multiplication (Q2833530) (← links)
- Efficient (partial) determination of derivative matrices via automatic differentiation (Q2847718) (← links)
- Hypergraph partitioning based models and methods for exploiting cache locality in sparse matrix-vector multiplication (Q2847753) (← links)
- Randomized extended Kaczmarz for solving least squares (Q2848636) (← links)
- An approach to making SPAI and PSAI preconditioning effective for large irregular sparse linear systems (Q2855649) (← links)
- Divide and conquer low-rank preconditioners for symmetric matrices (Q2855656) (← links)
- Fine-grained multithreading for the multifrontal \(QR\) factorization of sparse matrices (Q2855667) (← links)
- A load balancing strategy for parallel computation of sparse permanents. (Q2864488) (← links)
- 2-norm error bounds and estimates for Lanczos approximations to linear systems and rational matrix functions (Q2866223) (← links)
- Feasible Barzilai–Borwein-like methods for extreme symmetric eigenvalue problems (Q2867405) (← links)
- COAST: A Convex Optimization Approach to Stress-Based Embedding (Q2867664) (← links)
- A high-order numerical method for the Helmholtz equation with nonstandard boundary conditions (Q2870644) (← links)
- Avoiding communication in nonsymmetric Lanczos-based Krylov subspace methods (Q2870667) (← links)
- Enhanced block FSAI preconditioning using domain decomposition techniques (Q2870689) (← links)
- On positive semidefinite modification schemes for incomplete Cholesky factorization (Q2874998) (← links)
- Compressed multirow storage format for sparse matrices on graphics processing units (Q2875022) (← links)
- Computational experience with numerical methods for nonnegative least-squares problems. (Q2889392) (← links)
- Using Chebyshev polynomials and approximate inverse triangular factorizations for preconditioning the conjugate gradient method (Q2901137) (← links)
- Sparse Matrix Methods for Circuit Simulation Problems (Q2902757) (← links)
