Related papers: An Introduction to Smooth Infinitesimal Analysis
A new method is presented for calculation of the shell correction with the inclusion of the continuum part of the spectrum. The smoothing function used has a finite energy range in contrast to the Gaussian shape of the Strutinski method.…
This note deals with the direct and inverse spectral analysis for a class of infinite band symmetric matrices. This class corresponds to operators arising from difference quations with usual and inner boundary conditions. We give a…
We study connected sum at infinity on smooth, open manifolds. This operation requires a choice of proper ray in each manifold summand. In favorable circumstances, the connected sum at infinity operation is independent of ray choices. For…
An algorithmic method to exploit a general class of infinitesimal symmetries for reducing stochastic differential equations is presented and a natural definition of reconstruction, inspired by the classical reconstruction by quadratures, is…
We introduce proper display calculi for intuitionistic, bi-intuitionistic and classical linear logics with exponentials, which are sound, complete, conservative, and enjoy cut-elimination and subformula property. Based on the same design,…
We consider the problem of estimating an additive regression function in an inverse regres- sion model with a convolution type operator. A smooth backfitting procedure is developed and asymptotic normality of the resulting estimator is…
We introduce a new method, combination of random testing and abstract interpretation, for the analysis of programs featuring both probabilistic and non-probabilistic nondeterminism. After introducing "ordinary" testing, we show how to…
In this paper, we present a new smoothing approach to solve general nonlinear complementarity problems. Under the $P_0$ condition on the original problems, we prove some existence and convergence results . We also present an error estimate…
We define a solvable extension of the graph 2-step nilpotent Lie algebras of [5] by adding elements corresponding to the 3-cliques of the graph. We study some of their basic properties and we prove that two such Lie algebras are isomorphic…
Approximate Bayesian Computation (ABC) can be viewed as an analytic approximation of an intractable likelihood coupled with an elementary simulation step. Such a view, combined with a suitable instrumental prior distribution permits…
This article presents a Bayesian inferential method where the likelihood for a model is unknown but where data can easily be simulated from the model. We discretize simulated (continuous) data to estimate the implicit likelihood in a…
We describe some new univariate spline quasi-interpolants on uniform partitions of bounded intervals. Then we give some applications to numerical analysis: integration, differentiation and approximation of zeros.
This is a brief tutorial on the least square estimation technique that is straightforward yet effective for parameter estimation. The tutorial is focused on the linear LSEs instead of nonlinear versions, since most nonlinear LSEs can be…
We discuss alternative iteration methods for differential equations. We provide a convergence proof for exactly solvable examples and show more convenient formulas for nontrivial problems.
We study infinitesimal semi-simple extrinsic symmetric spaces and give a classification in the symplectic case.
Soft linear logic ([Lafont02]) is a subsystem of linear logic characterizing the class PTIME. We introduce Soft lambda-calculus as a calculus typable in the intuitionistic and affine variant of this logic. We prove that the (untyped) terms…
The paper revisits the classical problem of evaluating $f(A)$ for a real function $f$ and a matrix $A$ with real spectrum. The evaluation is based on expanding $f$ in Chebyshev polynomials, and the focus of the paper is to study the…
Computing occluding contours is a key building block of non-photorealistic rendering, but producing contours with consistent visibility has been notoriously challenging. This paper describes the first general-purpose smooth surface…
Infinitesimal contraction analysis provides exponential convergence rates between arbitrary pairs of trajectories of a system by studying the system's linearization. An essentially equivalent viewpoint arises through stability analysis of a…
An algorithm for computing an analytic function of a matrix $A$ is described. The algorithm is intended for the case where $A$ has some close eigenvalues, and clusters (subsets) of close eigenvalues are separated from each other. This…