The non-parametric filtered CPD is used to impose smoothness on the solution without imposing a polynomial constraint.doi:10.1016/j.ifacol.2021.08.437David T. WestwickDepartment of Electrical and Computer Engin
Starting with the interpolation problem, we define non-polynomial divided differences recursively as a generalization of classical divided differences. We also derive the identities and the properties of these non-polynomial divided differences such as symmetry and Leibniz formula which is a main tool ...
We demonstrate the design of a neural network hardware, where all neuromorphic computing functions, including signal routing and nonlinear activation are performed by spin-wave propagation and interference. Weights and interconnections of the network are realized by a magnetic-field pattern that is applie...
近十年有一个热门方向就是非凸的随机算法。下面将分两大类介绍：1. 随机算法复杂度的理论结果；2. ...
Holland, Non-negativity of Exponential Polynomial Trigonometric Functions-a Budan Fourier sequence approach, Poster 429 presented at the Bachelier Finance Society Congress, Toronto, 2010; available on-line at web-address http://euclid.ucc.ie/staff/hanzon/BFSTorontoPosterHanzonHollandFinal.pdf B. ...
(FNN) to learn a given set of the master equations’ solution functions for a specific non-equilibrium model38. Their ML framework showed a great computational speed-up compared to numerical integrators, with generalization performances left unclear. Similarly, Campoli et al.39explored different ML ...
For polynomial functions this includes computing the Milnor number at the origin [29] and the bifurcation set [32, 46]. Whereas for maps, Newton polyhedra were used to compute the Łojasiewicz exponents [3], prove non-properness conditions [42], and compute the set of atypical values [7,...
(Fundamental Theorem of Algebra) A non-constant polyno-mial of one complex variable takes on every complex value. Moreover, if the poly-nomial is of degree d, then every complex value is taken on d times, countingmultiplicity.Because entire functions have power series expansions, they are ...
5. Value Sharing One of the more striking consequences of Nevanlinna theory is Nevanlinna’s theorem that if two non-constant meromorphic functions f and g share ?ve values, then f must equal g, [Ne]. The polynomial version of this was taken up by Adams and Straus in [AS]. Theorem ...
any submodular function can be minimized in polynomial time [34, 14], maximization turns out to be more difficult and indeed all the aforementioned special cases are NP-hard. A related problem is Max-k-Cover, where the goal is to choose k sets whose union is as large as possible. It...