Remote Access Mathematics of Computation
Green Open Access

Mathematics of Computation

ISSN 1088-6842(online) ISSN 0025-5718(print)



Implicit schemes and $LU$ decompositions

Authors: A. Jameson and E. Turkel
Journal: Math. Comp. 37 (1981), 385-397
MSC: Primary 65M10; Secondary 65F05
MathSciNet review: 628702
Full-text PDF Free Access

Abstract | References | Similar Articles | Additional Information

Abstract: Implicit methods for hyperbolic equations are analyzed by constructing LU factorizations. It is shown that the solution of the resulting tridiagonal systems in one dimension is well conditioned if and only if the LU factors are diagonally dominant. Stable implicit methods that have diagonally dominant factors are constructed for hyperbolic equations in n space dimensions. Only two factors are required even in three space dimensions. Acceleration to a steady state is analyzed. When the multidimensional backward Euler method is used with large time steps, it is shown that the scheme approximates a Newton-Raphson iteration procedure.

References [Enhancements On Off] (What's this?)

Similar Articles

Retrieve articles in Mathematics of Computation with MSC: 65M10, 65F05

Retrieve articles in all journals with MSC: 65M10, 65F05

Additional Information

Article copyright: © Copyright 1981 American Mathematical Society