Re-parameterization reduces irreducible geometric constraint systems
Résumé
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<
Origine : Fichiers produits par l'(les) auteur(s)
Loading...
Dominique Michelucci : Connectez-vous pour contacter le contributeur
https://hal.science/hal-01205755
Soumis le : dimanche 29 novembre 2015-14:14:04
Dernière modification le : jeudi 25 avril 2024-03:10:02
Archivage à long terme le : samedi 29 avril 2017-01:05:58
Citer
Hichem Barki, Lincong Fang, Dominique Michelucci, Sebti Foufou. Re-parameterization reduces irreducible geometric constraint systems. Computer-Aided Design, 2016, 70, pp.182-192. ⟨10.1016/j.cad.2015.07.011⟩. ⟨hal-01205755⟩
Collections
186
Consultations
287
Téléchargements