搜索结果: 61-75 共查到“数学 computing”相关记录95条 . 查询时间(0.392 秒)
Computing the $\sin_{p}$ function via the inverse power method
Computing the $\sin_{p}$ function the inverse power method
font style='font-size:12px;'>
2010/11/22
In this paper, we discuss a new iterative method for computing $\sin_{p}$. This function was introduced by Lindqvist in connection with the unidimensional nonlinear Dirichlet eigenvalue problem for t...
Computing invariants via slicing groupoids: Gel'fand MacPherson, Gale and positive characteristic stable maps
Computing invariants via slicing groupoids Gel'fand MacPherson
font style='font-size:12px;'>
2010/11/22
We offer a groupoid-theoretic approach to computing invariants. We illustrate this approach by describing the Gel'fand-MacPherson correspondence and the Gale transform as well as giving Zariski-local...
A Distributed Procedure for Computing Stochastic Expansions with Mathematica
Rough paths；Iterated Integrals；Stochastic Expansions
font style='font-size:12px;'>
2010/12/14
The solution of a (stochastic) di erential equation can be locally approxi-mated by a (stochastic) expansion. If the vector eld of the di erential equation is a polynomial, the corresponding expansio...
Interior Point Methods for Computing Optimal Designs
Optimal design A-criterion c-criterion D-criterion E-criterion pth mean criterion
font style='font-size:12px;'>
2010/12/15
In this paper we study interior point (IP) methods for solving optimal design problems. In
particular, we propose a primal IP method for solving the problems with general convex optimality criteria a...
An Algorithm for Computing the Ratliff-Rush Closure
Algorithm Computing the Ratliff-Rush Closure
font style='font-size:12px;'>
2010/11/30
Let I ⊂ K[x, y] be a hx, yi-primary monomial ideal where K is a field. This paper produces an algorithm for computing the Ratliff-Rush closure eI for the ideal I =hm0, . . . ,mni whenever mi is ...
Computing the time-continuous Optimal Mass Transport Problem without Lagrangian techniques
AMS Classification 35F40 35L85 35R05 62-99
font style='font-size:12px;'>
2010/12/8
This work originates from a heart’s images tracking which is to generate an apparent continuous motion, observable through intensity variation from one starting image to an ending one both supposed se...
DGMRES method augmented with eigenvectors for computing the Drazin-inverse solution of singular linear systems
Drazin-inverse DGMRES Krylov subspace Itera-tive method Eigenvector
font style='font-size:12px;'>
2010/12/10
The DGMRES method for solving Drazin-inverse solution of sin-gular linear systems is generally used with restarting. But the restarting often slows down the convergence and DGMRES often stagnates.
COMPUTING TOP INTERSECTIONS IN THE TAUTOLOGICAL RING OF Mg
COMPUTING TOP INTERSECTIONS TAUTOLOGICAL RING OF Mg
font style='font-size:12px;'>
2018/4/19
We derive effective recursion formulae of top intersections in the tautological ring R(Mg) of the moduli space of curves of genus g 2. As an application, we prove a convolutiontype tautological rel...
Computing Networks: A General Framework to Contrast Neural and Swarm Architectures
Computing Networks Contrast Neural General Framework Swarm Architectures
font style='font-size:12px;'>
2010/4/1
Computing Networks (CNs) are defined. These are used to generalize neural and swarm architectures, namely artificial neural networks, ant colony optimization, and particle swarm optimization. The desc...
Computing Networks: A General Framework to Contrast Neural and Swarm Architectures
Computing Networks Swarm Architectures Contrast Neural
font style='font-size:12px;'>
2010/4/1
Computing Networks (CNs) are defined. These are used to generalize neural and swarm architectures, namely artificial neural networks, ant colony optimization, and particle swarm optimization. The desc...
Homotopy perturbation method for computing eigenelements of Sturm-Liouville two point boundary value problems
Homotopy Perturbation Method Sturm-Liouville problem
font style='font-size:12px;'>
2010/9/14
In this work we consider the application of the Homotopy Perturbation Method (HPM) to compute the eigenvalues and the corresponding normalized eigenfunction of Sturm-Liouville problem. To illustrate t...
Computing an approximate inverse preconditioner by successive approximations method
Successive approximations method Sylvester equation
font style='font-size:12px;'>
2010/9/17
A method for computing an approximate inverse preconditioner of a matrix A which all eigenvalues have negative real parts is proposed. The approximate solution of the special Sylvester matrix equation...
CSIAM Geometric Design & Computing （2009第四届全国几何设计与计算学术会议）
2009 第四届 几何设计 计算
font style='font-size:12px;'>
2009/3/31
由中国工业与应用数学学会几何设计与计算专业委员会主办，厦门大学承办的第四届全国几何设计与计算学术会议(CSIAM Geometric Design & Computing 2009) 定于2009年8月24日－28日在福建省厦门市召开。本次会议将以“几何设计和计算理论及其在工业中的应用”为主题，结合工业设计中急需解决的关键问题和难点问题，开展广泛的学术交流和讨论。
An efficient algorithm for computing zero-order Hankel transforms
Finite Hankel transform Bessel functions
font style='font-size:12px;'>
2010/9/14
Postnicov [22], in 2003, proposed an algorithm to compute the Hankel transforms of order zero and one by using Haar wavelets. But the proposed method faced problems in the evaluation of zero order Han...
A DNA computing model to solve 0-1 integer programming problem
DNA computing fluorescence material
font style='font-size:12px;'>
2010/9/14
The topic of binary optimization in integer linear programming is an intensive research area in the field of DNA computing. In this paper, a new DNA computation model utilizing solution-based methods ...