Abstract
The problem of weighting a general n variables mean is solved by using a class of algorithms which involve iterated subdivisions (triangulations) of the $$\left( n-1\right) $$ -simplex $$\Delta _{n-1}$$ . The instance based on the barycentric subdivision is treated at length, while a more sketchy presentation is given to the algorithm based on the Freudenthal triangulation. Generalizing the weightings of 2 variables means based on Aczel iterations, the resulting weighting procedures turn out to be continuous and scale invariant, being geometric the rate of convergence of the algorithms on the class of scaled uniformly internal means.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.