全文获取类型
收费全文 | 221篇 |
免费 | 20篇 |
国内免费 | 28篇 |
专业分类
化学 | 12篇 |
力学 | 4篇 |
综合类 | 3篇 |
数学 | 247篇 |
物理学 | 3篇 |
出版年
2023年 | 5篇 |
2022年 | 1篇 |
2021年 | 4篇 |
2020年 | 3篇 |
2019年 | 5篇 |
2018年 | 3篇 |
2017年 | 4篇 |
2016年 | 12篇 |
2015年 | 9篇 |
2014年 | 11篇 |
2013年 | 26篇 |
2012年 | 12篇 |
2011年 | 9篇 |
2010年 | 6篇 |
2009年 | 13篇 |
2008年 | 13篇 |
2007年 | 6篇 |
2006年 | 16篇 |
2005年 | 14篇 |
2004年 | 18篇 |
2003年 | 8篇 |
2002年 | 12篇 |
2001年 | 13篇 |
2000年 | 8篇 |
1999年 | 11篇 |
1998年 | 6篇 |
1997年 | 5篇 |
1996年 | 2篇 |
1995年 | 2篇 |
1994年 | 1篇 |
1993年 | 2篇 |
1991年 | 1篇 |
1990年 | 3篇 |
1988年 | 1篇 |
1985年 | 1篇 |
1984年 | 1篇 |
1983年 | 1篇 |
1982年 | 1篇 |
排序方式: 共有269条查询结果,搜索用时 31 毫秒
1.
在保持非负定性不变的前提下,本文对矩阵每一元素容许多大的扰动作了进一步的研究, 将本文的结论和C.R.Johnson提出的部分正定阵的正定完备化进行比较,容易发现对已知的正定矩阵求扰动,本文的结论比用C.R.Johnson的正定完备化计算扰动形式上更简单,同时也给出了不同于C.R.Johnson的部分正定阵的正定完备化表示的另外一个公式,推出了这些正定完备化矩阵应具有的若干性质. 相似文献
2.
We prove the following. Let G be an undirected graph. Every partially specified symmetric matrix, the graph of whose specified entries is G and each of whose fully specified submatrices is completely positive (equal to BBT for some entrywise nonnegative matrix B), may be completed to a completely positive matrix if and only if G is a block-clique graph (a chordal graph in which distinct maximal cliques overlap in at most one vertex). The same result holds for matrices that are doubly nonnegative (entrywise nonnegative and positive semidefinite). 相似文献
3.
4.
The nonlinear, nonnegative single‐mixture blind source separation problem consists of decomposing observed nonlinearly mixed multicomponent signal into nonnegative dependent component (source) signals. The problem is difficult and is a special case of the underdetermined blind source separation problem. However, it is practically relevant for the contemporary metabolic profiling of biological samples when only one sample is available for acquiring mass spectra; afterwards, the pure components are extracted. Herein, we present a method for the blind separation of nonnegative dependent sources from a single, nonlinear mixture. First, an explicit feature map is used to map a single mixture into a pseudo multi‐mixture. Second, an empirical kernel map is used for implicit mapping of a pseudo multi‐mixture into a high‐dimensional reproducible kernel Hilbert space. Under sparse probabilistic conditions that were previously imposed on sources, the single‐mixture nonlinear problem is converted into an equivalent linear, multiple‐mixture problem that consists of the original sources and their higher‐order monomials. These monomials are suppressed by robust principal component analysis and hard, soft, and trimmed thresholding. Sparseness‐constrained nonnegative matrix factorizations in reproducible kernel Hilbert space yield sets of separated components. Afterwards, separated components are annotated with the pure components from the library using the maximal correlation criterion. The proposed method is depicted with a numerical example that is related to the extraction of eight dependent components from one nonlinear mixture. The method is further demonstrated on three nonlinear chemical reactions of peptide synthesis in which 25, 19, and 28 dependent analytes are extracted from one nonlinear mixture mass spectra. The goal application of the proposed method is, in combination with other separation techniques, mass spectrometry‐based non‐targeted metabolic profiling, such as biomarker identification studies. Copyright © 2015 John Wiley & Sons, Ltd. 相似文献
5.
6.
7.
Xiao-xiaGuo Zhong-zhiBai 《计算数学(英文版)》2005,23(3):305-320
We study perturbation bound and structured condition number about the minimal nonnegative solution of nonsymmetric algebraic Riccati equation, obtaining a sharp perturbation bound and an accurate condition number. By using the matrix sign function method we present a new method for finding the minimal nonnegative solution of this algebraic Riccati equation. Based on this new method, we show how to compute the desired M-matrix solution of the quadratic matrix equation X^2 - EX - F = 0 by connecting it with the nonsymmetric algebraic Riccati equation, where E is a diagonal matrix and F is an M-matrix. 相似文献
8.
This paper introduces an algorithm for the nonnegative matrix factorization-and-completion problem, which aims to find nonnegative
low-rank matrices X and Y so that the product XY approximates a nonnegative data matrix M whose elements are partially known (to a certain accuracy). This problem aggregates two existing problems: (i) nonnegative
matrix factorization where all entries of M are given, and (ii) low-rank matrix completion where nonnegativity is not required. By taking the advantages of both nonnegativity
and low-rankness, one can generally obtain superior results than those of just using one of the two properties. We propose
to solve the non-convex constrained least-squares problem using an algorithm based on the classical alternating direction
augmented Lagrangian method. Preliminary convergence properties of the algorithm and numerical simulation results are presented.
Compared to a recent algorithm for nonnegative matrix factorization, the proposed algorithm produces factorizations of similar
quality using only about half of the matrix entries. On tasks of recovering incomplete grayscale and hyperspectral images,
the proposed algorithm yields overall better qualities than those produced by two recent matrix-completion algorithms that
do not exploit nonnegativity. 相似文献
9.
At present, the methods of constructing vector valued rational interpolation function in rectangular mesh are mainly presented by means of the branched continued fractions. In order to get vector valued rational interpolation function with lower degree and better approximation effect, the paper divides rectangular mesh into pieces by choosing nonnegative integer parameters d1 (0 〈 dl ≤ m) and d2 (0 ≤ d2≤ n), builds bivariate polynomial vector interpolation for each piece, then combines with them properly. As compared with previous methods, the new method given by this paper is easy to compute and the degree for the interpolants is lower. 相似文献
10.
A new two‐phase structure‐preserving doubling algorithm for critically singular M‐matrix algebraic Riccati equations 下载免费PDF全文
Tsung‐Ming Huang Wei‐Qiang Huang Ren‐Cang Li Wen‐Wei Lin 《Numerical Linear Algebra with Applications》2016,23(2):291-313
Among numerous iterative methods for solving the minimal nonnegative solution of an M‐matrix algebraic Riccati equation, the structure‐preserving doubling algorithm (SDA) stands out owing to its overall efficiency as well as accuracy. SDA is globally convergent and its convergence is quadratic, except for the critical case for which it converges linearly with the linear rate 1/2. In this paper, we first undertake a delineatory convergence analysis that reveals that the approximations by SDA can be decomposed into two components: the stable component that converges quadratically and the rank‐one component that converges linearly with the linear rate 1/2. Our analysis also shows that as soon as the stable component is fully converged, the rank‐one component can be accurately recovered. We then propose an efficient hybrid method, called the two‐phase SDA, for which the SDA iteration is stopped as soon as it is determined that the stable component is fully converged. Therefore, this two‐phase SDA saves those SDA iterative steps that previously have to have for the rank‐one component to be computed accurately, and thus essentially, it can be regarded as a quadratically convergent method. Numerical results confirm our analysis and demonstrate the efficiency of the new two‐phase SDA. Copyright © 2015 John Wiley & Sons, Ltd. 相似文献