activity
20092022
most citedExploiting Multiple Levels of Parallelism in Sparse Matrix-Matrix Multiplication

109 citations · 139 across the 14 of their papers we have counts for

collaborators
Showing math.NAShow all

8 papers · 1 filter

math.NA2022★ 1 cited

UltimateKalman: Flexible Kalman Filtering and Smoothing Using Orthogonal Transformations

Sivan Toledo

UltimateKalman is a flexible linear Kalman filter and smoother implemented in three popular programming languages: MATLAB, C, and Java. UltimateKalman is a slight simplification an…

math.NA2021

Lecture Notes on Support Preconditioning

Sivan Toledo

These are lectures notes on support preconditioning, originally written in 2007. The notes cover large sparse linear systems of equations, krylov subspace solvers for symmetric dia…

math.NA2016

High-Performance Algorithms for Computing the Sign Function of Triangular Matrices

Vadim Stotland, Oded Schwartz, Sivan Toledo

Algorithms and implementations for computing the sign function of a triangular matrix are fundamental building blocks in algorithms for computing the sign of arbitrary square real…

math.NA2015

Wilkinson's Inertia-Revealing Factorization and Its Application to Sparse Matrices

Alex Druinsky, Eyal Carlebach, Sivan Toledo

We propose a new inertia-revealing factorization for sparse symmetric matrices. The factorization scheme and the method for extracting the inertia from it were proposed in the 1960…

math.NA2013

Spectral Condition-Number Estimation of Large Sparse Matrices

Haim Avron, Alex Druinsky, Sivan Toledo

We describe a randomized Krylov-subspace method for estimating the spectral condition number of a real matrix A or indicating that it is numerically rank deficient. The main diffic…

math.NA2012★ 3 cited

How Accurate is inv(A)*b?

Alex Druinsky, Sivan Toledo

Several widely-used textbooks lead the reader to believe that solving a linear system of equations Ax = b by multiplying the vector b by a computed inverse inv(A) is inaccurate. Vi…

math.NA2011★ 9 cited

Effective Stiffness: Generalizing Effective Resistance Sampling to Finite Element Matrices

Haim Avron, Sivan Toledo

We define the notion of effective stiffness and show that it can used to build sparsifiers, algorithms that sparsify linear systems arising from finite-element discretizations of P…

math.NA2009★ 2 cited

On Element SDD Approximability

Haim Avron, Gil Shklarski, Sivan Toledo

This short communication shows that in some cases scalar elliptic finite element matrices cannot be approximated well by an SDD matrix. We also give a theoretical analysis of a sim…