首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   25篇
  免费   0篇
化学   4篇
数学   8篇
物理学   13篇
  2015年   1篇
  1999年   1篇
  1997年   3篇
  1996年   1篇
  1995年   2篇
  1994年   3篇
  1993年   6篇
  1991年   1篇
  1990年   1篇
  1988年   2篇
  1979年   1篇
  1975年   1篇
  1948年   2篇
排序方式: 共有25条查询结果,搜索用时 15 毫秒
1.
2.
3.
4.
5.
Simultaneous Iteration for Partial Eigensolution of Real Matrices   总被引:1,自引:0,他引:1  
Simultaneous iteration methods are presented for obtaining dominanteigenvalues and corresponding eigenvectors of real unsymmetricmatrices. These methods involve the accurate eigensolution ofthe smaller interaction matrix at each iteration, the dimensionsof which depend on the number of vectors processed simultaneously.A bi-iteration procedure is proposed when both left and righteigenvectors are required, and a lopsided iteration procedurewhen only one set of eigenvectors is required. Numerical testsare discussed.  相似文献   
6.
7.
New perturbation analyses for the Cholesky factorization   总被引:1,自引:0,他引:1  
We present new perturbation analyses for the Cholesky factorizationA = RT R of a symmetric positive definite matrix A. The analysesmore accurately reflect the sensitivity of the problem thanprevious normwise results. The condition numbers here are alteredby any symmetric pivoting used in PAPT = RTR, and both numericalresults and an analysis show that the standard method of pivotingis optimal in that it usually leads to a condition number veryclose to its lower limit for any given A. It follows that thecomputed R will probably have greatest accuracy when we usethe standard symmetric pivoting strategy. Initially we give a thorogh analysis to obtain both first-orderand strict normwise perturbation bounds which are as tight aspossible, leading to a definition of an optimal condition numberfor the problem. Then we use this approach to obtain reasonablyclear first-order and strict componentwise perturbation bounds. We complete the work by giving a much simpler normwise analysiswhich provides a somewhat weaker bound, but which allows usto estimate the condition of the problem quite well with anefficient computation. This simpler analysis also shows whythe factorization is often less sensitive than we previouslythought, and adds further insight into why pivoting usuallygives such good results. We derive a useful upper bound on thecondition of the problem when we use pivoting. This research was supported by the Natural Sciences and EngineeringResearch Ciuncil of Canada Grant OGP0009236. This research was supported in part by the US National ScienceFoundation under grant CCR 95503126.  相似文献   
8.
9.
10.
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号