首页 | 本学科首页   官方微博 | 高级检索  
相似文献
 共查询到20条相似文献,搜索用时 140 毫秒
1.
The singular value decomposition problem is mathematically equivalent to the eigenproblem of an argumented matrix. Golub et al. give a bidiagonalization Lanczos method for computing a number of largest or smallest singular values and corresponding singular vertors, but the method may encounter some convergence problems. In this paper we analyse the convergence of the method and show why it may fail to converge. To correct this possible nonconvergence, we propose a refined bidiagonalization Lanczos method and apply the implicitly restarting technique to it, and we then present an implicitly restarted bidiagonalization Lanczos algorithm(IRBL) and an implicitly restarted refined bidiagonalization Lanczos algorithm (IRRBL). A new implicitly restarting scheme and a reliable and efficient algorithm for computing refined shifts are developed for this special structure eigenproblem.Theoretical analysis and numerical experiments show that IRRBL performs much better than IRBL.  相似文献   

2.
邓键  黄庆道  马明娟 《东北数学》2008,24(5):433-446
In this paper we propose an optimal method for solving the linear bilevel programming problem with no upper-level constraint. The main idea of this method is that the initial point which is in the feasible region goes forward along the optimal direction firstly. When the iterative point reaches the boundary of the feasible region, it can continue to go forward along the suboptimal direction. The iteration is terminated until the iterative point cannot go forward along the suboptimal direction and effective direction, and the new iterative point is the solution of the lower-level programming. An algorithm which bases on the main idea above is presented and the solution obtained via this algorithm is proved to be optimal solution to the bilevel programming problem. This optimal method is effective for solving the linear bilevel programming problem.  相似文献   

3.
In this paper,we present an algorithm for the CDT subproblem.This problem stemsfrom computing a trust region step of an algorithm,which was first proposed by Celis,Dennis and Tapia for equality constrained optimization.Our algorithm considers generalcase of the CDT subproblem,convergence of the algorithm is proved.Numerical examplesare also provided.  相似文献   

4.
In this paper, we study the extension of isometries between the unit spheres of normed space E and C(Ω). We obtain that any surjective isometry between the unit spheres of normed space E and C(Ω) can be extended to be a linear isometry on the whole space E and give an affirmative answer to the corresponding Tingley's problem (where Ω be a compact metric space).  相似文献   

5.
In this paper, we consider a MUSIC algorithm for locating point-like scatterers contained in a sample on flat substrate. Based on an asymptotic expansion of the scattering amplitude proposed by Ammari et al., the reconstruction problem can be reduced to a calculation of Green function corresponding to the background medium. In addition, we use an explicit formulation of Green function in the MUSIC algorithm to simplify the calculation when the cross-section of sample is a half-disc. Numerical experiments are included to demonstrate the feasibility of this method.  相似文献   

6.
In this paper,we consider the following indefinite complex quadratic maximization problem: maximize zHQz,subject to zk ∈ C and zkm = 1,k = 1,...,n,where Q is a Hermitian matrix with trQ = 0,z ∈ Cn is the decision vector,and m 3.An (1/log n) approximation algorithm is presented for such problem.Furthermore,we consider the above problem where the objective matrix Q is in bilinear form,in which case a 0.7118 cos mπ 2approximation algorithm can be constructed.In the context of quadratic optimization,various extensions and connections of the model are discussed.  相似文献   

7.
Spontaneous potential well-logging is one of the important techniques in petroleum exploitation. A spontaneous potential satisfies an elliptic equivalued surface boundary value problem with diseontinuous interface conditlons. In practice, the measuring electrode is so small that we can simplify the corresponding equivalued surface to a point. In this paper, we give a positive answer to this approximation process: when the equivalued surface shrinks to a point, the solution of the original equivalued surface boundary value problem converges to the solution of the corresponding limit boundary value problem.  相似文献   

8.
In this paper,a semiparametric two-sample density ratio model is considered and the empirical likelihood method is applied to obtain the parameters estimation.A commonly occurring problem in computing is that the empirical likelihood function may be a concaveconvex function.Here a simple Lagrange saddle point algorithm is presented for computing the saddle point of the empirical likelihood function when the Lagrange multiplier has no explicit solution.So we can obtain the maximum empirical likelihood estimation (MELE) of parameters.Monte Carlo simulations are presented to illustrate the Lagrange saddle point algorithm.  相似文献   

9.
In this paper,a semiparametric two-sample density ratio model is considered and the empirical likelihood method is applied to obtain the parameters estimation.A commonly occurring problem in computing is that the empirical likelihood function may be a concaveconvex function.Here a simple Lagrange saddle point algorithm is presented for computing the saddle point of the empirical likelihood function when the Lagrange multiplier has no explicit solution.So we can obtain the maximum empirical likelihood estimation (MELE) of parameters.Monte Carlo simulations are presented to illustrate the Lagrange saddle point algorithm.  相似文献   

