Numerical linear algebra and its applications (Q2901229)
From MaRDI portal
| This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Numerical linear algebra and its applications |
scientific article; zbMATH DE number 6058194
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Numerical linear algebra and its applications |
scientific article; zbMATH DE number 6058194 |
Statements
18 July 2012
0 references
numerical linear algebra
0 references
direct methods
0 references
perturbation analysis
0 references
error analysis
0 references
least squares problems
0 references
iterative methods
0 references
eigenvalue problems
0 references
initial value problems
0 references
boundary value methods
0 references
preconditioning
0 references
LU factorisation
0 references
pivoting
0 references
Cholesky factorisation
0 references
algorithms
0 references
QR factorisation
0 references
Krylov subspace methods
0 references
Jacobi, Gauss-Seidel, and SOR methods
0 references
convergence
0 references
steepest descent method
0 references
conjugate gradient method
0 references
generalised minimum residual method
0 references
circulant matrices
0 references
Jacobi, bisection, and divide-and-conquer methods
0 references
Numerical linear algebra and its applications (English)
0 references
The book provides a concise introduction to numerical linear algebra with applications to solving initial value problems using boundary value methods and their preconditioning.NEWLINENEWLINEThe motivating introduction in Chapter 1 is followed by the overview of basic direct methods (LU factorisation with pivoting and Cholesky factorisation) for solving nonsingular systems of linear algebraic equations in Chapter 2.NEWLINENEWLINEChapter 3 is devoted to the elements of perturbation and error analysis of numerical algorithms in finite precision arithmetic. Particular attention is payed to the perturbation analysis of linear algebraic systems, the model of finite precision arithmetic, and the application to the backward error analysis of LU factorisation.NEWLINENEWLINEIn Chapter 4 the authors address direct solution methods for linear least squares problems based on QR factorisation.NEWLINENEWLINEIterative methods for solving linear systems are discussed in Chapters 5 and 6 devoted, respectively, to classical and Krylov subspace methods. Chapter 5 covers the basic iterative methods including the Jacobi, Gauss-Seidel, and SOR methods together with their convergence analysis. In Chapter 6 the authors consider the steepest descent method and two globally optimal Krylov subspace methods: namely, the conjugate gradient method for solving symmetric positive definite systems and the generalised minimum residual method for general ones. Preconditioning methods are discussed as well: the basic methods based on (block) diagonal splitting and incomplete factorisations including preconditioners for circulant matrices.NEWLINENEWLINEChapters 7 and 8 contain elements of solving nonsymmetric and symmetric eigenvalue problems. The authors describe some popular methods, in particular, the power and QR methods for general problems, and the Jacobi, bisection, and divide-and-conquer methods for symmetric ones.NEWLINENEWLINEChapter 9 is devoted to applications of methods of numerical linear algebra for solving initial value problems by boundary value methods. Particular attention is payed to the choice of the preconditioner for various types of ordinary differential equations.
0 references