Iterative Methods for Sparse Linear Systems
by Yousef Saad
Publisher: PWS 1996
The book gives an in-depth, up-to-date view of practical algorithms for solving large-scale linear systems of equations. These equations can number in the millions and are sparse in the sense that each involves only a small number of unknowns. The methods described are iterative, i.e., they provide sequences of approximations that will converge to the solution.
Home page url
Download or read it online for free here:
by Solomon I. Khmelnik, Inna S. Doubson - MiC
Hardware algorithms for computing of all elementary complex variable functions are proposed. Contents: A method 'digit-by-digit'; Decomposition; Compositions; Two-step-by-step operations; Taking the logarithm; Potentiation; and more.
by Bertrand Mercier - Tata Institute of Fundamental Research
Contents: Sobolev Spaces; Abstract Variational Problems and Examples; Conforming Finite Element Methods; Computation of the Solution of the Approximate Problem; Problems with an Incompressibility Constraint; Mixed Finite Element Methods; etc.
by N. V. Kopchenova, I. A. Maron
This is a manual on solving problems in computational mathematics. The book is intended primarily for engineering students, but may also prove useful for economics students, graduate engineers, and postgraduate students in the applied sciences.
by Ian Craw - University of Aberdeen
The overall aim of the course is to present modern computer programming techniques in the context of mathematical computation and numerical analysis and to foster the independence needed to use these techniques as appropriate in subsequent work.