{"title":"某些矩阵的条件","authors":"L. Shampine","doi":"10.6028/JRES.069B.034","DOIUrl":null,"url":null,"abstract":"By reve rsing the usual d irection of appl ication, a co mmon procedure for solv ing integr a l eq ua tion s numeri call y is used to obtain th e asymptotic P-condition numbe rs of two weU-known tes t matrices. Todd [1]1 has recently sugges ted th e matrix AI7 collection of test matrices [2]. The P-co ndition numbers of the matrices are used as a measure of th eir difficulty for num e rical purposes. Where th e co ndi-tion numbers are not explicitly known, the asym ptotic behavior in 11 is give n. Lehmer's matrix A7 I is exceptional in that the correct order in /J is not known_ A si mple id ea will allow us to obtain the asymptotic cond ition number of A 17 and the correc t order for A 7-Hilbert 's first method for integral equation s [3] approximates the e ige nvalues of the kern el K(x, y), o ,s; x, y ,s; 1, by t hose of t he matrix If K is bounded and Riemann integrable, then the eigen-values of th e matrices tend to those of the integral equation as n tends to 00. We reverse this procedure. We wish to es timate the behavior of the eigenvalues of a set of matri ces as n tends to 00. If we can regard them as arising from the application of Hilbert's first method to a fixed ke rnel, then we may hope for an asymptotic res ult. To estimate the largest eigenvalue of A 17 , let us form *This work was SUI)por'!cd by the United States Atomic Energy Commission. Rcp rodu c-I lion in whole or in part is pe rmitt ed for any purpose of the U.S. Government. ] Fi gures in brac ke ts ind ica te the literature references at the end of this paper. We regard them as arising from the approximation of the kernel K(x , y)= Ix-yl. A simple co mputation gives the largest eigenvalue of K as A =! Z-2 I 0 where Zo is the unique real root of coth z = z. This equation has bee n studied [4] and Zo is approximately Zo = 1.9967864. We conclude that the largest eigen-value of A 17 is asymptotically It is easy to es timate the accuracy of the approximation using the bounds of [5] but we s …","PeriodicalId":408709,"journal":{"name":"Journal of Research of the National Bureau of Standards Section B Mathematics and Mathematical Physics","volume":"27 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1965-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"8","resultStr":"{\"title\":\"The Condition of Certain Matrices\",\"authors\":\"L. Shampine\",\"doi\":\"10.6028/JRES.069B.034\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"By reve rsing the usual d irection of appl ication, a co mmon procedure for solv ing integr a l eq ua tion s numeri call y is used to obtain th e asymptotic P-condition numbe rs of two weU-known tes t matrices. Todd [1]1 has recently sugges ted th e matrix AI7 collection of test matrices [2]. The P-co ndition numbers of the matrices are used as a measure of th eir difficulty for num e rical purposes. Where th e co ndi-tion numbers are not explicitly known, the asym ptotic behavior in 11 is give n. Lehmer's matrix A7 I is exceptional in that the correct order in /J is not known_ A si mple id ea will allow us to obtain the asymptotic cond ition number of A 17 and the correc t order for A 7-Hilbert 's first method for integral equation s [3] approximates the e ige nvalues of the kern el K(x, y), o ,s; x, y ,s; 1, by t hose of t he matrix If K is bounded and Riemann integrable, then the eigen-values of th e matrices tend to those of the integral equation as n tends to 00. We reverse this procedure. We wish to es timate the behavior of the eigenvalues of a set of matri ces as n tends to 00. If we can regard them as arising from the application of Hilbert's first method to a fixed ke rnel, then we may hope for an asymptotic res ult. To estimate the largest eigenvalue of A 17 , let us form *This work was SUI)por'!cd by the United States Atomic Energy Commission. Rcp rodu c-I lion in whole or in part is pe rmitt ed for any purpose of the U.S. Government. ] Fi gures in brac ke ts ind ica te the literature references at the end of this paper. We regard them as arising from the approximation of the kernel K(x , y)= Ix-yl. A simple co mputation gives the largest eigenvalue of K as A =! Z-2 I 0 where Zo is the unique real root of coth z = z. This equation has bee n studied [4] and Zo is approximately Zo = 1.9967864. We conclude that the largest eigen-value of A 17 is asymptotically It is easy to es timate the accuracy of the approximation using the bounds of [5] but we s …\",\"PeriodicalId\":408709,\"journal\":{\"name\":\"Journal of Research of the National Bureau of Standards Section B Mathematics and Mathematical Physics\",\"volume\":\"27 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1965-10-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"8\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Journal of Research of the National Bureau of Standards Section B Mathematics and Mathematical Physics\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.6028/JRES.069B.034\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Journal of Research of the National Bureau of Standards Section B Mathematics and Mathematical Physics","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.6028/JRES.069B.034","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 8
摘要
通过改变通常的应用方向,利用求解整数方程的一般方法,得到两个已知矩阵的渐近p条件数。Todd[1]1最近提出了测试矩阵的矩阵AI7集合[2]。矩阵的P-co条件数被用作衡量其难度的数字目的。th e公司ndi-tion数字并不明确知道,这个asym内窥镜行为11给n。黄土的矩阵A7我异常的正确顺序/ J不是known_ si mple id ea将使我们得到渐近条件数过渡17和correc t一个7-Hilbert的第一积分方程方法年代[3]接近e的ige nvalues kern el K (x, y), o,年代;X, y,s;如果K是有界且黎曼可积的,那么当n趋于00时,e矩阵的特征值趋向于积分方程的特征值。我们把这个过程反过来。我们希望估计当n趋于00时一组矩阵的特征值的行为。如果我们认为它们是由希尔伯特第一种方法应用于一个固定的通道而产生的,那么我们可能希望得到一个渐近的结果。为了估计a17的最大特征值,让我们形成*This work was SUI) poor '!由美国原子能委员会批准。美国政府不得将全部或部分Rcp产品用于任何目的。括号内的数字是本文最后的文献参考文献。我们认为它们是由核函数K(x, y)= Ix-yl的近似引起的。一个简单的co计算给出了A =!时K的最大特征值z - 2i0,其中Zo是coth z = z的唯一实根,这个方程已经被研究过[4],Zo近似于Zo = 1.9967864。我们得出结论,a17的最大特征值是渐近的。使用[5]的边界很容易估计近似的精度,但我们…
By reve rsing the usual d irection of appl ication, a co mmon procedure for solv ing integr a l eq ua tion s numeri call y is used to obtain th e asymptotic P-condition numbe rs of two weU-known tes t matrices. Todd [1]1 has recently sugges ted th e matrix AI7 collection of test matrices [2]. The P-co ndition numbers of the matrices are used as a measure of th eir difficulty for num e rical purposes. Where th e co ndi-tion numbers are not explicitly known, the asym ptotic behavior in 11 is give n. Lehmer's matrix A7 I is exceptional in that the correct order in /J is not known_ A si mple id ea will allow us to obtain the asymptotic cond ition number of A 17 and the correc t order for A 7-Hilbert 's first method for integral equation s [3] approximates the e ige nvalues of the kern el K(x, y), o ,s; x, y ,s; 1, by t hose of t he matrix If K is bounded and Riemann integrable, then the eigen-values of th e matrices tend to those of the integral equation as n tends to 00. We reverse this procedure. We wish to es timate the behavior of the eigenvalues of a set of matri ces as n tends to 00. If we can regard them as arising from the application of Hilbert's first method to a fixed ke rnel, then we may hope for an asymptotic res ult. To estimate the largest eigenvalue of A 17 , let us form *This work was SUI)por'!cd by the United States Atomic Energy Commission. Rcp rodu c-I lion in whole or in part is pe rmitt ed for any purpose of the U.S. Government. ] Fi gures in brac ke ts ind ica te the literature references at the end of this paper. We regard them as arising from the approximation of the kernel K(x , y)= Ix-yl. A simple co mputation gives the largest eigenvalue of K as A =! Z-2 I 0 where Zo is the unique real root of coth z = z. This equation has bee n studied [4] and Zo is approximately Zo = 1.9967864. We conclude that the largest eigen-value of A 17 is asymptotically It is easy to es timate the accuracy of the approximation using the bounds of [5] but we s …