A new derivation and recursive algorithm based on Wronskian matrix for Vandermonde inverse matrix (Q1666955): Difference between revisions
From MaRDI portal
Created claim: Wikidata QID (P12): Q59120299, #quickstatements; #temporary_batch_1711055989931 |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: On the inversion of the Vandermonde matrix / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q2917987 / rank | |||
Normal rank |
Latest revision as of 12:06, 16 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | A new derivation and recursive algorithm based on Wronskian matrix for Vandermonde inverse matrix |
scientific article |
Statements
A new derivation and recursive algorithm based on Wronskian matrix for Vandermonde inverse matrix (English)
0 references
27 August 2018
0 references
Summary: For an analytical expression of Vandermonde inverse matrix, a new derivation process based on Wronskian matrix and Lagrange interpolation polynomial basis is presented. Recursive formula and implementation cases for the direct formula of Vandermonde inverse matrix are given based on deriving the unified formula of Wronskian inverse matrix. For the calculation of symbol-type Vandermonde inverse matrix, the direct formula and recursive method are verified to be more efficient than Mathematica which is good at symbolic computation by comparing the computing time in Mathematica. The process and steps of recursive algorithm are relatively simple. The derivation process and idea both have very important values in theory and practice of Vandermonde and generalized Vandermonde inverse matrix.
0 references