Pages that link to "Item:Q2989137"
From MaRDI portal
The following pages link to The university of Florida sparse matrix collection (Q2989137):
Displaying 50 items.
- Detecting critical node structures on graphs: A mathematical programming approach (Q4628045) (← links)
- A Block Lanczos Method for the Extended Trust-Region Subproblem (Q4629333) (← 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)
- 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)
- A Class of Symmetric Factored Approximate Inverses and Hybrid Two-Level Solver (Q4962546) (← 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)
- Projected Newton method for noise constrained Tikhonov regularization (Q5000596) (← links)
- <scp>TriCG</scp> and <scp>TriMR</scp>: Two Iterative Methods for Symmetric Quasi-definite Systems (Q5005013) (← links)
- Rational Spectral Filters with Optimal Convergence Rate (Q5005202) (← links)
- Nonlocal pagerank (Q5006301) (← links)
- Stochastic Gradient Descent Works Really Well for Stress Minimization (Q5014101) (← links)
- Mittag--Leffler Functions and their Applications in Network Science (Q5014163) (← links)
- On Greedy Randomized Augmented Kaczmarz Method for Solving Large Sparse Inconsistent Linear Systems (Q5015300) (← links)
- Large-Scale Optimization with Linear Equality Constraints Using Reduced Compact Representation (Q5022491) (← links)
- A Nonlinear Spectral Method for Core--Periphery Detection in Networks (Q5025758) (← links)
- Metric-Constrained Optimization for Graph Clustering Algorithms (Q5025762) (← links)
- Approximate Generalized Inverses with Iterative Refinement for $\epsilon$-Accurate Preconditioning of Singular Systems (Q5028552) (← links)
- Hierarchical Orthogonal Factorization: Sparse Square Matrices (Q5028554) (← links)
- Divide-and-Conquer Methods for Functions of Matrices with Banded or Hierarchical Low-Rank Structure (Q5028556) (← links)
- Efficient approximation of functions of some large matrices by partial fraction expansions (Q5031745) (← links)
- Extrapolating the Arnoldi Algorithm To Improve Eigenvector Convergence (Q5035918) (← links)
- Simultaneous iterative solutions for the trust-region and minimum eigenvalue subproblem (Q5038438) (← links)
- Simultaneous Computational and Data Load Balancing in Distributed-Memory Setting (Q5058287) (← links)
- Computation of generalized matrix functions with rational Krylov methods (Q5058654) (← links)
- On Relaxed Greedy Randomized Augmented Kaczmarz Methods for Solving Large Sparse Inconsistent Linear Systems (Q5061744) (← links)
- A Fast Block Coordinate Descent Method for Solving Linear Least-Squares Problems (Q5061750) (← links)
- On Convergence of the Partially Randomized Extended Kaczmarz Method (Q5061752) (← links)
- Partitioning and Reordering for Spike-Based Distributed-Memory Parallel Gauss--Seidel (Q5065494) (← links)
- GraphBLAST: A High-Performance Linear Algebra-based Graph Framework on the GPU (Q5066588) (← links)
- Reproduced Computational Results Report for “Ginkgo: A Modern Linear Operator Algebra Framework for High Performance Computing” (Q5066596) (← links)
- Exactly Solving Sparse Rational Linear Systems via Roundoff-Error-Free Cholesky Factorizations (Q5071429) (← links)
- A Robust Algebraic Domain Decomposition Preconditioner for Sparse Normal Equations (Q5075692) (← links)
- Evaluation of a Flow-Based Hypergraph Bipartitioning Algorithm (Q5075796) (← links)
- (Q5075824) (← links)
