ON COMPUTATIONAL COMPLEXITY FOR THE MULTIPLICATION OF GENERALIZED HILBERT MATRICES WITH VECTORS AND SOLUTION OF CERTAIN GENERALIZED HILBERT LINEAR SYSTEMS

【摘要】 <正> where p is a positive integer, t_i’s and s_i’s are distinct points in the complex plane and t_i≠s_j, i,j=1, 2,…, n. The following question was considered in[1].Given a vector b. Does there exist an algorithm for computing the product B₁b in less than O（n²） operations?"更多还原