搜索结果: 1-12 共查到“Fast computation”相关记录12条 . 查询时间(0.093 秒)
Fast computation of optimal contact forces
Calculation of point-contact friction model power optimization problem semidefinite programming
2015/8/10
We consider the problem of computing the smallest contact forces, with point-contact friction model, that can hold an object in equilibrium against a known external applied force and torque. It is kno...
FAST COMPUTATION OF PARTIAL FOURIER TRANSFORMS
fast Fourier transform multiscale decomposition butterfly algorithm fractional Fourier transform wave extrapolation
2015/7/14
This paper is concerned with the evaluation of the partial Fourier transform ux =|k| in one and two dimensions. The motivating application is the wave extrapolation procedure in ...
FAST COMPUTATION OF FOURIER INTEGRAL OPERATORS
Fourier integral operators generalized Radon transform separated representation nonuniform fast Fourier transform matrix approximation operator compression randomized algorithms reflection seismology
2015/7/14
We introduce a general purpose algorithm for rapidly computing certain types of oscillatory integrals which frequently arise in problems connected to wave propagation, general hyperbolic equations, an...
Fast Computation of Optimal Contact Forces
Convex optimization force closure friction cone grasp force interior-point method
2015/7/10
We consider the problem of computing the smallest contact forces, with point-contact friction model, that can hold an object in equilibrium against a known external applied force and torque. It is kno...
Fast Computation of Fourier Integral Operators
Fourier integral operators generalized Radon transform separated representation nonuniform fast Fourier transform matrix approximation operator compression randomized algorithms reflection seismology
2015/6/17
We introduce a general purpose algorithm for rapidly computing certain types of oscillatory integrals which frequently arise in problems connected to wave propagation and general hyperbolic equations....
Level set estimation from projection measurements: Performance guarantees and fast computation
estimation projection measurements Performance guarantees fast computation
2012/11/22
Estimation of the level set of a function (i.e., regions where the function exceeds some value) is an important problem with applications in digital elevation mapping, medical imaging, astronomy, etc....
Fast Computation of Common Left Multiples of Linear Ordinary Differential Operators
Algorithms complexity linear differential operators common left multiples
2013/9/3
We study tight bounds and fast algorithms for LCLMs of several linear differential operators with polynomial coefficients. We analyse the arithmetic complexity of existing algorithms for LCLMs, as wel...
The AEP algorithm for the fast computation of the distribution of the sum of dependent random variables
convolution istribution functions
2011/7/5
We propose a new algorithm to compute numerically the distribution function of the sum of $d$ dependent, non-negative random variables with given joint distribution.
The expansion in ultraspherical polynomials: a simple procedure for the fast computation of the ultraspherical coefficients
Ultraspherical expansions Gegenbauer coefficients Abel transform
2011/7/28
Abstract: We present a simple and fast algorithm for the computation of the coefficients of the expansion of a function f(cos u) in ultraspherical (Gegenbauer) polynomials. We prove that these coeffic...
Fast computation of multi-scale combustion systems
Fast computation multi-scale combustion systems
2010/11/23
In the present work, we illustrate the process of constructing a simplified model for complex
multi-scale combustion systems. To this end, reduced models of homogeneous ideal gas mixtures
of methane...
Fast computation of Tate pairing on general divisors of genus 3 hyperelliptic curves
Tate pairing hyperelliptic curves divisors resultant pairing-based cryptosystem
2008/11/12
For the Tate pairing computation over hyperelliptic curves, there are developments by Duursma-
Lee and Barreto et al., and those computations are focused on degenerate divisors.
Fast computation by block permanents of cumulative distribution functions of order statistics from several populations
block matrix computational complexity multiple comparison
2010/4/29
The joint cumulative distribution function for order statistics arising
from several different populations is given in terms of the distribution
function of the populations. The computational cost o...