Preconditioning linearized equations
This note deals with the problem of numerically finding a root of a function \(f:X\to {\mathbb{R}}^n\) with some interval \(X \subset {\mathbb{R}}^n\). In particular, this note compares the following possibilities: (1) Usually, one first linearizes the equation and the preconditions of the resulting linear equation. (2) Alternatively, one can first precondition the original nonlinear equation. The author shows that the second possibility is better. In particular, it is claimed that the suggested procedure generally produces more rapid convergence. However, the computational effort is comparable.
- scientific article; zbMATH DE number 3649911 (Why is no real title available?)
- scientific article; zbMATH DE number 3936378 (Why is no real title available?)
- scientific article; zbMATH DE number 54095 (Why is no real title available?)
- Interval Arithmetic in Matrix Computations, Part II
- Interval Methods for Systems of Equations
- Preconditioners for the Interval Gauss–Seidel Method
- Linear processing with pregroups
- Verified determination of singularities in chemical processes
- scientific article; zbMATH DE number 845652 (Why is no real title available?)
- Preconditioned linear solves for parametric model order reduction
- On the Origins of Linear and Non-linear Preconditioning
- Solving interval constraints by linearization in computer-aided design
- Linear systems with large uncertainties, with applications to truss structures
This page was built for publication: Preconditioning linearized equations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q678117)
