2001
DOI: 10.1016/s0045-7825(00)00336-4
|View full text |Cite
|
Sign up to set email alerts
|

Consistent tangent matrices for substepping schemes

Abstract: A very simple and general expression of the consistent tangent matrix for substepping time-integration schemes is presented. If needed, the derivatives required for the computation of the consistent tangent moduli can be obtained via numerical differentiation. These two strategies (substepping and numerical differentiation) lead to quadratic convergence in complex nonlinear inelasticity problems.

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
48
0

Year Published

2001
2001
2017
2017

Publication Types

Select...
6
3

Relationship

1
8

Authors

Journals

citations
Cited by 81 publications
(48 citation statements)
references
References 21 publications
0
48
0
Order By: Relevance
“…This situation is related to the strong nonlinearity of the equations which may arise, for example, from the high curvature of the yield function, as it can be found in typical practical applications. The numerical results reported in de Souza Neto et al [1994], Bićanić & Pearce [1996], Pérez-Foguet et al [2000a] and herein illustrate these difficulties. These observations identify clearly the goal of this work: the development of efficient globally convergent algorithms for the solution of the closest-point projection equations in elastoplasticity.…”
Section: Introductionmentioning
confidence: 58%
“…This situation is related to the strong nonlinearity of the equations which may arise, for example, from the high curvature of the yield function, as it can be found in typical practical applications. The numerical results reported in de Souza Neto et al [1994], Bićanić & Pearce [1996], Pérez-Foguet et al [2000a] and herein illustrate these difficulties. These observations identify clearly the goal of this work: the development of efficient globally convergent algorithms for the solution of the closest-point projection equations in elastoplasticity.…”
Section: Introductionmentioning
confidence: 58%
“…where A and B stand for the individual surface parameters of Eqs (26)- (27), as detailed in Table 1. The three material variables C,  t , tan associated with surface F 1 have explicit physical meaning as they represent the cohesion, the tensile strength and the friction angle at either mortar or brick interfaces.…”
Section: Variables Plastic Surfaces and Potentialsmentioning
confidence: 99%
“…When the number of iterations required to solve Eq. (40) is greater than a prescribed value n max1 , the substepping procedure is activated and the total increment of local strains du n , as determined from the increment of global displacements, is divided into m local substeps [27]: local iterations, the sum of the iterations required at each substep, is greater than a prescribed maximum value n max2 . In the former case, the local solution for the total increment of local strains du n , is determined, while in the latter case, step reduction at the global structural level may be required.…”
Section: Solution Of the Plasticity Problemmentioning
confidence: 99%
“…Reference [18] presents an analysis of different numerical differentiation schemes to compute these derivatives and references [23,26] show the application to different nontrivial elastoplastic models and time-integration rules. The main conclusion of these works is that simple first and second order difference schemes do not disturb the quadratic convergence of the Newton-Raphson method provided that the stepsize is fixed in a relative way.…”
Section: Numerical Differentiationmentioning
confidence: 99%