Decomposability in fixed point computation with applications and acceleration techniques

DOI10.1016/0022-247X(79)90209-9MaRDI QIDQ1132744zbMATH OpenFDO

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

Cites work

• scientific article; zbMATH DE number 3159955 (Why is no real title available?)
• scientific article; zbMATH DE number 3661134 (Why is no real title available?)
• scientific article; zbMATH DE number 3515261 (Why is no real title available?)
• scientific article; zbMATH DE number 3535189 (Why is no real title available?)
• scientific article; zbMATH DE number 3308846 (Why is no real title available?)
• scientific article; zbMATH DE number 3320765 (Why is no real title available?)
• scientific article; zbMATH DE number 3323651 (Why is no real title available?)
• scientific article; zbMATH DE number 3381785 (Why is no real title available?)
• scientific article; zbMATH DE number 3186512 (Why is no real title available?)
• Computing Kakutani Fixed Points
• On triangulations for computing fixed points
• SIMPLICIAL APPROXIMATION OF FIXED POINTS

Cited in

(2)

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

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

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