In the framework of Polynomial Eigenvalue Problems (PEPs), most matrix polynomials arising in applications are structured (namely, (skew-)symmetric, (skew-)Hermitian, (anti-)palindromic, or alternating). The standard way to solve PEPs is by means linearizations. frequently used linearizations belong general constructions, valid for all a fixed degree, known as companion It well known, however, ...

As an important content of enterprise management, financial management is work for enterprises to identify, prevent and control accounting risks, a key path implement the business policy enterprises. Scientific implementation conducive strengthening supervision can guarantee security integrity assets, as well stable operation efficient development So achieve goal improving economic benefits Und...

Ray tracing of implicit surfaces based on radial basis functions can demand high computational cost in the presence of a large number of radial centers. Recently, it was presented the Least Squares Hermite Radial Basis Functions (LS-HRBF) Implicits, a method for implicit surface reconstruction from Hermitian data (points equipped with their normal vectors) which makes use of iterative center se...

There exists a feasible procedure to decide whether or not an arbitrary polynomial belongs to a given ideal in Z[x] if the ideal’s minimal basis is known. However, when this is not the case there is no feasible procedure to decide whether or not an arbitrary polynomial belongs to a given ideal. There already exists an effective procedure to find an ideal’s minimal basis, but it depends on solvi...

We study cooperation structures with the following property: Given any two feasible coalitions with non-empty intersection, its union is a feasible coalition again. These combinatorial structures have a direct relationship with conference structures la Myerson. Characterizations of the Myer-son value in this context are provided by means of the introduction of the concept of basis for union sta...

Suppose that we are given a feasible conic program with a finite optimal value and with strong duality failing. It is known that there are small perturbations of the problem data that lead to relatively big changes in the optimal value. We quantify the notion of big change in the case of a semidefinite program (SDP). We first show that for any SDP with a finite optimal value where strong dualit...

We compare Schnorr's algorithm for semi block 2k-reduction of lattice bases with Koy's primal-dual reduction for blocksize 2k. Koy's algorithm guarantees within the same time bound under known proofs better approximations of the shortest lattice vector. Under reasonable heuristics both algorithms are equally strong and much better than proven in worst-case. We combine primal-dual reduction with...