Choice of approximation bases used in computational functional algorithms for approximating probability densities for a given sample

DOI10.15372/SJNM20240202zbMATH Open1544.6502MaRDI QIDQ6572965FDOQ6572965

Authors: A. V. Vojtishek, N. K. Shlymbetov 

Publication date: 16 July 2024

Published in: Sibirskiĭ Zhurnal Vychislitel'noĭ Matematiki (Search for Journal in Brave)

Recommendations

• Conditional optimization of the functional computational kernel algorithm for approximating the probability density on the basis of a given sample
• Using the approximation functional bases in Monte Carlo methods
• Efficient numerical approximation of maximum entropy estimates
• Approximation schemes for functional optimization problems
• Approximating probability density functions and their convolutions using orthogonal polynomials

zbMATH Keywords

strang-fix approximationcomputational functional kernel algorithmcomputational functional projection algorithmcomputational nonparametric estimation of probability densityconditional optimization of computational functional algorithmsmulti-dimensional analogue of frequency polygonmulti-linear approximation

Mathematics Subject Classification ID

Computational methods for problems pertaining to probability theory (60-08) Monte Carlo methods (65C05)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Using the approximation functional bases in Monte Carlo methods
• Title not available (Why is that?)

This page was built for publication: Choice of approximation bases used in computational functional algorithms for approximating probability densities for a given sample

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