必应词典为您提供nondifferentiable的释义,英['nɒndɪfə'renʃɪəbl],adj. 〔数〕不可微的; 网络释义: 不可微分;
nondifferentiable 英['nɒndɪfə'renʃɪəbl] 美['nɒndɪfə'renʃɪrbl] 释义 adj. 不可微分的 实用场景例句 全部 He first discussed his example of a continuousnondifferentiablefunction. 他首先讨论了其连续不可微函数的例子....
non differentiable 不可微分的 differentiable adj. 可辨的, 可区分的,可微的 non ad. 1.【拉】非;不 n. 1.【法】反对票;投反对票的人 non a. 非,无,不 non aligned adj. 不结盟 non finite a. 非定形的 non interlaced adj. 非交错式的 non privileged a. 没有特权的,没有权利的 ...
nondifferentiable 词条 nondifferentiable 基本释义 不可微分 专业释义 <造纸>不可微分的 词条提问 欢迎你对此术语进行提问>>
same context (17) Words that are found in similar contexts 1-dimensional 3-second better-natured buried d15 deicer greater interesting non-decreasing non-void now-and reinforce semicontinuous symplectic tallyho throug to-ennien relateds (1) relateds ...
of differentiable functions, - for Dirac operators and not just for Hill-Schroedinger operators, - in both the self-adjoint and non-self-adjoint cases. ... P Djakov,BS Mityagin - 《Russian Mathematical Surveys》 被引量: 132发表: 2006年 Fractional variational calculus for nondifferentiable funct...
B.M.Glover, On quasidifferentiable functions and non-differentiable programming, Optimization 24 (1992), 253-268.Glover, B.M.: On quasidifferentiable functions and non-differentiable programming. Optimization 24 (3–4), 253–286 (1992)On quasidifferentiable functions and nondifferentiable programming ...
Noncoercive Variational–Hemivariational Inequalities: Existence, Approximation by Double Regularization, and Application to Nonmonotone Contact Problems Our approach consists in a double regularization: we combine a Browder–Tikhonov regularization with regularization tools of nondifferentiable optimization to ......
Each polynomial in n variables can be written as sum of monomials with nonzero coefficients: P(:e) = L caR[a](:e), aEA{P) IX x Nondifferentiable optimization and polynomial problems where A(P) is the set of monomials contained in polynomial P. ...
nondifferentiable programmingnondifferentiable programming[¦nän‚dif·ə′ren·chə·bəl ′prō‚gram·iŋ] (mathematics) The branch of nonlinear programming which does not require the objective and constraint functions to be differentiable....