Geodesic
Tree organization of the data structure for Cholesky factorization
Žurnal vyčislitelʹnoj matematiki i matematičeskoj fiziki, Tome 34 (1994) no. 12, pp. 1747-1756 Cet article a éte moissonné depuis la source Math-Net.Ru

Voir la notice de l'article

@article{ZVMMF_1994_34_12_a0,
     author = {V. P. Il'in and V. I. Karnachuk and M. R. Larin},
     title = {Tree organization of the data structure for {Cholesky} factorization},
     journal = {\v{Z}urnal vy\v{c}islitelʹnoj matematiki i matemati\v{c}eskoj fiziki},
     pages = {1747--1756},
     year = {1994},
     volume = {34},
     number = {12},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/ZVMMF_1994_34_12_a0/}
}
TY  - JOUR
AU  - V. P. Il'in
AU  - V. I. Karnachuk
AU  - M. R. Larin
TI  - Tree organization of the data structure for Cholesky factorization
JO  - Žurnal vyčislitelʹnoj matematiki i matematičeskoj fiziki
PY  - 1994
SP  - 1747
EP  - 1756
VL  - 34
IS  - 12
UR  - http://geodesic.mathdoc.fr/item/ZVMMF_1994_34_12_a0/
LA  - ru
ID  - ZVMMF_1994_34_12_a0
ER  - 
%0 Journal Article
%A V. P. Il'in
%A V. I. Karnachuk
%A M. R. Larin
%T Tree organization of the data structure for Cholesky factorization
%J Žurnal vyčislitelʹnoj matematiki i matematičeskoj fiziki
%D 1994
%P 1747-1756
%V 34
%N 12
%U http://geodesic.mathdoc.fr/item/ZVMMF_1994_34_12_a0/
%G ru
%F ZVMMF_1994_34_12_a0
V. P. Il'in; V. I. Karnachuk; M. R. Larin. Tree organization of the data structure for Cholesky factorization. Žurnal vyčislitelʹnoj matematiki i matematičeskoj fiziki, Tome 34 (1994) no. 12, pp. 1747-1756. http://geodesic.mathdoc.fr/item/ZVMMF_1994_34_12_a0/

[1] George A. J., “Nested dissection of a regular finite element mesh”, SIAM J. Numer. Analys., 10:2 (1973), 345–363 | DOI | MR | Zbl

[2] Dzhordzh A., Lyu Dzh., Chislennoe reshenie bolshikh razrezhennykh sistem uravnenii, Mir, M., 1984 | MR

[3] Karnachuk V. I., Larin M. R., “Programmnaya realizatsiya metoda, vlozhennykh sechenii”, Vychisl. eksperiment v zadachakh matem. fiz., VTs SO AN CCCP, Novosibirsk, 1991, 123–132 | MR

[4] Pissanetski S., Tekhnologiya razrezhennykh matrits, Mir, M., 1988 | MR

[5] Yannakakis M., “Computing the minimum fill-in is NP-complete”, SIAM J. Alg. Discrete Methods, 2 (1981), 77–79 | DOI | MR | Zbl

[6] Duff I. S., Erisman A. M., Reid J. K., “On George's nested dissection method”, SIAM J. Numer. Analys., 13:5 (1976), 686–695 | DOI | MR | Zbl

[7] Ortega Dzh., Vvedenie v parallelnye i vektornye metody resheniya lineinykh sistem, Mir, M., 1991 | MR

[8] Liu J. W. H., “The multifrontal method and paging in sparse Cholesky factorization”, ACM Trans. Math. Software, 15:4 (1989), 310–325 | DOI | Zbl

[9] Samet H., “The quadtree and related hierarchical data structures”, Computing Surveys, 16:2 (1984), 187–260 | DOI | MR

[10] Evstigneev V. A., Kasyanov V. N., Algoritmy na derevyakh, VTs SO AN SSSR, Novosibirsk, 1989 | MR

[11] Liu J. W., “A compact row storage scheme for Cholesky factors using elimination trees”, ACM Trans. Math. Software, 12:2 (1986), 127–148 | DOI | MR | Zbl