Lab Home | Phone | Search
	Center for Nonlinear Studies
	Home  ▶ People   Current   Executive Committee   Postdocs   Visitors   Students   Research   Publications  ▶ Conferences   Workshops   Sponsorship  ▶ Talks   Seminars   Postdoc Seminars Archive   Quantum Lunch   Quantum Lunch Archive   P/T Colloquia   Archive   Ulam Scholar     Postdoc Nominations  ▶ Student Requests   Student Program  ▶ Visitor Requests   Description   Past Visitors  ▶ Services   General     History of CNLS     Maps, Directions   CNLS Office   T-Division   LANL				Wednesday, August 22, 20074:00 PM - 4:30 PMCNLS Conference Room (TA-3, Bldg 1690) Seminar Recursive Inverse Factorization Emanuel RubenssonRoyal Institute of Technology A recursive algorithm for the inverse factorization S^-1 = ZZ* of Hermitian positive definite matrices S is proposed. Iterative refinement [A.M.N. Niklasson, Phys. Rev. Lett. 70, 193102 (2004)] is combined with a recursive decomposition of S. It is proved that the recursive algorithm always converges if a binary principal submatrix tree is used for the recursive decomposition. As the algorithm uses only matrix--matrix multiplication it can be parallelized and the computational effort increases linearly with system size for sufficiently sparse matrices. Host: A.M.N. Niklasson