Results 21 to 30 of about 1,820,249 (291)
Comptes Rendus. Mathématique, 2021 We prove that the minimizer in the Nédélec polynomial space of some degree $p\ge 0$ of a discrete minimization problem performs as well as the continuous minimizer in $H({\bf curl})$, up to a constant that is independent of the polynomial degree $p$. The
Chaumont-Frelet, Théophile +2 more
doaj +1 more source
Constant terms in powers of a Laurent polynomial
Indagationes Mathematicae, 1998 The following is a conjecture of O. Mathieu: Let \(K\) be a connected real compact Lie group. Let \(f\) and \(g\) be \(K\)-finite functions on \(K\). Assume for all \(n \geq 1\) that the constant term of \(f^{n}\) vanishes, i.e. \[ \int_{K} f^{n}(k) \;dk = 0 .
Duistermaat, J.J., Kallen, W. van der
openaire +3 more sources
Problems on multivariate reliability polynomial
Atti della Accademia Peloritana dei Pericolanti : Classe di Scienze Fisiche, Matematiche e Naturali, 2017 The original results include: (i) homogenization of a reliability polynomial; (ii) compact hypersurfaces attached to homogeneous polynomials; (iii) an affine diffeomorphism that preserves a reliability polynomial; (iv) duality of networks via a ...
Constantin Udriste +2 more
doaj +1 more source
An Elementary Approach to Polynomial Optimization on Polynomial Meshes
Journal of Mathematical and Fundamental Sciences, 2018 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
Algorithms, 2011 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
Degree estimates for polynomials constant on a hyperplane
Michigan Mathematical Journal, 2007 The study of proper rational mappings between balls in complex Euclidean spaces naturally leads to the relationship between the degree and imbedding dimension of such a mapping. The special case for monomial mappings is equivalent to the question discussed in this paper. Estimate the degree $d$ of a polynomial in $n$ real variables, assumed to have non-
D'Angelo, John +2 more
openaire +3 more sources
A Jacobi Dual-Petrov-Galerkin Method for Solving Some Odd-Order Ordinary Differential Equations
Abstract and Applied Analysis, 2011 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
Electronic Journal of Qualitative Theory of Differential Equations, 2014 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
On the Sidon constant for Dirichlet polynomials
Bulletin des Sciences Mathématiques, 2014 Minor ...
openaire +3 more sources
Square-rich fixed point polynomial evaluation on FPGAs [PDF]
, 2014 Polynomial evaluation is important across a wide range of application domains, so significant work has been done on accelerating its computation. The conventional algorithm, referred to as Horner's rule, involves the least number of steps but can lead to
McLoughlin, Ian V. +5 more
core +1 more source