Sciweavers

2008 search results - page 3 / 402
» Computing with Equations
Sort
View
JSC
2010
82views more  JSC 2010»
13 years 2 months ago
Linear complete differential resultants and the implicitization of linear DPPEs
The linear complete differential resultant of a finite set of linear ordinary differential polynomials is defined. We study the computation by linear complete differential resulta...
Sonia L. Rueda, J. Rafael Sendra
JIPS
2007
131views more  JIPS 2007»
13 years 7 months ago
A Practical Privacy-Preserving Cooperative Computation Protocol without Oblivious Transfer for Linear Systems of Equations
: We propose several practical SMC protocols for privacy-preserving cooperative scientific computations. We consider two important scientific computations which involve linear equa...
Ju-Sung Kang, Dowon Hong
AMC
2005
195views more  AMC 2005»
13 years 7 months ago
A new symbolic computational approach to singular initial value problems in the second-order ordinary differential equations
This paper presents a new symbolic algorithm to compute the singular initial value problem of second-order ordinary differential equations using Adomian decomposition method. The ...
Onur Kiymaz, Seref Mirasyedioglu
SIAMCOMP
2000
66views more  SIAMCOMP 2000»
13 years 7 months ago
Computations of Uniform Recurrence Equations Using Minimal Memory Size
We consider a system of uniform recurrence equations (URE) of dimension one. We show how its computation can be carried out using minimal memory size with several synchronous proc...
Bruno Gaujal, Alain Jean-Marie, Jean Mairesse
ENTCS
2008
64views more  ENTCS 2008»
13 years 7 months ago
Effective Computability of Solutions of Ordinary Differential Equations The Thousand Monkeys Approach
In this note we consider the computability of the solution of the initial-value problem for ordinary differential equations with continuous right-hand side. We present algorithms ...
Pieter Collins, Daniel S. Graça