Efficient computation of erfc(x) for large arguments

DOI10.1109/26.843116MaRDI QIDQ2732977zbMATH OpenOpenAlexFDO

Authors C. Tellambura, A. Annamalai

Publication date 2 December 2001

Published in IEEE Transactions on Communications (Search for Journal in Brave)

Full work available at URL https://semanticscholar.org/paper/64306133b68cb18d9951cf402d90f5fb7ab62f7c

zbMATH Keywords

error functionerror boundnumerical methodsFourier analysiscomparison of methodserror probabilitysampling theoreminfinite series representation

Mathematics Subject Classification ID

Computation of special functions and constants, construction of tables (65D20) Incomplete beta and gamma functions (error functions, probability integral, Fresnel integrals) (33B20) Numerical approximation and evaluation of special functions (33F05)

Recommendations

• The functions erf and erfc computed with arbitrary precision and explicit error bounds
• More efficient computation of the complex error function
• A method for evaluation of the error function of real and complex variable with high relative accuracy
• Computation of the Complex Error Function
• Uniform convergent expansions of the error function in terms of elementary functions

Cited in

(5)

• Proposal of simple and accurate two-parametric approximation for the \(Q\)-function
• Various results for series expansions of the error functions with the complex variable and some of their implications
• The functions erf and erfc computed with arbitrary precision and explicit error bounds
• Highly accurate analytic approximation to the Gaussian \(Q\)-function based on the use of nonlinear least squares optimization algorithm
• Performance evaluation for PCC-OFDM systems impaired by carrier frequency offset over AWGN channels

This page was built for publication: Efficient computation of erfc(\(x\)) for large arguments

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2732977)