Computing Reviews
Today's Issue Hot Topics Search Browse Recommended My Account Log In
Review Help
Search
A fast, reliable algorithm for calculating Padé-Hermite forms
Cabay S., Labahn G.  Symbolic and algebraic computation (, Portland, OR, Jul 17-19, 1989)1001989.Type:Proceedings
Date Reviewed: Nov 1 1991

A new and fast algorithm is presented for calculating the Padé-Hermite form for a vector of power series. This algorithm works both when the vector of power series is normal (that is, the coefficient matrix corresponding to the Ai(z)s is nonsingular) and in nonnormal cases. The complexity for the normal case is the same as that of algorithms developed before. The strong point of this paper is that the algorithm works for the nonnormal case. This work is a conference paper and as such does not give a thorough exposition of the algorithm. Also, a lack of examples makes this paper difficult to read.

Reviewer:  M. S. Krishnamoorthy Review #: CR114322
Bookmark and Share
 
Numerical Algorithms And Problems (F.2.1 )
 
 
Approximation (G.1.2 )
 
 
Integral Equations (G.1.9 )
 
 
Ordinary Differential Equations (G.1.7 )
 
Would you recommend this review?
yes
no
Other reviews under "Numerical Algorithms And Problems": Date
On the computational complexity of ordinary differential equations
Ko K. (ed) Information and Control 58(1-3): 157-194, 1984. Type: Article
Jun 1 1985
The computational complexity of simultaneous diophantine approximation problems
Lagarias J. SIAM Journal on Computing 14(1): 196-209, 1985. Type: Article
Jan 1 1986
Parallel and distributed computation: numerical methods
Bertsekas D., Tsitsiklis J., Prentice-Hall, Inc., Upper Saddle River, NJ, 1989. Type: Book (9789780136487005)
Apr 1 1990
more...

E-Mail This Printer-Friendly
Send Your Comments
Contact Us
Reproduction in whole or in part without permission is prohibited.   Copyright 1999-2024 ThinkLoud®
Terms of Use
| Privacy Policy