First order perturbation and local stability of parametrized systems (Q294387): Difference between revisions
From MaRDI portal
Created a new Item |
Changed an Item |
||
Property / review text | |||
An algorithm using Gröbner bases to compute solutions and sensitivities to perturbations for parametrized problems that may be expressed as vanishing sets of polynomial ideals, and in particular to geometric configuration problems is presented. For the class of problems under consideration it is shown that the computations can be made tractable by treating the perturbations as first-order infinitesimals. A method for determining when perturbations in one parameter will lead to global changes in the form of the result, e.g. fewer solutions, is demonstrated. The ways in which this computation might fail due to the lack of genericity of the input are described. Conditions under which nonfailure implies genericity of the central configuration are formulated. | |||
Property / review text: An algorithm using Gröbner bases to compute solutions and sensitivities to perturbations for parametrized problems that may be expressed as vanishing sets of polynomial ideals, and in particular to geometric configuration problems is presented. For the class of problems under consideration it is shown that the computations can be made tractable by treating the perturbations as first-order infinitesimals. A method for determining when perturbations in one parameter will lead to global changes in the form of the result, e.g. fewer solutions, is demonstrated. The ways in which this computation might fail due to the lack of genericity of the input are described. Conditions under which nonfailure implies genericity of the central configuration are formulated. / rank | |||
Normal rank | |||
Property / reviewed by | |||
Property / reviewed by: A. I. Iliev / rank | |||
Normal rank | |||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 65H10 / rank | |||
Normal rank | |||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 13P10 / rank | |||
Normal rank | |||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 65H20 / rank | |||
Normal rank | |||
Property / zbMATH DE Number | |||
Property / zbMATH DE Number: 6593828 / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
constraint geometry | |||
Property / zbMATH Keywords: constraint geometry / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
parametric polynomial system solving | |||
Property / zbMATH Keywords: parametric polynomial system solving / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
sensitivity to perturbations | |||
Property / zbMATH Keywords: sensitivity to perturbations / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
algorithm | |||
Property / zbMATH Keywords: algorithm / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
Gröbner bases | |||
Property / zbMATH Keywords: Gröbner bases / rank | |||
Normal rank |
Revision as of 21:30, 27 June 2023
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | First order perturbation and local stability of parametrized systems |
scientific article |
Statements
First order perturbation and local stability of parametrized systems (English)
0 references
16 June 2016
0 references
An algorithm using Gröbner bases to compute solutions and sensitivities to perturbations for parametrized problems that may be expressed as vanishing sets of polynomial ideals, and in particular to geometric configuration problems is presented. For the class of problems under consideration it is shown that the computations can be made tractable by treating the perturbations as first-order infinitesimals. A method for determining when perturbations in one parameter will lead to global changes in the form of the result, e.g. fewer solutions, is demonstrated. The ways in which this computation might fail due to the lack of genericity of the input are described. Conditions under which nonfailure implies genericity of the central configuration are formulated.
0 references
constraint geometry
0 references
parametric polynomial system solving
0 references
sensitivity to perturbations
0 references
algorithm
0 references
Gröbner bases
0 references