2015
DOI: 10.1007/s00397-015-0880-9
|View full text |Cite
|
Sign up to set email alerts
|

An error-minimizing approach to inverse Langevin approximations

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

1
42
0

Year Published

2016
2016
2022
2022

Publication Types

Select...
6
1

Relationship

0
7

Authors

Journals

citations
Cited by 27 publications
(43 citation statements)
references
References 26 publications
1
42
0
Order By: Relevance
“…In Figure 4 it can be observed that all approximants employ similar computational times, except the Nguessong et al [17] and the Marchi and Arruda [18] approximants. The reason seems to be that the efficiency of power products with integer exponents is about four times better than those using real exponents, as it can easily be checked in Matlab.…”
Section: Computational Efficiencymentioning
confidence: 86%
See 2 more Smart Citations
“…In Figure 4 it can be observed that all approximants employ similar computational times, except the Nguessong et al [17] and the Marchi and Arruda [18] approximants. The reason seems to be that the efficiency of power products with integer exponents is about four times better than those using real exponents, as it can easily be checked in Matlab.…”
Section: Computational Efficiencymentioning
confidence: 86%
“…However, we consider that the error spectrum in the full domain gives a better picture because as seen below, achievable machine errors are also different in different parts of the domain. In Figure 2 we show a comparison of the present proposal using n = 10 5 and x r = 0.98 with the approximants of Kröger [2], Petrosyan [19], Nguessong et al [17], Marchi and Arruda [18], and Jedynak [11]. The formulae used for these approximants are given in the references and in the code in Appendix B.…”
Section: Load-type Accuracymentioning
confidence: 99%
See 1 more Smart Citation
“…This high accuracy will be at the cost of the simplicity of the expression. Such accurate approximations, with more than one correction steps, have been obtained for the invers Langevin function previously 31,32 .…”
Section: Appendixmentioning
confidence: 96%
“…Cohen (1991) derived an approximation based upon a [3/2] Padé approximant of the inverse Langevin function which has been widely used and is fairly accurate over the whole domain of definition. Many more accurate approximations have been devised, see for example, Treloar (1975), Puso (1994), Nguessong et al (2014), Darabi & Itskov (2015), Kröger (2015), Marchi & Arruda (2015), Rickaby & Scott (2015) and Jedynak (2015Jedynak ( , 2017. However, rather than finding further approximations to the inverse Langevin function, we emphasize in this paper how to find the approximate positions of its singularities in the complex plane.…”
Section: Introductionmentioning
confidence: 99%