The choleski Q.I.F. algorithm for solving symmetric linear systems

DOI10.1080/00207169908804852zbMath0949.65023OpenAlexW2028565542MaRDI QIDQ4934815

David J. Evans

Publication date: 21 November 2000

Published in: International Journal of Computer Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/00207169908804852

zbMATH Keywords

parallel algorithmCholesky algorithmbow-tie algorithmQIF factorizationquadratic interlocking factors

Mathematics Subject Classification ID

Parallel numerical computation (65Y05) Direct numerical methods for linear systems and matrix inversion (65F05)

Related Items (9)

A New Wz Factorization For Parallel Solution Of Tridiagonal Systems ⋮ Arithmetic Complexity Of Direct Solvers For Banded Systems ⋮ Add-sub pivoting triangular factorization for symmetric matrix ⋮ Computing theULfactorisation by newton's method ⋮ Backward error analysis of Choleski Q.I.F. for the solution of symmetric positive definite linear systems ⋮ A symmetric linear system solver ⋮ Two nonmonotone trust region algorithms based on an improved Newton method ⋮ Existence and Stability of Choleski Q.I.F. for Symmetric Linear Systems ⋮ Correction of trust region method with a new modified Newton method

Cites Work

• Householder's tridiagonalization of a symmetric matrix
• A modification of the quadrant interlocking factorisation parallel method
• Communication analysis of the PIE and QIF algorithms on distributed memory architecture

This page was built for publication: The choleski Q.I.F. algorithm for solving symmetric linear systems