Results 1 - 10
of
8,802
Chains of Recurrences - a method to expedite the evaluation of closed-form functions
- In International Symposium on Symbolic and Algebraic Computing
, 1994
"... Chains of Recurrences (CR's) are introduced as an effective method to evaluate functions at regular intervals. Algebraic properties of CR's are examined and an algorithm that constructs a CR for a given function is explained. Finally, an implementation of the method in MAXIMA/Common Lisp i ..."
Abstract
-
Cited by 39 (7 self)
- Add to MetaCart
is discussed. 1 Introduction Given a closed-form function G(x), a common computational task is to evaluate the function at a number of points in an interval. More precisely, given a starting point x0 and an increment h, the task is to compute G(x0 + ih) for i = 0; 1; : : : ; n \Gamma 1. Such computations
Chains of Recurrences - a method to expedite the evaluation of closed-form functions
- In International Symposium on Symbolic and Algebraic Computing
, 1994
"... Chains of Recurrences (CR's) are introduced as an effective method to evaluate functions at regular intervals. Algebraic properties of CR's are examined and an algorithm that constructs a CR for a given function is explained. Finally, an implementation of the method in MAXIMA/Common Lisp i ..."
Abstract
- Add to MetaCart
is discussed. 1 Introduction Given a closed-form function G(x), a common computational task is to evaluate the function at a number of points in an interval. More precisely, given a starting point x0 and an increment h, the task is to compute G(x0 + ih) for i = 0; 1; : : : ; n \Gamma 1. Such computations
Sums of Closed Form Functions Satisfy Recurrence Relations
, 1991
"... We give a short, self-contained proof of the fact that sums of closed form (hypergeometric) functions satisfy recurrence relations with polynomial coefficients. We obtain explicit bounds for the order of the recurrence and for the degrees of the coefficient polynomials directly from the form of the ..."
Abstract
-
Cited by 2 (0 self)
- Add to MetaCart
We give a short, self-contained proof of the fact that sums of closed form (hypergeometric) functions satisfy recurrence relations with polynomial coefficients. We obtain explicit bounds for the order of the recurrence and for the degrees of the coefficient polynomials directly from the form
A closed-form solution for options with stochastic volatility with applications to bond and currency options
- Review of Financial Studies
, 1993
"... I use a new technique to derive a closed-form solution for the price of a European call option on an asset with stochastic volatility. The model allows arbitrary correlation between volatility and spotasset returns. I introduce stochastic interest rates and show how to apply the model to bond option ..."
Abstract
-
Cited by 1512 (6 self)
- Add to MetaCart
I use a new technique to derive a closed-form solution for the price of a European call option on an asset with stochastic volatility. The model allows arbitrary correlation between volatility and spotasset returns. I introduce stochastic interest rates and show how to apply the model to bond
I-COLLIDE: An interactive and exact collision detection system for large-scale environments
- In Proc. of ACM Interactive 3D Graphics Conference
, 1995
"... We present an exact and interactive collision detection system, I-COLLIDE, for large-scale environments. Such environments are characterized by the number of objects undergoing rigid motion and the complexity of the mod-els. The algorithm does not assume the objects ’ motions can be expressed as a c ..."
Abstract
-
Cited by 322 (24 self)
- Add to MetaCart
closed form function of time. The collision detection system is general and can be easily in-terfaced with a variety of applications. The algorithm uses a two-level approach based on pruning multiple-object pairs using bounding boxes and performing exact collision detection between selected pairs
A Closed-Form Solution to Natural Image Matting
- IEEE TRANS. PAMI
, 2008
"... Interactive digital matting, the process of extracting a foreground object from an image based on limited user input, is an important task in image and video editing. From a computer vision perspective, this task is extremely challenging because it is massively ill-posed—at each pixel we must estim ..."
Abstract
-
Cited by 136 (2 self)
- Add to MetaCart
, or perform iterative nonlinear estimation by alternating foreground and background color estimation with alpha estimation. In this paper, we present a closed-form solution to natural image matting. We derive a cost function from local smoothness assumptions on foreground and background colors and show
Closed-Form Specified-Fuel Commands for On–Off Thrusters
"... A procedure is presented for generating on–off thruster commands for rest-to-rest slewing of flexible systems. The command profiles induce a low level of residual vibration and can be designed to use any desired amount of thruster fuel. A key advantage of the proposed method is that the commands are ..."
Abstract
- Add to MetaCart
are described by closed-form functions of the system parameters and the desired move distance. Performance measures such as maneuver speed, maximum transient deflection, and robustness to modeling errors indicate that the commands are attractive alternatives to time/fuel optimal commands that must be determined
Closed-form likelihood expansions for multivariate diffusions
, 2008
"... This paper provides closed-form expansions for the log-likelihood function of multivariate diffusions sampled at discrete time intervals. The coefficients of the expansion are calculated explicitly by exploiting the special structure afforded by the diffusion model. Examples of interest in financial ..."
Abstract
-
Cited by 109 (3 self)
- Add to MetaCart
This paper provides closed-form expansions for the log-likelihood function of multivariate diffusions sampled at discrete time intervals. The coefficients of the expansion are calculated explicitly by exploiting the special structure afforded by the diffusion model. Examples of interest
Closed-form upper bounds in . . .
, 2011
"... The classical approach to automatic cost analysis consists of two phases. Given a program and some measure of cost, the analysis first produces cost relations (CRs), i.e., recursive equations which capture the cost of the program in terms of the size of its input data. Second, CRs are converted in ..."
Abstract
- Add to MetaCart
into closed-form, i.e., without recurrences. Whereas the first phase has received considerable attention, with a number of cost analyses available for a variety of programming languages, the second phase has been comparatively less studied. This article presents, to our knowledge, the first practical
A note on the closed-form identification of regression models with a mismeasured binary regressor.
- Statistics and Probability Letters
, 2008
"... Abstract This note considers the identification of a nonparametric regression model with an unobserved 0-1 dichotomous regressor. The sample consists of a dependent variable and a 0-1 dichotomous proxy of the unobserved regressor. We obtain nonparametric identification of every element in the model ..."
Abstract
-
Cited by 2 (0 self)
- Add to MetaCart
in the model as a closed-form function of the observed moments or densities. Our identification strategy does not require any additional sample information, such as instrumental variables or a secondary sample. The closedform solution may be used to construct estimators of the unknowns.
Results 1 - 10
of
8,802