10.
The nonlinear complementarity problem can be reformulated as a nonsmooth equation. In this paper we propose a new smoothing Newton algorithm for the solution of the nonlinear complementarity problem by constructing a new smoothing approximation function. Global and local superlinear convergence results of the algorithm are obtained under suitable conditions. Numerical experiments confirm the good theoretical properties of the algorithm.  相似文献   

11.
This paper is concerned with the unique positive definite solution to a system of nonlinear matrix equations $X-A^*\bar{Y}^{-1}A=I_n$ and $Y-B^*\bar{X}^{-1}B=I_n$, where $A,B\in\mathbb{C}^{n\times n}$ are given matrices. Based on the special structure of the system of nonlinear matrix equations, the system can be equivalently reformulated as $V-C^*\bar{V}^{-1}C=I_{2n}$. Moreover, by means of Sherman-Moorison-Woodbury formula, we derive the relationship between the solutions of $V-C^*\bar{V}^{-1}C =I_{2n}$ and the well studied standard nonlinear matrix equation $Z+D^*Z^{-1}D=Q$, where $D$, $Q$ are uniquely determined by $C$. Then, we present a structure-preserving doubling algorithm and two modified structure-preserving doubling algorithms to compute the positive definite solution of the system. Furthermore, cyclic reduction algorithm and two modified cyclic reduction algorithms for the positive definite solution of the system are proposed. Finally, some numerical examples are presented to illustrate the efficiency of the theoretical results and the behavior of the considered algorithms.  相似文献   

12.
In this paper,we study the existence of positive solutions for the nonlinear singular third-order three-point boundary value problemu (t) = λa(t)f(t,u(t)),u(0) = u (1) = u (η) = 0,where λ is a positive parameter and 0 ≤ η 1 2 .By using the classical Krasnosel’skii’s fixed point theorem in cone,we obtain various new results on the existence of positive solution,and the solution is strictly increasing.Finally we give an example.  相似文献   

13.
研究了Hilbert空间H(?)K上的2×2阶上三角算子矩阵Mc=(AO CB)当A,B 给定,C为任意有界线性算子时,对Mc的点谱、剩余谱、连续谱的扰动分别给出了描述.  相似文献   

14.
设$(A,B,V,W,\psi,\phi)$是一个Morita Context,具有一对零态射$\psi=0$, $\phi=0$, $C =\left ( \begin{array} {cc}A & V \\W & B \end{array}\right)$是对应的Morita Context环.本文给出了$C$与$A,B,V,W$之间关于环的$\pi$-正则性、semiclean性、Mophic性和环的Exchgange性、Potent性、GM性的关系.  相似文献   

15.
本文我们考虑如下二阶奇异差分边值问题\begin{equation*}\begin{cases}-\Delta^{2} u(t-1)=\lambda g(t)f(u) ,\ t\in [1,T]_\mathbb{Z},\\u(0)=0,\\ \Delta u(T)+c(u(T+1))u(T+1)=0,\end{cases}\end{equation*}正解的存在性. 其中, $\lambda>0$, $f:(0,\infty)\rightarrow \mathbb{R}$ 是连续的,且允许在~$0$ 处奇异.通过引入一个新的全连续算子, 我们建立正解的存在性.  相似文献   

