共查询到20条相似文献,搜索用时 62 毫秒
1.
2.
3.
4.
5.
6.
7.
Feng Tan 《Topology and its Applications》2011,158(3):533-541
8.
9.
10.
11.
12.
13.
14.
15.
16.
17.
Joab R. Winkler Madina Hasan 《Journal of Computational and Applied Mathematics》2010,234(12):3226-1603
A non-linear structure preserving matrix method for the computation of a structured low rank approximation of the Sylvester resultant matrix S(f,g) of two inexact polynomials f=f(y) and g=g(y) is considered in this paper. It is shown that considerably improved results are obtained when f(y) and g(y) are processed prior to the computation of , and that these preprocessing operations introduce two parameters. These parameters can either be held constant during the computation of , which leads to a linear structure preserving matrix method, or they can be incremented during the computation of , which leads to a non-linear structure preserving matrix method. It is shown that the non-linear method yields a better structured low rank approximation of S(f,g) and that the assignment of f(y) and g(y) is important because may be a good structured low rank approximation of S(f,g), but may be a poor structured low rank approximation of S(g,f) because its numerical rank is not defined. Examples that illustrate the differences between the linear and non-linear structure preserving matrix methods, and the importance of the assignment of f(y) and g(y), are shown. 相似文献
18.
19.
20.