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.











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)