16.
In this paper, the authors aim at proving two existence results of fractional differential boundary value problems of the form(P_(a,b)){D~αu(x) + f(x, u(x)) = 0, x ∈(0, 1),u(0) = u(1) = 0, D~(α-3)u(0) = a, u(1) =-b,where 3 α≤ 4, Dαis the standard Riemann-Liouville fractional derivative and a, b are nonnegative constants. First the authors suppose that f(x, t) =-p(x)t~σ, with σ∈(-1, 1)and p being a nonnegative continuous function that may be singular at x = 0 or x = 1and satisfies some conditions related to the Karamata regular variation theory. Combining sharp estimates on some potential functions and the Sch¨auder fixed point theorem, the authors prove the existence of a unique positive continuous solution to problem(P_(0,0)).Global estimates on such a solution are also obtained. To state the second existence result, the authors assume that a, b are nonnegative constants such that a + b 0 and f(x, t) = tφ(x, t), with φ(x, t) being a nonnegative continuous function in(0, 1)×[0, ∞) that is required to satisfy some suitable integrability condition. Using estimates on the Green's function and a perturbation argument, the authors prove the existence and uniqueness of a positive continuous solution u to problem(P_(a,b)), which behaves like the unique solution of the homogeneous problem corresponding to(P_(a,b)). Some examples are given to illustrate the existence results.  相似文献   

17.
Let B  R~n be the unit ball centered at the origin. The authors consider the following biharmonic equation:{?~2u = λ(1 + u)~p in B,u =?u/?ν= 0 on ?B, where p n+4/ n-4and ν is the outward unit normal vector. It is well-known that there exists a λ* 0 such that the biharmonic equation has a solution for λ∈ (0, λ*) and has a unique weak solution u*with parameter λ = λ*, called the extremal solution. It is proved that u* is singular when n ≥ 13 for p large enough and satisfies u*≤ r~(-4/ (p-1)) - 1 on the unit ball, which actually solve a part of the open problem left in [D`avila, J., Flores, I., Guerra, I., Multiplicity of solutions for a fourth order equation with power-type nonlinearity, Math. Ann., 348(1), 2009, 143–193] .  相似文献   

18.
§1.IntroductionLetHbeaHilbertspacewithnorm‖·‖andinnerproduct(·,·)andletCbeanonemptysubsetofH.AmappingT:C|→CissaidtobeLipschit...  相似文献   

19.
Given a convex body $C\subset R^n$ (i.e., a compact convex set with nonempty interior), for $x\in$ {\it int}$(C)$, the interior, and a hyperplane $H$ with $x\in H$, let $H_1,H_2$ be the two support hyperplanes of $C$ parallel to $H$. Let $r(H, x)$ be the ratio, not less than 1, in which $H$ divides the distance between $H_1,H_2$. Then the quantity $${\it As}(C):=\inf_{x\in {\it int}(C)}\,\sup_{H\ni x}\,r(H,x)$$ is called the Minkowski measure of asymmetry of $C$. {\it As}$(\cdot)$ can be viewed as a real-valued function defined on the family of all convex bodies in $R^n$. It has been known for a long time that {\it As}$(\cdot)$ attains its minimum value 1 at all centrally symmetric convex bodies and maximum value $n$ at all simplexes. In this paper we discuss the stability of the Minkowski measure of asymmetry for convex bodies. We give an estimate for the deviation of a convex body from a simplex if the corresponding Minkowski measure of asymmetry is close to its maximum value. More precisely, the following result is obtained: Let $C\subset R^n$ be a convex body. If {\it As}$(C)\ge n-\varepsilon$ for some $0\le \varepsilon < 1/8(n+1),$ then there exists a simplex $S_0$ formed by $n+1$ support hyperplanes of $C$, such that $$(1+8(n+1)\varepsilon)^{-1}S_0\subset C\subset S_0,$$ where the homethety center is the (unique) Minkowski critical point of $C$. So $$d_{{\rm BM}}(C,S)\le 1+8(n+1)\varepsilon$$ holds for all simplexes $S$, where $d_{{\rm BM}}(\cdot,\cdot)$ denotes the Banach-Mazur distance.  相似文献   

20.
Graph sparsification is to approximate an arbitrary graph by a sparse graph and is useful in many applications, such as simplification of social networks, least squares problems, and numerical solution of symmetric positive definite linear systems. In this paper, inspired by the well-known sparse signal recovery algorithm called orthogonal matching pursuit (OMP), we introduce a deterministic, greedy edge selection algorithm, which is called the universal greedy approach (UGA) for the graph sparsification problem. For a general spectral sparsification problem, e.g., the positive subset selection problem from a set of $m$ vectors in $\mathbb{R}^n$, we propose a nonnegative UGA algorithm which needs $O(mn^2+ n^3/\epsilon^2)$ time to find a $\frac{1+\epsilon/\beta}{1-\epsilon/\beta}$-spectral sparsifier with positive coefficients with sparsity at most $\lceil\frac{n}{\epsilon^2}\rceil$, where $\beta$ is the ratio between the smallest length and largest length of the vectors. The convergence of the nonnegative UGA algorithm is established. For the graph sparsification problem, another UGA algorithm is proposed which can output a $\frac{1+O(\epsilon)}{1-O(\epsilon)}$-spectral sparsifier with $\lceil\frac{n}{\epsilon^2}\rceil$ edges in $O(m+n^2/\epsilon^2)$ time from a graph with $m$ edges and $n$ vertices under some mild assumptions. This is a linear time algorithm in terms of the number of edges that the community of graph sparsification is looking for. The best result in the literature to the knowledge of the authors is the existence of a deterministic algorithm which is almost linear, i.e. $O(m^{1+o(1)})$ for some $o(1)=O(\frac{(\log\log(m))^{2/3}}{\log^{1/3}(m)})$. Finally, extensive experimental results, including applications to graph clustering and least squares regression, show the effectiveness of proposed approaches.  相似文献   

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

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