 |
Journal articles
Re-parameterization reduces irreducible geometric constraint systems
Abstract : You recklessly told your boss that solving a non-linear system of size n (n unknowns and n equations) requires a time proportional to n, as you were not very attentive during algorithmic complexity lectures. So now, you have only one night to solve a problem of big size (e.g., 1000 equations/unknowns), otherwise you will be fired in the next morning. The system is well-constrained and structurally irreducible: it does not contain any strictly smaller well-constrained subsystems. Its size is big, so the Newton–Raphson method is too slow and impractical. The most frustrating thing is that if you knew the values of a small number k<
Cited literature [44 references]
https://hal.archives-ouvertes.fr/hal-01205755
Contributor : Dominique Michelucci <>
Submitted on : Sunday, November 29, 2015 - 2:14:04 PM
Last modification on : Tuesday, May 12, 2020 - 10:49:12 AM
Document(s) archivé(s) le : Saturday, April 29, 2017 - 1:05:58 AM
Contributor : Dominique Michelucci <>
Submitted on : Sunday, November 29, 2015 - 2:14:04 PM
Last modification on : Tuesday, May 12, 2020 - 10:49:12 AM
Document(s) archivé(s) le : Saturday, April 29, 2017 - 1:05:58 AM
File
Re-Parameterization-Barki-etAl...
Files produced by the author(s)
