Recursive algorithm without extra function evaluations for the Jacobian matrix of Vieta's polynomial system with applications

被引：0

作者：

Wu, XY ^{[1
]}

机构：

[1] Nanjing Univ, Dept Math, State Key Lab Novel Software Technol, Nanjing 210093, Peoples R China

来源：

APPLIED MATHEMATICS AND COMPUTATION | 2005年 / 162卷 / 02期

关键词：

polynomial zeros; simultaneous approximation of all zeros; Newton's method;

D O I：

10.1016/j.amc.2003.12.107

中图分类号：

O29 [应用数学];

学科分类号：

070104 ;

摘要：

This paper describes a simple recursion without extra function calculating for Jacobian matrix of Vieta's polynomial system and its applications in simultaneously approximating all the zeros of a polynomial with complex coefficient. (C) 2004 Elsevier Inc. All rights reserved.

引用

页码：539 / 548

页数：10

共 3 条

[1] Recursive algorithm without extra function evaluations for the Jacobian matrix of Viéta's polynomial system with applications
Wu, Xinyuan
Appl Math Comput (New York), 2 (539-548):
[2] RecurJac: An Efficient Recursive Algorithm for Bounding Jacobian Matrix of Neural Networks and Its Applications
Zhang, Huan
Zhang, Pengchuan
Hsieh, Cho-Jui
THIRTY-THIRD AAAI CONFERENCE ON ARTIFICIAL INTELLIGENCE / THIRTY-FIRST INNOVATIVE APPLICATIONS OF ARTIFICIAL INTELLIGENCE CONFERENCE / NINTH AAAI SYMPOSIUM ON EDUCATIONAL ADVANCES IN ARTIFICIAL INTELLIGENCE, 2019, : 5757 - 5764
[3] Jacobian-free algorithm to calculate the phase sensitivity function in the phase reduction theory and its applications to Karman's vortex street
Iima, Makoto
PHYSICAL REVIEW E, 2019, 99 (06)

← 1 →