메뉴 건너뛰기




Volumn 79, Issue 7, 2009, Pages 2135-2147

On some new approximate factorization methods for block tridiagonal matrices suitable for vector and parallel processors

Author keywords

Parallel algorithm; Polynomial sparse approximate; Preconditioning; Stair matrix; Tridiagonal matrix

Indexed keywords

LINEAR SYSTEMS; PARALLEL PROCESSING SYSTEMS; PARTIAL DIFFERENTIAL EQUATIONS; PETROLEUM RESERVOIR ENGINEERING; PETROLEUM RESERVOIRS; POLYNOMIAL APPROXIMATION; STAIRS;

EID: 61549099005     PISSN: 03784754     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.matcom.2008.09.009     Document Type: Article
Times cited : (14)

References (28)
  • 1
    • 0001249890 scopus 로고
    • M-step preconditioned conjugate gradient methods
    • Adams L. M-step preconditioned conjugate gradient methods. SIAM J. Sci. Stat. Comput. 6 2 (1985) 452-462
    • (1985) SIAM J. Sci. Stat. Comput. , vol.6 , Issue.2 , pp. 452-462
    • Adams, L.1
  • 2
    • 0024608787 scopus 로고
    • Additive polynomial preconditioners for parallel computers
    • Adams L., and Ong E. Additive polynomial preconditioners for parallel computers. Parallel Comput. 9 (1988/89) 333-345
    • (1988) Parallel Comput. , vol.9 , pp. 333-345
    • Adams, L.1    Ong, E.2
  • 4
    • 0033629867 scopus 로고    scopus 로고
    • On the convergence of the multisplitting methods for the linear complementarity problem
    • Bai Z. On the convergence of the multisplitting methods for the linear complementarity problem. SIAM J. Matrix Anal. Appl. 21 (2000) 67-78
    • (2000) SIAM J. Matrix Anal. Appl. , vol.21 , pp. 67-78
    • Bai, Z.1
  • 6
    • 0023427887 scopus 로고
    • On sparse block factorization iterative methods
    • Beauwens R., and Ben Bouzid M. On sparse block factorization iterative methods. SIAM J. Numer. Anal. 24 (1987) 1066-1076
    • (1987) SIAM J. Numer. Anal. , vol.24 , pp. 1066-1076
    • Beauwens, R.1    Ben Bouzid, M.2
  • 8
    • 0344800609 scopus 로고
    • A preconditioned conjugate gradient method on a distributed memory multiprocessor
    • Bru R., Corral C., and Mas J. A preconditioned conjugate gradient method on a distributed memory multiprocessor. Appl. Math. Lett. 8 3 (1995) 49-53
    • (1995) Appl. Math. Lett. , vol.8 , Issue.3 , pp. 49-53
    • Bru, R.1    Corral, C.2    Mas, J.3
  • 9
    • 21844509663 scopus 로고
    • Multisplitting preconditioners based on incomplete Choleski factorizations
    • Bru R., Corral C., Martínez A., and Mas J. Multisplitting preconditioners based on incomplete Choleski factorizations. SIAM J. Matrix Anal. Appl. 16 4 (1995) 1210-1222
    • (1995) SIAM J. Matrix Anal. Appl. , vol.16 , Issue.4 , pp. 1210-1222
    • Bru, R.1    Corral, C.2    Martínez, A.3    Mas, J.4
  • 10
    • 0031261348 scopus 로고    scopus 로고
    • Approximate inverse techniques for block-partitioned matrices
    • Chow E., and Saad Y. Approximate inverse techniques for block-partitioned matrices. SIAM J. Sci. Comput. 18 (1997) 1657-1675
    • (1997) SIAM J. Sci. Comput. , vol.18 , pp. 1657-1675
    • Chow, E.1    Saad, Y.2
  • 11
    • 0002308279 scopus 로고
    • Conjugate gradient methods for indefinite systems
    • Springer, Berlin
    • R. Fletcher, Conjugate gradient methods for indefinite systems, in: Lecture Notes in Mathematics, vol. 506, Springer, Berlin, 1976, pp. 73-89.
    • (1976) Lecture Notes in Mathematics , vol.506 , pp. 73-89
    • Fletcher, R.1
  • 12
    • 0031129197 scopus 로고    scopus 로고
    • Parallel preconditioning with sparse approximate inverses
    • Grote M.J., and Huckle T. Parallel preconditioning with sparse approximate inverses. SIAM J. Sci. Comput. 18 (1997) 838-853
    • (1997) SIAM J. Sci. Comput. , vol.18 , pp. 838-853
    • Grote, M.J.1    Huckle, T.2
  • 13
    • 0040842938 scopus 로고
    • Some results on sparse block factorization iterative methods
    • Guo C.H. Some results on sparse block factorization iterative methods. Lin. Alg. Appl. 145 (1991) 187-199
    • (1991) Lin. Alg. Appl. , vol.145 , pp. 187-199
    • Guo, C.H.1
  • 14
    • 0000415685 scopus 로고    scopus 로고
    • Incomplete block factorization preconditioning for linear systems arising in the numerical solution of the Helmholtz equation
    • Guo C.H. Incomplete block factorization preconditioning for linear systems arising in the numerical solution of the Helmholtz equation. Appl. Numer. Math. 19 (1996) 495-508
    • (1996) Appl. Numer. Math. , vol.19 , pp. 495-508
    • Guo, C.H.1
  • 16
    • 0033149565 scopus 로고    scopus 로고
    • Approximate sparsity patterns for the inverse of a matrix and preconditioning
    • Huckle T. Approximate sparsity patterns for the inverse of a matrix and preconditioning. Appl. Numer. Math. 30 (1999) 291-303
    • (1999) Appl. Numer. Math. , vol.30 , pp. 291-303
    • Huckle, T.1
  • 17
    • 33745220514 scopus 로고    scopus 로고
    • On a new criterion for the H-matrix property
    • Li H.B., and Huang T.Z. On a new criterion for the H-matrix property. Appl. Math. Lett. 19 10 (2006) 1134-1142
    • (2006) Appl. Math. Lett. , vol.19 , Issue.10 , pp. 1134-1142
    • Li, H.B.1    Huang, T.Z.2
  • 18
    • 32644448751 scopus 로고    scopus 로고
    • An improvement on a new upper bound for moduli of eigenvalues of iterative matrices
    • Li H.B., Huang T.Z., and Li H. An improvement on a new upper bound for moduli of eigenvalues of iterative matrices. Appl. Math. Comput. 137 (2006) 977-984
    • (2006) Appl. Math. Comput. , vol.137 , pp. 977-984
    • Li, H.B.1    Huang, T.Z.2    Li, H.3
  • 19
    • 34248562941 scopus 로고    scopus 로고
    • On some subclasses of P-matrices
    • Li H.B., Huang T.Z., and Li H. On some subclasses of P-matrices. Numer. Lin. Alg. Appl. 14 5 (2007) 391-405
    • (2007) Numer. Lin. Alg. Appl. , vol.14 , Issue.5 , pp. 391-405
    • Li, H.B.1    Huang, T.Z.2    Li, H.3
  • 20
    • 33750839043 scopus 로고    scopus 로고
    • Lower bounds for the minimum eigenvalue of Hadamard product of an M-matrix and its inverse
    • Li H.B., Huang T.Z., Shen S.Q., and Li H. Lower bounds for the minimum eigenvalue of Hadamard product of an M-matrix and its inverse. Lin. Alg. Appl. 421 1 (2007) 235-247
    • (2007) Lin. Alg. Appl. , vol.421 , Issue.1 , pp. 235-247
    • Li, H.B.1    Huang, T.Z.2    Shen, S.Q.3    Li, H.4
  • 21
    • 39549104056 scopus 로고    scopus 로고
    • Inclusion sets for singular values
    • Li H.B., Huang T.Z., and Li H. Inclusion sets for singular values. Lin. Alg. Appl. 428 (2008) 2220-2235
    • (2008) Lin. Alg. Appl. , vol.428 , pp. 2220-2235
    • Li, H.B.1    Huang, T.Z.2    Li, H.3
  • 22
    • 0041687759 scopus 로고    scopus 로고
    • Stair matrices and their generalizations with applications to iterative methods I: a generalization of the successive overrelaxation method
    • Lu H. Stair matrices and their generalizations with applications to iterative methods I: a generalization of the successive overrelaxation method. SIAM J. Numer. Anal. 37 1 (2001) 1-17
    • (2001) SIAM J. Numer. Anal. , vol.37 , Issue.1 , pp. 1-17
    • Lu, H.1
  • 25
    • 0000048673 scopus 로고
    • A generalized minimal residual algorithm for solving nonsymmetric linear systems
    • Saad Y., Schultz M.H., and GMRES:. A generalized minimal residual algorithm for solving nonsymmetric linear systems. SIAM J. Sci. Statist. Comput. 7 (1986) 856-869
    • (1986) SIAM J. Sci. Statist. Comput. , vol.7 , pp. 856-869
    • Saad, Y.1    Schultz, M.H.2
  • 26
    • 0000005482 scopus 로고
    • Bi-CGSTAB: a fast and smoothly converging variant of Bi-CG for the solution of nonsymmetric linear systems
    • Van der Vorst H.A. Bi-CGSTAB: a fast and smoothly converging variant of Bi-CG for the solution of nonsymmetric linear systems. SIAM J. Sci. Statist. Comput. 13 (1992) 631-644
    • (1992) SIAM J. Sci. Statist. Comput. , vol.13 , pp. 631-644
    • Van der Vorst, H.A.1
  • 28
    • 0013106371 scopus 로고    scopus 로고
    • Block ILU preconditioners for a nonsymmetric block-tridiagonal M-matrix
    • Yun J.H. Block ILU preconditioners for a nonsymmetric block-tridiagonal M-matrix. BIT 40 (2000) 583-605
    • (2000) BIT , vol.40 , pp. 583-605
    • Yun, J.H.1


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.