메뉴 건너뛰기




Volumn 21, Issue 1-4, 1999, Pages 157-164

Preconditioning projection methods for solving algebraic linear systems

Author keywords

[No Author keywords available]

Indexed keywords


EID: 0041577431     PISSN: 10171398     EISSN: None     Source Type: Journal    
DOI: 10.1023/a:1019192926247     Document Type: Article
Times cited : (4)

References (10)
  • 1
    • 0001712627 scopus 로고
    • A class of direct methods for linear systems
    • J. Abaffy, C.G. Broyden and E. Spedicato, A class of direct methods for linear systems, Numer. Math. 45 (1984) 361-376.
    • (1984) Numer. Math. , vol.45 , pp. 361-376
    • Abaffy, J.1    Broyden, C.G.2    Spedicato, E.3
  • 3
    • 0030246542 scopus 로고    scopus 로고
    • On projection algorithms for solving convex feasibility problems
    • H.H. Bauschke and J.M. Borwein, On projection algorithms for solving convex feasibility problems, SIAM Rev. 38 (1996) 367-426.
    • (1996) SIAM Rev. , vol.38 , pp. 367-426
    • Bauschke, H.H.1    Borwein, J.M.2
  • 4
    • 0000713765 scopus 로고
    • Row projection methods for large nonsymmetric linear systems
    • R. Bramley and A. Sameh, Row projection methods for large nonsymmetric linear systems, SIAM J. Sci. Statist. Comput. 13 (1992) 168-193.
    • (1992) SIAM J. Sci. Statist. Comput. , vol.13 , pp. 168-193
    • Bramley, R.1    Sameh, A.2
  • 5
    • 0031118954 scopus 로고    scopus 로고
    • Convex set theoretic image recovery by extrapolated iterations of parallel subgradient projections
    • P.L. Combettes, Convex set theoretic image recovery by extrapolated iterations of parallel subgradient projections, IEEE Trans. Image Process. 6(4) (1997) 1-15.
    • (1997) IEEE Trans. Image Process , vol.6 , Issue.4 , pp. 1-15
    • Combettes, P.L.1
  • 6
    • 85163170889 scopus 로고
    • The N-step iteration procedures
    • E.J. Craig, The N-step iteration procedures, J. Math. Phys. 34 (1955) 64-73.
    • (1955) J. Math. Phys. , vol.34 , pp. 64-73
    • Craig, E.J.1
  • 7
    • 0012088394 scopus 로고
    • Relaxed outer projections, weighted averages and convex feasibility
    • S.D. Flåm and J. Zowe, Relaxed outer projections, weighted averages and convex feasibility, BIT 30 (1990) 289-300.
    • (1990) BIT , vol.30 , pp. 289-300
    • Flåm, S.D.1    Zowe, J.2
  • 8
    • 0001001503 scopus 로고
    • Parallel projected aggregation methods for solving the convex inequality problem
    • U.M. García-Palomares, Parallel projected aggregation methods for solving the convex inequality problem, SIAM J. Optim. 3(4) (1993) 882-900.
    • (1993) SIAM J. Optim. , vol.3 , Issue.4 , pp. 882-900
    • García-Palomares, U.M.1
  • 9
    • 0032010261 scopus 로고    scopus 로고
    • A superlinearly convergent projection algorithm for solving the convex inequality problem
    • U.M. García-Palomares, A superlinearly convergent projection algorithm for solving the convex inequality problem, Oper. Res. Lett. 22 (1998) 97-103.
    • (1998) Oper. Res. Lett. , vol.22 , pp. 97-103
    • García-Palomares, U.M.1
  • 10
    • 22444455259 scopus 로고    scopus 로고
    • Incomplete projection algorithms for solving the convex feasibility problem
    • U.M. García-Palomares and F.J. González Castaño, Incomplete projection algorithms for solving the convex feasibility problem, Numer. Algorithms 18 (1998) 177-193.
    • (1998) Numer. Algorithms , vol.18 , pp. 177-193
    • García-Palomares, U.M.1    González Castaño, F.J.2


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