搜索结果: 1-6 共查到“计算数学 Polynomial”相关记录6条 . 查询时间(0.085 秒)
Computation of the Smith Form for Multivariate Polynomial Matrices Using Maple
Smith Form Unimodular Equivalence Quillen-Suslin Theorem Maple
font style='font-size:12px;'>
2013/1/30
In this paper we show how the transformations associated with the reduction to the Smith form of some classes of multivariate polynomial matrices are computed. Using a Maple implementation of a constr...
Approximate Interval Method for Epistemic Uncertainty Propagation using Polynomial Chaos and Evidence Theory
Approximate Interval Method Epistemic Uncertainty Propagation Evidence Theory
font style='font-size:12px;'>
2011/9/29
Abstract: The paper builds upon a recent approach to find the approximate bounds of a real function using Polynomial Chaos expansions. Given a function of random variables with compact support probabi...
A polynomial invariant and duality for triangulations
polynomial invariant duality for triangulations
font style='font-size:12px;'>
2011/1/19
The Tutte polynomial G(X, Y ) of a graph G is a classical invariant,important in combinatorics and statistical mechanics. An important feature of the Tutte polynomial is the duality for planar graphs...
Multivariate polynomial interpolation and sampling in Paley-Wiener spaces
Multivariate polynomial interpolation sampling Paley-Wiener spaces
font style='font-size:12px;'>
2010/12/3
In this paper, an equivalence between existence of particular exponential Riesz bases
for multivariate bandlimited functions and existence of certain polynomial interpolants for these bandlimited fun...
EFFICIENT AND ERROR-CORRECTING DATA STRUCTURES FOR MEMBERSHIP AND POLYNOMIAL EVALUATION
ERROR-CORRECTING DATA STRUCTURES POLYNOMIAL EVALUATION
font style='font-size:12px;'>
2012/11/30
We construct efficient data structures that are resilient against a constant fraction of adversarial noise. Our model requires that the decoder answers most queries correctly with high probability and...
An Interior-point Trust-region Polynomial Algorithm for Convex Programming
interior-point algorithm self-concordant barrier trust-region subproblem
font style='font-size:12px;'>
2012/8/1
An interior-point trust-region algorithm is proposed for minimization of a convex quadratic objective function over a general convex set. The algorithm uses a trust-region model to ensure descent on a...