The following pages link to Anshul Gupta (Q1630444):
Displaying 21 items.
- Buying optimal payoffs in bi-matrix games (Q1630445) (← links)
- Effective minimally-invasive GPU acceleration of distributed sparse matrix factorization (Q1693251) (← links)
- Solving Hermitian positive definite systems using indefinite incomplete factorizations (Q1936195) (← links)
- Sparse matrix factorization in the implicit finite element method on petascale architecture (Q2417574) (← links)
- A shared- and distributed-memory parallel general sparse direct solver (Q2642895) (← links)
- (Q2779397) (← links)
- Enhancing Performance and Robustness of ILU Preconditioners by Blocking and Selective Transposition (Q2968582) (← links)
- Revisiting Asynchronous Linear Solvers (Q3177757) (← links)
- Fast practical algorithms for the Boolean-product-witness-matrix problem (Q3454755) (← links)
- The design, implementation, and evaluation of a symmetric banded linear solver for distributed-memory parallel computers (Q4236187) (← links)
- (Q4375649) (← links)
- (Q4394583) (← links)
- Incentive Stackelberg Mean-Payoff Games (Q4571136) (← links)
- Improved Symbolic and Numerical Factorization Algorithms for Unsymmetric Sparse Matrices (Q4785789) (← links)
- (Q4860191) (← links)
- (Q4864234) (← links)
- (Q4895231) (← links)
- (Q4945811) (← links)
- (Q5013875) (← links)
- Recent advances in direct methods for solving unsymmetric sparse systems of linear equations (Q5461034) (← links)
- Multi-Function Multi-Way Analog Technology for Sustainable Machine Intelligence Computation (Q6518794) (← links)
