scientific article; zbMATH DE number 833698

MaRDI QIDQ4860187zbMATH OpenFDO

Authors Chunguang Sun

Publication date 14 January 1996

zbMATH Keywords

numerical examplesparallel algorithmsQR factorizationdistributed-memory multiprocessorssparse linear least squares problemssparse triangular systemsmethod of corrected semi-normal equationsparallel multifrontal scheme

Mathematics Subject Classification ID

Computational methods for sparse matrices (65F50) Parallel numerical computation (65Y05) Numerical solutions to overdetermined systems, pseudoinverses (65F20)

Recommendations

• Parallel solution of sparse linear least squares problems on distributed-memory multiprocessors
• Parallel algorithms for the iterative solution of sparse least-squares problems
• Parallel Sparse Orthogonal Factorization on Distributed-Memory Multiprocessors
• scientific article; zbMATH DE number 4076453
• A coarse-grained parallel QR-factorization algorithm for sparse least squares problems

Cited in

(10)

• Parallel Sparse Orthogonal Factorization on Distributed-Memory Multiprocessors
• Multifrontal Computation with the Orthogonal Factors of Sparse Matrices
• Parallel tools for solving incremental dense least squares problems: application to space geodesy
• Efficient Parallel Nonnegative Least Squares on Multicore Architectures
• Modeling 1D Distributed-Memory Dense Kernels for an Asynchronous Multifrontal Sparse Solver
• Parallel frontal solvers for large sparse linear systems
• Implementing Multifrontal Sparse Solvers for Multicore Architectures with Sequential Task Flow Runtime Systems
• QR Factorization for Linear Least-Squares Problems on a Hypercube Multiprocessor
• Multifrontal parallel distributed symmetric and unsymmetric solvers
• Parallel algorithms for the iterative solution of sparse least-squares problems

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4860187)