This is an early access version, the complete PDF, HTML, and XML versions will be available soon.
Open AccessFeature PaperArticle
Efficient Evaluation of Sobol’ Sensitivity Indices via Polynomial Lattice Rules and Modified Sobol’ Sequences
by
Venelin Todorov
Venelin Todorov 1,2,*
and
Petar Zhivkov
Petar Zhivkov 1
1
Institute of Information and Communication Technologies, Bulgarian Academy of Sciences, Acad. G. Bonchev Str. Bl. 25A, 1113 Sofia, Bulgaria
2
Centre of Excellence in Informatics and Information and Communication Technologies, Acad. G. Bonchev Str. Bl. 25A, 1113 Sofia, Bulgaria
*
Author to whom correspondence should be addressed.
Mathematics 2025, 13(21), 3402; https://doi.org/10.3390/math13213402 (registering DOI)
Submission received: 11 September 2025
/
Revised: 16 October 2025
/
Accepted: 21 October 2025
/
Published: 25 October 2025
Abstract
Accurate and efficient estimation of Sobol’ sensitivity indices is a cornerstone of variance-based global sensitivity analysis, providing critical insights into how uncertainties in input parameters affect model outputs. This is particularly important for large-scale environmental, engineering, and financial models, where understanding parameter influence is essential for improving model reliability, guiding calibration, and supporting informed decision-making. However, computing Sobol’ indices requires evaluating high-dimensional integrals, presenting significant numerical and computational challenges. In this study, we present a comparative analysis of two of the best available Quasi-Monte Carlo (QMC) techniques: polynomial lattice rules (PLRs) and modified Sobol’ sequences. The performance of both approaches is systematically assessed in terms of performance and accuracy. Extensive numerical experiments demonstrate that the proposed PLR-based framework achieves superior precision for several sensitivity measures, while modified Sobol’ sequences remain competitive for lower-dimensional indices. Our results show that IPLR-α3 outperforms traditional QMC methods in estimating both dominant and weak sensitivity indices, offering a robust framework for high-dimensional models. These findings provide practical guidelines for selecting optimal QMC strategies, contributing to more reliable sensitivity analysis and enhancing the predictive power of complex computational models.
Share and Cite
MDPI and ACS Style
Todorov, V.; Zhivkov, P.
Efficient Evaluation of Sobol’ Sensitivity Indices via Polynomial Lattice Rules and Modified Sobol’ Sequences. Mathematics 2025, 13, 3402.
https://doi.org/10.3390/math13213402
AMA Style
Todorov V, Zhivkov P.
Efficient Evaluation of Sobol’ Sensitivity Indices via Polynomial Lattice Rules and Modified Sobol’ Sequences. Mathematics. 2025; 13(21):3402.
https://doi.org/10.3390/math13213402
Chicago/Turabian Style
Todorov, Venelin, and Petar Zhivkov.
2025. "Efficient Evaluation of Sobol’ Sensitivity Indices via Polynomial Lattice Rules and Modified Sobol’ Sequences" Mathematics 13, no. 21: 3402.
https://doi.org/10.3390/math13213402
APA Style
Todorov, V., & Zhivkov, P.
(2025). Efficient Evaluation of Sobol’ Sensitivity Indices via Polynomial Lattice Rules and Modified Sobol’ Sequences. Mathematics, 13(21), 3402.
https://doi.org/10.3390/math13213402
Note that from the first issue of 2016, this journal uses article numbers instead of page numbers. See further details
here.
Article Metrics
Article Access Statistics
For more information on the journal statistics, click
here.
Multiple requests from the same IP address are counted as one view.