6 citations · 9 across the 6 of their papers we have counts for
6 papers
Randomized Block Adaptive Linear System Solvers
Vivak Patel, Mohammad Jahangoshahi, Daniel Adrian Maldonado
Randomized linear solvers randomly compress and solve a linear system with compelling theoretical convergence rates and computational complexities. However, such solvers suffer a s…
Convergence of Adaptive, Randomized, Iterative Linear Solvers
Vivak Patel, Mohammad Jahangoshahi, Daniel Adrian Maldonado
Deterministic and randomized, row-action and column-action linear solvers have become increasingly popular owing to their simplicity, low computational and memory complexities, and…
An Implicit Representation and Iterative Solution of Randomly Sketched Linear Systems
Vivak Patel, Mohammad Jahangoshahi, Daniel Adrian Maldonado
Randomized linear system solvers have become popular as they have the potential to reduce floating point complexity while still achieving desirable convergence rates. One particula…
Multiple-paths in multiply connected domains
Mohammad Jahangoshahi, Gregory F. Lawler
We define multiple-paths Schramm-Loewner evolution () in multiply connected domains when and prove that in annuli, the partition function is smooth. Moreover, we g…
On the smoothness of the partition function for multiple Schramm-Loewner evolutions
Mohammad Jahangoshahi, Gregory F. Lawler
We consider the measure on multiple chordal Schramm-Loewner evolution () curves. We establish a derivative estimate and use it to give a direct proof that the partition func…
GROTESQUE: Noisy Group Testing (Quick and Efficient)
Sheng Cai, Mohammad Jahangoshahi, Mayank Bakshi +1
Group-testing refers to the problem of identifying (with high probability) a (small) subset of defectives from a (large) set of items via a "small" number of "pooled" tests…