全文获取类型
收费全文 | 257篇 |
免费 | 4篇 |
国内免费 | 10篇 |
专业分类
化学 | 2篇 |
力学 | 14篇 |
综合类 | 3篇 |
数学 | 218篇 |
物理学 | 34篇 |
出版年
2023年 | 2篇 |
2022年 | 5篇 |
2021年 | 3篇 |
2020年 | 3篇 |
2019年 | 4篇 |
2018年 | 7篇 |
2017年 | 3篇 |
2016年 | 7篇 |
2015年 | 6篇 |
2014年 | 12篇 |
2013年 | 22篇 |
2012年 | 8篇 |
2011年 | 13篇 |
2010年 | 17篇 |
2009年 | 13篇 |
2008年 | 23篇 |
2007年 | 18篇 |
2006年 | 11篇 |
2005年 | 3篇 |
2004年 | 6篇 |
2003年 | 9篇 |
2002年 | 8篇 |
2001年 | 3篇 |
2000年 | 6篇 |
1999年 | 8篇 |
1998年 | 7篇 |
1997年 | 10篇 |
1996年 | 6篇 |
1995年 | 3篇 |
1994年 | 5篇 |
1993年 | 1篇 |
1992年 | 1篇 |
1991年 | 1篇 |
1990年 | 1篇 |
1989年 | 1篇 |
1987年 | 2篇 |
1985年 | 2篇 |
1984年 | 2篇 |
1982年 | 3篇 |
1980年 | 2篇 |
1979年 | 2篇 |
1977年 | 2篇 |
排序方式: 共有271条查询结果,搜索用时 15 毫秒
1.
The (mixed finite element) discretization of the linearized Navier–Stokes equations leads to a linear system of equations of saddle point type. The iterative solution of this linear system requires the construction of suitable preconditioners, especially in the case of high Reynolds numbers. In the past, a stabilizing approach has been suggested which does not change the exact solution but influences the accuracy of the discrete solution as well as the effectiveness of iterative solvers. This stabilization technique can be performed on the continuous side before the discretization, where it is known as ‘grad‐div’ (GD) stabilization, as well as on the discrete side where it is known as an ‘augmented Lagrangian’ (AL) technique (and does not change the discrete solution). In this paper, we study the applicability of ??‐LU factorizations to solve the arising subproblems in the different variants of stabilized saddle point systems. We consider both the saddle point systems that arise from the stabilization in the continuous as well as on the discrete setting. Recently, a modified AL preconditioner has been proposed for the system resulting from the discrete stabilization. We provide a straightforward generalization of this approach to the GD stabilization. We conclude the paper with numerical tests for a variety of problems to illustrate the behavior of the considered preconditioners as well as the suitability of ??‐LU factorization in the preconditioners. Copyright © 2010 John Wiley & Sons, Ltd. 相似文献
2.
3.
New representation and factorizations of the higher-order ultraspherical-type differential equations
The paper deals with the class of linear differential equations of any even order 2α+4, α∈N0, which are associated with the so-called ultraspherical-type polynomials. These polynomials form an orthogonal system on the interval [−1,1] with respect to the ultraspherical weight function (1−x2)α and additional point masses of equal size at the two endpoints. The differential equations of “ultraspherical-type” were developed by R. Koekoek in 1994 by utilizing special function methods. In the present paper, a new and completely elementary representation of these higher-order differential equations is presented. This result is used to deduce the orthogonality relation of the ultraspherical-type polynomials directly from the differential equation property. Moreover, we introduce two types of factorizations of the corresponding differential operators of order 2α+4 into a product of α+2 linear second-order operators. 相似文献
4.
LU和Cholesky分解的向前舍入误差分析 总被引:2,自引:1,他引:1
1引言LU分解可用于解可逆线性系统Ax=b.作为数值代数领域中的重要工具,其舍入误差分析一直为众多学者所关注.事实上,长方矩阵的LU分解也有着广泛的应用,如,确定矩阵数值秩的LU分解(RRLU)[5,7],解等式约束最小二乘问题的直接消去法[3]等问题中都涉及到长方矩阵的LU分解.当A∈Rm×n且秩r≤min{m,n},则在考虑A的LU分解时[4],一般需要确定置换阵∏L,∏R使得A(1):=∏L-A∏R的LU分解能持续qr步,这里当A为亏秩矩阵时,qr=r;否贝qr=r-1.在.A(1)的LU分解的第k(k≤qr)步,需执行如下Gauss消去过程: 相似文献
5.
《Wave Motion》2020
The paper examines the model problem of high-frequency diffraction by a convex surface consisting of two parts. One is soft, the other is hard. The incident wave falls at a small angle to the line which separates soft and hard parts of the surface. The change in the boundary condition provokes the field in the Fock zone to have a rapid transverse variation. This causes a special boundary-layer to be formed. The boundary value problem for the three dimensional parabolic equation is reduced to the Riemann problem solved by the factorization in the form of infinite products containing the zeros of the Airy function and zeros of its derivative. the results of this factorization appear under the sign of double Fourier integral in the representation of the field. Both numerical and asymptotic analysis of this representation is carried out and illustrates the effects of high-frequency diffraction caused by the line of the boundary condition discontinuity. 相似文献
6.
Gouranga C. Nayak 《Annals of Physics》2010,325(2):514-3898
Factorization theorem plays the central role at high energy colliders to study standard model and beyond standard model physics. The proof of factorization theorem is given by Collins, Soper and Sterman to all orders in perturbation theory by using diagrammatic approach. One might wonder if one can obtain the proof of factorization theorem through symmetry considerations at the lagrangian level. In this paper we provide such a proof. 相似文献
7.
In this paper, we prove that the set of all factorization indices of a completely positive graph has no gaps. In other words,
we give an affirmative answer to a question raised by N. Kogan and A. Berman [8] in the case of completely positive graphs.
Received December 9, 1997, Accepted May 16, 2002 相似文献
8.
图中具有某种性质的子图 总被引:1,自引:0,他引:1
汪长平 《高校应用数学学报(A辑)》1999,14(4):485-488
设g和f是定义在图G的顶点集合V(G)上的整数值函数且对每个x∈V(G)都有0≤g(x)≤f(x)且g(x)和f(x)为偶数。本文证明了:若G是一个(mg+k-1,mf-k+1)-图,1≤k≤m,H是G中一个给定的有k条边的子图,则G存在一个子图R使得R有一个(g,f)-因子分解与H正交。 相似文献
9.
Richard D. McBride 《Mathematical Programming》1980,18(1):49-61
A dynamic factorization algorithm is developed which algebraically partitions the basis inverse in such a manner so that the simplex method can be executed from a series of small inverses and the basis itself. This partition is maintained dynamically so that the additional memory required to represent the basis inverse reduces to this series of small inverses for in-core implementations.The algorithm is intended for use in solving general large-scale linear programming problems. This new method of basis representation should permit rather large problems to be solved completely in-core.Preliminary computational experience is presented and comparisons are made with Reid's sparsity-exploiting variant of the Bartels—Golub decomposition for linear programming bases. The computational experience indicated that a significant reduction in memory requirements can usually be obtained using the dynamic factorization approach with only a slight (up to about 20%) degradation of execution time.This research was supported in part by the Air Force Office of Scientific Research, Air Force System Command, USAF, under AFOSR Contract/Grant Number AFOSR-74-2715. 相似文献
10.
我们发现可以把二元多项式盾成系数为一元多项式的一元多项式来进行分解,据此,本文建立了二元整系数多项式因式分解的一种理论,提出了一个完整的分解二元整系数多项式的算法。这个算法还能很自然地推广成分解多元整系数多项式的算法。 相似文献