Decomposability in fixed point computation with applications and acceleration techniques

DOI10.1016/0022-247X(79)90209-9zbMath0419.90084MaRDI QIDQ1132744

Daniel Solow

Publication date: 1979

Published in: Journal of Mathematical Analysis and Applications (Search for Journal in Brave)

zbMATH Keywords

nonlinear programmingdecomposabilityacceleration techniquescomputation of fixed points

Mathematics Subject Classification ID

Nonlinear programming (90C30) Mathematical programming (90C99)

Related Items (2)

Reduction of substructural interface degrees of freedom in flexibility-based component mode synthesis ⋮ Multivalued mappings

Cites Work

• On triangulations for computing fixed points
• SIMPLICIAL APPROXIMATION OF FIXED POINTS
• Computing Kakutani Fixed Points
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Decomposability in fixed point computation with applications and acceleration techniques