全文获取类型
收费全文 | 55篇 |
免费 | 55篇 |
国内免费 | 2篇 |
专业分类
化学 | 33篇 |
力学 | 16篇 |
综合类 | 1篇 |
数学 | 13篇 |
物理学 | 49篇 |
出版年
2023年 | 1篇 |
2020年 | 1篇 |
2019年 | 4篇 |
2018年 | 1篇 |
2017年 | 4篇 |
2016年 | 8篇 |
2015年 | 5篇 |
2014年 | 5篇 |
2013年 | 2篇 |
2012年 | 4篇 |
2011年 | 7篇 |
2010年 | 3篇 |
2009年 | 2篇 |
2008年 | 3篇 |
2007年 | 2篇 |
2006年 | 7篇 |
2005年 | 5篇 |
2004年 | 5篇 |
2003年 | 5篇 |
2002年 | 3篇 |
2001年 | 4篇 |
2000年 | 2篇 |
1999年 | 1篇 |
1998年 | 3篇 |
1997年 | 1篇 |
1996年 | 3篇 |
1995年 | 2篇 |
1994年 | 1篇 |
1993年 | 1篇 |
1992年 | 1篇 |
1991年 | 1篇 |
1990年 | 1篇 |
1989年 | 1篇 |
1988年 | 1篇 |
1987年 | 1篇 |
1986年 | 1篇 |
1985年 | 1篇 |
1984年 | 1篇 |
1983年 | 1篇 |
1982年 | 1篇 |
1981年 | 1篇 |
1980年 | 1篇 |
1979年 | 1篇 |
1978年 | 1篇 |
1977年 | 1篇 |
1963年 | 1篇 |
排序方式: 共有112条查询结果,搜索用时 15 毫秒
21.
Galerkin domain decomposition procedures for parabolic equations with three cases of boundary conditions on rectangular domain are discussed. These procedures are non‐iterative and non‐overlapping ones. They rely on implicit Galerkin method in the sub‐domains and integral mean method on the inter‐domain boundaries to present explicit flux calculation. Thus, the parallelism can be achieved by the use of these procedures. Two kinds of approximating schemes are presented. Because of the explicit nature of the flux calculation, a less severe time‐step constraint is derived to preserve stability. To bound L2‐norm error estimates, new elliptic projections are established and analyzed. Numerical experiments are provided to confirm theoretical results. Copyright © 2009 John Wiley & Sons, Ltd. 相似文献
22.
密度矩阵重正化群方法(DMRG)在求解一维强关联格点模型的基态时可以获得较高的精度,在应用于二维或准二维问题时,要达到类似的精度通常需要较大的计算量与存储空间.本文提出一种新的DMRG异构并行策略,可以同时发挥计算机中央处理器(CPU)和图形处理器(GPU)的计算性能.针对最耗时的哈密顿量对角化部分,实现了数据的分布式存储,并且给出了CPU和GPU之间的负载平衡策略.以费米Hubbard模型为例,测试了异构并行程序在不同DMRG保留状态数下的运行表现,并给出了相应的性能基准.应用于4腿梯子时,观测到了高温超导中常见的电荷密度条纹,此时保留状态数达到104,使用的GPU显存小于12 GB. 相似文献
23.
Two fundamental challenges of simulating biologically relevant systems are the rapid calculation of the energy of solvation and the trajectory length of a given simulation. The Generalized Born model with a Simple sWitching function (GBSW) addresses these issues by using an efficient approximation of Poisson–Boltzmann (PB) theory to calculate each solute atom's free energy of solvation, the gradient of this potential, and the subsequent forces of solvation without the need for explicit solvent molecules. This study presents a parallel refactoring of the original GBSW algorithm and its implementation on newly available, low cost graphics chips with thousands of processing cores. Depending on the system size and nonbonded force cutoffs, the new GBSW algorithm offers speed increases of between one and two orders of magnitude over previous implementations while maintaining similar levels of accuracy. We find that much of the algorithm scales linearly with an increase of system size, which makes this water model cost effective for solvating large systems. Additionally, we utilize our GPU‐accelerated GBSW model to fold the model system chignolin, and in doing so we demonstrate that these speed enhancements now make accessible folding studies of peptides and potentially small proteins. © 2016 Wiley Periodicals, Inc. 相似文献
24.
A method capable of solving very fast and robust complex non-linear systems of equations is presented. The block adaptive multigrid (BAM) method combines mesh adaptive techniques with multigrid and domain decomposition methods. The overall method is based on the FAS multigrid, but instead of using global grids, locally enriched subgrids are also employed in regions where excessive solution errors are encountered. The final mesh is a composite grid with uniform rectangular subgrids of various mesh densities. The regions where finer grid resolution is necessary are detected using an estimation of the solution error by comparing solutions between grid levels. Furthermore, an alternative domain decomposition strategy has been developed to take advantage of parallel computing machines. The proposed method has been applied to an implicit upwind Euler code (EuFlex) for the solution of complex transonic flows around aerofoils. The efficiency and robustness of the BAM method are demonstrated for two popular inviscid test cases. Up to 19-fold acceleration with respect to the single-grid solution has been achieved, but a further twofold speed-up is possible on four-processor parallel computers. 相似文献
25.
The parallel implementation of multireference configuration interaction program based on the hole-particle symmetry is described. The platform to implement the parallelization is an Intel-Architectural cluster consisting of 12 nodes, each of which is equipped with two 2.4-G XEON processors, 3-GB memory, and 36-GB disk, and are connected by a Gigabit Ethernet Switch. The dependence of speedup on molecular symmetries and task granularities is discussed. Test calculations show that the scaling with the number of nodes is about 1.9 (for C1 and Cs), 1.65 (for C2v), and 1.55 (for D2h) when the number of nodes is doubled. The largest calculation performed on this cluster involves 5.6 x 10(8) CSFs. 相似文献
26.
密度矩阵重正化群方法(DMRG)在求解一维强关联格点模型的基态时可以获得较高的精度,在应用于二维或准二维问题时,要达到类似的精度通常需要较大的计算量与存储空间.本文提出一种新的DMRG异构并行策略,可以同时发挥计算机中央处理器(CPU)和图形处理器(GPU)的计算性能.针对最耗时的哈密顿量对角化部分,实现了数据的分布式存储,并且给出了CPU和GPU之间的负载平衡策略.以费米Hubbard模型为例,测试了异构并行程序在不同DMRG保留状态数下的运行表现,并给出了相应的性能基准.应用于4腿梯子时,观测到了高温超导中常见的电荷密度条纹,此时保留状态数达到104,使用的GPU显存小于12 GB. 相似文献
27.
密度矩阵重正化群方法(DMRG)在求解一维强关联格点模型的基态时可以获得较高的精度,在应用于二维或准二维问题时,要达到类似的精度通常需要较大的计算量与存储空间.本文提出一种新的DMRG异构并行策略,可以同时发挥计算机中央处理器(CPU)和图形处理器(GPU)的计算性能.针对最耗时的哈密顿量对角化部分,实现了数据的分布式存储,并且给出了CPU和GPU之间的负载平衡策略.以费米Hubbard模型为例,测试了异构并行程序在不同DMRG保留状态数下的运行表现,并给出了相应的性能基准.应用于4腿梯子时,观测到了高温超导中常见的电荷密度条纹,此时保留状态数达到104,使用的GPU显存小于12 GB. 相似文献
28.
Efficient simulation of large materials clusters using the jaguar quantum chemistry program: Parallelization and wavefunction initialization
下载免费PDF全文
![点击此处可从《International journal of quantum chemistry》网站下载免费的PDF全文](/ch/ext_images/free.gif)
Jing Zhang Andrew L. Weisman Patrick Saitta Richard A. Friesner 《International journal of quantum chemistry》2016,116(5):357-368
An outline of the improvements to the pseudospectral electronic structure program Jaguar is presented, showing efficient and robust performance of hybrid‐DFT calculations for large systems with thousands of basis functions, focusing on materials applications. The improvements include re‐engineered parallelization, the design of a fragment‐based initial guess generation method, and the validation of small eigenvalue cutoff values. An OpenMP/MPI hybrid parallelization has been implemented for the pseudospectral algorithm, which extends Jaguar's scalability to up to 256 cores in tests of TiO2 clusters with 1295‐4961 basis functions. In the largest test case, the code delivers 84.4× speedup for 128 cores in total calculation time. In addition, a fragment‐based initial guess method has been constructed for large systems containing many transition metals, where the conventional (atomic) approach often fails. Overall, Jaguar is now capable of efficiently and robustly performing hybrid‐DFT geometrical optimizations for large systems with more than 600 atoms in reasonable runtimes. © 2015 Wiley Periodicals, Inc. 相似文献
29.
van Wüllen C 《Journal of computational chemistry》2011,32(6):1195-1201
The programs ESCF, EGRAD, and AOFORCE are parts of the TURBOMOLE program package and compute excited-state properties and ground-state geometric hessians, respectively, for Hartree-Fock and density functional methods. The range of applicability of these programs has been extended by allowing them to use all CPU cores on a given node in parallel. The parallelization strategy is not new and duplicates what is standard today in the calculation of ground-state energies and gradients. The focus is on how this can be achieved without needing extensive modifications of the existing serial code. The key ingredient is to fork off worker processes with separated address spaces as they are needed. Test calculations on a molecule with about 80 atoms and 1000 basis functions show good parallel speedup up to 32 CPU cores. 相似文献
30.
密度矩阵重正化群方法(DMRG)在求解一维强关联格点模型的基态时可以获得较高的精度,在应用于二维或准二维问题时,要达到类似的精度通常需要较大的计算量与存储空间.本文提出一种新的DMRG异构并行策略,可以同时发挥计算机中央处理器(CPU)和图形处理器(GPU)的计算性能.针对最耗时的哈密顿量对角化部分,实现了数据的分布式存储,并且给出了CPU和GPU之间的负载平衡策略.以费米Hubbard模型为例,测试了异构并行程序在不同DMRG保留状态数下的运行表现,并给出了相应的性能基准.应用于4腿梯子时,观测到了高温超导中常见的电荷密度条纹,此时保留状态数达到104,使用的GPU显存小于12 GB. 相似文献