Multihomogeneous resultant formulae for systems with scaled support (Q5891547): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Merged Item from Q5965634
 
(4 intermediate revisions by 3 users not shown)
description / endescription / en
scientific article; zbMATH DE number 6034131
scientific article; zbMATH DE number 6037612
Property / zbMATH Open document ID
 
Property / zbMATH Open document ID: 1258.65038 / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/j.jsc.2011.12.010 / rank
 
Normal rank
Property / published in
 
Property / published in: Journal of Symbolic Computation / rank
 
Normal rank
Property / publication date
 
23 May 2012
Timestamp+2012-05-23T00:00:00Z
Timezone+00:00
CalendarGregorian
Precision1 day
Before0
After0
Property / publication date: 23 May 2012 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 15A15 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 6037612 / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q57908707 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2154376488 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1971439379 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 0904.4064 / rank
 
Normal rank
Property / review text
 
Analogues of the bounds presented by \textit{A. Dickenstein} and \textit{I. Z. Emiris} [J. Symb. Comput. 36, No. 3--4, 317--342 (2003; Zbl 1095.13547)] are established. This leads to a simplification of the proof in the unmixed case. Scaled systems, that admit a determinantal formula, are characterized. Differentials in the Weyman complex are made explicit and details of computation are given. The difficulty of indentifying the maps between some terms, in the construction of the matrix, is pointed out. A complete MAPLE module for the computation of multi-homogeneous resultant matrices is provided. It is pointed out that the proposed construction is efficient in terms of storage in memory.
Property / review text: Analogues of the bounds presented by \textit{A. Dickenstein} and \textit{I. Z. Emiris} [J. Symb. Comput. 36, No. 3--4, 317--342 (2003; Zbl 1095.13547)] are established. This leads to a simplification of the proof in the unmixed case. Scaled systems, that admit a determinantal formula, are characterized. Differentials in the Weyman complex are made explicit and details of computation are given. The difficulty of indentifying the maps between some terms, in the construction of the matrix, is pointed out. A complete MAPLE module for the computation of multi-homogeneous resultant matrices is provided. It is pointed out that the proposed construction is efficient in terms of storage in memory. / rank
 
Normal rank
Property / reviewed by
 
Property / reviewed by: Reginald P. Tewarson / rank
 
Normal rank
Property / zbMATH Keywords
 
multi-homogeneous systems
Property / zbMATH Keywords: multi-homogeneous systems / rank
 
Normal rank
Property / zbMATH Keywords
 
determinantal formula
Property / zbMATH Keywords: determinantal formula / rank
 
Normal rank
Property / zbMATH Keywords
 
resultant matrix
Property / zbMATH Keywords: resultant matrix / rank
 
Normal rank
Property / zbMATH Keywords
 
MAPLE implementation
Property / zbMATH Keywords: MAPLE implementation / rank
 
Normal rank

Latest revision as of 13:23, 29 April 2024

scientific article; zbMATH DE number 6037612
Language Label Description Also known as
English
Multihomogeneous resultant formulae for systems with scaled support
scientific article; zbMATH DE number 6037612

    Statements

    Multihomogeneous resultant formulae for systems with scaled support (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    13 May 2012
    0 references
    23 May 2012
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    Analogues of the bounds presented by \textit{A. Dickenstein} and \textit{I. Z. Emiris} [J. Symb. Comput. 36, No. 3--4, 317--342 (2003; Zbl 1095.13547)] are established. This leads to a simplification of the proof in the unmixed case. Scaled systems, that admit a determinantal formula, are characterized. Differentials in the Weyman complex are made explicit and details of computation are given. The difficulty of indentifying the maps between some terms, in the construction of the matrix, is pointed out. A complete MAPLE module for the computation of multi-homogeneous resultant matrices is provided. It is pointed out that the proposed construction is efficient in terms of storage in memory.
    0 references
    multi-homogeneous systems
    0 references
    determinantal formula
    0 references
    resultant matrix
    0 references
    MAPLE implementation
    0 references