Arielle Carr

Arielle Carr

Auto-generated profile, based on publicly available information

Arielle Carr

Computer Science and Engineering Department, Lehigh University, Bethlehem, United States

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
14 January 2025 in ACM Transactions on Quantum Computing
Verified
Journal Article
Open access
mohammadhossein mohammadisiahroudimohammadhossein mohammadisiahroudi
mohammadhossein mohammadisiahroudi
ZWZeguan Wu
Zeguan Wu
BABrandon Augustino
Brandon Augustino
ACArielle Carr
Arielle Carr
Tamás Sándor TerlakyTamás Sándor Terlaky
Tamás Sándor Terlaky
Quantum linear system algorithms (QLSAs) have the potential to speed up Interior Point Methods (IPMs). However, a major bottleneck is the inexactness of quantum tomography to extract classical solutions from quantum states. In addition, QLSAs are sensitive to the condition number, and this sensitivity is exacerbated when the Newton systems arising in IPMs converge to a singular matrix. Recently, an Inexact Feasible Quantum IPM (IF-QIPM) has been developed that addresses the inexactness of QLSAs. However, this method requires a large number of gates and qubits to be implemented. Here, we propose a new IF-QIPM using the normal equation system, which requires fewer gates and qubits. To mitigate the sensitivity to the condition number and other input data-related parameters, we use preconditioning coupled with iterative refinement to obtain better complexity. Finally, we demonstrate the effectiveness of our approach on IBM Qiskit simulators.

28 December 2023 in International Journal for Numerical Methods in Fluids
Verified
Journal Article
Closed access
Stephen Senior Applied Mathematics Researcher ThomasStephen Senior Applied Mathematics Researcher Thomas
Stephen Senior Applied Mathematics Researcher Thomas
ACArielle Carr
Arielle Carr
PMPaul Mullowney
Paul Mullowney
KŚKatarzyna Świrydowicz
Katarzyna Świrydowicz
MDMarcus Day
Marcus Day

15 December 2023
Verified
Conference Paper
Open access
AGAinara Garcia
Ainara Garcia
SXSihong Xie
Sihong Xie
ACArielle Carr
Arielle Carr
Sequences of linear systems arise in the predictor-corrector method when computing the Pareto front for multi-objective optimization. Rather than discarding information generated when solving one system, it may be advantageous to recycle information for subsequent systems. To accomplish this, we seek to reduce the overall cost of computation when solving linear systems using common recycling methods. In this work, we assessed the performance of recycling minimum residual (RMIN-RES) method along with a map between coefficient matrices. For these methods to be fully integrated into the software used in Enouen et al. (2022), there must be working version of each in both Python and PyTorch. Herein, we discuss the challenges we encountered and solutions undertaken (and some ongoing) when computing efficient Python implementations of these recycling strategies. The goal of this project was to implement RMINRES in Python and PyTorch and add it to the established Pareto front code to reduce computational cost. Additionally, we wanted to implement the sparse approximate maps code in Python and PyTorch, so that it can be parallelized in future work.

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.

20 March 2023 in arXiv
Verified
Preprint
Open access
PDF file
STStephen Thomas
Stephen Thomas
ECErin Carson
Erin Carson
MRMiro Rozložník
Miro Rozložník
ACArielle Carr
Arielle Carr
KŚKasia Świrydowicz
Kasia Świrydowicz
The GMRES algorithm of Saad and Schultz (1986) is an iterative method for approximately solving linear systems $A{\bf x}={\bf b}$, with initial guess ${\bf x}_0$ and residual ${\bf r}_0 = {\bf b} - A{\bf x}_0$. The algorithm employs the Arnoldi process to generate the Krylov basis vectors (the columns of $V_k$). It is well known that this process can be viewed as a $QR$ factorization of the matrix $B_k = [\: {\bf r}_0, AV_k\:]$ at each iteration. Despite an ${O}(\epsilon)\kappa(B_k)$ loss of orthogonality, for unit roundoff $\epsilon$ and condition number $\kappa$, the modified Gram-Schmidt formulation was shown to be backward stable in the seminal paper by Paige et al. (2006). We present an iterated Gauss-Seidel formulation of the GMRES algorithm (IGS-GMRES) based on the ideas of Ruhe (1983) and \'{S}wirydowicz et al. (2020). IGS-GMRES maintains orthogonality to the level ${O}(\epsilon)\kappa(B_k)$ or ${O}(\epsilon)$, depending on the choice of one or two iterations; for two Gauss-Seidel iterations, the computed Krylov basis vectors remain orthogonal to working precision and the smallest singular value of $V_k$ remains close to one. The resulting GMRES method is thus backward stable. We show that IGS-GMRES can be implemented with only a single synchronization point per iteration, making it relevant to large-scale parallel computing environments. We also demonstrate that, unlike MGS-GMRES, in IGS-GMRES the relative Arnoldi residual corresponding to the computed approximate solution no longer stagnates above machine precision even for highly non-normal systems.