Derivation of the Strutinsky method from the least squares principle
B. Mohammed-Azizi

TL;DR
This paper rigorously derives the Strutinsky method from the least squares principle, providing detailed mathematical foundations and clarifying its interpretation as a polynomial moving average of the semi-classical level density.
Contribution
It establishes the mathematical basis of the Strutinsky method from the least squares principle, including detailed formulas and properties of averaging functions.
Findings
Strutinsky method is a polynomial moving average under certain conditions.
Mathematical properties of averaging functions are thoroughly analyzed.
Formulas are clarified with complete demonstrations.
Abstract
The main purpose of this paper is to rigorously establish the Strutinsky method from the least squares principle. Thus, it is the mathematical basis of this method (aspect often neglected) which is revisited in an extensive way. Some formulas previously given without demonstration or in a simplified way are set out here with all the details. In this respect, the most important mathematical properties of the averaging functions are also established in this paper. When some conditions are met, it turns out that Strutinsky's method is nothing more than a polynomial moving average of the semi-classical level density.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsIterative Methods for Nonlinear Equations · Matrix Theory and Algorithms · Mathematical functions and polynomials
