The following pages link to SparseMatrix (Q16799):
Displaying 37 items.
- Extending the eigCG algorithm to nonsymmetric Lanczos for linear systems with multiple right-hand sides (Q5502424) (← links)
- Covariance selection for nonchordal graphs via chordal embedding (Q5503689) (← links)
- Evaluation of Several Variants of Explicitly Restarted Lanczos Eigensolvers and Their Parallel Implementations (Q5503811) (← links)
- What Color Is Your Jacobian? Graph Coloring for Computing Derivatives (Q5713152) (← links)
- Deflation as a Method of Variance Reduction for Estimating the Trace of a Matrix Inverse (Q5738167) (← links)
- Computing the Action of Trigonometric and Hyperbolic Matrix Functions (Q5738170) (← links)
- Restrictively Preconditioned Conjugate Gradient Method for a Series of Constantly Augmented Least Squares Problems (Q5853709) (← links)
- The extended block Arnoldi method for solving generalized differential Sylvester equations (Q5855693) (← links)
- Tree decompositions and social graphs (Q5856440) (← links)
- A Domain Decomposition Rayleigh--Ritz Algorithm for Symmetric Generalized Eigenvalue Problems (Q5856674) (← links)
- Three-Precision GMRES-Based Iterative Refinement for Least Squares Problems (Q5856681) (← links)
- Polynomial Preconditioned Arnoldi with Stability Control (Q5856683) (← links)
- Exploiting Lower Precision Arithmetic in Solving Symmetric Positive Definite Linear Systems and Least Squares Problems (Q5857837) (← links)
- Matrices with Tunable Infinity-Norm Condition Number and No Need for Pivoting in LU Factorization (Q5857851) (← links)
- Low synchronization Gram–Schmidt and generalized minimal residual algorithms (Q5858527) (← links)
- A Block Bidiagonalization Method for Fixed-Accuracy Low-Rank Matrix Approximation (Q5863873) (← links)
- A Block Minimum Residual Norm Subspace Solver with Partial Convergence Management for Sequences of Linear Systems (Q5863875) (← 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)
- Dynamic Matching Algorithms in Practice (Q5874529) (← links)
- (Q5874530) (← links)
- (Q5874548) (← links)
- HIFIR: Hybrid Incomplete Factorization with Iterative Refinement for Preconditioning Ill-Conditioned and Singular Systems (Q5882948) (← links)
- Algorithm 1021: SPEX Left LU, Exactly Solving Sparse Linear Systems via a Sparse Left-looking Integer-preserving LU Factorization (Q5883713) (← links)
- Monte Carlo Methods for Estimating the Diagonal of a Real Symmetric Matrix (Q5885812) (← links)
- GPMR: An Iterative Method for Unsymmetric Partitioned Linear Systems (Q5885815) (← links)
- The Joint Bidiagonalization Method for Large GSVD Computations in Finite Precision (Q5885819) (← links)
- Preconditioning Sparse Matrices with Alternating and Multiplicative Operator Splittings (Q5886846) (← links)
- Mixed precision algorithms in numerical linear algebra (Q5887837) (← links)
- Enhancing Block Cimmino for Sparse Linear Systems with Dense Columns via Schur Complement (Q5889340) (← links)
- Generalizing Geometric Graphs (Q5895515) (← links)
- Computational Science and Its Applications – ICCSA 2004 (Q5901243) (← links)
- Heuristic spectral techniques for the reduction of bandwidth and work-bound of sparse matrices (Q5959245) (← links)
- Towards a tighter coupling of bottom-up and top-down sparse matrix ordering methods (Q5960916) (← links)
- A semismooth Newton-CG based dual PPA for matrix spectral norm approximation problems (Q5962724) (← links)
- On short recurrence Krylov type methods for linear systems with many right-hand sides (Q5964591) (← links)
- A new deflated block GCROT(\(m,k\)) method for the solution of linear systems with multiple right-hand sides (Q5964601) (← links)
