Approximate least common multiple of several polynomials using the ERES division algorithm (Q331163): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 4 users not shown)
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 65F30 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 11A05 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 65Y20 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 6643899 / rank
 
Normal rank
Property / zbMATH Keywords
 
greatest common divisor
Property / zbMATH Keywords: greatest common divisor / rank
 
Normal rank
Property / zbMATH Keywords
 
linear systems
Property / zbMATH Keywords: linear systems / rank
 
Normal rank
Property / zbMATH Keywords
 
shifting operation
Property / zbMATH Keywords: shifting operation / rank
 
Normal rank
Property / zbMATH Keywords
 
numerical errors
Property / zbMATH Keywords: numerical errors / rank
 
Normal rank
Property / zbMATH Keywords
 
least squares
Property / zbMATH Keywords: least squares / rank
 
Normal rank
Property / zbMATH Keywords
 
low-rank approximation
Property / zbMATH Keywords: low-rank approximation / rank
 
Normal rank
Property / zbMATH Keywords
 
numerical optimization
Property / zbMATH Keywords: numerical optimization / rank
 
Normal rank
Property / zbMATH Keywords
 
numerical stability
Property / zbMATH Keywords: numerical stability / rank
 
Normal rank
Property / zbMATH Keywords
 
complexity
Property / zbMATH Keywords: complexity / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.laa.2016.09.010 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2520546048 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast projection methods for minimal design problems in linear system theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3141919 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Necessary and sufficient conditions for zero assignment by constant squaring down / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4067388 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Numerical computation of the least common multiple of a set of polynomials / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimal Bases of Rational Vector Spaces, with Applications to Multivariable Linear Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Geometric properties, invariants, and the Toeplitz structure of minimal bases of rational vector spaces / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimal bases of matrix pencils and coprime matrix fraction descriptions / rank
 
Normal rank
Property / cites work
 
Property / cites work: System theoretic based characterisation and computation of the least common multiple of a set of polynomials. / rank
 
Normal rank
Property / cites work
 
Property / cites work: A geometrical approach to finding multivariate approximate LCMs and GCDs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Invariance properties, and characterization of the greatest common divisor of a set of polynomials / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computation of the GCD of polynomials using gaussian transformations and shifting / rank
 
Normal rank
Property / cites work
 
Property / cites work: Matrix representation of the shifting operation and numerical properties of the ERES method for computing the greatest common divisor of sets of many polynomials / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3653570 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The ERES method for computing the approximate GCD of several polynomials / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3359644 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal backward perturbation bounds for the linear least squares problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4868577 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4232503 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5301644 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Structured total least norm and approximate GCDs of inexact polynomials / rank
 
Normal rank
Property / cites work
 
Property / cites work: Certified approximate univariate GCDs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3447170 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Numerical performance of the matrix pencil algorithm computing the greatest common divisor of polynomials and comparison with other matrix-based methodologies / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 20:13, 12 July 2024

scientific article
Language Label Description Also known as
English
Approximate least common multiple of several polynomials using the ERES division algorithm
scientific article

    Statements

    Approximate least common multiple of several polynomials using the ERES division algorithm (English)
    0 references
    0 references
    0 references
    0 references
    26 October 2016
    0 references
    greatest common divisor
    0 references
    linear systems
    0 references
    shifting operation
    0 references
    numerical errors
    0 references
    least squares
    0 references
    low-rank approximation
    0 references
    numerical optimization
    0 references
    numerical stability
    0 references
    complexity
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers