|
Author(s): R. Barrere
Abstract:
Symbolic approximations based on series expansions can be improved by
resummation techniques.
A heuristic algorithm developed in the field of
combinatorics is examined from the functional point of view.
This process may
reconstitute the exact solution, or lead to approximations by partial summation.
1 Introduction
The modeling of physical systems or processes often leads to equations without
known closed-form solution, thus entailing the failure of computer algebra
techniques.
However in that case, function space methods may give access to
symbolic approximation techniques.
In particular, successive approximations,
Newton's symbolic method, perturbation expansions and the Galerkin
procedure have been considered from that point of view [2].
This investigation was motivated by the re...
Pages: 8
Size: 709 kb
Paper DOI: 10.2495/IMS970091
|
|
Download
the Full Article
Price: US$
0.00
This article is part of the WIT OpenView scheme and you can download the full text Adobe PDF article for FREE by clicking the 'Openview' icon below.
Send
this page to a colleague.

|