{"title":"在给定定义域内最接近于零的多项式","authors":"Hiroshi Sekigawa","doi":"10.1145/1277500.1277527","DOIUrl":null,"url":null,"abstract":"For a real univariate polynomial f and a bounded closed domain D ⊂ C whose boundary <i>C</i> is a simple closed curve of finite length and is represented by a piecewise rational function, we provide a rigorous method for finding the real univariate polynomial <i>f</i> such that <i>f</i> has a zero in <i>D</i> and ||<i>f</i> -- <i>f</i>||∞ is minimal. First, we prove that the absolute value of every coefficient of <i>f</i> -- <i>f</i> is ||<i>f</i> -- <i>f</i>∞ with at most one exception. Using this property and the representation of C, we reduce the problem to solving systems of algebraic equations, each of which consists of two equations with two variables. Furthermore, every equation is of degree one with respect to one of the two variables.","PeriodicalId":308716,"journal":{"name":"Symbolic-Numeric Computation","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2007-07-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"9","resultStr":"{\"title\":\"The nearest polynomial with a zero in a given domain\",\"authors\":\"Hiroshi Sekigawa\",\"doi\":\"10.1145/1277500.1277527\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"For a real univariate polynomial f and a bounded closed domain D ⊂ C whose boundary <i>C</i> is a simple closed curve of finite length and is represented by a piecewise rational function, we provide a rigorous method for finding the real univariate polynomial <i>f</i> such that <i>f</i> has a zero in <i>D</i> and ||<i>f</i> -- <i>f</i>||∞ is minimal. First, we prove that the absolute value of every coefficient of <i>f</i> -- <i>f</i> is ||<i>f</i> -- <i>f</i>∞ with at most one exception. Using this property and the representation of C, we reduce the problem to solving systems of algebraic equations, each of which consists of two equations with two variables. Furthermore, every equation is of degree one with respect to one of the two variables.\",\"PeriodicalId\":308716,\"journal\":{\"name\":\"Symbolic-Numeric Computation\",\"volume\":\"1 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2007-07-25\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"9\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Symbolic-Numeric Computation\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1145/1277500.1277527\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Symbolic-Numeric Computation","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/1277500.1277527","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
The nearest polynomial with a zero in a given domain
For a real univariate polynomial f and a bounded closed domain D ⊂ C whose boundary C is a simple closed curve of finite length and is represented by a piecewise rational function, we provide a rigorous method for finding the real univariate polynomial f such that f has a zero in D and ||f -- f||∞ is minimal. First, we prove that the absolute value of every coefficient of f -- f is ||f -- f∞ with at most one exception. Using this property and the representation of C, we reduce the problem to solving systems of algebraic equations, each of which consists of two equations with two variables. Furthermore, every equation is of degree one with respect to one of the two variables.