SIT
发表于 2025-3-30 09:36:04
On the Extended Iterative Proportional Scaling Algorithm,e iterative proportional scaling algorithm. They are also applied to improve the convergent rate of the iterative proportional scaling algorithm when dealing with ill-conditioned systems. Reduction to convex optimization is discussed. Computational results are also presented.
冲击力
发表于 2025-3-30 13:34:52
http://reply.papertrans.cn/89/8839/883858/883858_52.png
foppish
发表于 2025-3-30 16:59:38
Conference proceedings 2007ic computations, two types of computation coexisting in mathematics yet separated in traditional research of mathematical computation. This book presents 23 research articles on the integration and interaction of symbolic and numeric computation.
antenna
发表于 2025-3-30 20:43:40
http://reply.papertrans.cn/89/8839/883858/883858_54.png
嬉耍
发表于 2025-3-31 01:29:01
Structured Low Rank Approximation of a Sylvester Matrix,ingle iteration is carried out with a number of floating point operations that is of cubic order in the input degrees. We also demonstrate the practical performance of our algorithms on a diverse set of univariate pairs of polynomials.
Entropion
发表于 2025-3-31 08:31:19
On the Location of Zeros of an Interval Polynomial,e the set of real numbers that are zeros of a polynomial in .. For complex zeros, we can obtain a set . that contains the set .(.), which consists of all the complex numbers that are zeros of a polynomial in ., and the difference between . and .(.) can be as small as possible.
使饥饿
发表于 2025-3-31 09:59:49
On a Generalized Companion Matrix Pencil for Matrix Polynomials Expressed in the Lagrange Basis,ometimes be numerically stable. It has recently been proved that a new rootfinding condition number, defined for points on a set containing the interpolation points, is never larger than the rootfinding condition number for the Bernstein polynomial (which is itself optimally small in a certain sense
主动脉
发表于 2025-3-31 15:31:22
http://reply.papertrans.cn/89/8839/883858/883858_58.png
Keratin
发表于 2025-3-31 20:46:23
Computing Approximate GCD of Multivariate Polynomials,lemented the new algorithm and compared it by typical examples with (approximate) PRS, (approximate) EZ-GCD algorithms and two new algorithms based on SVD. The experiment shows a good performance of our algorithm.
诙谐
发表于 2025-3-31 23:15:05
http://reply.papertrans.cn/89/8839/883858/883858_60.png