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.
- Iterative ILU Preconditioners for Linear Systems and Eigenproblems (Q5079524) (← links)
- Fortification Against Cascade Propagation Under Uncertainty (Q5084610) (← links)
- Solving the Distance-Based Critical Node Problem (Q5087707) (← links)
- Finding Critical Links for Closeness Centrality (Q5138269) (← links)
- Network Flow-Based Refinement for Multilevel Hypergraph Partitioning (Q5140705) (← links)
- (Q5140706) (← links)
- (Q5140710) (← links)
- (Q5140737) (← links)
- MPI+OpenMP реализация метода сопряженных градиентов с факторизованными неявными предобусловливателями (Q5153975) (← links)
- Adaptive Relaxation Strategy on Basic Iterative Methods for Solving Linear Systems with Single and Multiple Right-Hand Sides (Q5157047) (← links)
- Beyond non-backtracking: non-cycling network centrality measures (Q5160872) (← links)
- Mixed-precision iterative refinement using tensor cores on GPUs to accelerate solution of linear systems (Q5161159) (← links)
- Approximate residual-minimizing shift parameters for the low-rank ADI iteration (Q5218393) (← links)
- Flip-flop spectrum-revealing QR factorization and its applications to singular value decomposition (Q5218403) (← links)
- Thick restarting the weighted harmonic Golub-Kahan-Lanczos algorithm for the linear response eigenvalue problem (Q5218406) (← links)
- A simpler GMRES and its adaptive variant for shifted linear systems (Q5271012) (← links)
- Fast Estimation of Approximate Matrix Ranks Using Spectral Densities (Q5380703) (← links)
- An Efficient Variant of the GMRES(<i>m</i>) Method Based on the Error Equations (Q5406907) (← links)
- A fast convergent iterative solver for approximate inverse of matrices (Q5502422) (← links)
- The extended block Arnoldi method for solving generalized differential Sylvester equations (Q5855693) (← links)
- Greedy Kaczmarz Algorithm Using Optimal Intermediate Projection Technique for Coherent Linear Systems (Q5864786) (← links)
- A Partially Greedy Randomized Extended Gauss-Seidel Method for Solving Large Linear Systems (Q5866607) (← links)
- (Q5874530) (← links)
- (Q5874548) (← links)
- An Incomplete Cholesky Preconditioner Based on Orthogonal Approximations (Q6039243) (← links)
- An almost-maximal residual tensor block Kaczmarz method for large tensor linear systems (Q6049259) (← links)
- An efficient randomized QLP algorithm for approximating the singular value decomposition (Q6052614) (← links)
- Numerical methods for solving large-scale systems of differential equations (Q6054814) (← links)
- On adaptive block coordinate descent methods for ridge regression (Q6060680) (← links)
- A dimension expanded preconditioning technique for block two-by-two linear equations (Q6060846) (← links)
- A FEAST SVDsolver based on Chebyshev-Jackson series for computing partial singular triplets of large matrices (Q6077289) (← links)
- Accelerated greedy randomized augmented Kaczmarz algorithm for inconsistent linear systems (Q6086859) (← links)
- On multi-step randomized extended Kaczmarz method for solving large sparse inconsistent linear systems (Q6086876) (← links)
- In search of dense subgraphs: How good is greedy peeling? (Q6087137) (← links)
- Automated tuning for the parameters of linear solvers (Q6087949) (← links)
- An exact algorithm for the maximum quasi‐clique problem (Q6088204) (← links)
- Second‐order accurate hierarchical approximate factorizations for solving sparse linear systems (Q6092276) (← links)
- Krylov-Aware Stochastic Trace Estimation (Q6094742) (← links)
- Mixed Precision Iterative Refinement with Sparse Approximate Inverse Preconditioning (Q6098511) (← links)
- Efficient Algebraic Two-Level Schwarz Preconditioner for Sparse Matrices (Q6098522) (← links)
- On convergence rates of Kaczmarz-type methods with different selection rules of working rows (Q6101793) (← links)
- Nonmonotone feasible arc search algorithm for minimization on Stiefel manifold (Q6103364) (← links)
- A gradient method exploiting the two dimensional quadratic termination property (Q6110631) (← links)
- Row Replicated Block Cimmino (Q6116384) (← links)
- Probabilistic Rounding Error Analysis of Householder QR Factorization (Q6116667) (← links)
- On a family of low-rank algorithms for large-scale algebraic Riccati equations (Q6118776) (← links)
- Thick-restarted joint Lanczos bidiagonalization for the GSVD (Q6126037) (← links)
- The constant solution method for solving large-scale differential Sylvester matrix equations with time invariant coefficients (Q6126605) (← links)
- Faster Deterministic Pseudoinverse-Free Block Extension of Motzkin Method for Large Consistent Linear Systems (Q6139025) (← links)
- Sparse sampling Kaczmarz–Motzkin method with linear convergence (Q6139724) (← links)
