Computation of the collapse state in limit analysis using the LP primal affine scaling algorithm

DOI10.1016/0377-0427(91)90147-CzbMath0713.73035OpenAlexW2007797219MaRDI QIDQ750203

D. Kharzeev

Publication date: 1991

Published in: Journal of Computational and Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0377-0427(91)90147-c

zbMATH Keywords

tensionduality problemclassical and hard problem in plane straincollapse fieldscollapse multiplierlinearized yield conditionrectangular barsymmetric thin cuts

Mathematics Subject Classification ID

Linear programming (90C05) Anelastic fracture and damage (74R20) Finite element methods applied to problems in solid mechanics (74S05) Plastic materials, materials of stress-rate and internal-variable type (74C99)

Related Items

Limit analysis with the dual affine scaling algorithm, Mesh adaptive computation of upper and lower bounds in limit analysis, An upper-bound limit analysis of Mindlin plates using CS-DSG3 method and second-order cone programming, Limit analysis of plates using the EFG method and second-order cone programming

Uses Software

• LSQR
• CRAIG

Cites Work

• A modification of Karmarkar's linear programming algorithm
• Computing material collapse displacement fields on a Cray X-MP/48 by the LP primal affine scaling algorithm
• A new polynomial-time algorithm for linear programming
• On the collapse solution in limit analysis
• Convergence results and numerical experiments on a linear programming hybrid algorithm
• An interior point algorithm for semi-infinite linear programming
• On the kinematic minimum principle for the rate problem in classical plasticity
• A variation on Karmarkar’s algorithm for solving linear programming problems
• A quadratically convergent method for minimizing a sum of euclidean norms
• Computation of limit loads
• Vector-Supercomputer Experiments with the Primal Affine Linear Programming Scaling Algorithm
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item