메뉴 건너뛰기




Volumn 133, Issue 2-3, 2002, Pages 547-557

PCR algorithm for parallel computing minimum-norm (T) least-squares (S) solution of inconsistent linear equations

Author keywords

Inconsistent linear equations; Parallel algorithm; The minimum norm (T) least squares (S) solution; Time complexity; Weighted Moore Penrose inverse

Indexed keywords

LEAST SQUARES APPROXIMATIONS; LINEAR EQUATIONS; PARALLEL ALGORITHMS; SET THEORY; THEOREM PROVING;

EID: 0037114101     PISSN: 00963003     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0096-3003(01)00256-9     Document Type: Article
Times cited : (12)

References (16)
  • 2
    • 0001712739 scopus 로고
    • A survey of parallel algorithms in numerical linear algebra
    • (1978) SIAM Rev. , vol.20 , pp. 740-777
    • Heller, D.1
  • 10
    • 0000630025 scopus 로고
    • A Cramer rule for minimum-norm (T) least-squares (S) solutions of inconsistent linear equations
    • (1986) Linear Algebra Appl. , vol.74 , pp. 213-218
    • Wang, G.1
  • 11
    • 0043096908 scopus 로고    scopus 로고
    • Weighted Moore-Penrose inverse, Drazin inverse and group inverse of the Kroneckor product A ⊗ B and some applications
    • (1997) Linear Algebra Appl. , vol.250 , pp. 39-50
    • Wang, G.1


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