Pages that link to "Item:Q1085948"
From MaRDI portal
The following pages link to The performance of FORTRAN implementations for preconditioned conjugate gradients on vector computers (Q1085948):
Displaying 14 items.
- Approximate polynomial preconditionings applied to biharmonic equations (Q547496) (← links)
- A general approach to nonlinear FE compuations on shared-memory multiprocessors (Q1123604) (← links)
- Vectorizable preconditioners for elliptic difference equations in three space dimensions (Q1124279) (← links)
- Data structures to vectorize CG algorithms for general sparsity patterns (Q1262077) (← links)
- ICCG and related methods for 3D problems on vector computers (Q1330640) (← links)
- Practical use of the conjugate gradient method on parallel supercomputers (Q1330655) (← links)
- A block preconditioned conjugate gradient method for solving high-order finite element matrix equations (Q1344219) (← links)
- The behavior of conjugate gradient algorithms on a multivector processor with a hierarchical memory (Q1813207) (← links)
- Solving 3D block bidiagonal linear systems on vector computers (Q1822897) (← links)
- Inexact Newton methods on a vector supercomputer (Q1899956) (← links)
- On vectorizing the preconditioned generalized conjugate residual methods (Q4009761) (← links)
- A vectorizable variant of pgcr methods for unsymmetric linear systems (Q4021071) (← links)
- TRANSPOSE-FREE LANCZOS-TYPE SCHEMES ON TRANSPUTER NETWORK∗ (Q4820024) (← links)
- The pgcr method for solving unsymmetric linear systems on a vector multiprocessor (Q4839727) (← links)
