School of Mathematical & Statistical Sciences Faculty Publications

Document Type

Article

Publication Date

10-2026

Abstract

Often, in solving large systems of differential equations using a time-stepping algorithm, one must solve multiple linear systems where the coefficient matrix is unchanged or shifted by a constant multiple of the identity. This can be computationally expensive when the coefficient matrix involved is very large. Where direct methods like Gaussian elimination are infeasible, iterative methods like GMRES are often used. It is especially useful when the matrices involved are sparse or allow for fast matrix multiplication algorithms. In this paper, we propose preconditioning strategies that glean information from previous runs of GMRES to build an effective preconditioner for subsequent solves in order to lessen the number of iterations required per step. We explore implementations of this preconditioning method both in serial and in parallel.

Comments

Undergraduate Student publication. 

Copyright © SIAM

The Author may post the final published version of the Work on the Author's personal web site and on the web server of the Author's institution, provided that proper notice of the Publisher's copyright is included and that no separate or additional fees are collected for access to or distribution of the work.

Publication Title

SIAM Undergraduate Research Online

DOI

10.1137/25S179350X

Included in

Mathematics Commons

Share

COinS
 
 

To view the content in your browser, please download Adobe Reader or, alternately,
you may Download the file to your hard drive.

NOTE: The latest versions of Adobe Reader do not support viewing PDF files within Firefox on Mac OS and if you are using a modern (Intel) Mac, there is no official plugin for viewing PDF files within the browser window.