咨询与建议

限定检索结果

文献类型

  • 8 篇 期刊文献

馆藏范围

  • 8 篇 电子文献
  • 0 种 纸本馆藏

日期分布

学科分类号

  • 7 篇 理学
    • 6 篇 数学
    • 4 篇 统计学(可授理学、...
  • 4 篇 工学
    • 4 篇 计算机科学与技术...
    • 1 篇 机械工程
    • 1 篇 电气工程
    • 1 篇 信息与通信工程
    • 1 篇 控制科学与工程
    • 1 篇 软件工程
  • 1 篇 经济学
    • 1 篇 应用经济学
  • 1 篇 管理学
    • 1 篇 图书情报与档案管...

主题

  • 8 篇 efficiency of al...
  • 3 篇 least squares me...
  • 2 篇 basic elements m...
  • 2 篇 smoothing
  • 1 篇 acychc directed ...
  • 1 篇 computational st...
  • 1 篇 curve segmentati...
  • 1 篇 pairs of vertice...
  • 1 篇 routing
  • 1 篇 piecewise-polyno...
  • 1 篇 graph algorithms
  • 1 篇 numerical experi...
  • 1 篇 simulation
  • 1 篇 quasi-monotone v...
  • 1 篇 data smoothing
  • 1 篇 approximation by...
  • 1 篇 higher-degree po...
  • 1 篇 disjoint paths
  • 1 篇 hamiltonian mont...
  • 1 篇 iterative method...

机构

  • 1 篇 univ warwick dep...
  • 1 篇 weizmann institu...
  • 1 篇 computer science...
  • 1 篇 acad romanian sc...
  • 1 篇 china med univ c...
  • 1 篇 cristal lille
  • 1 篇 psl res univ uni...
  • 1 篇 univ trieste dip...
  • 1 篇 imt lille douai ...
  • 1 篇 moscow mv lomono...
  • 1 篇 joint institute ...
  • 1 篇 laboratory of in...
  • 1 篇 department of ma...
  • 1 篇 kyung hee univ c...
  • 1 篇 joint institute ...
  • 1 篇 univ kwazulu nat...

作者

  • 3 篇 dikusar n.d.
  • 1 篇 qin x.
  • 1 篇 mewomo o. t.
  • 1 篇 shiloach y.
  • 1 篇 moret i
  • 1 篇 perl y.
  • 1 篇 ol'shanskii ma
  • 1 篇 owolabi a. o. e.
  • 1 篇 yao j. c.
  • 1 篇 tawn nick
  • 1 篇 chizhonkov ev
  • 1 篇 wu changye
  • 1 篇 elvira victor
  • 1 篇 robert christian...

语言

  • 7 篇 英文
  • 1 篇 其他
检索条件"主题词=efficiency of algorithms"
8 条 记 录,以下是1-10 订阅
排序:
On the best constant in the inf-sup-condition for elongated rectangular domains
收藏 引用
MATHEMATICAL NOTES 2000年 第3-4期67卷 325-332页
作者: Ol'shanskii, MA Chizhonkov, EV Moscow MV Lomonosov State Univ Moscow 117234 Russia
The Ladyzhenskaya-Babushka-Brezzi inequality (inf-sup-condition) is often used in the analysis of convergence of approximate solutions of hydrodynamic equations to exact ones. The constant involved in it depends on th... 详细信息
来源: 评论
ON SOLVING OPERATOR-EQUATIONS BY MULTIPOINT ITERATIVE METHODS
收藏 引用
INTERNATIONAL JOURNAL OF COMPUTER MATHEMATICS 1986年 第1期20卷 77-90页
作者: MORET, I UNIV TRIESTE DIPARTIMENTO ELETTROTECN ELETTR & INFORMAT I-34100 TRIESTE ITALY
Multipoint iterative procedures for solving non-linear operator equations in Banach spaces are considered. They are described by a general iteration scheme (1.2) which extends that proposed by Wolfe. Local convergence... 详细信息
来源: 评论
Accelerating MCMC algorithms
收藏 引用
WILEY INTERDISCIPLINARY REVIEWS-COMPUTATIONAL STATISTICS 2018年 第5期10卷 e1435-e1435页
作者: Robert, Christian P. Elvira, Victor Tawn, Nick Wu, Changye PSL Res Univ Univ Paris Dauphine Paris France Univ Warwick Dept Stat Coventry W Midlands England IMT Lille Douai Douai France CRIStAL Lille France
Markov chain Monte Carlo algorithms are used to simulate from complex statistical distributions by way of a local exploration of these distributions. This local feature avoids heavy requests on understanding the natur... 详细信息
来源: 评论
The basic element method
收藏 引用
Mathematical Models and Computer Simulations 2011年 第4期3卷 492-507页
作者: Dikusar, N.D. Joint Institute for Nuclear Research Laboratory of Information Technologies Moscow Russian Federation
The basic element method (BEM) for decomposition of the algebraic polynomial via one cubic and three quadratic parabolas (basic elements) is developed within the four-point transformation technique. Representation of ... 详细信息
来源: 评论
Higher-order polynomial approximation
收藏 引用
Mathematical Models and Computer Simulations 2016年 第2期8卷 183-200页
作者: Dikusar, N.D. Laboratory of Information Technologies Joint Institute for Nuclear Research Dubna 141980 Russian Federation
A new approach to polynomial higher-order approximation (smoothing) based on the basic elements method (BEM) is proposed. A BEM polynomial of degree n is defined by four basic elements specified on a three-point grid:... 详细信息
来源: 评论
Finding Two Disjoint Paths Between Two Pairs of Vertices in a Graph
收藏 引用
Journal of the ACM (JACM) 1978年 第1期25卷 1-9页
作者: Shiloach, Y. Perl, Y. Weizmann Institute of Science Rehovot Israel Computer Science Department Stanford University Stanford CA United States Department of Mathematics and Computer Science Bar-Ilan University Ramat-Gan Israel
Gwen a graph G = (V, E) and four verttces s1, t2, s2, and t2, the problem of finding two disjoint paths, P1 from s2 to t2 and P2 from s2 to t2, is considered This problem may arise as a transportation network problem ... 详细信息
来源: 评论
Piecewise polynomial approximation of the sixth order with automatic knots detection
收藏 引用
Mathematical Models and Computer Simulations 2014年 第5期6卷 509-522页
作者: Dikusar, N.D. Joint Institute for Nuclear Research Laboratory of Information Technologies ul. Joliot Curie 6 Dubna Moscow 141980 Russian Federation
Coefficients of a local segment model for piecewise polynomial approximation of the sixth order are evaluated using values of the function and of its first derivative at three knots of the support. The formulas for co... 详细信息
来源: 评论
STRONG CONVERGENCE ANALYSIS FOR SOLVING QUASI-MONOTONE VARIATIONAL INEQUALITIES AND FIXED POINT PROBLEMS IN REFLEXIVE BANACH SPACES
JOURNAL OF NONLINEAR FUNCTIONAL ANALYSIS
收藏 引用
JOURNAL OF NONLINEAR FUNCTIONAL ANALYSIS 2023年 第1期2023卷
作者: Owolabi, A. O. E. Mewomo, O. T. Yao, J. C. Qin, X. Univ KwaZulu Natal Sch Math Stat & Comp Sci Durban South Africa China Med Univ Ctr Gen Educ Taichung Taiwan Acad Romanian Scientists Bucharest 50044 Romania Kyung Hee Univ Ctr Adv Informat Technol Seoul 02447 South Korea
In this paper, we propose a modified inertial hybrid Tseng's extragradient algorithm with self-adaptive step sizes for finding a common solution of variational inequalities with quasimonotone operators and the fix... 详细信息
来源: 评论