English
Related papers

Related papers: The Intuitive Logarithm

200 papers

Let X be a separable Banach space which admits a separating polynomial; in particular X a separable Hilbert space. Let $f:X \rightarrow R$ be bounded, Lipschitz, and $C^1$ with uniformly continuous derivative. Then for each {\epsilon}>0,…

Functional Analysis · Mathematics 2010-11-23 D. Azagra , R. Fry , L. Keener

We present a new method for approximating real-valued functions on ${\mathbb R}^+$ by linear combinations of exponential functions with complex coefficients. The approach is based on a multi-point Pad\'e approximation of the Laplace…

Numerical Analysis · Mathematics 2026-05-05 Alexey Kuznetsov , Armin Mohammadioroojeh

We investigate smooth approximations of functions, with prescribed gradient behavior on a distinguished stratified subset of the domain. As an application, we outline how our results yield important consequences for a recently introduced…

Classical Analysis and ODEs · Mathematics 2015-07-21 D. Drusvyatskiy , M. Larsson

Approximate Bayesian Computation (ABC) methods are applicable to statistical models specified by generative processes with analytically intractable likelihoods. These methods try to approximate the posterior density of a model parameter by…

Methodology · Statistics 2024-03-11 Sanjay Chaudhuri , Subhroshekhar Ghosh , Kim Cuc Pham

First we recall the notion of conxity and log-convexity for real-valued. Then we generalize the trick used by Artin in his famous paper on the Gamma function to find log-convex solutions to the functional equations f(x+1)=g(x)f(x). This…

Classical Analysis and ODEs · Mathematics 2014-08-29 Martin Himmel

We present a new algorithm for reconstructing an exact algebraic number from its approximate value using an improved parameterized integer relation construction method. Our result is consistent with the existence of error controlling on…

Computational Complexity · Computer Science 2009-02-06 Xiaolin Qin , Yong Feng , Jingwei Chen , Jingzhong Zhang

With help of a compact Prolog-based theorem prover for Intuitionistic Propositional Logic, we synthesize minimal assumptions under which a given formula formula becomes a theorem. After applying our synthesis algorithm to cover basic…

Logic in Computer Science · Computer Science 2022-05-13 Paul Tarau

This manuscript proposes a probabilistic framework for algorithms that iteratively solve unconstrained linear problems $Bx = b$ with positive definite $B$ for $x$. The goal is to replace the point estimates returned by existing methods with…

Optimization and Control · Mathematics 2014-10-16 Philipp Hennig

We propose a novel use of a recent new computational tool for Bayesian inference, namely the Approximate Bayesian Computation (ABC) methodology. ABC is a way to handle models for which the likelihood function may be intractable or even…

Computation · Statistics 2014-03-04 Clara Grazian , Brunero Liseo

Often, when solving forward, inverse or data assimilation problems, only a part of the solution is needed. As a model, we consider the stationary diffusion problem. We demonstrate an algorithm that can compute only a part or a functional of…

Numerical Analysis · Mathematics 2020-08-06 Alexander Litvinenko

A variety of problems emerged investigating electronic circuits, computer devices and cellular automata motivated a number of attempts to create a differential and integral calculus for Boolean functions. In the present article, we extend…

Logic · Mathematics 2016-08-17 Eduardo Mizraji

We consider the problem of explaining the predictions of an arbitrary blackbox model $f$: given query access to $f$ and an instance $x$, output a small set of $x$'s features that in conjunction essentially determines $f(x)$. We design an…

Machine Learning · Computer Science 2021-11-03 Guy Blanc , Jane Lange , Li-Yang Tan

This work contributes to the theory of judgment aggregation by discussing a number of significant non-classical logics. After adapting the standard framework of judgment aggregation to cope with non-classical logics, we discuss in…

Logic in Computer Science · Computer Science 2017-11-13 Daniele Porello

The search for the Higgs boson and for physics beyond the Standard Model are the major motivations behind the LHC experiment. In many scenarios the success of the experiment depends on the knowledge of signal and background event rates at…

High Energy Physics - Phenomenology · Physics 2009-04-03 Thomas Reiter

We derive approximation algorithms for the nonnegative matrix factorization problem, i.e. the problem of factorizing a matrix as the product of two matrices with nonnegative coefficients. We form convex approximations of this problem which…

Optimization and Control · Mathematics 2012-07-03 Vijay Krishnamurthy , Alexandre d'Aspremont

System F, the polymorphic lambda calculus, features the principle of impredicativity: polymorphic types may be (explicitly) instantiated at other types, enabling many powerful idioms such as Church encoding and data abstraction.…

Programming Languages · Computer Science 2022-03-04 Henry Mercer , Cameron Ramsay , Neel Krishnaswami

We compute the nonlinearity of Boolean functions with Groebner basis techniques, providing two algorithms: one over the binary field and the other over the rationals. We also estimate their complexity. Then we show how to improve our…

Information Theory · Computer Science 2014-04-11 E. Bellini , I. Simonetti , M. Sala

Bayesian methods have proved powerful in many applications for the inference of model parameters from data. These methods are based on Bayes' theorem, which itself is deceptively simple. However, in practice the computations required are…

Methodology · Statistics 2020-07-10 Michael A. Chappell , Mark W. Woolrich

We introduce a symbolic method for the evaluation of definite integrals containing combinations of various functions, including exponentials, logarithm and products of Bessel functions of different types. The method we develop is naturally…

Classical Analysis and ODEs · Mathematics 2011-11-04 D. Babusci , G. Dattoli

We consider the task of approximating a matrix function $f(A)$, where $A$ is a matrix in which only a relatively small number of (not necessarily consecutive) sub- and superdiagonals contain nonzero entries. Approximating $f$ by a…

Numerical Analysis · Mathematics 2025-12-09 Majed Hamadi , Nezam Mahdavi-Amiri , Marcel Schweitzer
‹ Prev 1 3 4 5 6 7 10 Next ›