搜索结果: 1-6 共查到“计算数学 the line”相关记录6条 . 查询时间(0.156 秒)
SANDPILE GROUPS AND SPANNING TREES OF DIRECTED LINE GRAPHS
SANDPILE GROUPS SPANNING TREES DIRECTED LINE GRAPHS
2015/8/14
We generalize a theorem of Knuth relating the oriented spanning trees of a directed graph G and its directed line graph LG. The sandpile group is an abelian group associated to a directed graph, whose...
A Nonlinear Conjugate Gradient Algorithm with An Optimal Property and An Improved Wolfe Line Search
conjugate gradient method memoryless BFGS method unconstrained optimization global convergence Wolfe line search
2012/8/10
In this paper, we seek the conjugate gradient direction closest to the direction of the
scaled memoryless BFGS method and propose a family of conjugate gradient methods for
unconstrained optimizatio...
Explicit formula for the solution of the Szegö equation on the real line and applications
Szeg¨o equation integrable systems Lax pair Hankel operators soliton resolution
2011/1/21
We consider the cubic Szeg¨o equation i@tu = (|u|2u) in the Hardy space L2 +(R) on the upper half-plane, where is the Szeg¨o projector.
AN SQP ALGORITHM WITH NONMONOTONE LINE SEARCH FOR GENERAL NONLINEARCONSTRAINED OPTIMIZATION PROBLEM
2007/12/11
In this paper, an SQP type algorithm with a new nonmonotone line search
technique for general constrained optimization problems is presented.
The new algorithm does not have to solve the second orde...
We extend the SCGS smoothing procedure (Symmetrical Collective
Gauss--Seidel relaxation) proposed by S.~P.~Vanka$^{[4]}$,
for multigrid solvers of the steady viscous incompressible Navier--Stokes
e...
The Global Convergence of Self-scale BFGS Algorithm with Nonmonotone Line Search for Unconstrained Nonconvex Optimization Problems
nonmonotone line search self-scaling BFGS method global convergence
2007/12/11
The self-scaling quasi-Newton method solves an unconstrained optimization problem by scaling the Hessian approximation matrix before it is updated at each iteration to avoid the possible large eigenva...
