搜索结果: 46-60 共查到“数学 computing”相关记录95条 . 查询时间(0.073 秒)
Vector bundles of rank 2 computing Clifford indices
Semistable vector bundle Clifford indices gonality
font style='font-size:12px;'>
2011/1/17
Clifford indices of vector bundles on algebraic curves were introduced in a previous paper of the authors. In this paper we study bundles of rank 2 which compute these Clifford indices.
This is of pa...
Computing the topological entropy of unimodal maps
Topological entropy interval maps symbolic dynamics
font style='font-size:12px;'>
2011/3/2
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...
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 material fronts with a Lagrange-Projection approach
Computing material fronts Lagrange-Projection approach
font style='font-size:12px;'>
2011/2/24
This paper reports investigations on the computation of mate-rial fronts in multi-fluid models using a Lagrange-Projection ap-proach. Various forms of the Projection step are considered. Par-ticular a...
Computing (or not) Quasi-Periodicity Functions of Tilings
Computing (or not) Quasi-Periodicity Functions Tilings
font style='font-size:12px;'>
2011/3/2
We know that tilesets that can tile the plane always admit a quasiperiodic tiling [4, 8], yet they hold many uncomputable properties [3, 11, 21, 25].The quasi-periodicity function is one way to measur...
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...
Defining and Computing Topological Persistence for 1-cocycles
Topological Persistence 1-cocycles
font style='font-size:12px;'>
2011/2/22
The concept of topological persistence, introduced recently in computational topology, finds applications in studying a map in relation to the topology of its domain. Since its introduction, it has be...
Computing (or not) Quasi-Periodicity Functions of Tilings
Computing Quasi-Periodicity Functions of Tilings
font style='font-size:12px;'>
2010/12/28
We know that tilesets that can tile the plane always admit a quasiperiodic tiling [4, 8], yet they hold many uncomputable properties [3, 11, 21, 25].The quasi-periodicity function is one way to measur...
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...
A new algorithm for computing the multivariate Faà di Bruno's formula
algorithm computing multivariate Faà di Bruno's formula
font style='font-size:12px;'>
2011/1/4
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...
Computing the first eigenpair of the p-Laplacian via inverse iteration of sublinear supersolutions
the p-Laplacian sublinear supersolutions
font style='font-size:12px;'>
2010/11/19
We introduce an iterative method for computing the first eigenpair $\left( \lambda_{p},e_{p}\right) $ for the $p$-Laplacian operator with homogeneous Dirichlet data as the limit of $\left( \mu_{q,}u_...
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.
Computing local constants for CM elliptic curves
Computing local constants CM elliptic curves
font style='font-size:12px;'>
2010/11/9
For E/k an elliptic curve with CM by O, we determine a formula for (a generalization of) the arithmetic local constant of [4] at almost all primes of good reduction. We apply this formula to the CM c...