Behrooz Zarebavani
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Behrooz Zarebavani has a total of 12 co-authors. Here are the top co-authors by number of shared publications:
- Maryam Mehri Dehnavi
University of Toronto, Toronto, ON, Canada and NVIDIA, Seattle, USA
2 shared publications - Ahmed H. Mahmoud
Massachusetts Institute of Technology (MIT), Cambridge, MA, USA
1 shared publication - Ana Dodik
MIT CSAIL, Cambridge, MA, USA
1 shared publication - Changcheng Yuan
Texas A&M University, College Station, TX, USA
1 shared publication - Danny M. Kaufman
Adobe Research, Seattle, USA
1 shared publication - David I. W. Levin
University of Toronto, Toronto, Ontario, Canada
1 shared publication
Latest Publications
- Open Access
- 19 July 2026
- Published by Association for Computing Machinery (ACM)
- p. 1-11
Fast Sparse Matrix Permutation for Mesh-Based Direct Solvers
- 19 July 2026
- Published by Association for Computing Machinery (ACM)
- p. 1-11
Open AccessFast Sparse Matrix Permutation for Mesh-Based Direct Solvers
- Open Access
- 27 July 2025
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Graphics
- Vol. 44 (4) , 1-17
Adaptive Algebraic Reuse of Reordering in Cholesky Factorizations with Dynamic Sparsity Patterns
We introduce Parth, a fill-reducing ordering method for sparse Cholesky solvers with dynamic sparsity patterns (e.g., in physics simulations with contact or geometry processing with local remeshing). Parth facilitates the selective reuse of fill-reducing orderings when sparsity patterns exhibit temporal coherence, avoiding full symbolic analysis by localizing the effect of dynamic sparsity changes on the ordering vector. We evaluated Parth on over 175,000 linear systems collected from both physics simulations and geometry processing applications, and show that for some of the most challenging physics simulations, it achieves up to 14x reordering runtime speedup, resulting in a 2x speedup in Cholesky solve time—even on top of well-optimized solvers such as Apple Accelerate and Intel MKL.
- 27 July 2025
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Graphics
- Vol. 44 (4) , 1-17
Open AccessAdaptive Algebraic Reuse of Reordering in Cholesky Factorizations with Dynamic Sparsity Patterns
We introduce Parth, a fill-reducing ordering method for sparse Cholesky solvers with dynamic sparsity patterns (e.g., in physics simulations with contact or geometry processing with local remeshing). Parth facilitates the selective reuse of fill-reducing orderings when sparsity patterns exhibit temporal coherence, avoiding full symbolic analysis by localizing the effect of dynamic sparsity changes on the ordering vector. We evaluated Parth on over 175,000 linear systems collected from both physics simulations and geometry processing applications, and show that for some of the most challenging physics simulations, it achieves up to 14x reordering runtime speedup, resulting in a 2x speedup in Cholesky solve time—even on top of well-optimized solvers such as Apple Accelerate and Intel MKL.
- 3 September 2019
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Parallel and Distributed Systems
- Vol. 31 (3) , 530-542
cuPC: CUDA-Based Parallel PC Algorithm for Causal Structure Learning on GPU
- 3 September 2019
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Parallel and Distributed Systems
- Vol. 31 (3) , 530-542
cuPC: CUDA-Based Parallel PC Algorithm for Causal Structure Learning on GPU