Element-by-Element Preconditioners for Large Partially Separable Optimization Problems

DOI10.1137/S1064827594274796MaRDI QIDQ4376249zbMATH OpenFDO

Authors Michel J. Daydé, Nicholas I. M. Gould, Jean-Yves L'Excellent

Publication date 10 February 1998

Published in SIAM Journal on Scientific Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/S1064827594274796

zbMATH Keywords

element-by-element preconditionerslarge scale optimizationnumerical experimentspartial separabilityperformancepreconditioned conjugate gradient method

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Complexity and performance of numerical algorithms (65Y20) Nonlinear programming (90C30)

Recommendations

• scientific article; zbMATH DE number 3843081
• scientific article; zbMATH DE number 653037
• scientific article; zbMATH DE number 679859
• On large scale nonlinear network optimization
• scientific article; zbMATH DE number 3898623

Cited in

(8)

• Partitioned versus global Krylov subspace iterative methods for FE solution of 3-D Biot's problem
• A survey of truncated-Newton methods
• An octree pattern-based massively parallel PCG solver for elasto-static and dynamic problems
• Performance of Jacobi preconditioning in Krylov subspace solution of finite element equations
• Dynamic scaling based preconditioning for truncated Newton methods in large scale unconstrained optimization
• scientific article; zbMATH DE number 653037 (Why is no real title available?)
• An element-based preconditioner for mixed finite element problems
• Isosurface-based marching cube algorithm for smooth geometric topology optimization within adaptive octree SBFE approach

This page was built for publication: Element-by-Element Preconditioners for Large Partially Separable Optimization Problems

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