论文信息 - Parallel Solution of Sparse Problems by Using a Sequence of Large Dense Blocks

Parallel Solution of Sparse Problems by Using a Sequence of Large Dense Blocks

Linear least squares problems arise in many important fields of science and engineering (such as econometry, geodesy, statistics, structural analysis, fluid dynamics, etc.). Applications from all these fields are to be handled numerically in the solution of various models used in the development of new industrial products. At the National Environmental Research Institute (Denmark), linear least squares problems have been applied in the efforts to determine optimal values of some of the parameters involved in air pollution models.

Zahari Zlatev | Tzvetan Ostromsky | Stefano Salvini | Jerzy Wasniewski

[1] Zahari Zlatev,et al. Solving sparse linear least-squares problems on some supercomputers by using large dense blocks , 1997 .

[2] John G. Lewis,et al. Sparse matrix test problems , 1982, SGNM.

[3] P. Hansen,et al. Improving the numerical stability and the performance of a parallel sparse solver , 1995 .

[4] Zahari Zlatev,et al. A Parallel Sparse QR-Factorization Algorithm , 1995, PARA.

[5] Iain S. Duff,et al. Full matrix techniques in sparse Gaussian elimination , 1982 .

[6] Zahari Zlatev,et al. A testing scheme for subroutines solving large linear problems , 1981, Comput. Chem..

[7] Iain S. Duff. A review of frontal methods for solving linear systems , 1996 .

[8] Stefano Salvini,et al. Linear Algebra Subprograms on Shared Memory Computers: Beyond LAPACK , 1996, PARA.

[9] I. Duff,et al. Sparse numerical linear algebra: Direct methods and preconditioning , 1996 .

[10] Z. Zlatev. Computational Methods for General Sparse Matrices , 1991 .

[11] John K. Reid,et al. Some Design Features of a Sparse Matrix Code , 1979, TOMS.