On restricted derivative approximation
Zi-Xiao Yang, Bu-Xi Li (1990)
Compositio Mathematica
Similarity:
Zi-Xiao Yang, Bu-Xi Li (1990)
Compositio Mathematica
Similarity:
Albert Cohen (2009)
Bollettino dell'Unione Matematica Italiana
Similarity:
We discuss the performances of greedy algorithms for two problems of numerical approximation. The first one is the best approximation of an arbitrary function by an N-terms linear combination of simple functions adaptively picked within a large dictionary. The second one is the approximation of an arbitrary function by a piecewise polynomial function on an optimally adapted triangulation of cardinality N. Performance is measured in terms of convergence rate with respect to the number...
Yann Bugeaud, Carlos Gustavo Moreira (2011)
Acta Arithmetica
Similarity:
Tulsi Dass Narang (1986)
Archivum Mathematicum
Similarity:
N. K. Basu (1971)
Applicationes Mathematicae
Similarity:
Popov, Vasil (2002)
Serdica Mathematical Journal
Similarity:
Bibliography of the research publications of Vasil Atanasov Popov
Kyurkchiev, Nikolay, Markov, Svetoslav (2015)
Serdica Journal of Computing
Similarity:
We introduce a modification of the familiar cut function by replacing the linear part in its definition by a polynomial of degree p + 1 obtaining thus a sigmoid function called generalized cut function of degree p + 1 (GCFP). We then study the uniform approximation of the (GCFP) by smooth sigmoid functions such as the logistic and the shifted logistic functions. The limiting case of the interval-valued Heaviside step function is also discussed which imposes the use of Hausdorff metric....
Fernando Cobos (1988)
Colloquium Mathematicae
Similarity:
Ricardo Faro Rivas (1986)
Extracta Mathematicae
Similarity:
J. Prasad (1972)
Publications de l'Institut Mathématique [Elektronische Ressource]
Similarity: