Rishad Islam Shanto
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Rishad Islam Shanto has a total of 9 co-authors. Here are the top co-authors by number of shared publications:
- Arielle Carr
Computer Science and Engineering Department, Lehigh University, Bethlehem, United States
1 shared publication - Benjamin Aulenbach
Macguyver Tech, USA
1 shared publication - Caleb Geren
Dept. of Computer Science and Eng., Lehigh University, USA
1 shared publication Colin Jacobs
Lehigh University Bethlehem Pennsylvania USA
1 shared publication- Henry F. Korth
Lehigh University, USA
1 shared publication - Jonathan Klein
Dept. of Computer Science and Eng., Lehigh University, USA
1 shared publication
Latest Publications
- Open Access
- 18 November 2024
- Published by Wiley in Proceedings in Applied Mathematics and Mechanics
- Vol. 24 (4)
Optimization of approximate maps for linear systems arising in discretized PDEs
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.
- 18 November 2024
- Published by Wiley in Proceedings in Applied Mathematics and Mechanics
- Vol. 24 (4)
Open AccessOptimization of approximate maps for linear systems arising in discretized PDEs
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.
- Open Access
- 23 June 2023
- Published by Association for Computing Machinery (ACM)
- p. 1-9
Scaling Zero-Knowledge to Verifiable Databases
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.
- 23 June 2023
- Published by Association for Computing Machinery (ACM)
- p. 1-9
Open AccessScaling Zero-Knowledge to Verifiable Databases
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.