1994
DOI: 10.1016/0045-7949(94)90165-1
|View full text |Cite
|
Sign up to set email alerts
|

A path-following technique via an asymptotic-numerical method

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

3
236
0

Year Published

1997
1997
2018
2018

Publication Types

Select...
7
1

Relationship

2
6

Authors

Journals

citations
Cited by 230 publications
(239 citation statements)
references
References 9 publications
3
236
0
Order By: Relevance
“…Besides, the convergence toward the equilibrium solution is never assured. An alternative is to use an asymptotic numerical method [4] [5]. Such a method principle is, starting from a solution point, to seek the branch of solution as an asymptotic expansion of an arc length measure, leading to a semi-analytical solution.…”
Section: Asymptotic Numerical Methodsmentioning
confidence: 99%
“…Besides, the convergence toward the equilibrium solution is never assured. An alternative is to use an asymptotic numerical method [4] [5]. Such a method principle is, starting from a solution point, to seek the branch of solution as an asymptotic expansion of an arc length measure, leading to a semi-analytical solution.…”
Section: Asymptotic Numerical Methodsmentioning
confidence: 99%
“…A small step size leads to a slow convergence, while a large step size compromises the accuracy of the results. Our method is similar to [Cochelin 1994], which adaptively selects the step size as large as possible while retaining sufficient accuracy to ensure quadratic convergence at each step. Our key contribution is the development of asymptotic expansions for the inverse neo-Hookean model.…”
Section: Related Workmentioning
confidence: 99%
“…To this end, we need to quickly estimate the residual of X(a). As suggested by [Cochelin 1994], a simple estimation is motivated by the observation that when a − a0 is within the convergence radius of the power series, the difference between two consecutive approximation orders remains small. However, when a − a0 reaches the convergence radius, they separate rapidly (see Figure 4).…”
Section: Residual Estimation Of X(a)mentioning
confidence: 99%
See 1 more Smart Citation
“…Let us note that these problems have the same tangent stiffness matrix and hence the terms (U i , λ i ) (1 ≤ i ≤ N ) of (2.2) are computed by inverting only one stiffness matrix. The last step is the continuation technique [1,2]. The end of the branch j is the starting point of the next branch (j + 1).…”
Section: Local Parameterizations In the Anmmentioning
confidence: 99%