00791nam0-22002651i-450-990001142410403321000114241FED01000114241(Aleph)000114241FED0100011424120000920d1972----km-y0itay50------baengFixed points and topological degree in nonlinear analysisby CroninProvidence (RI)American Mathematical Society1972XII+198cm 18Mathematical surveys11Cronin,Jane41632ITUNINARICAUNIMARCBK990001142410403321C-46-(116390MA1MA1Fixed points and topological degree in nonlinear analysis344093UNINAING0103675nam 22006375 450 991096461820332120250811094756.09781475722727147572272910.1007/978-1-4757-2272-7(CKB)2660000000024209(SSID)ssj0001297242(PQKBManifestationID)11766177(PQKBTitleCode)TC0001297242(PQKBWorkID)11354710(PQKB)11535601(DE-He213)978-1-4757-2272-7(MiAaPQ)EBC3084190(PPN)238008606(EXLCZ)99266000000002420920130125d1993 u| 0engurnn#008mamaatxtccrIntroduction to Numerical Analysis /by J. Stoer, R. Bulirsch2nd ed. 1993.New York, NY :Springer New York :Imprint: Springer,1993.1 online resource (XIII, 660 p.)Texts in Applied Mathematics,2196-9949 ;12Bibliographic Level Mode of Issuance: Monograph9780387978789 038797878X 9781475722741 1475722745 Includes bibliographical references and index.1 Error Analysis -- 2 Interpolation -- 3 Topics in Integration -- 4 Systems of Linear Equations -- 5 Finding Zeros and Minimum Points by Iterative Methods -- 6 Eigenvalue Problems -- 7 Ordinary Differential Equations -- 8 Iterative Methods for the Solution of Large Systems of Linear Equations. Some Further Methods -- General Literature on Numerical Methods.On the occasion of this new edition, the text was enlarged by several new sections. Two sections on B-splines and their computation were added to the chapter on spline functions: Due to their special properties, their flexibility, and the availability of well-tested programs for their computation, B-splines play an important role in many applications. Also, the authors followed suggestions by many readers to supplement the chapter on elimination methods with a section dealing with the solution of large sparse systems of linear equations. Even though such systems are usually solved by iterative methods, the realm of elimination methods has been widely extended due to powerful techniques for handling sparse matrices. We will explain some of these techniques in connection with the Cholesky algorithm for solving positive definite linear systems. The chapter on eigenvalue problems was enlarged by a section on the Lanczos algorithm; the sections on the LR and QR algorithm were rewritten and now contain a description of implicit shift techniques. In order to some extent take into account the progress in the area of ordinary differential equations, a new section on implicit differential equa­ tions and differential-algebraic systems was added, and the section on stiff differential equations was updated by describing further methods to solve such equations.Texts in Applied Mathematics,2196-9949 ;12Numerical analysisNumerical AnalysisNumerical analysis.Numerical Analysis.51851865-01mscStoer Josefauthttp://id.loc.gov/vocabulary/relators/aut12949Bulirsch Rolandauthttp://id.loc.gov/vocabulary/relators/autMiAaPQMiAaPQMiAaPQBOOK9910964618203321Introduction to numerical analysis1501478UNINA