搜索结果: 1-15 共查到“知识库 计算数学 computing”相关记录17条 . 查询时间(0.072 秒)
Simulation and Beyond: Computing in the 21st Century
Simulation and Beyond Computing
font style='font-size:12px;'>
2015/8/25
Computers have a remarkable ability to simulate natural and arti cial
phenomena. Industry, science, economic a airs and national security have
come to rely upon simulation as an essential technology...
Computing Periodic Orbits and their Bifurcations with Automatic Differentiation
Automatic Differentiation Computing Periodic Orbits
font style='font-size:12px;'>
2015/8/25
This paper examines algorithms for computing periodic orbits of dynamical systems. Our
goal is to explore the limits of accuracy that are attainable for these calculations within
the pragmatic conte...
Computing the threshold shift for general channels
Threshold the probability curve noise the binary
font style='font-size:12px;'>
2015/8/21
The ‘threshold’ of a code ensemble can be defined as the noise level at which the block error probability curve crosses 1/2. For ensembles of low-density parity check codes used over the binary erasur...
Computing bounds for the structured singular value via an interior point algorithm
Calculation structure singular value the interior point algorithm
font style='font-size:12px;'>
2015/8/12
We describe an interior point algorithm for computing the upper bound for the structured singular value described in the paper by Fan, Tits and Doyle, IEEE Trans AC, Jan. 1991. We demonstrate the perf...
Efficient Use of Cloud Computing in Medical Science
Cloud Diseases Treatment Medical Information Internet
font style='font-size:12px;'>
2013/1/30
Technology has grown rapidly with scientific advancement over the world in recent decades. Therefore, there is a need to redesign the medical system to meet their better needs .With the advent of clou...
Parallel Computing with a Bayesian Item Response Model
Gibbs Sampling High Performance Computing Message Passing Interface Two-Parameter IRT Model
font style='font-size:12px;'>
2013/1/30
Item response theory (IRT) is a modern test theory that has been used in various aspects of educational and psychological measurement. The fully Bayesian approach shows promise for estimating IRT mode...
Computing the Moore-Penrose Inverse of a Matrix Through Symmetric Rank-One Updates
Finite Recursive Algorithm Moore-Penrose Inverse Symmetric Rank-One Update
font style='font-size:12px;'>
2013/1/30
This paper presents a recursive procedure to compute the Moore-Penrose inverse of a matrix A. The method is based on the expression for the Moore-Penrose inverse of rank-one modified matrix. The compu...
An O(N) Method for Rapidly Computing Periodic Potentials Using Accelerated Cartesian Expansions
Accelerated Cartesian Expansion (ACE) Fast Multipole Methods Periodic Systems
font style='font-size:12px;'>
2011/10/8
Abstract: The evaluation of long-range potentials in periodic, many-body systems arises as a necessary step in the numerical modeling of a multitude of interesting physical problems. Direct evaluation...
A new algorithm for computing the multivariate Faà di Bruno's formula
multivariate composite function Fa`a di Bruno’s formula multivariate cumulant
font style='font-size:12px;'>
2011/3/1
A new algorithm for computing the multivariate Fa`a di Bruno’s formula is provided.We use a symbolic approach based on the classical umbral calculus that turns the computation of the multivariate Fa`a...
Computing the topological entropy of unimodal maps
Topological entropy interval maps symbolic dynamics
font style='font-size:12px;'>
2010/12/28
We derive an algorithm to determine recursively the lap number (minimal number of monotone pieces) of the iterates of unimodal maps of an interval with free end-points. The algorithm
is obtained by t...
Border Algorithms for Computing Hasse Diagrams of Arbitrary Lattices
Lattices Hasse diagrams border algorithms
font style='font-size:12px;'>
2011/3/2
The Border algorithm and the iPred algorithm find the Hasse diagrams of FCA lattices. We show that they can be generalized to ar-bitrary lattices. In the case of iPred, this requires the identificatio...
A new conception for computing gröbner basis and its applications
Gr¨obner basis F5 GVW TRB Mpair
font style='font-size:12px;'>
2011/3/4
This paper presents a conception for computing gr¨obner basis. We convert some of gr¨obner-computing algorithms, e.g., F5, extended F5 and GWV algorithms into a special type of algorithm.
Fixed-Point Approaches to Computing Bertrand-Nash Equilibrium Prices Under Mixed Logit Demand: A Technical Framework for Analysis and Efficient Computational Methods
Mixed Logit Demand Technical Framework Analysis Efficient Computational Methods
font style='font-size:12px;'>
2011/2/28
Bertrand competiton has been a prominent paradigm for the empirical study of differentiated
product markets for at least twenty years. Firms engaged in Bertrand competition maximize profits by choosi...
Computing the partition function for perfect matchings in a hypergraph
hypergraph perfect matching partition function permanent
font style='font-size:12px;'>
2010/12/6
Given non-negative weights wS on the k-subsets S of a km-element set V , we consider the sum of the products wS1 · · ·wSm over all partitions V =S1 [ . . . [ Sm into pairwise disjoint k-subsets Si.
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 ...