scientific article; zbMATH DE number 4199985

zbMATH Open0726.90078MaRDI QIDQ3348720FDOQ3348720

Authors: Paul E. Plassman 

Publication date: 1990

Title of this publication is not available (Why is that?)

Recommendations

• A Parallel Nonlinear Least-Squares Solver: Theoretical Analysis and Numerical Results
• Sparse Cholesky Factorization on a Local-Memory Multiprocessor
• Sparse QR factorization on a massively parallel computer
• A coarse-grained parallel QR-factorization algorithm for sparse least squares problems
• Software for estimating sparse Jacobian matrices

zbMATH Keywords

estimationtrust-regionfactorization of large, sparse Jacobiansmessage-passing multiprocessor

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Parallel numerical computation (65Y05) Large-scale problems in mathematical programming (90C06) Nonlinear programming (90C30) Computational methods for problems pertaining to operations research and mathematical programming (90-08) Distributed algorithms (68W15)

Cited In (2)

• Matrix-free preconditioning using partial matrix estimation
• Efficient estimation of sparse Jacobian matrices by differences

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 Q3348720)