pm_mathLogSumExp Module Reference

This module contains the procedures and interfaces for computing the natural logarithm of the sum of exponentials the elements of an array. More...

Data Types
interface	getLogSumExp
	Generate and return the natural logarithm of the sum of the exponential of the input array robustly (without numerical overflow). More...

Variables
character(*, SK), parameter	MODULE_NAME = "@pm_mathLogSumExp"

Detailed Description

This module contains the procedures and interfaces for computing the natural logarithm of the sum of exponentials the elements of an array.

See also

getLog1p
get1mexp
getMinMax
setMinMax
getLogAddExp
getLogSubExp
getLogSumExp

Test:

test_pm_mathLogSumExp

Final Remarks ⛓

---

If you believe this algorithm or its documentation can be improved, we appreciate your contribution and help to edit this page's documentation and source file on GitHub.
For details on the naming abbreviations, see this page.
For details on the naming conventions, see this page.
This software is distributed under the MIT license with additional terms outlined below.

1. If you use any parts or concepts from this library to any extent, please acknowledge the usage by citing the relevant publications of the ParaMonte library.
   
2. If you regenerate any parts/ideas from this library in a programming environment other than those currently supported by this ParaMonte library (i.e., other than C, C++, Fortran, MATLAB, Python, R), please also ask the end users to cite this original ParaMonte library.
   

This software is available to the public under a highly permissive license.
Help us justify its continued development and maintenance by acknowledging its benefit to society, distributing it, and contributing to it.

Copyright

Computational Data Science Lab

Author:

Fatemeh Bagheri, Thursday 12:45 AM, August 20, 2021, Dallas, TX

Variable Documentation

MODULE_NAME

character(*, SK), parameter pm_mathLogSumExp::MODULE_NAME = "@pm_mathLogSumExp"

Definition at line 46 of file pm_mathLogSumExp.F90.