Results 21 to 30 of about 689,207 (330)
An Elementary Approach to Polynomial Optimization on Polynomial Meshes
A polynomial mesh on a multivariate compact set or manifold is a sequence of finite norming sets for polynomials whose norming constant is independent of degree.
Marco Vianello
doaj +1 more source
Edit Distance with Block Deletions
Several variants of the edit distance problem with block deletions are considered. Polynomial time optimal algorithms are presented for the edit distance with block deletions allowing character insertions and character moves, but without block moves.
Dana Shapira, James A. Storer
doaj +1 more source
The Zhegalkin Polynomial of Multiseat Sole Sufficient Operator
Among functionally complete sets of Boolean functions, sole sufficient operators are of particular interest. They have a wide range of applicability and are not limited to the two-seat case.
Leonid Y. Bystrov, Egor V. Kuzmin
doaj +1 more source
A Jacobi Dual-Petrov-Galerkin Method for Solving Some Odd-Order Ordinary Differential Equations
A Jacobi dual-Petrov-Galerkin (JDPG) method is introduced and used for solving fully integrated reformulations of third- and fifth-order ordinary differential equations (ODEs) with constant coefficients.
E. H. Doha, A. H. Bhrawy, R. M. Hafez
doaj +1 more source
The best constant of Sobolev inequality corresponding to anti-periodic boundary value problem
In this paper we establish the best constant of $\mathcal{L}^{p}$ Sobolev inequality for a function with anti-periodic boundary conditions. The best constant is expressed by $\mathcal{L}^q$ norm of $(M-1)$-th order Euler polynomial.
Jozef Kiseľák
doaj +1 more source
Meromorphic solutions of three certain types of non-linear difference equations
In this paper, the representations of meromorphic solutions for three types of non-linear difference equations of form $ f^{n}(z)+P_{d}(z, f) = u(z)e^{v(z)}, $ $ f^{n}(z)+P_{d}(z, f) = p_{1}e^{\lambda z}+p_{2}e^{-\lambda z} $ and $
Min Feng Chen +2 more
doaj +1 more source
Complete sets of invariants for dynamical systems that admit a separation of variables [PDF]
Consider a classical Hamiltonian H in n dimensions consisting of a kinetic energy term plus a potential. If the associated Hamilton–Jacobi equation admits an orthogonal separation of variables, then it is possible to generate algorithmically a canonical ...
Bonatos D. +12 more
core +2 more sources
Polynomial solutions to constant coefficient differential equations [PDF]
Let D 1 , … , D r ∈ C [ ∂ / ∂ x 1 , … , ∂ / ∂
openaire +2 more sources
Determining projection constants of univariate polynomial spaces
The long-standing problem of minimal projections is addressed from a computational point of view. Techniques to determine bounds on the projection constants of univariate polynomial spaces are presented. The upper bound, produced by a linear program, and the lower bound, produced by a semidefinite program exploiting the method of moments, are often ...
Foucart, Simon, Lasserre, Jean-Bernard
openaire +5 more sources
Piecewise polynomial representations of genomic tracks. [PDF]
Genomic data from micro-array and sequencing projects consist of associations of measured values to chromosomal coordinates. These associations can be thought of as functions in one dimension and can thus be stored, analyzed, and interpreted as piecewise-
Maxime Tarabichi +2 more
doaj +1 more source

