搜索结果: 1-15 共查到“数学 fast”相关记录83条 . 查询时间(0.092 秒)
Academy of Mathematics and Systems Science, CAS Colloquia & Seminars：Bubbling and extinction for some fast diffusion equations in bounded domains
有界域 快速扩散方程 气泡 消光
2023/11/13
Motivated by the Wisconsin octupole experiments on anomalous diffusion of hydrogen plasma across a purely poloidal octupole magnetic field, Berryman-Holland 1980 proved the stability of separable solu...
Academy of Mathematics and Systems Science, CAS Colloquia & Seminars：Fast Numerical Evaluation of Generalized Todd Polynomials
广义托德多项式 的快速数值 评估
2023/4/23
Fast Numerical Evaluation of Generalized Todd Polynomials.
Fast Algorithms for Signal Reconstruction without Phase
Frames mutually unbiased bases equiangular frames projective 2-designs discrete chirps
2015/9/29
We derive fast algorithms for doing signal reconstruction without phase. This type of problem is important insignal processing, especially speech recognition technology, and has relevance for state to...
Generic fast diffusion for a class of non-convex Hamiltonians with two degrees of freedom
fast diffusion non-convex Hamiltonians two degrees of freedom
2015/9/25
In this paper, we study small perturbations of a class of non-convex integrable Hamiltonians with two degrees offreedom, and we prove a result of diffusion for an open and dense set of perturbations, ...
The task of constructing higher-dimensional invariant manifolds for dynamical systems can
be computationally expensive. We demonstrate that this problem can be locally reduced to
solving a system of...
Near-Optimal Detection of Geometric Objects by Fast Multiscale Methods
Fast Multiscale Methods Geometric Objects
2015/8/21
We construct detectors for ‘geometric’ objects in noisy data. Examples include a detector
for presence of a line segment of unknown length, position, and orientation in two-dimensional
image data wi...
Fast X-Ray and Beamlet Transforms for Three-Dimensional Data
Three-Dimensional Data 3-D Volumetric (Raster-Scan) Dat
2015/8/21
Three-dimensional volumetric data are becoming increasingly available
in a wide range of scientific and technical disciplines. With the right tools,
we can expect such data to yield valuable i...
Fast Slant Stack: A notion of Radon Transform for Data in a Cartesian Grid which is Rapidly Computible, Algebraically Exact, Geometrically Faithful and Invertible
Radon Transform Projection-slice theorem Sinc-Interpolation,
2015/8/21
We define a notion of Radon Transform for data in an n by n grid. It is based on summation
along lines of absolute slope less than 1 (as a function either of x or of y), with values at non-Cart...
Fast Solution of `1-norm Minimization Problems When the Solution May be Sparse
LASSO. LARS Homotopy Methods Basis Pursuit.
2015/8/21
The minimum `1-norm solution to an underdetermined system of linear equations y = Ax,
is often, remarkably, also the sparsest solution to that system. This sparsity-seeking property
is of interest i...
OPTIMAL AND FAST DETECTION OF SPATIAL CLUSTERS WITH SCAN STATISTICS
SPATIAL CLUSTERS SCAN STATISTICS
2015/8/20
We consider the detection of multivariate spatial clusters in the Bernoulli
model with N locations, where the design distribution has weakly dependent
marginals. The locations are scanned with a rec...
FAST GROWTH IN THE FOLNER FUNCTION FOR THOMPSON’S GROUP F
FAST GROWTH FOLNER FUNCTION THOMPSON’S GROUP F
2015/8/17
The purpose of this note is to prove a lower bound on the growth of Følner functions for Thompson’s group F . Specifically I will prove that, for any finite generating set Γ ⊆ F , there is ...
We give an algorithm that computes the final state of certain growth models without computing all intermediate states. Our technique is based on a “least action principle” which characterizes the odom...
Designing fast distributed iterations via semidefinite programming
Iteration markov chain the transition probability mixing ratio the monte carlo markov chain
2015/8/11
The general setting we consider involves a process, iteration, or method in which the computation or communication at each step is local, determined by a given graph, and involves some parameters or c...
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 evaluation of quadratic control-Lyapunov policy
Quadratic lyapunov function quadratic programming the solution and optimization method computationally intensive control application
2015/8/7
The evaluation of a control-Lyapunov policy, with quadratic Lyapunov function, requires the solution of a quadratic program (QP) at each time step. For small problems this QP can be solved explicitly;...