The following pages link to SparseMatrix (Q16799):
Displaying 50 items.
- Improved componentwise verified error bounds for least squares problems and underdetermined linear systems (Q2249828) (← links)
- An efficient and accurate method to compute the Fiedler vector based on Householder deflation and inverse power iteration (Q2252255) (← links)
- A block \(\mathrm{GCROT}(m, k)\) method for linear systems with multiple right-hand sides (Q2252728) (← links)
- Simultaneous similarity reductions for a pair of matrices to condensed forms (Q2255033) (← links)
- Verified bounds for all the singular values of matrix (Q2257612) (← links)
- Variants of residual smoothing with a small residual gap (Q2273191) (← links)
- A reduced-order discontinuous Galerkin method based on a Krylov subspace technique in nanophotonics (Q2279351) (← links)
- On the error estimate of the randomized double block Kaczmarz method (Q2287617) (← links)
- A note on the adaptive simpler block GMRES method (Q2289864) (← links)
- Preconditioners for rank deficient least squares problems (Q2297167) (← links)
- Performance and energy consumption of accurate and mixed-precision linear algebra kernels on GPUs (Q2297181) (← links)
- Chordal decomposition in operator-splitting methods for sparse semidefinite programs (Q2297655) (← links)
- Finding strongly connected components of simple digraphs based on granulation strategy (Q2302953) (← links)
- On partial Cholesky factorization and a variant of quasi-Newton preconditioners for symmetric positive definite matrices (Q2305868) (← links)
- Efficient variants of the CMRH method for solving a sequence of multi-shifted non-Hermitian linear systems simultaneously (Q2309253) (← links)
- Optimal \(K\)-node disruption on a node-capacitated network (Q2311104) (← links)
- Variant of greedy randomized Kaczmarz for ridge regression (Q2311776) (← links)
- A new projected variant of the deflated block conjugate gradient method (Q2316259) (← links)
- On partially randomized extended Kaczmarz method for solving large sparse overdetermined inconsistent linear systems (Q2321358) (← links)
- Implementation of interior-point methods for LP based on Krylov subspace iterative solvers with inner-iteration preconditioning (Q2322556) (← links)
- Weighted and deflated global GMRES algorithms for solving large Sylvester matrix equations (Q2322827) (← links)
- On the maximum small-world subgraph problem (Q2327623) (← links)
- An inexact dual logarithmic barrier method for solving sparse semidefinite programs (Q2330644) (← links)
- Preconditioners for nonsymmetric indefinite linear systems (Q2332746) (← links)
- Distributed algebraic tearing and interconnecting techniques (Q2334804) (← links)
- The effect of graph partitioning techniques on parallel block FSAI preconditioning: a computational study (Q2340362) (← links)
- An integer programming approach for finding the most and the least central cliques (Q2341092) (← links)
- A positivity preserving inexact Noda iteration for computing the smallest eigenpair of a large irreducible \(M\)-matrix (Q2353376) (← links)
- Global LSMR(Gl-LSMR) method for solving general linear systems with several right-hand sides (Q2357421) (← links)
- On some extended block Krylov based methods for large scale nonsymmetric Stein matrix equations (Q2359587) (← links)
- A breakdown-free block conjugate gradient method (Q2359753) (← links)
- Variants of the groupwise update strategy for short-recurrence Krylov subspace methods (Q2360676) (← links)
- Block Krylov-type complex moment-based eigensolvers for solving generalized eigenvalue problems (Q2360677) (← links)
- Updating preconditioners for modified least squares problems (Q2360681) (← links)
- Stagnation of block GMRES and its relationship to block FOM (Q2362282) (← links)
- Aitken's method for estimating bilinear forms arising in applications (Q2363689) (← links)
- A quasi-minimal residual variant of the BiCORSTAB method for nonsymmetric linear systems (Q2364213) (← links)
- A fast block low-rank dense solver with applications to finite-element matrices (Q2374895) (← links)
- Exploiting the composite step strategy to the biconjugate \(A\)-orthogonal residual method for non-Hermitian linear systems (Q2375537) (← links)
- An implicitly restarted block Lanczos bidiagonalization method using Leja shifts (Q2376857) (← links)
- Crout versions of ILU factorization with pivoting for sparse symmetric matrices (Q2388705) (← links)
- Breakdown-free version of ILU factorization for nonsymmetric positive definite matrices (Q2390015) (← links)
- A simple strategy for varying the restart parameter in GMRES\((m)\) (Q2390021) (← links)
- Efficient preconditioner updates for unsymmetric shifted linear systems (Q2397184) (← links)
- Complete pivoting strategy for the left-looking robust incomplete factorization preconditioner (Q2397289) (← links)
- Efficient preconditioning of \(hp\)-FEM matrices by hierarchical low-rank approximations (Q2399152) (← links)
- A fixed-point method for approximate projection onto the positive semidefinite cone (Q2400246) (← links)
- Numerical issues in computing the antitriangular factorization of symmetric indefinite matrices (Q2400798) (← links)
- Finding near-optimal independent sets at scale (Q2401330) (← links)
- A real-valued block conjugate gradient type method for solving complex symmetric linear systems with multiple right-hand sides. (Q2402122) (← links)
