Formal convergence characteristics of elliptically constrained incremental Newton-Raphson algorithms

DOI10.1016/0020-7225(82)90091-XzbMath0503.73065OpenAlexW2068081286MaRDI QIDQ1173442

Tomas Arechaga, Joseph Padovan

Publication date: 1982

Published in: International Journal of Engineering Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0020-7225(82)90091-x

zbMATH Keywords

algorithmsnonlinearitiescontinuousclosedconvergence characteristicsexistence, uniquenesspiecewise continuousconstrained type incremental Newton-Raphson operator schemeselliptically constrained versionformal numerical propertiesglobal as well as local point of viewglobal safety zonesopen constraint conditionspositive, negative, semi and indefinite tangent properties

Mathematics Subject Classification ID

Newton-type methods (49M15) Numerical computation of solutions to systems of equations (65H10) Numerical and other methods in solid mechanics (74S99) Software, source code, etc. for problems pertaining to mechanics of deformable solids (74-04)

Related Items

Multiply constrained partitioned nonlinear equation solvers, On the convergence of block constrained nonlinear equation solvers^∗, Extension of constrained incremental Newton-Raphson scheme to generalized loading fields, Operating characteristics of hyperbolically and elliptically constrained self-adaptive incremental Newton-Raphson algorithms, Consistent concept for line search algorithms in combination with arc-length constraints, On the general rolling contact problem for finite deformations of a viscoelastic cylinder

Cites Work

• The solution of nonlinear finite element equations
• A fast incremental/iterative solution procedure that handles “snap-through”
• Self-adaptive predictor-corrector algorithms for static nonlinear structural analysis
• Quasi-Newton Methods, Motivation and Theory
• Solution techniques for non−linear finite element problems
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item