A Homotopy for Solving Large, Sparse and Structured Fixed Point Problems

DOI10.1287/MOOR.8.4.557MaRDI QIDQ3314876zbMATH OpenOpenAlexFDO

Authors Romesh Saigal

Publication date 1983

Published in Mathematics of Operations Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1287/moor.8.4.557

zbMATH Keywords

Cholesky factorizationhomotopy methodssparse Jacobianvariable dimension algorithms

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Numerical computation of solutions to systems of equations (65H10) Numerical solution of boundary value problems involving ordinary differential equations (65L10)

Recommendations

• Computational complexity of a piecewise linear homotopy algorithm
• Numerical Linear Algebra Aspects of Globally Convergent Homotopy Methods
• Structure variable homotopy methods for solving nonlinear systems
• Algorithm 652
• Algorithm 801: POLSYS_PLP

Cited in

(19)

• A variable dimension fixed point algorithm and the orientation of simplices
• An Interior-Point Differentiable Path-Following Method to Compute Stationary Equilibria in Stochastic Games
• scientific article; zbMATH DE number 6255489 (Why is no real title available?)
• Solving discrete zero point problems
• Model transform and local parameters. Application to instantaneous attractors
• Homotopies Exploiting Newton Polytopes for Solving Sparse Polynomial Systems
• An Efficient Implementation of Merrill’s Method for Sparse or Partially Separable Systems of Nonlinear Equations
• scientific article; zbMATH DE number 903256 (Why is no real title available?)
• Efficiency and implementation of simplicial zero point algorithms
• Sparse systems in fixed point form
• Simplicial approximation of solutions to the nonlinear complementarity problem with lower and upper bounds
• Solving discrete systems of nonlinear equations
• Computational complexity of a piecewise linear homotopy algorithm
• A variable dimension homotopy for computing spatial equilibria
• A discrete multivariate mean value theorem with applications
• Simplicial zero-point algorithms: A unifying description
• A better triangulation for Wright's \(2^n\)-ray algorithm
• Numerical Linear Algebra Aspects of Globally Convergent Homotopy Methods
• A variable-dimension homotopy on networks for computing linear spatial equilibria

This page was built for publication: A Homotopy for Solving Large, Sparse and Structured Fixed Point Problems

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