01113nam 2200325 n 450 99638864870331620221108044806.0(CKB)1000000000635064(EEBO)2248496099(UnM)99826640(UnM)9927909700971(EXLCZ)99100000000063506419941220d1677 uy |engurbn||||a|bb|The orders of vestry[electronic resource] made and agreed unto in the year of our Lord 1677. of the rates payable for burials by the inhabitants in the parish of St. Buttolph without Aldgate, LondonLondon printed by J. How, for William Sheepey, at the Bible and Crown in the Minories[1677]1 sheet ([1] pReproduction of the original in the British Library.eebo-0018BurialEnglandEarly works to 1800BurialCu-RivESCu-RivESCStRLINWaOLNBOOK996388648703316The orders of vestry2352968UNISA04034nam 22005295 450 991086318170332120251113203954.09783030552510303055251910.1007/978-3-030-55251-0(CKB)4100000011479498(DE-He213)978-3-030-55251-0(MiAaPQ)EBC6362812(PPN)255204035(MiAaPQ)EBC6362691(EXLCZ)99410000001147949820201002d2020 u| 0engurnn|008mamaatxtrdacontentcrdamediacrrdacarrierKrylov Methods for Nonsymmetric Linear Systems From Theory to Computations /by Gérard Meurant, Jurjen Duintjer Tebbens1st ed. 2020.Cham :Springer International Publishing :Imprint: Springer,2020.1 online resource (XIV, 686 p. 184 illus.) Springer Series in Computational Mathematics,2198-3712 ;579783030552503 3030552500 Includes bibliographical references and index.1. Notation, definitions and tools -- 2. Q-OR and Q-MR methods -- 3. Bases for Krylov subspaces -- 4. FOM/GMRES and variants -- 5. Methods equivalent to FOM or GMRES- 6. Hessenberg/CMRH -- 7. BiCG/QMR and Lanczos algorithms -- 8. Transpose-free Lanczos methods -- 9. The IDR family -- 10. Restart, deflation and truncation -- 11. Related topics -- 12. Numerical comparison of methods -- A. Test matrices and short biographical notices -- References -- Index.This book aims to give an encyclopedic overview of the state-of-the-art of Krylov subspace iterative methods for solving nonsymmetric systems of algebraic linear equations and to study their mathematical properties. Solving systems of algebraic linear equations is among the most frequent problems in scientific computing; it is used in many disciplines such as physics, engineering, chemistry, biology, and several others. Krylov methods have progressively emerged as the iterative methods with the highest efficiency while being very robust for solving large linear systems; they may be expected to remain so, independent of progress in modern computer-related fields such as parallel and high performance computing.The mathematical properties of the methods are described and analyzed along with their behavior in finite precision arithmetic. A number of numerical examples demonstrate the properties and the behavior of the described methods. Also considered are the methods’ implementations and coding as Matlab®-like functions. Methods which became popular recently are considered in the general framework of Q-OR (quasi-orthogonal )/Q-MR (quasi-minimum) residual methods. This book can be useful for both practitioners and for readers who are more interested in theory. Together with a review of the state-of-the-art, it presents a number of recent theoretical results of the authors, some of them unpublished, as well as a few original algorithms. Some of the derived formulas might be useful for the design of possible new methods or for future analysis. For the more applied user, the book gives an up-to-date overview of the majority of the available Krylov methods for nonsymmetric linear systems, including well-known convergence properties and, as we said above, template codes that can serve as the base for more individualized and elaborate implementations.Springer Series in Computational Mathematics,2198-3712 ;57Numerical analysisNumerical AnalysisNumerical analysis.Numerical Analysis.512.5Meurant Gérard A.431205Duintjer Tebbens JurjenMiAaPQMiAaPQMiAaPQBOOK9910863181703321Krylov methods for nonsymmetric linear systems2287946UNINA