High-dimensional homotopy curve tracking on a shared-memory multiprocessor
From MaRDI portal
Publication:1186833
DOI10.1007/BF00127953zbMath0749.65032OpenAlexW2071421598MaRDI QIDQ1186833
K. M. Irani, D. C. S. Allison, Layne T. Watson, Calvin J. Ribbens
Publication date: 28 June 1992
Published in: The Journal of Supercomputing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf00127953
global convergenceparallel algorithmhomotopy algorithmsoftware packagepreconditioned conjugate gradient algorithmcurve trackingshared-memory multiprocessor
Numerical computation of solutions to systems of equations (65H10) Global methods, including homotopy approaches to the numerical solution of nonlinear equations (65H20) Parallel numerical computation (65Y05)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A globally convergent algorithm for computing fixed points of \(C^2\) maps
- Algorithm 652
- Numerical Linear Algebra Aspects of Globally Convergent Homotopy Methods
- Preconditioned Iterative Methods for Homotopy Curve Tracking
- Experiments with Conjugate Gradient Algorithms for Homotopy Curve Tracking
- Finding Zeroes of Maps: Homotopy Methods That are Constructive With Probability One
- Methods of conjugate gradients for solving linear systems