𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Operations over scalar polynomials and their computer realization

✍ Scribed by V. N. Kublanovskaya; V. N. Simonova


Publisher
Springer US
Year
1997
Tongue
English
Weight
749 KB
Volume
86
Category
Article
ISSN
1573-8795

No coin nor oath required. For personal study only.


πŸ“œ SIMILAR VOLUMES


Linearizations, realization, and scalar
✍ Ilya Krupnik; Peter Lancaster πŸ“‚ Article πŸ“… 1998 πŸ› Elsevier Science 🌐 English βš– 595 KB

The connections between linearizations of regular matrix polynomials ZJ h) under shift and inversion of the parameter are developed and used to obtain a new formula for the realization of L(A)-'. In the self-adjoint case nondegenerate indefinite scalar products are obtained in which the fundamental

Approximation of Functions on [βˆ’1,1] and
✍ K. BalΓ‘zs; T. Kilgore πŸ“‚ Article πŸ“… 1993 πŸ› John Wiley and Sons 🌐 English βš– 241 KB

## Abstract Pointwise estimates are obtained for the simultaneous approximation of a function f Ο΅__C__^__q__^[‐1,1] and its derivatives f^(1)^, …, f^(q)^ by means of an arbitrary sequence of bounded linear projection operators __L__~__n__~ which map __C__[‐1,1] into the polynomials of degree at mos

SFA, a Package on Symmetric Functions Co
✍ Vincent Prosper πŸ“‚ Article πŸ“… 2000 πŸ› Elsevier Science 🌐 English βš– 302 KB

Symmetric functions can be considered as operators acting on the ring of polynomials with coefficients in R. We present the package SFA, an implementation of this action for the computer algebra system Maple. As an example, we show how to recover different classical expressions of Lagrange inversion

Rings of Operators on Modules over Commu
✍ R.C Cannings; M.P Holland πŸ“‚ Article πŸ“… 1996 πŸ› Elsevier Science 🌐 English βš– 300 KB

We introduce and impose conditions under which the finitely generated essential right ideals of E may be classified in terms of k-submodules of M. This yields a classification of the domains Morita equivalent to E when E is a Noetherian domain. For example, a special case of our results is:

Computer generation of king and color po
✍ K. Balasubramanian; R. Ramaraj πŸ“‚ Article πŸ“… 1985 πŸ› John Wiley and Sons 🌐 English βš– 631 KB

A computer program is developed in Pascal for the generation of king and color polynomials of graphs. The king polynomial was defined by Motoyama and Hosoya and was shown to be useful in dimer statistics, enumera.tion of Kekule structures, etc. We show that the king polynomial of a lattice is the sa