On the block implicit LU algorithm for linear systems of equations
From MaRDI portal
The author considers various implementations of the block version of the implicit LU algorithm of the ABS class and describes their computational and memory requirements. The results of numerical experiments indicate that the scalar version of the algorithm yields the best precision of the solution. The reviewer misses comparison with the other finite algorithms.
Recommendations
- The implicit LX method of the ABS class
- scientific article; zbMATH DE number 1163763
- scientific article; zbMATH DE number 18290
- A generalization of the implicit LU algorithm to an arbitrary initial matrix
- Parallel ABS projection methods for linear and nonlinear systems with block arrowhead structure
Cited in
(3)
This page was built for publication: On the block implicit LU algorithm for linear systems of equations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2770610)