Parallel and Fully Recursive
Multifrontal Supernodal Sparse Cholesky
Irony, D.; Shklarski, G.; Toledo, S.
Lecture Notes in Computer Science, 2002, no. 2330, pp. 335-344,
Ingenta.
Two Ways to Extend the
Cholesky Decomposition to Block Matrices with Interval Entries
Schaefer, U.
Reliable Computing, 2002, vol. 8, no. 1, pp. 1-20,
Ingenta.
A Recursive Formulation of
Cholesky Factorization of a Matrix in Packed Storage
Andersen, B. S.; Wasniewski, J.; Gustavson, F. G.
ACM Transactions on Mathematical Software, 2001, vol. 27, no. 2,
pp. 214-244, Ingenta.
Multiple-rank modifications of
a sparse Cholesky factorization.
Davis, Timothy A.; Hager, William W.
SIAM J. Matrix Anal. Appl. 22 (2001), no. 4, 997--1013
(electronic), MathSciNet.
Minimal-storage
high-performance Cholesky factorization via blocking and
recursion
Gustavson, F. G.; Jonsson, I.
IBM Journal of Research and Development, 2000, vol. 44, no. 6, pp.
823-890, Ingenta.
Fast Cholesky Factorization
Algorithm for Symmetric Indefinite Block-Toeplitz Matrices and the
Inverse Matrices
Wang, W.; Zhong, J.-p.; Zheng, H.-r.
Journal- Wuhan University Natural Sciences Edition, 2000, vol. 46,
no. 5, pp. 535-538, Ingenta.
Cholesky decomposition of a
hyper inverse Wishart matrix.
Roverato, A.
Biometrika, 2000, vol. 87, no. 1, pp. 99,
Ingenta.
Efficient Methods for
Out-of-Core Sparse Cholesky Factorization.
Rothberg, Edward; Schreiber, Robert
Siam Journal on Scientific Computing, 2000, vol. 21, no. 1, pp.
129, Ingenta.
A revised modified Cholesky
factorization algorithm.
Schnabel, Robert B.; Eskow, Elizabeth
Dedicated to John E. Dennis, Jr., on his 60th birthday. SIAM J.
Optim. 9 (1999), no. 4, 1135--1148 (electronic),
MathSciNet.
Modifying a sparse Cholesky
factorization.
Davis, Timothy A.; Hager, William W.
SIAM J. Matrix Anal. Appl. 20 (1999), no. 3, 606--627
(electronic), MathSciNet.
Efficient methods for
out-of-core sparse Cholesky factorization.
Rothberg, Edward; Schreiber, Robert
SIAM J. Sci. Comput. 21 (1999), no. 1, 129--144 (electronic),
MathSciNet.
Performance of greedy ordering
heuristics for sparse Cholesky factorization.
Ng, Esmond G.; Raghavan, Padma
Sparse and structured matrices and their applications (Coeur
d'Alene, ID, 1996).
SIAM J. Matrix Anal. Appl. 20 (1999), no. 4, 902--914
(electronic), MathSciNet.
A linear array for large
sparse matrix operations. I. Cholesky factorization.
Padmini, M. V.; Madan, B. B.; Jain, B. N.
Parallel Algorithms Appl. 13 (1999), no. 3, 187--215,
MathSciNet.
Modifying the Cholesky
factorization on MIMD distributed memory machines.
D'Apuzzo, Marco; De Simone, Valentina; Marino, Marina; Toraldo,
Gerardo
High performance algorithms and software in nonlinear optimization
(Ischia, 1997), 125--141, Appl. Optim., 24, Kluwer Acad. Publ.,
Dordrecht, 1998, MathSciNet.
Perturbation analyses for the
Cholesky factorization with backward rounding errors.
Chang, Xiao-Wen
Scientific computing (Hong Kong, 1997), 180--187, Springer,
Singapore, 1997, MathSciNet.
Efficient parallel
Gauss-Doolittle matrix triangulation.
Watkins, W. J.; Kennedy, D.; Williams, F. W.
Comput. & Structures 62 (1997), no. 1, 185--195,
MathSciNet.
A parallel algorithm for
solving large sparse linear systems of equations via Cholesky
factorization. (Chinese)
Wang, Si Qun; Wei, Zi Luan
J. Numer. Methods Comput. Appl. 17 (1996), no. 2, 104--111;
translation in
Chinese J. Numer. Math. Appl. 19 (1997), no. 1, 19--27,
MathSciNet.
A Fast Parallel Cholesky
Decomposition Algorithm for Tridiagonal Symmetric Matrices.
Bar-On, Ilan; Codenotti, Bruno; Leoncini, Mauro
SIAM journal on matrix analysis and applications, 1997, vol. 18,
no. 2, pp. 403, Ingenta.
Cholesky factorization of
semidefinite Toeplitz matrices.
Stewart, Michael
Proceedings of the Fifth Conference of the International Linear
Algebra Society (Atlanta, GA, 1995). Linear Algebra Appl. 254
(1997), 497--525, MathSciNet.
Parallel Cholesky
factorization with the processor farm application.
Molnar-Egert, Eva
Publ. Univ. Miskolc Ser. D Nat. Sci. Math. 36 (1996), no. 2,
97--104, MathSciNet.
New perturbation analyses for
the Cholesky factorization.
Chang, Xiao-Wen; Paige, Christopher C.; Stewart, G. W.
IMA J. Numer. Anal. 16 (1996), no. 4, 457--484,
MathSciNet.
On the stability of Cholesky
factorization for symmetric quasidefinite systems.
Gill, Philip E.; Saunders, Michael A.; Shinnerl, Joseph R.
SIAM J. Matrix Anal. Appl. 17 (1996), no. 1, 35--46,
MathSciNet.
Fast Accurate Eigenvalue
Computations Using the Cholesky Factorization.
Mathias, R.
Zeitschrift fur angewandte mathematik und mechanik, 1996, vol.
76supp1, pp. 303, Ingenta.
Fast Cholesky Factorization
for Interior Point Methods of Linear Programming.
Meszaros, C.
Computers & mathematics with applications, 1996, vol. 31, no.
4/5, pp. 49, Ingenta.
Design and Implementation of
the ScaLAPACK LU, QR, and Cholesky Factorization Routines.
Choi, J.; Dongarra, J.J.; Whaley, R.C.
Scientific programming, 1996, vol. 5, no. 3, pp. 173,
Ingenta.
Efficient sparse Cholesky
factorization on a massively parallel SIMD computer.
Manne, Fredrik; Hafsteinsson, Hjálmt'yr
SIAM J. Sci. Comput. 16 (1995), no. 4, 934--950,
MathSciNet.
An efficient algorithm to
compute row and column counts for sparse Cholesky
factorization.
Gilbert, John R.; Ng, Esmond G.; Peyton, Barry W.
SIAM J. Matrix Anal. Appl. 15 (1994), no. 4, 1075--1091,
MathSciNet.
A tree-like approach to the
organization of the structure of data for the Cholesky
factorization. (Russian)
Ilcprime in, V. P.; Karnachuk, V. I.; Larin, M. R.
Zh. Vychisl. Mat. i Mat. Fiz. 34 (1994), no. 12, 1747--1756;
translation in
Comput. Math. Math. Phys. 34 (1994), no. 12, 1503--1510 (1995),
MathSciNet.
The
Cholesky Decomposition of P - pp'
Richard William Farebrother
Journal of the Royal Statistical Society. Series B
(Methodological), Vol. 56, No. 4. (1994), p. 727,
Jstor.
Recurrent neural networks for
LU decomposition and Cholesky factorization.
Wang, J.; Wu, G.
Math. Comput. Modelling 18 (1993), no. 6, 1--8,
MathSciNet.
A supernodal Cholesky
factorization algorithm for shared-memory multiprocessors.
Ng, Esmond; Peyton, Barry W.
SIAM J. Sci. Comput. 14 (1993), no. 4, 761--769,
MathSciNet.
On the Perturbation of LU,
Cholesky, and QR Factorizations.
Stewart, G. W.
The Journal of supercomputing, 1993, vol. 14, no. 4, pp. 1141,
Ingenta.
Block-Cholesky for parallel
processing.
Louter-Nool, M.
Applied numerical mathematics, 1992, vol. 10, no. 1, pp. 37,
Ingenta.
The average parallel
complexity of Cholesky factorization.
Resta, G.
Comput. Math. Appl. 22 (1991), no. 9, 27--33,
MathSciNet.
Perturbation bounds for the
Cholesky and QR factorizations.
Sun, J.G.
BIT, 1991, no. 2, pp. 341, Ingenta.
A new modified Cholesky
factorization.
Schnabel, Robert B.; Eskow, Elizabeth
SIAM J. Sci. Statist. Comput. 11 (1990), no. 6, 1136--1158,
MathSciNet.
The Accuracy of Least Squares
Calculations with the Cholesky Algorithm.
Randall, J.H.; Rayner, A.A.
Linear algebra and its applications, 1990, vol. 127, pp. 463,
Ingenta.
A note on the parallel
Cholesky factorization of wide banded matrices.
Conroy, John M.
Parallel Comput. 10 (1989), no. 2, 239--246,
MathSciNet.
Cholesky decomposition of the
Hilbert matrix.
Hitotumatu, Sin
Japan J. Appl. Math. 5 (1988), no. 1, 135--144,
MathSciNet.
On Some
Determinant Inequalities and Cholesky
Factorization
Panos M. Pardalos
Mathematics Magazine: Volume 61, Number 3, (1988), Pages:
170-171.
Fast Gauss-Doolittle matrix
triangulation.
Williams, F. W.; Kennedy, D.
Comput. & Structures 28 (1988), no. 2, 143--148,
MathSciNet.
On the Cholesky Decomposition
of a Positive Semidefinite Symmetric Matrix.
Kabe, D.G.
Industrial mathematics, 1988, vol. 38p2, pp. 233,
Ingenta.
A note on rounding-error
analysis of Cholesky factorization.
Kielbasi'nski, Andrzej
Linear Algebra Appl. 88/89 (1987), 487--494,
MathSciNet.