𝔖 Bobbio Scriptorium
✦   LIBER   ✦

An algebraic algorithm for the resolution of singularities of foliations

✍ Scribed by S. C. Coutinho; R. M. Oliveira

Publisher
Springer
Year
2008
Tongue
English
Weight
304 KB
Volume
19
Category
Article
ISSN
0938-1279

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

An algorithm for the decomposition of se
An algorithm for the decomposition of semisimple Lie algebras
✍ W.A. de Graaf πŸ“‚ Article πŸ“… 1997 πŸ› Elsevier Science 🌐 English βš– 356 KB

We consider the problem of decomposing a semisimple Lie algebra defined over a field of characteristic zero as a direct sum of its simple ideals. The method is based on the decomposition of the action of a Car-tan subalgebra. An implementation of the algorithm in the system ELIAS is discussed at the

An Algorithm for Isolating the Real Solu
An Algorithm for Isolating the Real Solutions of Semi-algebraic Systems
✍ Bican Xia; Lu Yang πŸ“‚ Article πŸ“… 2002 πŸ› Elsevier Science 🌐 English βš– 298 KB

We propose an algorithm for isolating the real solutions of semi-algebraic systems, which has been implemented as a Maple-program realzero. The performance of realzero in solving some examples from various applications is presented and the timings are reported.

An algebraic algorithm for the design an
An algebraic algorithm for the design and analysis of linear dynamical systems
✍ M.L. Munjal; A.V. Sreenath; M.V. Narasimhan πŸ“‚ Article πŸ“… 1973 πŸ› Elsevier Science 🌐 English βš– 745 KB

In an earlier paper [1], it has been shown that velocity ratio, defined with reference to the analogous circuit, is a basic parameter in the complete analysis of a linear onedimensional dynamical system. In this paper it is shown that the terms constituting velocity ratio can be readily determined b

An algorithm for approximating the singu
An algorithm for approximating the singular triplets of complex symmetric matrices
✍ V. Simoncini; E. SjΓΆstrΓΆm πŸ“‚ Article πŸ“… 1997 πŸ› John Wiley and Sons 🌐 English βš– 172 KB πŸ‘ 2 views

We present an algorithm for the approximation of the dominant singular values and corresponding right and left singular vectors of a complex symmetric matrix. The method is based on two short-term recurrences first proposed by Saunders, Simon and Yip for a non-Hermitian linear system solver. With s