Pages that link to "Item:Q2868952"
From MaRDI portal
The following pages link to A sparse approximate inverse preconditioner for nonsymmetric positive definite matrices (Q2868952):
Displaying 10 items.
- Different versions of ILU and IUL factorizations obtained from forward and backward factored approximate inverse processes. I (Q666393) (← links)
- New breakdown-free variant of AINV method for nonsymmetric positive definite matrices (Q935767) (← links)
- A two-phase preconditioning strategy of sparse approximate inverse for indefinite matrices (Q979931) (← links)
- A sparse-sparse iteration for computing a sparse incomplete factorization of the inverse of an SPD matrix (Q1015916) (← links)
- A novel class of approximate inverse preconditioners for large positive definite linear systems in optimization (Q2397822) (← links)
- Approximate inverse preconditioners for some large dense random electrostatic interaction matrices (Q2502319) (← links)
- A new approximate inverse preconditioner based on the Vaidya’s maximum spanning tree for matrix equation AXB = C (Q3389578) (← links)
- ILU preconditioning based on the FAPINV algorithm (Q3459016) (← links)
- ``Compress and Eliminate” Solver for Symmetric Positive Definite Sparse Matrices (Q4568105) (← links)
- A robust AINV-type method for constructing sparse approximate inverse preconditioners in factored form. (Q4814579) (← links)