U. Erlingsson, E. Kaltofen, and D. Musser. Generic Gram-Schmidt orthogonalization by exact division. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
FOXBOX: A System for Manipulating Symbolic Objects in.. - Díaz, Kaltofen (1998) (Correct)
....site of the calls, by using B as an STL style function object type we avoid, when evaluating the black box at a point, both function look up via a pointer to a function and even the function call. In retrospect, however, the gain in efficiency is not as much as one might expect. Our experiments in [9] show the cost of dereferencing, and the savings may not justify the associated code bloat. However, code bloat can be easily avoided by use of the virtual function calling mechanism and by supplying the (instantiated) base classes blackbox K and blackbox K, L to the algorithm templates. ....
ERLINGSSON, U., KALTOFEN, E., AND MUSSER, D. Generic Gram-Schmidt orthogonalization by exact division. In Lakshman Y. N. [26], pp. 275--282.
Publications by Erich Kaltofen - January In The Self-citation (Kaltofen) (Correct)
No context found.
U. Erlingsson, E. Kaltofen, and D. Musser. Generic Gram-Schmidt orthogonalization by exact division.
Symbolic Computation in Java: an Appraisement - Bernardin, Char, Kaltofen (1999) (2 citations) Self-citation (Kaltofen) (Correct)
....the A ] Aldor [43] compiler. 3.1 Generic programming A main goal of generic programming is the ability to write algorithms with variable types: for example, a Grobner basis procedure is parameterized with the coefficient field and can be instantiated for a multitude of different fields. In [18] we distinguish three implementations of genericity: 1. the field operations that define the common interface (addition, division, equality tests, etc. are inline compiled into the procedure for a selected field; 2. they are retrieved via a function pointer in the stub for the field object (an ....
....template library, and we have used this approach in FoxBox [17] Dynamic evaluation is used in the Scratchpad II Axiom system and in Maple s Domain package. C has virtual class member functions for this purpose, which have been adopted by Java under the name of abstract methods. A main point in [18] is that in C one can write a generic program so that the choice of the three instantiation methods for type parameters is left to the users. Originally Java was thought as a computer architectureindependent programming system. It adopted Smalltalk s approach of an interpreted intermediate ....
Erlingsson, U., Kaltofen, E., and Musser, D. Generic Gram-Schmidt orthogonalization by exact division. In ISSAC 96 Proc. 1996 Internat. Symp. Symbolic Algebraic Comput. (New York, N. Y., 1996), Lakshman Y. N., Ed., ACM Press, pp. 275--282.
Publications by Erich Kaltofen - Kaltofen (1999) Self-citation (Kaltofen) (Correct)
No context found.
U. Erlingsson, E. Kaltofen, and D. Musser. Generic Gram-Schmidt orthogonalization by exact division. In Lakshman Y. N. [-8], pages 275--282. Ka95:jcss
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC