scientific article; zbMATH DE number 1226271

DOI<275::AID-NLA83>3.0.CO;2-7 10.1002/(SICI)1099-1506(199607/08)3:4<275::AID-NLA83>3.0.CO;2-7zbMath0907.65040MaRDI QIDQ4220434

C. Puglisi, Iain S. Duff, Patrick R. Amestoy

Publication date: 23 November 1998

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

performancealgorithmparallel computationmultifrontal methodHouseholder transformationslarge sparse matrixsparse QR factorization

Mathematics Subject Classification ID

Computational methods for sparse matrices (65F50) Numerical solutions to overdetermined systems, pseudoinverses (65F20) Parallel numerical computation (65Y05) Complexity and performance of numerical algorithms (65Y20)

Related Items

A null space algorithm for mixed finite-element approximations of Darcy's equation, Preconditioning Linear Least-Squares Problems by Identifying a Basis Matrix, A Computational Study of Using Black-box QR Solvers for Large-scale Sparse-dense Linear Least Squares Problems, Solving sparse linear least-squares problems on some supercomputers by using large dense blocks, A distributed memory parallel element-by-element scheme for semiconductor device simulation, Parallel QR Factorization of Block-Tridiagonal Matrices, Construction of a discrete divergence-free basis through orthogonal factorization in \({\mathcal{H}}\)-arithmetic, A survey of direct methods for sparse linear systems, Multiprocessing a sparse matrix code on the Alliant FX/8, The impact of high-performance computing in the solution of linear systems: Trends and problems, Implementing Multifrontal Sparse Solvers for Multicore Architectures with Sequential Task Flow Runtime Systems, Hierarchical Orthogonal Factorization: Sparse Square Matrices

Cites Work

• Predicting fill for sparse orthogonal factorization
• A Note on the Least Squares Solution of a Band System of Linear Equations by Householder Reductions