Pages that link to "Item:Q2855667"

The following pages link to Fine-Grained Multithreading for the Multifrontal $QR$ Factorization of Sparse Matrices (Q2855667):

Displaying 15 items.

• Experiments with sparse Cholesky using a sequential task-flow implementation (Q1713223) (← links)
• Parallel direct solver for solving systems of linear equations resulting from finite element method on multi-core desktops and workstations (Q2006579) (← links)
• Discrete least-squares finite element methods (Q2310100) (← links)
• Numerical recovery strategies for parallel resilient Krylov linear solvers (Q2955988) (← links)
• Extensions of the Augmented Block Cimmino Method to the Solution of Full Rank Rectangular Systems (Q5009902) (← links)
• Hierarchical Orthogonal Factorization: Sparse Square Matrices (Q5028554) (← links)
• SemiAutomatic Task Graph Construction for $\mathcal{H}$-Matrix Arithmetic (Q5065492) (← links)
• A Computational Study of Using Black-box QR Solvers for Large-scale Sparse-dense Linear Least Squares Problems (Q5066598) (← links)
• Parallel <i>QR</i> Factorization of Block-Tridiagonal Matrices (Q5146680) (← links)
• A Parallel Sparse Direct Solver via Hierarchical DAG Scheduling (Q5270706) (← links)
• Implementing Multifrontal Sparse Solvers for Multicore Architectures with Sequential Task Flow Runtime Systems (Q5270774) (← links)
• On Using Cholesky-Based Factorizations and Regularization for Solving Rank-Deficient Sparse Linear Least-Squares Problems (Q5350438) (← links)
• A survey of direct methods for sparse linear systems (Q5740079) (← links)
• A regularized interior-point method for constrained linear least squares (Q5882390) (← links)
• Fully parallel and pipelined sparse direct solver for large symmetric indefinite finite element problems (Q6663392) (← links)