|
|
Zhurnal Vychislitel'noi Matematiki i Matematicheskoi Fiziki, 1990, Volume 30, Number 3, Pages 420–429
(Mi zvmmf3295)
|
|
|
|
This article is cited in 3 scientific papers (total in 3 papers)
Programming a generalized cholesky algorithm for mixed discrete analogues of elliptic boundary-value problems
A. A. Kobozeva, L. V. Maslovskaya Odessa
Abstract:
An approach to the programming of a new algorithm involving a certain numbering of the unknowns is proposed, the use of which does not require permutation of rows and columns of the system to ensure stability of the solution algorithm. A method is proposed for solving the corresponding system of linear algebraic equations, whose matrix is not positive-definite but is of a special form.
Received: 30.10.1988 Revised: 10.08.1989
Citation:
A. A. Kobozeva, L. V. Maslovskaya, “Programming a generalized cholesky algorithm for mixed discrete analogues of elliptic boundary-value problems”, Zh. Vychisl. Mat. Mat. Fiz., 30:3 (1990), 420–429; U.S.S.R. Comput. Math. Math. Phys., 30:2 (1990), 56–62
Linking options:
https://www.mathnet.ru/eng/zvmmf3295 https://www.mathnet.ru/eng/zvmmf/v30/i3/p420
|
|