%0 Journal Article
%T I_(01) APPROXIMATION AND THE ROUND-OFF PROBLEM FOR COEFFICIENTS IN COMPUTATION OF POLYNOMAILS (CONTINUED)<br>I_(01)逼近和多项式计算中的系数舍入(续)
%A 王振宇
%J 计算数学
%D 1981
%I 
%X This paper investigates further the round-off problem for coefficients in computa-tion of polynomails based on author's previous paper1]. To do this, it discusses non-uniqueness of I_(01), approximation, gives a more precise estimate method for round-offerror, and generalizes the main result of 1] to more general interval instead of 0, 1].Finally, some examples are given to demonstrate the advantages of our round-off crite-rion: round-off error is smaller, its use is simple, and the rough estimate for round-offerror sufficient for common applications is unified -- there is no need of any com-putation in use.
%U http://www.alljournals.cn/get_abstract_url.aspx?pcid=6E709DC38FA1D09A4B578DD0906875B5B44D4D294832BB8E&cid=37F46C35E03B4B86&jid=CC77F3CEF526D9CF0B3021650FB4E57E&aid=67B6D4468EC2872694665B4374CBDC23&yid=AA64127AB7DEB65D&vid=38B194292C032A66&iid=CA4FD0336C81A37A&sid=6209D9E8050195F5&eid=BE33CC7147FEFCA4&journal_id=0254-7791&journal_name=计算数学&referenced_num=1&reference_num=0