On the Gauss, Cholesky and Householder algorithms
From MaRDI portal
Publication:2378079
DOI10.1016/J.ADVENGSOFT.2008.03.018zbMATH Open1159.65030OpenAlexW2086263384MaRDI QIDQ2378079FDOQ2378079
Authors: Mongi Benhamadou 
Publication date: 6 January 2009
Published in: Advances in Engineering Software (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.advengsoft.2008.03.018
Recommendations
- Parallel QR factorization by Householder and modified Gram-Schmidt algorithms
- scientific article; zbMATH DE number 440657
- scientific article; zbMATH DE number 641618
- Stability Analysis of a Householder-Based Algorithm for Downdating the Cholesky Factorization
- scientific article; zbMATH DE number 218384
tensor productnumerical experimentsGauss-Jordan algorithmLinear systemsCholesky algorithmGauss algorithmHouseholder algorithm
Cites Work
- Title not available (Why is that?)
- An Iterative Solution Method for Linear Systems of Which the Coefficient Matrix is a Symmetric M-Matrix
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- A generalized SSOR method
- Approximate inverse preconditionings for sparse linear systems
- Title not available (Why is that?)
- Toward an Effective Sparse Approximate Inverse Preconditioner
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Preconditioners for the resolution of the linear systems \(Ax=b\)
- A new algorithm to solve nonlinear systems
Cited In (1)
This page was built for publication: On the Gauss, Cholesky and Householder algorithms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2378079)
