You are not currently logged in.
Access JSTOR through your library or other institution:
If You Use a Screen ReaderThis content is available through Read Online (Free) program, which relies on page scans. Since scans are not currently available to screen readers, please contact JSTOR User Support for access. We'll provide a PDF copy for your screen reader.
Solution of Vandermonde Systems of Equations
Åke Björck and Victor Pereyra
Mathematics of Computation
Vol. 24, No. 112 (Oct., 1970), pp. 893-903
Published by: American Mathematical Society
Stable URL: http://www.jstor.org/stable/2004623
Page Count: 11
You can always find the topics here!Topics: Algorithms, Mathematical procedures, Polynomials, Integers, Matrices, Interpolation, Coefficients, Factorization, Test systems, Mathematics
Were these topics helpful?See somethings inaccurate? Let us know!
Select the topics that are inaccurate.
Since scans are not currently available to screen readers, please contact JSTOR User Support for access. We'll provide a PDF copy for your screen reader.
Preview not available
We obtain in this paper a considerable improvement over a method developed earlier by Ballester and Pereyra for the solution of systems of linear equations with Vandermonde matrices of coefficients. This is achieved by observing that a part of the earlier algorithm is equivalent to Newton's interpolation method. This allows also to produce a progressive algorithm which is significantly more efficient than previous available methods. Algol-60 programs and numerical results are included. Confluent Vandermonde systems are also briefly discussed.
Mathematics of Computation © 1970 American Mathematical Society