Algorithms of numeric (in exact arithmetic) deduction of analytical expressions, proposed and described by Shevchenko and Vasiliev (1993), are developed and implemented in a computer algebra code. This code is built as a superstructure for the computer algebra package by Shevchenko and Sokolsky (199
β¦ LIBER β¦
Symbolic and Numeric Computation in Curve Interrogation
β Scribed by Gershon Elber
- Book ID
- 114674737
- Publisher
- John Wiley and Sons
- Year
- 1995
- Tongue
- English
- Weight
- 339 KB
- Volume
- 14
- Category
- Article
- ISSN
- 0167-7055
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
Numeric Deduction in Symbolic Computatio
β
IVAN I. SHEVCHENKO
π
Article
π
1997
π
Elsevier Science
π
English
β 295 KB
[IEEE 2011 13th International Symposium
β
Kaltofen, Erich
π
Article
π
2011
π
IEEE
β 121 KB
System Identifiability (Symbolic Computa
β
Lilianne Denis-Vidal; Ghislaine Joly-Blanchard; CΓ©line Noiret
π
Article
π
2003
π
Springer US
π
English
β 104 KB
Symbolic and numeric knowledge integrati
β
Arie Ben-David; Leon Sterling
π
Article
π
1991
π
Elsevier Science
π
English
β 634 KB
Coupling of symbolic and numerical compu
β
Felix S. Wong; Wei-min Dong; Michael Blanks
π
Article
π
1988
π
Elsevier Science
π
English
β 575 KB
Symbolic and Numeric Methods for Exploit
β
Ioannis Z Emiris; Victor Y Pan
π
Article
π
2002
π
Elsevier Science
π
English
β 391 KB
Resultants characterize the existence of roots of systems of multivariate nonlinear polynomial equations, while their matrices reduce the computation of all common zeros to a problem in linear algebra. Sparse elimination theory has introduced the sparse (or toric) resultant, which takes into account