The latter half of the book traces this stance's implications in the idea of "collusive resistance," with readings of Delarivier Manley's The New Atalantis in chapter 6; Manley's The Adventures of ...Rivella and The Perjur'd Beauty in relation to Behn's The Nun, Or The Perjur'd Beauty in chapter 7; Eliza Haywood's scandalous fiction in chapter 8; and Samuel Richardson's Pamela and Clarissa in the longest and richest chapter. In reasoning through the disturbing intersections between sexual and political argument, Force or Fraud joins recent books such as Melissa Sanchez's Erotic Subjects and Kathryn Schwarz's What You Will.1 In addition, Bowers contributes some- thing both new and valuable in her willingness to follow the faultlines of the gendered interrelations of collusion and resistance.
This thesis is based on recent work by Paige which gave a formalism for presenting and analyzing the class of algorithms which manipulate an appropriate Krylov subspace in solving large sparse ...systems of linear equations. This formalism--a way of dividing a method of solution into a Krylov process and an associated subproblem--is described and then applied to several of the more popular algorithms in use today including the methods of Conjugate Gradients and BiConjugate Gradients. The aim is to clarify these algorithms to make them easier to understand, analyze and use. Several of the methods presented in this thesis were developed in exactly this way--notably the Symmetric LQ method and the Generalized Minimum Residual method--and required little or no effort to characterize using the formalism. It was successfully applied to Conjugate Gradients and BiConjugate Gradients, already recognized as being closely related to the symmetric and unsymmetric Lanczos processes respectively. The newer algorithms such as Conjugate Gradients Squared and BiConjugate Gradients Stabilized, with less obvious relation to a specific Krylov process, provided more difficulty in their clarification.
This thesis is based on recent work by Paige which gave a formalism for presenting and analyzing the class of algorithms which manipulate an appropriate Krylov subspace in solving large sparse ...systems of linear equations. This formalism--a way of dividing a method of solution into a Krylov process and an associated subproblem--is described and then applied to several of the more popular algorithms in use today including the methods of Conjugate Gradients and BiConjugate Gradients. The aim is to clarify these algorithms to make them easier to understand, analyze and use. Several of the methods presented in this thesis were developed in exactly this way--notably the Symmetric LQ method and the Generalized Minimum Residual method--and required little or no effort to characterize using the formalism. It was successfully applied to Conjugate Gradients and BiConjugate Gradients, already recognized as being closely related to the symmetric and unsymmetric Lanczos processes respectively. The newer algorithms such as Conjugate Gradients Squared and BiConjugate Gradients Stabilized, with less obvious relation to a specific Krylov process, provided more difficulty in their clarification.
