Rishad Islam Shanto

Rishad Islam Shanto

Auto-generated profile, based on publicly available information

Rishad Islam Shanto

Lehigh University Bethlehem Pennsylvania USA

Research Focus & Metrics

Academic Career Length

4Years (2023-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
23 June 2023
Verified
Conference Paper
Open access
TDTal Derei
Tal Derei
BABenjamin Aulenbach
Benjamin Aulenbach
VCVictor Carolino
Victor Carolino
CGCaleb Geren
Caleb Geren
MKMichael Kaufman
Michael Kaufman
HKHenry F. Korth
Henry F. Korth
Zero-Knowledge proofs are a cryptographic technique to reveal knowledge of information without revealing the information itself, thus enabling systems optimally to mix privacy and transparency, and, where needed, regulatability. Application domains include health and other enterprise data, financial systems such as central-bank digital currencies, and performance enhancement in blockchain systems. The challenge of zero-knowledge proofs is that, although they are computationally easy to verify, they are computationally hard to produce. This paper examines the scalability limits of leading zero-knowledge algorithms and addresses the use of parallel architectures to meet performance demands of applications.

18 November 2024 in Proceedings in Applied Mathematics and Mechanics
Verified
Journal Article
Open access
RIRishad Islam
Rishad Islam
ACArielle Carr
Arielle Carr
CJColin Jacobs
Colin Jacobs
Generally, discretization of partial differential equations (PDEs) creates a sequence of linear systems with well‐known and structured sparsity patterns. Preconditioners are often necessary to achieve fast convergence when solving these linear systems using iterative solvers. We can use preconditioner updates for closely related systems instead of computing a preconditioner for each system from scratch. One such preconditioner update is the sparse approximate map (SAM), which is based on the sparse approximate inverse preconditioner using a least squares approximation. A SAM then acts as a map from one matrix in the sequence to another nearby one for which we have an effective preconditioner. To efficiently compute an effective SAM update (i.e., one that facilitates fast convergence of the iterative solver), we seek to compute an optimal sparsity pattern. In this paper, we examine several sparsity patterns for computing the SAM update to characterize optimal or near‐optimal sparsity patterns for linear systems arising from discretized PDEs.