找回密码
 To register

QQ登录

只需一步,快速开始

扫一扫,访问微社区

Titlebook: Symbolic-Numeric Computation; Dongming Wang,Lihong Zhi Conference proceedings 2007 Birkhäuser Basel 2007 Differential equations.GCD comput

[复制链接]
楼主: 时间
发表于 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 | 显示全部楼层
发表于 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.
发表于 2025-3-30 20:43:40 | 显示全部楼层
发表于 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.
发表于 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 | 显示全部楼层
发表于 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 | 显示全部楼层
 关于派博传思  派博传思旗下网站  友情链接
派博传思介绍 公司地理位置 论文服务流程 影响因子官网 SITEMAP 大讲堂 北京大学 Oxford Uni. Harvard Uni.
发展历史沿革 期刊点评 投稿经验总结 SCIENCEGARD IMPACTFACTOR 派博系数 清华大学 Yale Uni. Stanford Uni.
|Archiver|手机版|小黑屋| 派博传思国际 ( 京公网安备110108008328) GMT+8, 2025-5-29 05:12
Copyright © 2001-2015 派博传思   京公网安备110108008328 版权所有 All rights reserved
快速回复 返回顶部 返回列表