Tell us what's wrong and we'll take a look.
Thanks – we got it. We'll review and follow up if needed.
Large sparse linear systems of equations are ubiquitous in science, engineering and beyond. This open access monograph focuses on factorization algorithms for solving such systems. It presents classical techniques for complete factorizations that are used in sparse direct methods and discusses the computation of approximate direct and inverse factorizations that are key to constructing general-purpose algebraic preconditioners for iterative solvers. A unified framework is used that emphasizes the underlying sparsity structures and highlights the importance of understanding sparse direct methods when developing algebraic preconditioners. Theoretical results are complemented by sparse matrix algorithm outlines.
This monograph is aimed at students of applied mathematics and scientific computing, as well as computational scientists and software developers who are interested in understanding the theory and algorithms needed to tackle sparse systems. It is assumed that the reader has completed a basic course in linear algebra and numerical mathematics.
Jennifer Scott is a member of the Yakama Band of Indians, with connections to the Confederated Tribes of The Umatilla Reservation. She holds a BA in Tribal Governance from The Evergreen State College, as well as an AA in Early Childhood education from Olympic College. Jennifer works with veterans as a case manager at a Veteran Tiny Home Village. She also enjoys creating regalia, jewelry, and baby boards in her free time. Jennifer currently resides in Washington state.
Readwise Books is an ebook & audiobook platform that automatically logs how much you and your friends read, making it fun and easy to read more. Learn more →
Enter your email to continue. We'll create your account if you're new here.