The following pages link to SparseMatrix (Q16799):
Displaying 50 items.
- Randomized Quasi-Newton Updates Are Linearly Convergent Matrix Inversion Algorithms (Q4598334) (← links)
- Improving the stability and robustness of incomplete symmetric indefinite factorization preconditioners (Q4599015) (← links)
- 1.5D Parallel Sparse Matrix-Vector Multiply (Q4602886) (← links)
- On Greedy Randomized Kaczmarz Method for Solving Large Sparse Linear Systems (Q4603512) (← links)
- A Robust Multilevel Approximate Inverse Preconditioner for Symmetric Positive Definite Matrices (Q4604560) (← links)
- Computing the Weighted Geometric Mean of Two Large-Scale Matrices and Its Inverse Times a Vector (Q4604562) (← links)
- Low Rank Approximation of a Sparse Matrix Based on LU Factorization with Column and Row Tournament Pivoting (Q4610132) (← links)
- BootCMatch (Q4611308) (← links)
- Design and Implementation of Adaptive SpMV Library for Multicore and Many-Core Architecture (Q4611317) (← links)
- On Hessenberg type methods for low-rank Lyapunov matrix equations (Q4614231) (← links)
- A 2/3-Approximation Algorithm for Vertex Weighted Matching in Bipartite Graphs (Q4623143) (← links)
- Detecting critical node structures on graphs: A mathematical programming approach (Q4628045) (← links)
- A Block Lanczos Method for the Extended Trust-Region Subproblem (Q4629333) (← links)
- Improving projection‐based eigensolvers via adaptive techniques (Q4637393) (← links)
- Wilkinson's inertia‐revealing factorization and its application to sparse matrices (Q4637399) (← links)
- Low-Rank Factorizations in Data Sparse Hierarchical Algorithms for Preconditioning Symmetric Positive Definite Matrices (Q4644411) (← links)
- A New Preconditioner that Exploits Low-Rank Approximations to Factorization Error (Q4646451) (← links)
- A Hypergraph Partitioning Model for Profile Minimization (Q4646452) (← links)
- A Novel Algebraic Multigrid Approach Based on Adaptive Smoothing and Prolongation for Ill-Conditioned Systems (Q4646457) (← links)
- (Q4649004) (← links)
- Double Ordering and Fill-In for the <i>LU</i> Factorization (Q4650950) (← links)
- Community Detection in Networks via Nonlinear Modularity Eigenvectors (Q4683908) (← links)
- Communication lower bounds and optimal algorithms for numerical linear algebra (Q4683913) (← links)
- A Sparse Completely Positive Relaxation of the Modularity Maximization for Community Detection (Q4685333) (← links)
- On the Stability of Network Indices Defined by Means of Matrix Functions (Q4689241) (← links)
- The Design and Use of Algorithms for Permuting Large Entries to the Diagonal of Sparse Matrices (Q4702235) (← links)
- BILUTM: A Domain-Based Multilevel Block ILUT Preconditioner for General Sparse Matrices (Q4702264) (← links)
- (Q4737758) (← links)
- Numerical performance of preconditioning techniques for the solution of complex sparse linear systems (Q4795134) (← links)
- LQ-Schur projection on large sparse matrix equations (Q4814495) (← links)
- An incompleteLU-factorization algorithm based on block bordering (Q4814498) (← links)
- (Q4905469) (← links)
- A Matrix-Free Preconditioner for Sparse Symmetric Positive Definite Systems and Least-Squares Problems (Q4917131) (← links)
- IMF: An Incomplete Multifrontal $LU$-Factorization for Element-Structured Sparse Linear Systems (Q4917135) (← links)
- Overlapping Blocks by Growing a Partition with Applications to Preconditioning (Q4917142) (← links)
- A Recursive Bipartitioning Algorithm for Permuting Sparse Square Matrices into Block Diagonal Form with Overlap (Q4917166) (← links)
- Algorithm 1000 (Q4960968) (← links)
- A Class of Symmetric Factored Approximate Inverses and Hybrid Two-Level Solver (Q4962546) (← links)
- Least squares solution of the quaternion Sylvester tensor equation (Q4965577) (← links)
- Level-based heuristics and hill climbing for the antibandwidth maximization problem (Q4982954) (← links)
- Fast Algorithms for the Maximum Clique Problem on Massive Graphs with Applications to Overlapping Community Detection (Q4985798) (← links)
- A Power Schur Complement Low-Rank Correction Preconditioner for General Sparse Linear Systems (Q4986833) (← links)
- On the cost of iterative computations (Q4993500) (← links)
- Algebraic Algorithms for Betweenness and Percolation Centrality (Q4994345) (← links)
- Hybrid Iterative Refined Method for Computing a Few Extreme Eigenpairs of a Symmetric Matrix (Q4997345) (← links)
- A Lipschitz Matrix for Parameter Reduction in Computational Science (Q4997385) (← links)
- Kaczmarz-Type Inner-Iteration Preconditioned Flexible GMRES Methods for Consistent Linear Systems (Q4997391) (← links)
- On Adaptive Sketch-and-Project for Solving Linear Systems (Q4997841) (← links)
- Block Low-Rank Matrices with Shared Bases: Potential and Limitations of the BLR$^2$ Format (Q4997842) (← links)
- Greed Works: An Improved Analysis of Sampling Kaczmarz--Motzkin (Q4999361) (← links)
