首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   37篇
  免费   0篇
  国内免费   3篇
化学   9篇
力学   1篇
数学   27篇
物理学   3篇
  2017年   2篇
  2016年   2篇
  2015年   4篇
  2014年   3篇
  2013年   5篇
  2012年   2篇
  2011年   3篇
  2010年   2篇
  2009年   2篇
  2008年   4篇
  2007年   2篇
  2006年   2篇
  2005年   1篇
  2004年   1篇
  2003年   2篇
  2002年   1篇
  2000年   1篇
  1999年   1篇
排序方式: 共有40条查询结果,搜索用时 31 毫秒
1.
A zero modes’ Fock space is constructed for the extended chiral WZNW model. It gives room to a realization of the fusion ring of representations of the restricted quantum universal enveloping algebra at an even root of unity, and of its infinite dimensional extension by the Lusztig operators We provide a streamlined derivation of the characteristic equation for the Casimir invariant from the defining relations of A central result is the characterization of the Grothendieck ring of both and in Theorem 3.1. The properties of the fusion ring in are related to the braiding properties of correlation functions of primary fields of the conformal current algebra model.   相似文献   
2.
A simple technique is given in this paper for the construction and analysis of a class of finite element discretizations for convection-diffusion problems in any spatial dimension by properly averaging the PDE coefficients on element edges. The resulting finite element stiffness matrix is an -matrix under some mild assumption for the underlying (generally unstructured) finite element grids. As a consequence the proposed edge-averaged finite element scheme is particularly interesting for the discretization of convection dominated problems. This scheme admits a simple variational formulation, it is easy to analyze, and it is also suitable for problems with a relatively smooth flux variable. Some simple numerical examples are given to demonstrate its effectiveness for convection dominated problems.

  相似文献   

3.
This paper develops a first-order system least-squares (FOSLS) formulation for equations of two-phase flow. The main goal is to show that this discretization, along with numerical techniques such as nested iteration, algebraic multigrid, and adaptive local refinement, can be used to solve these types of complex fluid flow problems. In addition, from an energetic variational approach, it can be shown that an important quantity to preserve in a given simulation is the energy law. We discuss the energy law and inherent structure for two-phase flow using the Allen–Cahn interface model and indicate how it is related to other complex fluid models, such as magnetohydrodynamics. Finally, we show that, using the FOSLS framework, one can still satisfy the appropriate energy law globally while using well-known numerical techniques.  相似文献   
4.
Motivated by the increasing importance of large‐scale networks typically modeled by graphs, this paper is concerned with the development of mathematical tools for solving problems associated with the popular graph Laplacian. We exploit its mixed formulation based on its natural factorization as product of two operators. The goal is to construct a coarse version of the mixed graph Laplacian operator with the purpose to construct two‐level, and by recursion, a multilevel hierarchy of graphs and associated operators. In many situations in practice, having a coarse (i.e., reduced dimension) model that maintains some inherent features of the original large‐scale graph and respective graph Laplacian offers potential to develop efficient algorithms to analyze the underlined network modeled by this large‐scale graph. One possible application of such a hierarchy is to develop multilevel methods that have the potential to be of optimal complexity. In this paper, we consider general (connected) graphs and function spaces defined on its edges and its vertices. These two spaces are related by a discrete gradient operator, ‘Grad’ and its adjoint, ‘ ? Div’, referred to as (negative) discrete divergence. We also consider a coarse graph obtained by aggregation of vertices of the original one. Then, a coarse vertex space is identified with the subspace of piecewise constant functions over the aggregates. We consider the ?2‐projection QH onto the space of these piecewise constants. In the present paper, our main result is the construction of a projection πH from the original edge‐space onto a properly constructed coarse edge‐space associated with the edges of the coarse graph. The projections πH and QH commute with the discrete divergence operator, that is, we have Div πH = QH div. The respective pair of coarse edge‐space and coarse vertex‐space offer the potential to construct two‐level, and by recursion, multilevel methods for the mixed formulation of the graph Laplacian, which utilizes the discrete divergence operator. The performance of one two‐level method with overlapping Schwarz smoothing and correction based on the constructed coarse spaces for solving such mixed graph Laplacian systems is illustrated on a number of graph examples. Copyright © 2013 John Wiley & Sons, Ltd.  相似文献   
5.
Graph disaggregation is a technique used to address the high cost of computation for power law graphs on parallel processors. The few high-degree vertices are broken into multiple small-degree vertices, in order to allow for more efficient computation in parallel. In particular, we consider computations involving the graph Laplacian, which has significant applications, including diffusion mapping and graph partitioning, among others. We prove results regarding the spectral approximation of the Laplacian of the original graph by the Laplacian of the disaggregated graph. In addition, we construct an alternate disaggregation operator whose eigenvalues interlace those of the original Laplacian. Using this alternate operator, we construct a uniform preconditioner for the original graph Laplacian.  相似文献   
6.
We study homological mirror symmetry for Del Pezzo surfaces and their mirror Landau-Ginzburg models. In particular, we show that the derived category of coherent sheaves on a Del Pezzo surface X k obtained by blowing up ℂℙ2 at k points is equivalent to the derived category of vanishing cycles of a certain elliptic fibration W k :M k →ℂ with k+3 singular fibers, equipped with a suitable symplectic form. Moreover, we also show that this mirror correspondence between derived categories can be extended to noncommutative deformations of X k , and give an explicit correspondence between the deformation parameters for X k and the cohomology class [B+iω]∈H 2(M k ,ℂ).  相似文献   
7.
We leverage the results of the prequel [8], in combination with a theorem of D. Orlov to create a categorical covering picture for factorizations. As applications, we provide a conjectural geometric framework to further understand M. Kontsevich's Homological Mirror Symmetry conjecture and obtain new cases of a conjecture of Orlov concerning the Rouquier dimension of the bounded derived category of coherent sheaves on a smooth variety.  相似文献   
8.
This paper presents a new approach to the dimension theory of triangulated categories by considering invariants that arise in the pretriangulated setting.  相似文献   
9.
This paper is devoted to the convergence rate estimate for the method of successive subspace corrections applied to symmetric and positive semidefinite (singular) problems. In a general Hilbert space setting, a convergence rate identity is obtained for the method of subspace corrections in terms of the subspace solvers. As an illustration, the new abstract theory is used to show uniform convergence of a multigrid method applied to the solution of the Laplace equation with pure Neumann boundary conditions.

  相似文献   

10.
This paper is on the convergence analysis for two‐grid and multigrid methods for linear systems arising from conforming linear finite element discretization of the second‐order elliptic equations with anisotropic diffusion. The multigrid algorithm with a line smoother is known to behave well when the discretization grid is aligned with the anisotropic direction; however, this is not the case with a nonaligned grid. The analysis in this paper is mainly focused on two‐level algorithms. For aligned grids, a lower bound is given for a pointwise smoother, and this bound shows a deterioration in the convergence rate, whereas for ‘maximally’ nonaligned grids (with no edges in the triangulation parallel to the direction of the anisotropy), the pointwise smoother results in a robust convergence. With a specially designed block smoother, we show that, for both aligned and nonaligned grids, the convergence is uniform with respect to the anisotropy ratio and the mesh size in the energy norm. The analysis is complemented by numerical experiments that confirm the theoretical results. Copyright © 2012 John Wiley & Sons, Ltd.  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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