Operating characteristics of hyperbolically and elliptically constrained self-adaptive incremental Newton-Raphson algorithms
DOI10.1016/0016-0032(83)90041-8zbMath0514.65037OpenAlexW2078107261MaRDI QIDQ1051399
Surapong Tovichakchikul, Tomas Arechaga, Joseph Padovan
Publication date: 1983
Published in: Journal of the Franklin Institute (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0016-0032(83)90041-8
stabilitynumerical experimentsefficiencyconvergence characteristicsversatilityNewton-Raphson techniquesafety zones
Numerical computation of solutions to systems of equations (65H10) Finite element methods applied to problems in solid mechanics (74S05) Finite element, Rayleigh-Ritz and Galerkin methods for boundary value problems involving PDEs (65N30)
Related Items (2)
Cites Work
- Unnamed Item
- Some practical procedures for the solution of nonlinear finite element equations
- Formal convergence characteristics of elliptically constrained incremental Newton-Raphson algorithms
- An incremental approach to the solution of snapping and buckling problems
- 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
- On the solution of creep induced buckling in general structure
- Quasi-Newton Methods, Motivation and Theory
This page was built for publication: Operating characteristics of hyperbolically and elliptically constrained self-adaptive incremental Newton-Raphson algorithms