首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   16篇
  国内免费   5篇
  完全免费   2篇
  数学   23篇
  2015年   1篇
  2014年   1篇
  2013年   1篇
  2011年   2篇
  2010年   2篇
  2009年   2篇
  2008年   2篇
  2007年   4篇
  2006年   1篇
  2005年   1篇
  2003年   1篇
  1998年   3篇
  1997年   1篇
  1980年   1篇
排序方式: 共有23条查询结果,搜索用时 78 毫秒
1.
We investigate the use of sparse approximate inverse preconditioners for the iterative solution of linear systems with dense complex coefficient matrices arising in industrial electromagnetic problems. An approximate inverse is computed via a Frobenius norm approach with a prescribed nonzero pattern. Some strategies for determining the nonzero pattern of an approximate inverse are described. The results of numerical experiments suggest that sparse approximate inverse preconditioning is a viable approach for the solution of large-scale dense linear systems on parallel computers. This revised version was published online in August 2006 with corrections to the Cover Date.  相似文献
2.
This paper presents methodology which permits the complete ranking of nondirected graphs (NDG's) on an attribute labelled ‘complexity.’ The technique applies to both small and large systems as might arise in studies of group or organization behavior. The methodology extends to cover the complexity of directed graphs (DG's) and permits the detailed specification of individual and group behavior.For the NDG an abstract automaton representing the participants' interaction or communications function is sited at each node. Each automaton is constructed so its internal complexity is sufficient to realize the minimal social action (e.g. transmission of a rumor and the path followed by the rumor) within the framework of the NDG. It is shown that the complexity of each node automaton depends upon the order of the graph, the degree of the node and the longest path parameter of the graph. The combined complexity of node automata constitutes the complexity of the NDG. The complexity of a DG is specified as a composition of complexities computed for the associated NDG and logical devices which produce the observed behavior. Illustrative examples pertaining to the committee-subcommittee problem and to organizational structures are presented.  相似文献
3.
4.
A bounded linear operator on a complex Hilbert space is called complex symmetric if , where is a conjugation (an isometric, antilinear involution of ). We prove that , where is an auxiliary conjugation commuting with . We consider numerous examples, including the Poincaré-Neumann singular integral (bounded) operator and the Jordan model operator (compressed shift). The decomposition also extends to the class of unbounded -selfadjoint operators, originally introduced by Glazman. In this context, it provides a method for estimating the norms of the resolvents of certain unbounded operators.

  相似文献

5.
We study a few classes of Hilbert space operators whose matrix representations are complex symmetric with respect to a preferred orthonormal basis. The existence of this additional symmetry has notable implications and, in particular, it explains from a unifying point of view some classical results. We explore applications of this symmetry to Jordan canonical models, self-adjoint extensions of symmetric operators, rank-one unitary perturbations of the compressed shift, Darlington synthesis and matrix-valued inner functions, and free bounded analytic interpolation in the disk.

  相似文献

6.
Complex symmetric matrices often appear in quantum physics in the solution methods of partial differential equations such as the Schrödinger equation. We have recently introduced a new fast and efficient direct eigensolver for this problem in [4], and reported its performance in the eigenvalue calculation in [3]. In this paper, we further report on some benchmark tests for computing the full and partial eigenspectrum on a variety of super computing machines, i.e., the Cray J-932, the DEC Alfa 8400, and the SGI Power Challenge 8000 and 10000. We observe that in all cases the new algorithm is much faster than codes available in standard state of the art eigensolver packages such as LAPACK.  相似文献
7.
A conjugation C is antilinear isometric involution on a complex Hilbert space , and is called complex symmetric if T* = CTC for some conjugation C. We use multiplicity theory to describe all conjugations commuting with a fixed positive operator. We expand upon a result of Garcia and Putinar to provide a factorization of complex symmetric operators which is based on the polar decomposition. This paper is based in part on the first author’s Master’s Project.  相似文献
8.
If C is a conjugation (an isometric, conjugate-linear involution) on a separable complex Hilbert space H, then TB(H) is called C-symmetric if T=CTC. In this note we prove that each C-symmetric contraction T is the mean of two C-symmetric unitary operators. We discuss several corollaries and an application to the Friedrichs operator of a planar domain.  相似文献
9.
In this note it is shown that any square matrix AC n×n can be represented as the sum A= , where is complex symmetric and rank . The corresponding persymmetric result can be used in finding the terms of a small rank perturbed Toeplitz matrix via an O(n 2) computation. This allows one to perform fast matrix–vector products in case n is large.  相似文献
10.
Complex symmetric matrices whose real and imaginary parts are positive definite are shown to have a growth factor bounded by 2 for LU factorization. This result adds to the classes of matrix for which it is known to be safe not to pivot in LU factorization. Block factorization with the pivoting strategy of Bunch and Kaufman is also considered, and it is shown that for such matrices only pivots are used and the same growth factor bound of 2 holds, but that interchanges that destroy band structure may be made. The latter results hold whether the pivoting strategy uses the usual absolute value or the modification employed in LINPACK and LAPACK.

  相似文献

设为首页 | 免责声明 | 关于勤云 | 加入收藏

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