The following pages link to Miroslav Tuma (Q229058):
Displaying 12 items.
- A Computational Study of Using Black-box QR Solvers for Large-scale Sparse-dense Linear Least Squares Problems (Q5066598) (← links)
- On Signed Incomplete Cholesky Factorization Preconditioners for Saddle-Point Systems (Q5176059) (← links)
- Sparse Stretching for Solving Sparse-Dense Linear Least-Squares Problems (Q5230611) (← links)
- HSL_MI28 (Q5270694) (← links)
- A robust incomplete factorization preconditioner for positive definite matrices (Q5317890) (← links)
- Effects of problem decomposition (partitioning) on the rate of convergence of parallel numerical algorithms (Q5317893) (← links)
- Stabilized and block approximate inverse preconditioners for problems in solid and structural mechanics (Q5955326) (← links)
- Preconditioned iterative methods for solving linear least squares problems (Q6486766) (← links)
- Avoiding breakdown in incomplete factorizations in low precision arithmetic (Q6519739) (← links)
- On incomplete Cholesky factorizations in half precision arithmetic (Q6526785) (← links)
- On the role of orthogonality in the GMRES method (Q6560196) (← links)
- Avoiding breakdown in incomplete factorizations in low precision arithmetic (Q6604161) (← links)