@article{10.1007/s10586-013-0312-5,
    abstract = "Voronin's Universality Theorem states grosso modo, that any non-vanishing analytic function can be uniformly approximated by certain shifts of the Riemann zeta-function ζ(s). However, the problem of obtaining a concrete approximants for a given function is computationally highly challenging. The present note deals with this problem, using a finite number n of factors taken from the Euler product definition of ζ(s). The main result of the present work is the design and implementation of a sequential and a parallel heuristic method for the computation of those approximants. The main properties of this method are: (i) the computation time grows quadratically as a function of the quotient n/m, where m is the number of coefficients calculated in one iteration of the heuristic; (ii) the error does not vary significantly as m changes and is similar to the error of the exact algorithm. © 2013 Springer Science+Business Media New York.",
    number = "2",
    year = "2014",
    title = "Heuristic quadratic approximation for the universality theorem",
    volume = "17",
    keywords = "Heuristic , Quadratic , Universality theorem",
    pages = "281-289",
    doi = "10.1007/s10586-013-0312-5",
    journal = "Cluster Computing",
    author = "Salinas, Luís C. and Plaza, Rafael and Hernández, Gonzalo"
}

{"_id":"jvsXZQ6wBSSxsZg89","bibbaseid":"salinas-plaza-hernndez-heuristicquadraticapproximationfortheuniversalitytheorem-2014","downloads":0,"creationDate":"2017-04-03T15:16:25.856Z","title":"Heuristic quadratic approximation for the universality theorem","author_short":["Salinas, L. C.","Plaza, R.","Hernández, G."],"year":2014,"bibtype":"article","biburl":"https://1fichier.com/?yjj84y68k0","bibdata":{"bibtype":"article","type":"article","abstract":"Voronin's Universality Theorem states grosso modo, that any non-vanishing analytic function can be uniformly approximated by certain shifts of the Riemann zeta-function ζ(s). However, the problem of obtaining a concrete approximants for a given function is computationally highly challenging. The present note deals with this problem, using a finite number n of factors taken from the Euler product definition of ζ(s). The main result of the present work is the design and implementation of a sequential and a parallel heuristic method for the computation of those approximants. The main properties of this method are: (i) the computation time grows quadratically as a function of the quotient n/m, where m is the number of coefficients calculated in one iteration of the heuristic; (ii) the error does not vary significantly as m changes and is similar to the error of the exact algorithm. © 2013 Springer Science+Business Media New York.","number":"2","year":"2014","title":"Heuristic quadratic approximation for the universality theorem","volume":"17","keywords":"Heuristic , Quadratic , Universality theorem","pages":"281-289","doi":"10.1007/s10586-013-0312-5","journal":"Cluster Computing","author":[{"propositions":[],"lastnames":["Salinas"],"firstnames":["Luís","C."],"suffixes":[]},{"propositions":[],"lastnames":["Plaza"],"firstnames":["Rafael"],"suffixes":[]},{"propositions":[],"lastnames":["Hernández"],"firstnames":["Gonzalo"],"suffixes":[]}],"bibtex":"@article{10.1007/s10586-013-0312-5,\n abstract = \"Voronin's Universality Theorem states grosso modo, that any non-vanishing analytic function can be uniformly approximated by certain shifts of the Riemann zeta-function ζ(s). However, the problem of obtaining a concrete approximants for a given function is computationally highly challenging. The present note deals with this problem, using a finite number n of factors taken from the Euler product definition of ζ(s). The main result of the present work is the design and implementation of a sequential and a parallel heuristic method for the computation of those approximants. The main properties of this method are: (i) the computation time grows quadratically as a function of the quotient n/m, where m is the number of coefficients calculated in one iteration of the heuristic; (ii) the error does not vary significantly as m changes and is similar to the error of the exact algorithm. © 2013 Springer Science+Business Media New York.\",\n number = \"2\",\n year = \"2014\",\n title = \"Heuristic quadratic approximation for the universality theorem\",\n volume = \"17\",\n keywords = \"Heuristic , Quadratic , Universality theorem\",\n pages = \"281-289\",\n doi = \"10.1007/s10586-013-0312-5\",\n journal = \"Cluster Computing\",\n author = \"Salinas, Luís C. and Plaza, Rafael and Hernández, Gonzalo\"\n}\n\n","author_short":["Salinas, L. C.","Plaza, R.","Hernández, G."],"key":"10.1007/s10586-013-0312-5","id":"10.1007/s10586-013-0312-5","bibbaseid":"salinas-plaza-hernndez-heuristicquadraticapproximationfortheuniversalitytheorem-2014","role":"author","urls":{},"keyword":["Heuristic","Quadratic","Universality theorem"],"downloads":0},"search_terms":["heuristic","quadratic","approximation","universality","theorem","salinas","plaza","hernández"],"keywords":["heuristic","quadratic","universality theorem"],"authorIDs":[],"dataSources":["mqyNxb9twi6rYAXFv"]}