Integration by differentiation: new proofs, methods and examples
نویسندگان
چکیده
منابع مشابه
Towards Animation of Proofs {testing proofs by examples{
In this paper, we introduce the notion of proof animation. It is a new application of the principle of \Curry-Howard isomorphism" to formal proof developments. Logically, proof animation is merely a contrapositive of \proofs as programs," which is an application of Curry-Howard isomorphism to formal program developments. Nonetheless, the new viewpoint totally changes the scene. The motivation, ...
متن کاملNew Iterative Methods for Interpolation, Numerical Differentiation and Numerical Integration
Through introducing a new iterative formula for divided difference using Neville's and Aitken's algorithms, we study new iterative methods for interpolation, numerical differentiation and numerical integration formulas with arbitrary order of accuracy for evenly or unevenly spaced data. Basic computer algorithms for new methods are given.
متن کاملMean-variance hedging for continuous processes: New proofs and examples
Let X be a special semimartingale of the form X = X0 + M + ∫ d〈M〉 λ̂, denote by K̂ = ∫ λ̂ d〈M〉 λ̂ the mean-variance tradeoff process of X and by Θ the space of predictable processes θ for which the stochastic integral G(θ) = ∫ θdX is a square-integrable semimartingale. For a given constant c ∈ IR and a given square-integrable random variable H, the mean-variance optimal hedging strategy ξ minimizes...
متن کاملon the comparison of keyword and semantic-context methods of learning new vocabulary meaning
the rationale behind the present study is that particular learning strategies produce more effective results when applied together. the present study tried to investigate the efficiency of the semantic-context strategy alone with a technique called, keyword method. to clarify the point, the current study seeked to find answer to the following question: are the keyword and semantic-context metho...
15 صفحه اولFinding Counter Examples in Induction Proofs
This paper addresses a problem arising in automated proof of invariants of transition systems, for example transition systems modelling distributed programs. Most of the time, the actual properties we want to prove are too weak to hold inductively, and auxiliary invariants need to be introduced. The problem is how to find these extra invariants. We propose a method where we find minimal counter...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Physics A: Mathematical and Theoretical
سال: 2017
ISSN: 1751-8113,1751-8121
DOI: 10.1088/1751-8121/aa6f32